arXiv Machine Learning By Manuel Fernandez V, Yizhe Zhu

Spectral Concentration and Recovery in Sparse High-Dimensional Random Geometric Graphs

Read the original on arXiv Machine Learning →

arXiv:2607. 14304v1 Announce Type: cross Abstract: We study sparse random geometric graphs generated by connecting pairs of high-dimensional vectors whose inner product exceeds a threshold.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Sep 4

Restricted Eigenvalues Beyond Gaussian Width: Threshold Occupancy under Heavy Tails

The paper investigates restricted eigenvalue (RE) bounds for norm‑regularized estimators under heavy‑tailed designs. It shows that the previously conjectured sample‑size law based on Gaussian width fails for heavy‑tailed measurements, due to a phenomenon called simultaneous threshold occupancy. The authors provide explicit counterexamples, derive worst‑case sample‑complexity bounds, and compare the behavior of heavy‑tailed versus Gaussian designs on constant‑width polyhedral descent cones.

By Shi Fu, Huibo Xu, Qixin Zhang, Dacheng Tao
arXiv Statistics ML
Sep 24

Rank-One Signal Recovery in Sparse Wishart Noise

arXiv:2609.28163v1 Announce Type: cross Abstract: We study the high-dimensional recovery of a signal vector $\mathbf{x}$ in the presence of sparse Wishart-like noise. We define an $N \times N$ matrix...

By Preben Forer, Urte Adomaityte, Pierpaolo Vivo