Sciweavers

443 search results - page 39 / 89
» Transductive optimal component analysis
Sort
View
ICA
2004
Springer
14 years 29 days ago
ICA Using Kernel Entropy Estimation with NlogN Complexity
Abstract. Mutual information (MI) is a common criterion in independent component analysis (ICA) optimization. MI is derived from probability density functions (PDF). There are scen...
Sarit Shwartz, Michael Zibulevsky, Yoav Y. Schechn...
GECCO
2003
Springer
118views Optimization» more  GECCO 2003»
14 years 24 days ago
Distributed Probabilistic Model-Building Genetic Algorithm
In this paper, a new model of Probabilistic Model-Building Genetic Algorithms (PMBGAs), Distributed PMBGA (DPMBGA), is proposed. In the DPMBGA, the correlation among the design var...
Tomoyuki Hiroyasu, Mitsunori Miki, Masaki Sano, Hi...
NIPS
2003
13 years 9 months ago
Learning to Find Pre-Images
We consider the problem of reconstructing patterns from a feature map. Learning algorithms using kernels to operate in a reproducing kernel Hilbert space (RKHS) express their solu...
Gökhan H. Bakir, Jason Weston, Bernhard Sch&o...
JMLR
2012
11 years 10 months ago
Minimax Rates of Estimation for Sparse PCA in High Dimensions
We study sparse principal components analysis in the high-dimensional setting, where p (the number of variables) can be much larger than n (the number of observations). We prove o...
Vincent Q. Vu, Jing Lei
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
14 years 8 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais