Sciweavers

58 search results - page 2 / 12
» Approximation accuracy, gradient methods, and error bound fo...
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...
NIPS
2008
13 years 6 months ago
Tighter Bounds for Structured Estimation
Large-margin structured estimation methods minimize a convex upper bound of loss functions. While they allow for efficient optimization algorithms, these convex formulations are n...
Olivier Chapelle, Chuong B. Do, Quoc V. Le, Alexan...
CORR
2011
Springer
202views Education» more  CORR 2011»
12 years 11 months ago
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
ICCV
2005
IEEE
14 years 7 months ago
Quasiconvex Optimization for Robust Geometric Reconstruction
Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show t...
Qifa Ke, Takeo Kanade
JMLR
2008
230views more  JMLR 2008»
13 years 5 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...