Sciweavers

1106 search results - page 72 / 222
» On regularization algorithms in learning theory
Sort
View
137
Voted
SIAMSC
2010
215views more  SIAMSC 2010»
15 years 3 months ago
A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
We propose a fast algorithm for solving the ℓ1-regularized minimization problem minx∈Rn µ x 1 + Ax − b 2 2 for recovering sparse solutions to an undetermined system of linea...
Zaiwen Wen, Wotao Yin, Donald Goldfarb, Yin Zhang
ATAL
2010
Springer
15 years 6 months ago
Frequency adjusted multi-agent Q-learning
Multi-agent learning is a crucial method to control or find solutions for systems, in which more than one entity needs to be adaptive. In today's interconnected world, such s...
Michael Kaisers, Karl Tuyls
ICML
2007
IEEE
16 years 5 months ago
Learning nonparametric kernel matrices from pairwise constraints
Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Som...
Steven C. H. Hoi, Rong Jin, Michael R. Lyu
AI
2002
Springer
15 years 4 months ago
Multiagent learning using a variable learning rate
Learning to act in a multiagent environment is a difficult problem since the normal definition of an optimal policy no longer applies. The optimal policy at any moment depends on ...
Michael H. Bowling, Manuela M. Veloso
ICML
2009
IEEE
16 years 5 months ago
More generality in efficient multiple kernel learning
Recent advances in Multiple Kernel Learning (MKL) have positioned it as an attractive tool for tackling many supervised learning tasks. The development of efficient gradient desce...
Manik Varma, Bodla Rakesh Babu