Sciweavers

9176 search results - page 523 / 1836
» algorithms 2010
Sort
View
CORR
2010
Springer
125views Education» more  CORR 2010»
15 years 7 months ago
Near-Optimal Bayesian Active Learning with Noisy Observations
We tackle the fundamental problem of Bayesian active learning with noise, where we need to adaptively select from a number of expensive tests in order to identify an unknown hypot...
Daniel Golovin, Andreas Krause, Debajyoti Ray
INLG
2010
Springer
15 years 4 months ago
Named Entity Generation Using Sampling-based Structured Prediction
The problem of Named Entity Generation is expressed as a conditional probability model over a structured domain. By defining a factor-graph model over the mentions of a text, we o...
Guillaume Bouchard
SODA
2010
ACM
232views Algorithms» more  SODA 2010»
16 years 4 months ago
On the Optimality of Spiral Search
Searching for a point in the plane is a well-known search game problem introduced in the early eigthies. The best known search strategy is given by a spiral and achieves a competi...
Elmar Langetepe
CORR
2010
Springer
113views Education» more  CORR 2010»
15 years 7 months ago
Opaque sets
The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opa...
Adrian Dumitrescu, János Pach
NECO
2010
97views more  NECO 2010»
15 years 5 months ago
Derivatives of Logarithmic Stationary Distributions for Policy Gradient Reinforcement Learning
Most conventional Policy Gradient Reinforcement Learning (PGRL) algorithms neglect (or do not explicitly make use of) a term in the average reward gradient with respect to the pol...
Tetsuro Morimura, Eiji Uchibe, Junichiro Yoshimoto...