Slow kill for big data learning

DOI10.1109/TIT.2023.3273179MaRDI QIDQ6574859zbMATH OpenFDO

Authors Yiyuan She, Jiahui Shen, Adrian Barbu

Publication date 19 July 2024

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2023.3273179

zbMATH Keywords

adaptive \(l^2\)-shrinkageincrease of learning ratesnonconvex constrained optimizationslow kill method

Mathematics Subject Classification ID

Statistical aspects of big data and data science (62R07) Nonconvex programming, global optimization (90C26) Applications of mathematical programming (90C90)

Cited in

(4)

• An _0-constrained and _1-regularized estimator for graphical models
• Stochastic feature selection with annealing and its applications to streaming data
• Understanding best subset selection: a tale of two c(omplex)ities
• Distributed learning with adversarial contamination: an efficient and optimal approach based on dynamic regularization

This page was built for publication: Slow kill for big data learning

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