Sciweavers

57 search results - page 9 / 12
» Convergence and Rate of Convergence of a Manifold-Based Dime...
Sort
View
GECCO
2009
Springer
14 years 9 days ago
Optimal robust expensive optimization is tractable
Following a number of recent papers investigating the possibility of optimal comparison-based optimization algorithms for a given distribution of probability on fitness functions...
Philippe Rolet, Michèle Sebag, Olivier Teyt...
STOC
2010
ACM
195views Algorithms» more  STOC 2010»
13 years 10 months ago
Efficiently Learning Mixtures of Two Gaussians
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We provide a polynomial-time algorithm for this proble...
Adam Tauman Kalai, Ankur Moitra, and Gregory Valia...
IJON
2006
131views more  IJON 2006»
13 years 5 months ago
Optimizing blind source separation with guided genetic algorithms
This paper proposes a novel method for blindly separating unobservable independent component (IC) signals based on the use of a genetic algorithm. It is intended for its applicati...
J. M. Górriz, Carlos García Puntonet...
ICML
2004
IEEE
14 years 6 months ago
Generalized low rank approximations of matrices
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
Jieping Ye
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
13 years 3 months ago
Efficient and Numerically Stable Sparse Learning
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...