Cover Image

Theoretical limits of descending $\ell_0$ sparse-regression ML algorithms

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Stojnic, Mihailo
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Information Theory Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Ridge interpolators in correlated factor regression models -- exact risk analysis
by: Stojnic, Mihailo
Published: (2024)

Phase transition of \emph{descending} phase retrieval algorithms
by: Stojnic, Mihailo
Published: (2025)

Phase retrieval with rank $d$ measurements -- \emph{descending} algorithms phase transitions
by: Stojnic, Mihailo
Published: (2025)

Precise analysis of ridge interpolators under heavy correlations -- a Random Duality Theory view
by: Stojnic, Mihailo
Published: (2024)

Optimal spectral initializers impact on phase retrieval phase transitions -- an RDT view
by: Stojnic, Mihailo
Published: (2025)

A CLuP algorithm to practically achieve $\sim 0.76$ SK--model ground state free energy
by: Stojnic, Mihailo
Published: (2025)

A large deviation view of \emph{stationarized} fully lifted blirp interpolation
by: Stojnic, Mihailo
Published: (2025)

Fully lifted \emph{blirp} interpolation -- a large deviation view
by: Stojnic, Mihailo
Published: (2025)

Exact objectives of random linear programs and mean widths of random polyhedrons
by: Stojnic, Mihailo
Published: (2024)

CLuP practically achieves $\sim 1.77$ positive and $\sim 0.33$ negative Hopfield model ground state free energy
by: Stojnic, Mihailo
Published: (2025)

Deep ReLU networks -- injectivity capacity upper bounds
by: Stojnic, Mihailo
Published: (2024)

Injectivity capacity of ReLU gates
by: Stojnic, Mihailo
Published: (2024)

Rare dense solutions clusters in asymmetric binary perceptrons -- local entropy via fully lifted RDT
by: Stojnic, Mihailo
Published: (2025)

Exact capacity of the \emph{wide} hidden layer treelike neural networks with generic activations
by: Stojnic, Mihailo
Published: (2024)

Fixed width treelike neural networks capacity analysis -- generic activations
by: Stojnic, Mihailo
Published: (2024)

Capacity of the Hebbian-Hopfield network associative memory
by: Stojnic, Mihailo
Published: (2024)

Binary perceptron computational gap -- a parametric fl RDT view
by: Stojnic, Mihailo
Published: (2025)

Ultrametric OGP - parametric RDT \emph{symmetric} binary perceptron connection
by: Stojnic, Mihailo
Published: (2026)

Parametric RDT approach to computational gap of symmetric binary perceptron
by: Stojnic, Mihailo
Published: (2026)

A non-asymptotic distributional theory of approximate message passing for sparse and robust regression
by: Li, Gen, et al.
Published: (2024)

Adaptive Refinement Protocols for Distributed Distribution Estimation under $\ell^p$-Losses
by: Yuan, Deheng, et al.
Published: (2024)

On the sample complexity of parameter estimation in logistic regression with normal design
by: Hsu, Daniel, et al.
Published: (2023)

Information-Theoretic Thresholds for the Alignments of Partially Correlated Graphs
by: Huang, Dong, et al.
Published: (2024)

UCB algorithms for multi-armed bandits: Precise regret and adaptive inference
by: Han, Qiyang, et al.
Published: (2024)

Adaptive sparse variational approximations for Gaussian process regression
by: Nieman, Dennis, et al.
Published: (2025)

Overfitting has a limitation: a model-independent generalization gap bound based on Rényi entropy
by: Suzuki, Atsushi, et al.
Published: (2025)

Fundamental limits of distributed covariance matrix estimation via a conditional strong data processing inequality
by: Rahmani, Mohammad Reza, et al.
Published: (2025)

Information-Theoretic Guarantees for Recovering Low-Rank Tensors from Symmetric Rank-One Measurements
by: Kızıldağ, Eren C.
Published: (2025)

Closed-form $\ell_r$ norm scaling with data for overparameterized linear regression and diagonal linear networks under $\ell_p$ bias
by: Zhang, Shuofeng, et al.
Published: (2025)

Learning sparse generalized linear models with binary outcomes via iterative hard thresholding
by: Matsumoto, Namiko, et al.
Published: (2025)

Neural Networks Learn Generic Multi-Index Models Near Information-Theoretic Limit
by: Zhang, Bohan, et al.
Published: (2025)

Hard labels sampled from sparse targets mislead rotation invariant algorithms
by: Ghosh, Avrajit, et al.
Published: (2026)

Adaptive posterior concentration rates for sparse high-dimensional linear regression with random design and unknown error variance
by: Mai, The Tien
Published: (2024)

Information-Geometric Decomposition of Generalization Error in Unsupervised Learning
by: Kim, Gilhan
Published: (2026)

Fundamental limits of community detection from multi-view data: multi-layer, dynamic and partially labeled block models
by: Yang, Xiaodong, et al.
Published: (2024)

Fine-Grained Uncertainty Quantification via Collisions
by: Friedbaum, Jesse, et al.
Published: (2024)

Efficient Unbiased Sparsification
by: Barnes, Leighton, et al.
Published: (2024)

Minimax Optimality of Score-based Diffusion Models: Beyond the Density Lower Bound Assumptions
by: Zhang, Kaihong, et al.
Published: (2024)

Top-$K$ ranking with a monotone adversary
by: Yang, Yuepeng, et al.
Published: (2024)

Characterizing Dependence of Samples along the Langevin Dynamics and Algorithms via Contraction of $Φ$-Mutual Information
by: Liang, Jiaming, et al.
Published: (2024)