Feature-aware regularization for sparse online learning

DOI10.1007/S11432-014-5082-ZMaRDI QIDQ893629zbMATH OpenOpenAlexFDO

Authors Hidekazu Oiwa, Shin Matsushima, Hiroshi Nakagawa

Publication date 20 November 2015

Published in Science China Information Sciences (Search for Journal in Brave)

Full work available at URL http://engine.scichina.com/doi/10.1007/s11432-014-5082-z

zbMATH Keywords

feature selectionsupervised learningonline learningsentiment analysissparsity-inducing regularization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Sparse online learning via truncated gradient
• Efficient online and batch learning using forward backward splitting
• Dual averaging methods for regularized stochastic learning and online optimization
• scientific article; zbMATH DE number 6860836
• Adaptive subgradient methods for online learning and stochastic optimization

Cites work

• scientific article; zbMATH DE number 5957338 (Why is no real title available?)
• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• scientific article; zbMATH DE number 3850830 (Why is no real title available?)
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A primal-dual perspective of online learning algorithms
• Adaptive subgradient methods for online learning and stochastic optimization
• Approximation accuracy, gradient methods, and error bound for structured convex optimization
• Dual averaging methods for regularized stochastic learning and online optimization
• Efficient algorithms for online decision problems
• Efficient online and batch learning using forward backward splitting
• Manifold identification in dual averaging for regularized stochastic online learning
• Mirror descent and nonlinear projected subgradient methods for convex optimization.
• Online learning and online convex optimization
• Optimal distributed online prediction using mini-batches
• Primal-dual subgradient methods for convex problems
• Regularization and Variable Selection Via the Elastic Net
• Simultaneous Regression Shrinkage, Variable Selection, and Supervised Clustering of Predictors with OSCAR
• Sparse online learning via truncated gradient

Cited in

(5)

• scientific article; zbMATH DE number 6860836 (Why is no real title available?)
• Online learning for matrix factorization and sparse coding
• Sparse online learning via truncated gradient
• Spatially-Dimension-Adaptive Sparse Grids for Online Learning
• Online Proximal Learning Over Jointly Sparse Multitask Networks With $\ell _{\infty, 1}$ Regularization

Describes a project that uses

Uses Software

• OSCAR
• AdaGrad

This page was built for publication: Feature-aware regularization for sparse online learning

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