263 search results - page 18 / 53 » Regret Bounds for Prediction Problems |
INFORMS
2006
14 years 11 months ago
2006
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
ICML
2007
IEEE
16 years 17 days ago
2007
IEEE
In this paper, we present an information-theoretic approach to learning a Mahalanobis distance function. We formulate the problem as that of minimizing the differential relative e...
COLT
2004
Springer
15 years 5 months ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
80
Voted
CATS
2007
15 years 1 months ago
2007
A model for the problem of predicting the outputs of a process, based only on knowledge of previous outputs, is proposed in terms of a decision problem. The strength of this parti...
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
— This paper develops a novel robust control method for linear systems subject to additive and bounded disturbances. The approach is based on constraint tightening method. The pr...