Sciweavers

56 search results - page 4 / 12
» Stochastic methods for l1 regularized loss minimization
Sort
View
119
Voted
JMLR
2010
143views more  JMLR 2010»
14 years 10 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, ...
ICDM
2009
IEEE
149views Data Mining» more  ICDM 2009»
15 years 7 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...
108
Voted
MICCAI
2010
Springer
14 years 10 months ago
Efficient MR Image Reconstruction for Compressed MR Imaging
In this paper, we propose an efficient algorithm for MR image reconstruction. The algorithm minimizes a linear combination of three terms corresponding to a least square data fitti...
Junzhou Huang, Shaoting Zhang, Dimitris N. Metaxas
108
Voted
ICIP
2005
IEEE
16 years 2 months ago
Stochastic frame buffers for rate distortion optimized loss resilient video communications
In this paper we propose an error control scheme for video communications over lossy channels. The proposed algorithm uses stochastic frame buffers(SFB) to determine the expected ...
Oztan Harmanci, A. Murat Tekalp
IWANN
2009
Springer
15 years 7 months ago
Feature Selection in Survival Least Squares Support Vector Machines with Maximal Variation Constraints
This work proposes the use of maximal variation analysis for feature selection within least squares support vector machines for survival analysis. Instead of selecting a subset of ...
Vanya Van Belle, Kristiaan Pelckmans, Johan A. K. ...