paper-with-me

홈 › Papers

Minimax-optimal estimation for sparse multi-reference alignment with collision-free signals

2023-12-13 · Subhro Ghosh, Soumendu Sundar Mukherjee, Jing Bin Pan

The Multi-Reference Alignment (MRA) problem aims at the recovery of an unknown signal from repeated observations under the latent action of a group of cyclic isometries, in the presence of additive noise of high intensity $\sigma$. It is a more tractable version of the celebrated cryo EM model. In the crucial high noise regime, it is known that its sample complexity scales as $\sigma^6$. Recent investigations have shown that for the practically significant setting of sparse signals, the sample complexity of the maximum likelihood estimator asymptotically scales with the noise level as $\sigma^4$. In this work, we investigate minimax optimality for signal estimation under the MRA model for so-called collision-free signals. In particular, this signal class covers the setting of generic signals of dilute sparsity (wherein the support size $s=O(L^{1/3})$, where $L$ is the ambient dimension. We demonstrate that the minimax optimal rate of estimation in for the sparse MRA problem in this setting is $\sigma^2/\sqrt{n}$, where $n$ is the sample size. In particular, this widely generalizes the sample complexity asymptotics for the restricted MLE in this setting, establishing it as the statistically optimal estimator. Finally, we demonstrate a concentration inequality for the restricted MLE on its deviations from the ground truth.

📄 PDF Abstract BibTeX arXiv:2312.07839

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Leveraging Sparsity for Sample-Efficient Preference Learning: A Theoretical Perspective

2025-01-30 · Yunzhen Yao, Lie He, Michael Gastpar

This paper considers the sample-efficiency of preference learning, which models and predicts human choices based on comparative judgments. The minimax optimal estimation rate $\Theta(d/n)$ in traditional estimation theor…

Minimax sparse principal subspace estimation in high dimensions

2012-11-02 · Vincent Q. Vu, Jing Lei

We study sparse principal components analysis in high dimensions, where $p$ (the number of variables) can be much larger than $n$ (the number of observations), and analyze the problem of estimating the subspace spanned b…

Vocal Bursts Intensity Prediction

Minimax Optimal Rates of Estimation in High Dimensional Additive Models: Universal Phase Transition

2015-03-10 · Ming Yuan, Ding-Xuan Zhou

We establish minimax optimal rates of convergence for estimation in a high dimensional additive model assuming that it is approximately sparse. Our results reveal an interesting phase transition behavior universal to thi…

Additive modelsregression

Optimal Structured Principal Subspace Estimation: Metric Entropy and Minimax Rates

2020-02-18 · T. Tony Cai, Hongzhe Li, Rong Ma

Driven by a wide range of applications, many principal subspace estimation problems have been studied individually under different structural constraints. This paper presents a unified framework for the statistical analy…

Clustering

Rates of Convergence of Spectral Methods for Graphon Estimation

2017-09-10 · ICML 2018 7 · Jiaming Xu

This paper studies the problem of estimating the grahpon model - the underlying generating mechanism of a network. Graphon estimation arises in many applications such as predicting missing links in networks and learning …

Community DetectionGraphon EstimationRecommendation SystemsStochastic Block Model