Estimation of the Number of Spikes, Possibly Equal, in the High-Dimensional Case
Damien Passemier (ECE), Jian-Feng Yao (DSAS)

TL;DR
This paper addresses the challenge of estimating the number of spikes in high-dimensional models where the observation dimension exceeds the sample size, extending previous methods to cases with equal spikes using random matrix theory.
Contribution
It introduces an extended algorithm for spike estimation in high-dimensional settings with equal spikes, improving upon prior approaches and comparing favorably to benchmarks.
Findings
The proposed method effectively estimates the number of spikes in high-dimensional data.
The algorithm performs well even when some spikes are equal.
Comparison shows advantages over existing benchmark methods.
Abstract
Estimating the number of spikes in a spiked model is an important problem in many areas such as signal processing. Most of the classical approaches assume a large sample size whereas the dimension of the observations is kept small. In this paper, we consider the case of high dimension, where is large compared to . The approach is based on recent results of random matrix theory. We extend our previous results to a more difficult situation where some spikes are equal, and compare our algorithm to an existing benchmark method.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
