Simplex constrained sparse optimization via tail screening

MaRDI QIDQ6887389zbMATH OpenFDO

Authors Jin Zhu, Junxian Zhu, Xue-Qin Wang, Peng Chen

Publication date 9 December 2025

Published in Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://jmlr.org/papers/v26/24-0010.html

zbMATH Keywords

self-regularizationprojected gradient descentsimplex constrained sparse recoveryspecial information criteriontail screening

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Methods of reduced gradient type (90C52)

Cites work

• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A Neural Architecture for Bayesian Compressive Sensing Over the Simplex via Laplace Techniques
• A filtered bucket-clustering method for projection onto the simplex and the \(\ell_1\) ball
• A geometric proximal gradient method for sparse least squares regression with probabilistic simplex constraint
• A polynomial algorithm for best-subset selection problem
• CVXPY: a Python-embedded modeling language for convex optimization
• Calibrating nonconvex penalized regression in ultra-high dimension
• Communication-Efficient Accurate Statistical Estimation
• Estimating the dimension of a model
• Fast projection onto the simplex and the l₁ ball
• First-order methods in optimization
• From the simplex to the sphere: faster constrained optimization using the Hadamard parametrization
• Gradient methods for minimizing composite functions
• High-Dimensional Data Analysis with Low-Dimensional Models
• High-dimensional statistics. A non-asymptotic viewpoint
• Iterative hard thresholding for compressed sensing
• Methods for sparse and low-rank recovery under simplex constraints
• Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization
• OSQP: an operator splitting solver for quadratic programs
• On the conditions used to prove oracle results for the Lasso
• Sign-constrained least squares estimation for high-dimensional regression
• Simultaneous analysis of Lasso and Dantzig selector
• Sparse Portfolios for High-Dimensional Financial Index Tracking
• Sparsity and Smoothness Via the Fused Lasso
• Statistics for high-dimensional data. Methods, theory and applications.
• The Group Lasso for Logistic Regression
• \texttt{skscope}: fast sparsity-constrained optimization in Python

This page was built for publication: Simplex constrained sparse optimization via tail screening

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6887389)