Sciweavers

463 search results - page 51 / 93
» Localizing Search in Reinforcement Learning
Sort
View
CIKM
2003
Springer
14 years 3 months ago
Categorizing web queries according to geographical locality
Web pages (and resources, in general) can be characterized according to their geographical locality. For example, a web page with general information about wildflowers could be c...
Luis Gravano, Vasileios Hatzivassiloglou, Richard ...
JMLR
2010
143views more  JMLR 2010»
13 years 8 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
NN
2002
Springer
136views Neural Networks» more  NN 2002»
13 years 9 months ago
Bayesian model search for mixture models based on optimizing variational bounds
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Zoubin Ghahramani
ASIAN
1999
Springer
186views Algorithms» more  ASIAN 1999»
14 years 2 months ago
Ant Colony Optimization for the Ship Berthing Problem
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
Chia Jim Tong, Hoong Chuin Lau, Andrew Lim
JAIR
2011
187views more  JAIR 2011»
13 years 4 months ago
A Monte-Carlo AIXI Approximation
This paper describes a computationally feasible approximation to the AIXI agent, a universal reinforcement learning agent for arbitrary environments. AIXI is scaled down in two ke...
Joel Veness, Kee Siong Ng, Marcus Hutter, William ...