要看的几篇文章
colt2010上: Adaptive Bound Optimization for Online Convex Optimization ：http://www.colt2010.org/papers/104mcmahan.pdf
?
?
colt2010上: Adaptive Subgradient Methods for?Online Learning and Stochastic Optimization:
http://www.colt2010.org/papers/023Duchi.pdf??
nips2009上: adaptive regularization of weight vectors
http://books.nips.cc/papers/files/nips22/NIPS2009_0611.pdf? IR/paper/2009/nips
?
想起来在哪找到的这几篇文章里,原来是订阅的machine learning里有人提到,正好duchi的文章之前也有看. 博主对这几篇文章的评价是These papers provide tractable online algorithms with regret guarantees over a family of metrics rather than just euclidean metrics. They look pretty useful in practice.
?
approx: a general approximation framework...
ICML 系列:
A Dual Coordinate Descent Method for Large-scale Linear SVM这篇要看,晚上看完.
?
A Quasi-Newton Approach to Nonsmooth Convex Optimization (2008)http://www.conflate.net/icml/paper/2008/461
?
Learning Diverse Rankings with Multi-Armed Bandits (2008)
http://www.conflate.net/icml/paper/2008/264
?
ManifoldBoost: Stagewise Function Approximation for Fully-, Semi- and Un-supervised Learning (2008)
http://www.conflate.net/icml/paper/2008/676
?
Multiple Instance Ranking (2008)
http://www.conflate.net/icml/paper/2008/552
?
Optimized Cutting Plane Algorithm for Support Vector Machines (2008)
http://www.conflate.net/icml/paper/2008/411
?
?
Stochastic Methods for L1 Regularized Loss Minimization (2009)
http://www.conflate.net/icml/paper/2009/262
?
?
?Boosting with Structural Sparsity (2009)
http://www.conflate.net/icml/paper/2009/146
?
BoltzRank: Learning to Maximize Expected Ranking Gain (2009)
http://www.conflate.net/icml/paper/2009/498
?
Interactively Optimizing Information Retrieval Systems as a Dueling Bandits Problem (2009)
http://www.conflate.net/icml/paper/2009/346
?
Learning Structural SVMs with Latent Variables (2009)
http://www.conflate.net/icml/paper/2009/420
?
?
?
?
?
提示:看过的文章一定要整理出来,以后看完整理分类的science blog上.
1 楼 backsnow 2010-09-07 将DCD算法的非线性情况解决好就是个很大的突破 2 楼 backsnow 2010-09-07 或者解决其non-smooth的情况?