Sciweavers

309 search results - page 21 / 62
» Smooth Optimization with Approximate Gradient
Sort
View
86
Voted
ICASSP
2011
IEEE
14 years 4 months ago
An ALPS view of sparse recovery
We provide two compressive sensing (CS) recovery algorithms based on iterative hard-thresholding. The algorithms, collectively dubbed as algebraic pursuits (ALPS), exploit the res...
Volkan Cevher
IJCV
2002
188views more  IJCV 2002»
15 years 3 days ago
A Multiphase Level Set Framework for Image Segmentation Using the Mumford and Shah Model
We propose a new multiphase level set framework for image segmentation using the Mumford and Shah model, for piecewise constant and piecewise smooth optimal approximations. The pro...
Luminita A. Vese, Tony F. Chan
CEC
2011
IEEE
14 years 12 days ago
Stochastic Natural Gradient Descent by estimation of empirical covariances
—Stochastic relaxation aims at finding the minimum of a fitness function by identifying a proper sequence of distributions, in a given model, that minimize the expected value o...
Luigi Malagò, Matteo Matteucci, Giovanni Pi...
110
Voted
JMLR
2012
13 years 2 months ago
SpeedBoost: Anytime Prediction with Uniform Near-Optimality
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...
Alexander Grubb, Drew Bagnell
JC
2006
68views more  JC 2006»
15 years 12 days ago
Monte Carlo approximation of weakly singular integral operators
We study the randomized approximation of weakly singular integral operators. For a suitable class of kernels having a standard type of singularity and being otherwise of finite sm...
Stefan Heinrich