Sciweavers

65 search results - page 3 / 13
» Convergence of a Generalized Gradient Selection Approach for...
Sort
View
ECML
2007
Springer
13 years 11 months ago
Fast Optimization Methods for L1 Regularization: A Comparative Study and Two New Approaches
L1 regularization is effective for feature selection, but the resulting optimization is challenging due to the non-differentiability of the 1-norm. In this paper we compare state...
Mark Schmidt, Glenn Fung, Rómer Rosales
SADM
2008
178views more  SADM 2008»
13 years 5 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
INFOCOM
2007
IEEE
13 years 12 months ago
The Impact of Stochastic Noisy Feedback on Distributed Network Utility Maximization
—The implementation of distributed network utility maximization (NUM) algorithms hinges heavily on information feedback through message passing among network elements. In practic...
Junshan Zhang, Dong Zheng, Mung Chiang
ICML
2003
IEEE
14 years 6 months ago
Hierarchical Policy Gradient Algorithms
Hierarchical reinforcement learning is a general framework which attempts to accelerate policy learning in large domains. On the other hand, policy gradient reinforcement learning...
Mohammad Ghavamzadeh, Sridhar Mahadevan
IWANN
2007
Springer
13 years 11 months ago
An EA Multi-model Selection for SVM Multiclass Schemes
Multiclass problems with binary SVM classifiers are commonly treated as a decomposition in several binary sub-problems. An open question is how to properly tune all these sub-prob...
Gilles Lebrun, Olivier Lezoray, Christophe Charrie...