Sciweavers

1790 search results - page 233 / 358
» Noise in Bilinear Problems
Sort
View
NIPS
2008
13 years 9 months ago
An Homotopy Algorithm for the Lasso with Online Observations
It has been shown that the problem of 1-penalized least-square regression commonly referred to as the Lasso or Basis Pursuit DeNoising leads to solutions that are sparse and there...
Pierre Garrigues, Laurent El Ghaoui
NIPS
2001
13 years 9 months ago
Estimating Car Insurance Premia: a Case Study in High-Dimensional Data Inference
Estimating insurance premia from data is a difficult regression problem for several reasons: the large number of variables, many of which are discrete, and the very peculiar shape...
Nicolas Chapados, Yoshua Bengio, Pascal Vincent, J...
CIMAGING
2009
120views Hardware» more  CIMAGING 2009»
13 years 9 months ago
Dantzig selector homotopy with dynamic measurements
The Dantzig selector is a near ideal estimator for recovery of sparse signals from linear measurements in the presence of noise. It is a convex optimization problem which can be r...
Muhammad Salman Asif, Justin K. Romberg
GECCO
2008
Springer
171views Optimization» more  GECCO 2008»
13 years 9 months ago
Image registration using genetic algorithms
This paper addresses the image registration problem applying genetic algorithms. The image registration’s objective is the definition of a mapping that best match two set of poi...
Flávio Luiz Seixas, Luiz Satoru Ochi, Aura ...
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
13 years 9 months ago
Self-adaptive mutation in XCSF
Recent advances in XCS technology have shown that selfadaptive mutation can be highly useful to speed-up the evolutionary progress in XCS. Moreover, recent publications have shown...
Martin V. Butz, Patrick O. Stalph, Pier Luca Lanzi