Sciweavers

452 search results - page 2 / 91
» A convex optimization approach to the mode acceleration prob...
Sort
View
ICDM
2009
IEEE
149views Data Mining» more  ICDM 2009»
13 years 12 months ago
Accelerated Gradient Method for Multi-task Sparse Learning Problem
—Many real world learning problems can be recast as multi-task learning problems which utilize correlations among different tasks to obtain better generalization performance than...
Xi Chen, Weike Pan, James T. Kwok, Jaime G. Carbon...
ICML
2010
IEEE
13 years 6 months ago
Accelerated dual decomposition for MAP inference
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language unders...
Vladimir Jojic, Stephen Gould, Daphne Koller
JMLR
2010
143views more  JMLR 2010»
13 years 3 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
FOCM
2010
97views more  FOCM 2010»
13 years 3 months ago
Self-Concordant Barriers for Convex Approximations of Structured Convex Sets
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
Levent Tunçel, Arkadi Nemirovski
JOTA
2010
127views more  JOTA 2010»
13 years 23 hour ago
Optimization Over the Efficient Set of Multi-objective Convex Optimal Control Problems
We consider multi-objective convex optimal control problems. First we state a relationship between the (weakly or properly) efficient set of the multi-objective problem and the sol...
Henri Bonnel, C. Yalçin Kaya