Sciweavers

403 search results - page 69 / 81
» Sampling Bounds for Stochastic Optimization
Sort
View
GECCO
2007
Springer
132views Optimization» more  GECCO 2007»
14 years 4 months ago
Empirical analysis of ideal recombination on random decomposable problems
This paper analyzes the behavior of a selectorecombinative genetic algorithm (GA) with an ideal crossover on a class of random additively decomposable problems (rADPs). Specifical...
Kumara Sastry, Martin Pelikan, David E. Goldberg
NIPS
2007
13 years 11 months ago
Collapsed Variational Inference for HDP
A wide variety of Dirichlet-multinomial ‘topic’ models have found interesting applications in recent years. While Gibbs sampling remains an important method of inference in su...
Yee Whye Teh, Kenichi Kurihara, Max Welling
AUTOMATICA
2008
114views more  AUTOMATICA 2008»
13 years 10 months ago
A synthesis approach for output feedback robust constrained model predictive control
This paper addresses the synthesis approach to output feedback robust model predictive control for systems with polytopic description, bounded state disturbance and measurement no...
BaoCang Ding, YuGeng Xi, Marcin T. Cychowski, Thom...
ICML
2006
IEEE
14 years 10 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...
ESA
2007
Springer
125views Algorithms» more  ESA 2007»
14 years 4 months ago
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
We study the online ad-auctions problem introduced by Mehta et. al. [15]. We design a (1 − 1/e)competitive (optimal) algorithm for the problem, which is based on a clean primal-...
Niv Buchbinder, Kamal Jain, Joseph Naor