Sciweavers

2944 search results - page 386 / 589
» Improving Bound Propagation
Sort
View
ICML
2006
IEEE
16 years 7 months ago
PAC model-free reinforcement learning
For a Markov Decision Process with finite state (size S) and action spaces (size A per state), we propose a new algorithm--Delayed Q-Learning. We prove it is PAC, achieving near o...
Alexander L. Strehl, Lihong Li, Eric Wiewiora, Joh...
ICML
2003
IEEE
16 years 7 months ago
Margin Distribution and Learning
Recent theoretical results have shown that improved bounds on generalization error of classifiers can be obtained by explicitly taking the observed margin distribution of the trai...
Ashutosh Garg, Dan Roth
STOC
2009
ACM
119views Algorithms» more  STOC 2009»
16 years 7 months ago
Explicit construction of a small epsilon-net for linear threshold functions
We give explicit constructions of epsilon nets for linear threshold functions on the binary cube and on the unit sphere. The size of the constructed nets is polynomial in the dime...
Yuval Rabani, Amir Shpilka
DCC
2009
IEEE
16 years 7 months ago
Communicating the Difference of Correlated Gaussian Sources over a MAC
This paper considers the problem of transmitting the difference of two positively correlated Gaussian sources over a two-user additive Gaussian noise multiple access channel (MAC)...
Rajiv Soundararajan, Sriram Vishwanath
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
16 years 6 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano