JMLR
2012
11 years 9 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...
COLT
2010
Springer
13 years 4 months ago
2010
Springer
We study the regret of an online learner playing a multi-round game in a Banach space B against an adversary that plays a convex function at each round. We characterize the minima...
JGO
2008
13 years 6 months ago
2008
When dealing with convex functions defined on a normed vector space X the biconjugate is usually considered with respect to the dual system (X, X ), that is, as a function defined...
DAM
2008
13 years 6 months ago
2008
The Newton Bracketing method [9] for the minimization of convex functions f : Rn R is extended to affinely constrained convex minimization problems. The results are illustrated for...
AUTOMATICA
2008
13 years 7 months ago
2008
This paper presents a guaranteed method for the parameter estimation of nonlinear models in a bounded-error context. This method is based on functions which consists of the differ...
ICASSP
2009
IEEE
14 years 1 months ago
2009
IEEE
—We consider constrained minimization of a sum of convex functions over a convex and compact set, when each component function is known only to a specific agent in a timevarying...