Sciweavers

74 search results - page 14 / 15
» Regret Bounds for Gaussian Process Bandit Problems
Sort
View
JMLR
2010
135views more  JMLR 2010»
13 years 6 months ago
Bundle Methods for Regularized Risk Minimization
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and differen...
Choon Hui Teo, S. V. N. Vishwanathan, Alex J. Smol...
SIAMCO
2002
71views more  SIAMCO 2002»
13 years 7 months ago
Rate of Convergence for Constrained Stochastic Approximation Algorithms
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
Robert Buche, Harold J. Kushner
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
13 years 7 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
CSDA
2010
122views more  CSDA 2010»
13 years 7 months ago
Nonparametric density estimation for positive time series
The Gaussian kernel density estimator is known to have substantial problems for bounded random variables with high density at the boundaries. For i.i.d. data several solutions hav...
Taoufik Bouezmarni, Jeroen V. K. Rombouts
MP
2011
13 years 2 months ago
Null space conditions and thresholds for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi