1 citations · 1 across the 12 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
math.ST2025
Almost-Optimal Local-Search Methods for Sparse Tensor PCA
Max Lovig, Conor Sheehan, Konstantinos Tsirkas +1
Local-search methods are widely employed in statistical applications, yet interestingly, their theoretical foundations remain rather underexplored, compared to other classes of est…
math.ST2025
An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds
Siyu Chen, Theodor Misiakiewicz, Ilias Zadik +1
Bandeira et al. (2022) introduced the Franz-Parisi (FP) criterion for characterizing the computational hard phases in statistical detection problems. The FP criterion, based on an…
math.ST2025
The Fundamental Limits of Recovering Planted Subgraphs
Daniel Lee, Francisco Pernice, Amit Rajaraman +1
Given an arbitrary subgraph and , the planted subgraph model is defined as follows. A statistician observes the union a random copy of , together…