Sparse online learning via truncated gradient

zbMATH Open1235.68167MaRDI QIDQ2880897FDOQ2880897

Authors: John Langford, Lihong Li, Tong Zhang 

Publication date: 17 April 2012

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

Full work available at URL: http://www.jmlr.org/papers/v10/langford09a.html

Recommendations

• Feature-aware regularization for sparse online learning
• scientific article; zbMATH DE number 6860836
• Efficient online and batch learning using forward backward splitting
• scientific article; zbMATH DE number 1931826
• Adaptive subgradient methods for online learning and stochastic optimization

zbMATH Keywords

lassoregularizationsparsityonline learningstochastic gradient descenttruncated gradient

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cited In (36)

• Stochastic approximation with discontinuous dynamics, differential inclusions, and applications
• Distributed Learning with Sparse Communications by Identification
• LASSO for streaming data with adaptative filtering
• An accelerated variance reducing stochastic method with Douglas-Rachford splitting
• Learning Theory
• Nearly Dimension-Independent Sparse Linear Bandit over Small Action Spaces via Best Subset Selection
• A general framework of online updating variable selection for generalized linear models with streaming datasets
• A tight bound of hard thresholding
• A sparsity preserving stochastic gradient methods for sparse regression
• Beetle swarm optimization algorithm: Theory and application
• Online Estimation for Functional Data
• Online sparse sliced inverse regression for high-dimensional streaming data
• Kernel-based measures of association
• Title not available (Why is that?)
• Spatially-Dimension-Adaptive Sparse Grids for Online Learning
• A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression
• A linear recurrent kernel online learning algorithm with sparse updates
• Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
• Feature-aware regularization for sparse online learning
• An empirical study of on-line models for relational data streams
• Fast and scalable Lasso via stochastic Frank-Wolfe methods with a convergence guarantee
• Convergence analysis of online learning algorithm with two-stage step size
• Efficient transductive online learning via randomized rounding
• Online learning for matrix factorization and sparse coding
• Sparse high-dimensional fractional-norm support vector machine via DC programming
• Statistical optimization in high dimensions
• Make \(\ell_1\) regularization effective in training sparse CNN
• Stochastic primal-dual coordinate method for regularized empirical risk minimization
• A divide-and-combine method for large scale nonparallel support vector machines
• Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces
• Statistical inference for the mean outcome under a possibly non-unique optimal treatment strategy
• Online sparse identification for regression models
• Title not available (Why is that?)
• Robust echo state network with sparse online learning
• Adaptive subgradient methods for online learning and stochastic optimization
• Adaptive supervised learning on data streams in reproducing kernel Hilbert spaces with data sparsity constraint

Uses Software

• RCV1

This page was built for publication: Sparse online learning via truncated gradient

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