Sciweavers

459 search results - page 59 / 92
» Average Case Analysis of Conjunctive Learning Algorithms
Sort
View
COLT
2010
Springer
13 years 5 months ago
Toward Learning Gaussian Mixtures with Arbitrary Separation
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
Mikhail Belkin, Kaushik Sinha
BMCBI
2008
220views more  BMCBI 2008»
13 years 7 months ago
Gene prediction in metagenomic fragments: A large scale machine learning approach
Background: Metagenomics is an approach to the characterization of microbial genomes via the direct isolation of genomic sequences from the environment without prior cultivation. ...
Katharina J. Hoff, Maike Tech, Thomas Lingner, Rol...
FOCS
2002
IEEE
14 years 21 days ago
Learning Intersections and Thresholds of Halfspaces
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
Adam Klivans, Ryan O'Donnell, Rocco A. Servedio
ICML
2005
IEEE
14 years 8 months ago
Non-negative tensor factorization with applications to statistics and computer vision
We derive algorithms for finding a nonnegative n-dimensional tensor factorization (n-NTF) which includes the non-negative matrix factorization (NMF) as a particular case when n = ...
Amnon Shashua, Tamir Hazan
COLT
2006
Springer
13 years 11 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal