English
Related papers

Related papers: Exact Minimax Optimality of Spectral Methods in Ph…

200 papers

Many important geometric estimation problems take the form of synchronization over the special Euclidean group: estimate the values of a set of poses given a set of relative measurements between them. This problem is typically formulated as…

Robotics · Computer Science 2017-02-07 David M. Rosen , Luca Carlone , Afonso S. Bandeira , John J. Leonard

A central challenge in machine learning is to understand how noise or measurement errors affect low-rank approximations, particularly in the spectral norm. This question is especially important in differentially private low-rank…

Machine Learning · Computer Science 2025-10-30 Phuc Tran , Nisheeth K. Vishnoi , Van H. Vu

Rotation group $\mathcal{SO}(d)$ synchronization is an important inverse problem and has attracted intense attention from numerous application fields such as graph realization, computer vision, and robotics. In this paper, we focus on the…

Optimization and Control · Mathematics 2023-06-23 Linglingzhi Zhu , Chong Li , Anthony Man-Cho So

Spectral methods include a family of algorithms related to the eigenvectors of certain data-generated matrices. In this work, we are interested in studying the geometric landscape of the eigendecomposition problem in various spectral…

Optimization and Control · Mathematics 2022-07-13 Shuang Li , Gongguo Tang , Michael B. Wakin

Alternating minimization, or Fienup methods, have a long history in phase retrieval. We provide new insights related to the empirical and theoretical analysis of these algorithms when used with Fourier measurements and combined with convex…

Information Theory · Computer Science 2018-02-14 Edouard Pauwels , Amir Beck , Yonina C. Eldar , Shoham Sabach

In this paper, we study a spiked Wigner problem with an inhomogeneous noise profile. Our aim in this problem is to recover the signal passed through an inhomogeneous low-rank matrix channel. While the information-theoretic performances are…

Machine Learning · Statistics 2023-02-15 Aleksandr Pak , Justin Ko , Florent Krzakala

This paper is concerned with the interplay between statistical asymmetry and spectral methods. Suppose we are interested in estimating a rank-1 and symmetric matrix $\mathbf{M}^{\star}\in \mathbb{R}^{n\times n}$, yet only a randomly…

Statistics Theory · Mathematics 2023-01-10 Yuxin Chen , Chen Cheng , Jianqing Fan

The problem of optimal linear estimation of linear functionals depending on the unknown values of a periodically correlated stochastic process from observations of the process with additive noise is considered. Formulas for calculating the…

Statistics Theory · Mathematics 2025-10-29 Iryna Dubovets'ka , Mykhailo Moklyachuk

In this paper, we study the minimax optimization problem in the smooth and strongly convex-strongly concave setting when we have access to noisy estimates of gradients. In particular, we first analyze the stochastic Gradient Descent Ascent…

Optimization and Control · Mathematics 2020-02-14 Alireza Fallah , Asuman Ozdaglar , Sarath Pattathil

Mixed linear regression involves the recovery of two (or more) unknown vectors from unlabeled linear measurements; that is, where each sample comes from exactly one of the vectors, but we do not know which one. It is a classic problem, and…

Machine Learning · Statistics 2014-02-10 Xinyang Yi , Constantine Caramanis , Sujay Sanghavi

This paper investigates recovery of an undamped spectrally sparse signal and its spectral components from a set of regularly spaced samples within the framework of spectral compressed sensing and super-resolution. We show that the existing…

Information Theory · Computer Science 2021-01-19 Zai Yang , Xunmeng Wu

We study the problem of estimating a function in the presence of both speckle and additive noises, commonly referred to as the de-speckling problem. Although additive noise has been thoroughly explored in nonparametric estimation, speckle…

Statistics Theory · Mathematics 2025-05-12 Reihaneh Malekian , Hao Xing , Arian Maleki

We study online convex optimization under stochastic sub-gradient observation faults, where we introduce adaptive algorithms with minimax optimal regret guarantees. We specifically study scenarios where our sub-gradient observations can be…

Machine Learning · Computer Science 2019-04-23 Hakan Gokcesu , Suleyman S. Kozat

We study the convergence rates of the EM algorithm for learning two-component mixed linear regression under all regimes of signal-to-noise ratio (SNR). We resolve a long-standing question that many recent results have attempted to tackle:…

Machine Learning · Statistics 2021-02-08 Jeongyeol Kwon , Nhat Ho , Constantine Caramanis

This paper studies an optimization problem on the sum of traces of matrix quadratic forms in $m$ semi-orthogonal matrices, which can be considered as a generalization of the synchronization of rotations. While the problem is nonconvex, the…

Optimization and Control · Mathematics 2021-10-13 Joong-Ho Won , Teng Zhang , Hua Zhou

Detecting and recovering a low-rank signal in a noisy data matrix is a fundamental task in data analysis. Typically, this task is addressed by inspecting and manipulating the spectrum of the observed data, e.g., thresholding the singular…

Statistics Theory · Mathematics 2024-08-01 Boris Landa , Yuval Kluger

This paper studies early-stopped mirror descent applied to noisy sparse phase retrieval, which is the problem of recovering a $k$-sparse signal $\mathbf{x}^\star\in\mathbb{R}^n$ from a set of quadratic Gaussian measurements corrupted by…

Signal Processing · Electrical Eng. & Systems 2021-05-11 Fan Wu , Patrick Rebeschini

Phase noise correction is crucial to exploit full advantage of orthogonal frequency division multiplexing (OFDM) in modern high-data-rate communications. OFDM channel estimation with simultaneous phase noise compensation has therefore drawn…

Information Theory · Computer Science 2017-04-25 Zhongju Wang , Prabhu Babu , Daniel P. Palomar

This paper studies first order methods for solving smooth minimax optimization problems $\min_x \max_y g(x,y)$ where $g(\cdot,\cdot)$ is smooth and $g(x,\cdot)$ is concave for each $x$. In terms of $g(\cdot,y)$, we consider two settings --…

Optimization and Control · Mathematics 2019-07-03 Kiran Koshy Thekumparampil , Prateek Jain , Praneeth Netrapalli , Sewoong Oh

We study the problem of finding a near-stationary point for smooth minimax optimization. The recently proposed extra anchored gradient (EAG) methods achieve the optimal convergence rate for the convex-concave minimax problem in the…

Machine Learning · Computer Science 2025-02-04 Lesi Chen , Luo Luo
‹ Prev 1 4 5 6 7 8 10 Next ›