Proximal regularization for online and batch learning
- 14 June 2009
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 257-264
- https://doi.org/10.1145/1553374.1553407
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- A scalable modular convex solver for regularized risk minimizationPublished by Association for Computing Machinery (ACM) ,2007
- Logarithmic regret algorithms for online convex optimizationMachine Learning, 2007
- PegasosPublished by Association for Computing Machinery (ACM) ,2007
- Training linear SVMs in linear timePublished by Association for Computing Machinery (ACM) ,2006
- CONTRAfold: RNA secondary structure prediction without physics-based modelsBioinformatics, 2006
- New variants of bundle methodsMathematical Programming, 1995
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical ResultsSIAM Journal on Optimization, 1992
- An aggregate subgradient method for nonsmooth convex minimizationMathematical Programming, 1983