1118 search results - page 103 / 224 » Convex Optimization |
JMLR
2012
12 years 2 days ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
ICASSP
2009
IEEE
14 years 4 months ago
2009
IEEE
Recently proposed l1-regularized maximum-likelihood optimization methods for learning sparse Markov networks result into convex problems that can be solved optimally and efficien...
WEBI
2010
Springer
13 years 7 months ago
2010
Springer
Abstract--Expertise matching, aiming to find the alignment between experts and queries, is a common problem in many real applications such as conference paper-reviewer assignment, ...
TSP
2010
13 years 4 months ago
2010
Abstract--In this paper, we deal with the problem of constrained code optimization for radar space-time adaptive processing (STAP) in the presence of colored Gaussian disturbance. ...
FOCM
2002
13 years 9 months ago
2002
We consider the Riemannian geometry defined on a convex set by the Hessian of a selfconcordant barrier function, and its associated geodesic curves. These provide guidance for the...