299 citations · 1.3k across the 49 of their papers we have counts for
52 papers
RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees
Eilon Vaknin Laufer, Boaz Nadler
Recovering a low rank matrix from a subset of its entries, some of which may be corrupted, is known as the robust matrix completion (RMC) problem. Existing RMC methods have several…
Semi-Supervised Sparse Gaussian Classification: Provable Benefits of Unlabeled Data
Eyar Azar, Boaz Nadler
The premise of semi-supervised learning (SSL) is that combining labeled and unlabeled data yields significantly more accurate models. Despite empirical successes, the theoretical u…
Truth is Universal: Robust Detection of Lies in LLMs
Lennart Bürger, Fred A. Hamprecht, Boaz Nadler
Large Language Models (LLMs) have revolutionised natural language processing, exhibiting impressive human-like capabilities. In particular, LLMs are capable of "lying", knowingly o…
A Majorization-Minimization Gauss-Newton Method for 1-Bit Matrix Completion
Xiaoqian Liu, Xu Han, Eric C. Chi +1
In 1-bit matrix completion, the aim is to estimate an underlying low-rank matrix from a partial set of binary observations. We propose a novel method for 1-bit matrix completion ca…
Imbalanced Mixed Linear Regression
Pini Zilber, Boaz Nadler
We consider the problem of mixed linear regression (MLR), where each observed sample belongs to one of unknown linear models. In practical applications, the proportions of the…
Distributed Sparse Linear Regression under Communication Constraints
Rodney Fonseca, Boaz Nadler
In multiple domains, statistical tasks are performed in distributed settings, with data split among several end machines that are connected to a fusion center. In various applicati…