Feature-aware regularization for sparse online learning
From MaRDI portal
Publication:893629
DOI10.1007/S11432-014-5082-ZzbMATH Open1343.68202OpenAlexW1997378987MaRDI QIDQ893629FDOQ893629
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
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
feature selectionsupervised learningonline learningsentiment analysissparsity-inducing regularization
Cites Work
- Simultaneous Regression Shrinkage, Variable Selection, and Supervised Clustering of Predictors with OSCAR
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Adaptive subgradient methods for online learning and stochastic optimization
- Regularization and Variable Selection Via the Elastic Net
- Title not available (Why is that?)
- Primal-dual subgradient methods for convex problems
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Title not available (Why is that?)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Dual averaging methods for regularized stochastic learning and online optimization
- Online learning and online convex optimization
- Efficient algorithms for online decision problems
- Sparse online learning via truncated gradient
- Efficient online and batch learning using forward backward splitting
- Title not available (Why is that?)
- Optimal distributed online prediction using mini-batches
- Manifold identification in dual averaging for regularized stochastic online learning
- A primal-dual perspective of online learning algorithms
Cited In (5)
- Online Proximal Learning Over Jointly Sparse Multitask Networks With $\ell _{\infty, 1}$ Regularization
- Spatially-Dimension-Adaptive Sparse Grids for Online Learning
- Online learning for matrix factorization and sparse coding
- Sparse online learning via truncated gradient
- Title not available (Why is that?)
Uses Software
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)
