Image de couverture de livre

The ESPRIT algorithm under high noise: Optimal error scaling and noisy super-resolution

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ding, Zhiyan, Epperly, Ethan N., Lin, Lin, Zhang, Ruizhe
Format:	Preprint
Publié:	2024
Sujets:	Information Theory Data Structures and Algorithms Signal Processing Statistics Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Asymptotically Optimal Sequential Testing with Heterogeneous LLMs
par: Li, Guokai, et autres
Publié: (2026)

Model-agnostic super-resolution in high dimensions
par: Chen, Xi, et autres
Publié: (2025)

Beyond Catoni: Sharper Rates for Heavy-Tailed and Robust Mean Estimation
par: Gupta, Shivam, et autres
Publié: (2023)

Logarithmic Positional Partition Interval Encoding
par: Alevizos, Vasileios, et autres
Publié: (2024)

An Instance-Based Approach to the Trace Reconstruction Problem
par: Mazooji, Kayvon, et autres
Publié: (2024)

Achievability of Heterogeneous Hypergraph Recovery from its Graph Projection
par: Morgan, Alexander, et autres
Publié: (2026)

Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing
par: Matsumoto, Namiko, et autres
Publié: (2022)

Distribution Learnability and Robustness
par: Ben-David, Shai, et autres
Publié: (2024)

A Distribution Testing Approach to Clustering Distributions
par: Kumar, Gunjan, et autres
Publié: (2025)

Random Subgraph Detection Using Queries
par: Huleihel, Wasim, et autres
Publié: (2021)

Learning sparse generalized linear models with binary outcomes via iterative hard thresholding
par: Matsumoto, Namiko, et autres
Publié: (2025)

Planted Bipartite Graph Detection
par: Rotenberg, Asaf, et autres
Publié: (2023)

PTF Testing Lower Bounds for Non-Gaussian Component Analysis
par: Diakonikolas, Ilias, et autres
Publié: (2025)

The Empirical Spectral Distribution of i.i.d. Random Matrices with Random Perturbations
par: Chen, Kun, et autres
Publié: (2024)

On the Statistical Complexity of Sample Amplification
par: Axelrod, Brian, et autres
Publié: (2022)

Optimal Rates for Differentially Private Hypothesis Testing with E-values
par: Jacobsen, Ben, et autres
Publié: (2026)

A Simple Geometric Proof of the Optimality of the Sequential Probability Ratio Test for Symmetric Bernoulli Hypotheses
par: Pabbaraju, Chirag, et autres
Publié: (2025)

Tight bounds for stream decodable error-correcting codes
par: Gupta, Meghal, et autres
Publié: (2024)

Robust Sparse Estimation for Gaussians with Optimal Error under Huber Contamination
par: Diakonikolas, Ilias, et autres
Publié: (2024)

A smoothed-Bayesian approach to frequency recovery from sketched data
par: Beraha, Mario, et autres
Publié: (2023)

Universal entrywise eigenvector fluctuations in delocalized spiked matrix models and asymptotics of rounded spectral algorithms
par: Chen, Shujing, et autres
Publié: (2025)

Optimal Robust Estimation under Local and Global Corruptions: Stronger Adversary and Smaller Error
par: Pittas, Thanasis, et autres
Publié: (2024)

On Unbiased Low-Rank Approximation with Minimum Distortion
par: Barnes, Leighton Pate, et autres
Publié: (2025)

Computational and statistical lower bounds for low-rank estimation under general inhomogeneous noise
par: De, Debsurya, et autres
Publié: (2025)

Towards Optimal Grammars for RNA Structures
par: Onokpasa, Evarista, et autres
Publié: (2024)

A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation
par: Ding, Jian, et autres
Publié: (2022)

Robust Gray Codes Approaching the Optimal Rate
par: Con, Roni, et autres
Publié: (2024)

A faster algorithm for efficient longest common substring calculation for non-parametric entropy estimation in sequential data
par: Smart, Bridget, et autres
Publié: (2025)

The Conflict Graph Design: Estimating Causal Effects under Arbitrary Neighborhood Interference
par: Kandiros, Vardis, et autres
Publié: (2024)

Rooting Out Entropy: Optimal Tree Extraction for Ultra-Succinct Graphs
par: Alaoui, Ziad Ismaili, et autres
Publié: (2026)

Detecting Correlation Efficiently in Stochastic Block Models: Breaking Otter's Threshold in the Entire Supercritical Regime
par: Chen, Guanyi, et autres
Publié: (2025)

Satisfying the Restricted Isometry Property with the Optimal Number of Rows and Slightly Less Randomness
par: Rao, Shravas
Publié: (2023)

Nonadaptive Noise-Resilient Group Testing with Order-Optimal Tests and Fast-and-Reliable Decoding
par: Guruswami, Venkatesan, et autres
Publié: (2023)

A proximal gradient algorithm for composite log-concave sampling
par: Liu, Linghai, et autres
Publié: (2026)

The Power of Two Matrices in Spectral Algorithms for Community Recovery
par: Dhara, Souvik, et autres
Publié: (2022)

Minimax optimal testing by classification
par: Gerber, Patrik Róbert, et autres
Publié: (2023)

Accurate Analysis of Sparse Random Projections
par: Skórski, Maciej
Publié: (2024)

Optimal Binary Variable-Length Codes with a Bounded Number of 1's per Codeword: Design, Analysis, and Applications
par: Bruno, Roberto, et autres
Publié: (2025)

The Broader Landscape of Robustness in Algorithmic Statistics
par: Kamath, Gautam
Publié: (2024)

Better and Simpler Lower Bounds for Differentially Private Statistical Estimation
par: Narayanan, Shyam
Publié: (2023)