Sciweavers

6 search results - page 1 / 2
» Lifted coordinate descent for learning with trace-norm regul...
Sort
View
JMLR
2012
11 years 7 months ago
Lifted coordinate descent for learning with trace-norm regularization
We consider the minimization of a smooth loss with trace-norm regularization, which is a natural objective in multi-class and multitask learning. Even though the problem is convex...
Miroslav Dudík, Zaïd Harchaoui, J&eacu...
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 5 months ago
On the Finite Time Convergence of Cyclic Coordinate Descent Methods
Cyclic coordinate descent is a classic optimization method that has witnessed a resurgence of interest in machine learning. Reasons for this include its simplicity, speed and stab...
Ankan Saha, Ambuj Tewari
ICML
2009
IEEE
14 years 5 months ago
Boosting with structural sparsity
Despite popular belief, boosting algorithms and related coordinate descent methods are prone to overfitting. We derive modifications to AdaBoost and related gradient-based coordin...
John Duchi, Yoram Singer
ICDM
2010
IEEE
226views Data Mining» more  ICDM 2010»
13 years 2 months ago
Edge Weight Regularization over Multiple Graphs for Similarity Learning
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...
Pradeep Muthukrishnan, Dragomir R. Radev, Qiaozhu ...
CORR
2012
Springer
220views Education» more  CORR 2012»
12 years 20 days ago
Sparse Topical Coding
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic t...
Jun Zhu, Eric P. Xing