Sparse Online Learning via Truncated Gradient

Abstract

We propose a general method called truncated gradient to induce sparsity in the weights of online learning algorithms with convex loss functions. This method has several essential properties: The degree of sparsity is continuous -- a parameter controls the rate of sparsification from no sparsification to total sparsification. The approach is theoretically motivated, and an instance of it can be regarded as an online counterpart of the popular $L_1$-regularization method in the batch setting. We prove that small rates of sparsification result in only small additional regret with respect to typical online learning guarantees. The approach works well empirically. We apply the approach to several datasets and find that for datasets with large numbers of features, substantial sparsity is discoverable.

Cited by in corpus (9)

• Mini-Batch Semi-Stochastic Gradient Descent in the Proximal Setting
• Statistical inference for the mean outcome under a possibly non-unique optimal treatment strategy
• Feature Selection with Annealing for Computer Vision and Big Data Learning
• Strong error analysis for stochastic gradient descent optimization algorithms
• A Random Block-Coordinate Douglas-Rachford Splitting Method with Low Computational Complexity for Binary Logistic Regression
• A Novel Framework for Online Supervised Learning with Feature Selection
• Sparse online relative similarity learning
• Fiedler Regularization: Learning Neural Networks with Graph Sparsity
• Online Tensor Inference