Yonina C. Eldar

AAAI Conference 2026 Conference Paper

NeuPAN: Direct Point Robot Navigation with End-to-End Model-Based Learning (Abstract Reprint)

• Ruihua Han
• Shuai Wang
• Shuaijun Wang
• Zeqing Zhang
• Jianjun Chen
• Shijie Lin
• Chengyang Li
• Chengzhong Xu

Navigating a nonholonomic robot in a cluttered, unknown environment requires accurate perception and precise motion control for real-time collision avoidance. This article presents neural proximal alternating-minimization network (NeuPAN): a real-time, highly accurate, map-free, easy-to-deploy, and environment-invariant robot motion planner. Leveraging a tightly coupled perception-to-control framework, NeuPAN has two key innovations compared to existing approaches: first, it directly maps raw point cloud data to a latent distance feature space for collision-free motion generation, avoiding error propagation from the perception to control pipeline; second, it is interpretable from an end-to-end model-based learning perspective. The crux of NeuPAN is solving an end-to-end mathematical model with numerous point-level constraints using a plug-and-play proximal alternating-minimization network, incorporating neurons in the loop. This allows NeuPAN to generate real-time, physically interpretable motions. It seamlessly integrates data and knowledge engines, and its network parameters can be fine-tuned via back propagation. We evaluate NeuPAN on a ground mobile robot, a wheel-legged robot, and an autonomous vehicle, in extensive simulated and real-world environments. Results demonstrate that NeuPAN outperforms existing baselines in terms of accuracy, efficiency, robustness, and generalization capabilities across various environments, including the cluttered sandbox, office, corridor, and parking lot. We show that NeuPAN works well in unknown and unstructured environments with arbitrarily shaped objects, transforming impassable paths into passable ones.

NeurIPS Conference 2024 Conference Paper

Unrolled denoising networks provably learn to perform optimal Bayesian inference

• Aayush Karan
• Kulin Shah
• Sitan Chen
• Yonina C. Eldar

Much of Bayesian inference centers around the design of estimators for inverse problems which are optimal assuming the data comes from a known prior. But what do these optimality guarantees mean if the prior is unknown? In recent years, algorithm unrolling has emerged as deep learning's answer to this age-old question: design a neural network whose layers can in principle simulate iterations of inference algorithms and train on data generated by the unknown prior. Despite its empirical success, however, it has remained unclear whether this method can provably recover the performance of its optimal, prior-aware counterparts. In this work, we prove the first rigorous learning guarantees for neural networks based on unrolling approximate message passing (AMP). For compressed sensing, we prove that when trained on data drawn from a product prior, the layers of the network approximately converge to the same denoisers used in Bayes AMP. We also provide extensive numerical experiments for compressed sensing and rank-one matrix estimation demonstrating the advantages of our unrolled architecture --- in addition to being able to obliviously adapt to general priors, it exhibits improvements over Bayes AMP in more general settings of low dimensions, non-Gaussian designs, and non-product priors.

ICLR Conference 2023 Conference Paper

Generalization and Estimation Error Bounds for Model-based Neural Networks

• Avner Shultzman
• Eyar Azar
• Miguel Rodrigues 0001
• Yonina C. Eldar

Model-based neural networks provide unparalleled performance for various tasks, such as sparse coding and compressed sensing problems. Due to the strong connection with the sensing model, these networks are interpretable and inherit prior structure of the problem. In practice, model-based neural networks exhibit higher generalization capability compared to ReLU neural networks. However, this phenomenon was not addressed theoretically. Here, we leverage complexity measures including the global and local Rademacher complexities, in order to provide upper bounds on the generalization and estimation errors of model-based networks. We show that the generalization abilities of model-based networks for sparse recovery outperform those of regular ReLU networks, and derive practical design rules that allow to construct model-based networks with guaranteed high generalization. We demonstrate through a series of experiments that our theoretical insights shed light on a few behaviours experienced in practice, including the fact that ISTA and ADMM networks exhibit higher generalization abilities (especially for small number of training samples), compared to ReLU networks.

JBHI Journal 2023 Journal Article

Sparsity-Based Multi-Person Non-Contact Vital Signs Monitoring via FMCW Radar

• Yonathan Eder
• Yonina C. Eldar

Non-contact technology for monitoring the vital signs of multiple individuals, such as respiration and heartbeat, has been investigated in recent years due to the rising cardiopulmonary morbidity, the risk of disease transmission, and the heavy burden on medical staff. Frequency-modulated continuous wave (FMCW) radars have shown great promise in meeting these needs, even using a single-input-single-output (SISO) setup. However, contemporary techniques for non-contact vital signs monitoring (NCVSM) via SISO FMCW radar, are based on simplistic models and present difficulties in coping with noisy environments containing multiple objects. In this work, we first develop an extended model for multi-person NCVSM via SISO FMCW radar. Then, by utilizing the sparse nature of the modeled signals in conjunction with human-typical cardiopulmonary features, we present accurate localization and NCVSM of multiple individuals in a cluttered scenario, even with only a single channel. Specifically, we provide a joint-sparse recovery mechanism to localize people and develop a robust method for NCVSM called Vital Signs-based Dictionary Recovery (VSDR), which uses a dictionary-based approach to search for the rates of respiration and heartbeat over high-resolution grids corresponding to human cardiopulmonary activity. The advantages of our method are illustrated through examples that combine the proposed model with in-vivo data of 30 individuals. We demonstrate accurate human localization in a noisy scenario that includes both static and vibrating objects and show that our VSDR approach outperforms existing NCVSM techniques based on several statistical metrics. The findings support the widespread use of FMCW radars with the proposed algorithms in healthcare.

ICML Conference 2021 Conference Paper

A Wasserstein Minimax Framework for Mixed Linear Regression

• Theo Diamandis
• Yonina C. Eldar
• Alireza Fallah 0001
• Farzan Farnia
• Asuman E. Ozdaglar

Multi-modal distributions are commonly used to model clustered data in statistical learning tasks. In this paper, we consider the Mixed Linear Regression (MLR) problem. We propose an optimal transport-based framework for MLR problems, Wasserstein Mixed Linear Regression (WMLR), which minimizes the Wasserstein distance between the learned and target mixture regression models. Through a model-based duality analysis, WMLR reduces the underlying MLR task to a nonconvex-concave minimax optimization problem, which can be provably solved to find a minimax stationary point by the Gradient Descent Ascent (GDA) algorithm. In the special case of mixtures of two linear regression models, we show that WMLR enjoys global convergence and generalization guarantees. We prove that WMLR’s sample complexity grows linearly with the dimension of data. Finally, we discuss the application of WMLR to the federated learning task where the training samples are collected by multiple agents in a network. Unlike the Expectation-Maximization algorithm, WMLR directly extends to the distributed, federated learning setting. We support our theoretical results through several numerical experiments, which highlight our framework’s ability to handle the federated learning setting with mixture models.

SODA Conference 2020 Conference Paper

Sample Efficient Toeplitz Covariance Estimation

• Yonina C. Eldar
• Jerry Li 0001
• Cameron Musco
• Christopher Musco

ICML Conference 2016 Conference Paper

Sparse Nonlinear Regression: Parameter Estimation under Nonconvexity

• Zhuoran Yang
• Zhaoran Wang 0001
• Han Liu 0001
• Yonina C. Eldar
• Tong Zhang 0001

We study parameter estimation for sparse nonlinear regression. More specifically, we assume the data are given by y = f( \bf x^T \bf β^* ) + ε, where f is nonlinear. To recover \bf βs, we propose an \ell_1-regularized least-squares estimator. Unlike classical linear regression, the corresponding optimization problem is nonconvex because of the nonlinearity of f. In spite of the nonconvexity, we prove that under mild conditions, every stationary point of the objective enjoys an optimal statistical rate of convergence. Detailed numerical results are provided to back up our theory.

JMLR Journal 2016 Journal Article

Subspace Learning with Partial Information

• Alon Gonen
• Dan Rosenbaum
• Yonina C. Eldar
• Shai Shalev-Shwartz

The goal of subspace learning is to find a $k$-dimensional subspace of $\mathbb{R}^d$, such that the expected squared distance between instance vectors and the subspace is as small as possible. In this paper we study subspace learning in a partial information setting, in which the learner can only observe $r \le d$ attributes from each instance vector. We propose several efficient algorithms for this task, and analyze their sample complexity. [abs] [ pdf ][ bib ] &copy JMLR 2016. ( edit, beta )