Sciweavers

272 search results - page 32 / 55
» Parallel Reinforcement Learning with Linear Function Approxi...
Sort
View
IJCAI
2007
13 years 9 months ago
Using Linear Programming for Bayesian Exploration in Markov Decision Processes
A key problem in reinforcement learning is finding a good balance between the need to explore the environment and the need to gain rewards by exploiting existing knowledge. Much ...
Pablo Samuel Castro, Doina Precup
STOC
2012
ACM
209views Algorithms» more  STOC 2012»
11 years 10 months ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...
EMNLP
2010
13 years 5 months ago
Turbo Parsers: Dependency Parsing by Approximate Variational Inference
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
André F. T. Martins, Noah A. Smith, Eric P....
ASC
2007
13 years 7 months ago
An approximate stability analysis of nonlinear systems described by Universal Learning Networks
Stability is one of the most important subjects in control systems. As for the stability of nonlinear dynamical systems, Lyapunov’s direct method and linearized stability analys...
Kotaro Hirasawa, Shingo Mabu, Shinji Eto, Jinglu H...
SIAMCOMP
1998
92views more  SIAMCOMP 1998»
13 years 7 months ago
Surface Approximation and Geometric Partitions
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
Pankaj K. Agarwal, Subhash Suri