63 search results - page 1 / 13 » Adaptive Subgradient Methods for Online Learning and Stochas... |
COLT
2010
Springer
13 years 2 months ago
2010
Springer
We present a new family of subgradient methods that dynamically incorporate knowledge of the geometry of the data observed in earlier iterations to perform more informative gradie...
JMLR
2010
12 years 11 months ago
2010
We consider regularized stochastic learning and online optimization problems, where the objective function is the sum of two convex terms: one is the loss function of the learning...
ICML
2007
IEEE
14 years 5 months ago
2007
IEEE
We describe and analyze a simple and effective iterative algorithm for solving the optimization problem cast by Support Vector Machines (SVM). Our method alternates between stocha...
ATAL
2010
Springer
13 years 5 months ago
2010
Springer
Many applications in multiagent learning are essentially convex optimization problems in which agents have only limited communication and partial information about the function be...
CICLING
2010
Springer
13 years 7 months ago
2010
Springer
Term weighting strongly influences the performance of text mining and information retrieval approaches. Usually term weights are determined through statistical estimates based on s...