Sciweavers

701 search results - page 72 / 141
» Self Bounding Learning Algorithms
Sort
View
ORL
2007
66views more  ORL 2007»
13 years 7 months ago
Linear programming with online learning
We propose online decision strategies for time-dependent sequences of linear programs which use no distributional and minimal geometric assumptions about the data. These strategies...
Tatsiana Levina, Yuri Levin, Jeff McGill, Mikhail ...
JMLR
2008
117views more  JMLR 2008»
13 years 7 months ago
Active Learning by Spherical Subdivision
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
Falk-Florian Henrich, Klaus Obermayer
ML
2008
ACM
152views Machine Learning» more  ML 2008»
13 years 7 months ago
Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
András Antos, Csaba Szepesvári, R&ea...
COLT
2007
Springer
13 years 11 months ago
An Efficient Re-scaled Perceptron Algorithm for Conic Systems
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
Alexandre Belloni, Robert M. Freund, Santosh Vempa...
ML
2008
ACM
13 years 7 months ago
Large margin vs. large volume in transductive learning
Abstract. We consider a large volume principle for transductive learning that prioritizes the transductive equivalence classes according to the volume they occupy in hypothesis spa...
Ran El-Yaniv, Dmitry Pechyony, Vladimir Vapnik