10901 search results - page 122 / 2181 » Approximations in Distributed Optimization |
170
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— Q-learning is a technique used to compute an optimal policy for a controlled Markov chain based on observations of the system controlled using a non-optimal policy. It ...
159
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We survey results on the hardness of approximating combinatorial optimization problems. Contents
185
click to vote
SAGA
2009
Springer
16 years 28 days ago
2009
Springer
Stochastic programming problems appear as mathematical models for optimization problems under stochastic uncertainty. Most computational approaches for solving such models are base...
145
click to vote
COLT
1993
Springer
15 years 10 months ago
1993
Springer
We introduce a new formal model in which a learning algorithm must combine a collection of potentially poor but statistically independent hypothesis functions in order to approxima...
165
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
We propose total subset variation (TSV), a convexity preserving generalization of the total variation (TV) prior, for higher order clique MRF. A proposed differentiable approximat...