The problem of making sequential decisions in unknown probabilistic environments is studied. In cycle t action yt results in perception xt and reward rt, where all quantities in g...
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
It is difficult to apply machine learning to new domains because often we lack labeled problem instances. In this paper, we provide a solution to this problem that leverages domai...
We generalize the primal-dual hybrid gradient (PDHG) algorithm proposed by Zhu and Chan in [M. Zhu, and T. F. Chan, An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Var...