835 search results - page 37 / 167 » Adaptive Bound Optimization for Online Convex Optimization |
NIPS
2004
14 years 16 hour ago
2004
We develop a family of upper and lower bounds on the worst-case expected KL loss for estimating a discrete distribution on a finite number m of points, given N i.i.d. samples. Our...
JMLR
2012
12 years 1 months ago
2012
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...
DATE
2007
IEEE
14 years 5 months ago
2007
IEEE
Recently, there has been a substantial interest in the design of systems that receive their energy from regenerative sources such as solar cells. In contrast to approaches that at...
ICAART
2010
INSTICC
14 years 7 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
JMLR
2006
13 years 10 months ago
2006
In this paper we prove the optimality of an aggregation procedure. We prove lower bounds for aggregation of model selection type of M density estimators for the Kullback-Leibler d...