Data structures and network algorithms
Data structures and network algorithms
Exponentiated gradient versus gradient descent for linear predictors
Information and Computation
Introduction to Algorithms
RCV1: A New Benchmark Collection for Text Categorization Research
The Journal of Machine Learning Research
Feature selection, L1 vs. L2 regularization, and rotational invariance
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Efficient Learning of Label Ranking by Soft Projections onto Polyhedra
The Journal of Machine Learning Research
Pegasos: Primal Estimated sub-GrAdient SOlver for SVM
Proceedings of the 24th international conference on Machine learning
An Interior-Point Method for Large-Scale l1-Regularized Logistic Regression
The Journal of Machine Learning Research
Mirror descent and nonlinear projected subgradient methods for convex optimization
Operations Research Letters
Efficient Euclidean projections in linear time
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
An efficient projection for l1, ∞ regularization
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Stochastic methods for l1 regularized loss minimization
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
On primal and dual sparsity of Markov networks
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Large-scale sparse logistic regression
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Primal sparse Max-margin Markov networks
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Trajectory Modeling Using Mixtures of Vector Fields
IbPRIA '09 Proceedings of the 4th Iberian Conference on Pattern Recognition and Image Analysis
Sparse reconstruction by separable approximation
IEEE Transactions on Signal Processing
Stochastic gradient descent training for L1-regularized log-linear models with cumulative penalty
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1 - Volume 1
Maximum Entropy Discrimination Markov Networks
The Journal of Machine Learning Research
Efficient Online and Batch Learning Using Forward Backward Splitting
The Journal of Machine Learning Research
Online Learning for Matrix Factorization and Sparse Coding
The Journal of Machine Learning Research
Proceedings of the 19th international conference on World wide web
Trajectory analysis in natural images using mixtures of vector fields
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Combined regression and ranking
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Distance metric learning from uncertain side information for automated photo tagging
ACM Transactions on Intelligent Systems and Technology (TIST)
Dual Averaging Methods for Regularized Stochastic Learning and Online Optimization
The Journal of Machine Learning Research
The Journal of Machine Learning Research
Discovering sociolinguistic associations with structured sparsity
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Detecting adversarial advertisements in the wild
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Conditional topical coding: an efficient topic model conditioned on rich features
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Stochastic Methods for l1-regularized Loss Minimization
The Journal of Machine Learning Research
Cognitive policy learner: biasing winning or losing strategies
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
An alternating direction method for dual MAP LP relaxation
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II
Cross-Lingual Adaptation Using Structural Correspondence Learning
ACM Transactions on Intelligent Systems and Technology (TIST)
Extracting insights from social media with large-scale matrix approximations
IBM Journal of Research and Development
Convex and Network Flow Optimization for Structured Sparsity
The Journal of Machine Learning Research
Efficient Learning with Partially Observed Attributes
The Journal of Machine Learning Research
On vector and matrix median computation
Journal of Computational and Applied Mathematics
New approximation algorithms for minimum enclosing convex shapes
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Dual decomposition with many overlapping components
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Weighted consensus multi-document summarization
Information Processing and Management: an International Journal
A continuous max-flow approach to minimal partitions with label cost prior
SSVM'11 Proceedings of the Third international conference on Scale Space and Variational Methods in Computer Vision
Segmentation of images with separating layers by fuzzy c-means and convex optimization
Journal of Visual Communication and Image Representation
Statistical Analysis and Data Mining
Large-scale distributed non-negative sparse coding and sparse dictionary learning
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Accelerated Block-coordinate Relaxation for Regularized Optimization
SIAM Journal on Optimization
Structured sparsity via alternating direction methods
The Journal of Machine Learning Research
Low-rank mechanism: optimizing batch queries under differential privacy
Proceedings of the VLDB Endowment
Smaller alignment models for better translations: unsupervised word alignment with the l0-norm
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Auto-grouped sparse representation for visual analysis
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part I
Stochastic coordinate descent methods for regularized smooth and nonsmooth losses
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I
Supervised patient similarity measure of heterogeneous patient records
ACM SIGKDD Explorations Newsletter
Group sparse topical coding: from code to topic
Proceedings of the sixth ACM international conference on Web search and data mining
Co-factorization machines: modeling user interests and predicting individual decisions in Twitter
Proceedings of the sixth ACM international conference on Web search and data mining
Confidence Weighted Mean Reversion Strategy for Online Portfolio Selection
ACM Transactions on Knowledge Discovery from Data (TKDD)
Guided learning for role discovery (GLRD): framework, algorithms, and applications
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 22nd international conference on World Wide Web
Towards efficient sparse coding for scalable image annotation
Proceedings of the 21st ACM international conference on Multimedia
Sparse activity and sparse connectivity in supervised learning
The Journal of Machine Learning Research
Trading regret for efficiency: online convex optimization with long term constraints
The Journal of Machine Learning Research
Lead-lag analysis via sparse co-projection in correlated text streams
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Inverse volume rendering with material dictionaries
ACM Transactions on Graphics (TOG)
Online portfolio selection: A survey
ACM Computing Surveys (CSUR)
Robust median reversion strategy for on-line portfolio selection
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Link label prediction in signed social networks
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A sparse nonnegative matrix factorization technique for graph matching problems
Pattern Recognition
Estimating ad group performance in sponsored search
Proceedings of the 7th ACM international conference on Web search and data mining
Multiview Hessian discriminative sparse coding for image annotation
Computer Vision and Image Understanding
An effective dual method for multiplicative noise removal
Journal of Visual Communication and Image Representation
Homogeneous Penalizers and Constraints in Convex Image Restoration
Journal of Mathematical Imaging and Vision
Novel document detection for massive data streams using distributed dictionary learning
IBM Journal of Research and Development
| Hi-index | 0.00 |
We describe efficient algorithms for projecting a vector onto the l1-ball. We present two methods for projection. The first performs exact projection in O(n) expected time, where n is the dimension of the space. The second works on vectors k of whose elements are perturbed outside the l1-ball, projecting in O(k log(n)) time. This setting is especially useful for online learning in sparse feature spaces such as text categorization applications. We demonstrate the merits and effectiveness of our algorithms in numerous batch and online learning tasks. We show that variants of stochastic gradient projection methods augmented with our efficient projection procedures outperform interior point methods, which are considered state-of-the-art optimization techniques. We also show that in online settings gradient updates with l1 projections outperform the exponentiated gradient algorithm while obtaining models with high degrees of sparsity.