Sciweavers

7378 search results - page 1261 / 1476
» Introduction to Machine Learning
Sort
View
COLT
2006
Springer
15 years 6 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
130
Voted
COLT
1995
Springer
15 years 6 months ago
Regression NSS: An Alternative to Cross Validation
The Noise Sensitivity Signature (NSS), originally introduced by Grossman and Lapedes (1993), was proposed as an alternative to cross validation for selecting network complexity. I...
Michael P. Perrone, Brian S. Blais
133
Voted
COLT
2005
Springer
15 years 4 months ago
From External to Internal Regret
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
Avrim Blum, Yishay Mansour
127
Voted
ECLIPSE
2005
ACM
15 years 4 months ago
Coping with an open bug repository
Most open source software development projects include an open bug repository—one to which users of the software can gain full access—that is used to report and track problems...
John Anvik, Lyndon Hiew, Gail C. Murphy
COLT
2008
Springer
15 years 4 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
« Prev « First page 1261 / 1476 Last » Next »