Sciweavers

701 search results - page 30 / 141
» Self Bounding Learning Algorithms
Sort
View
CVPR
2007
IEEE
14 years 11 months ago
The Hierarchical Isometric Self-Organizing Map for Manifold Representation
We present an algorithm, Hierarchical ISOmetric SelfOrganizing Map (H-ISOSOM), for a concise, organized manifold representation of complex, non-linear, large scale, high-dimension...
Haiying Guan, Matthew Turk
ICML
2006
IEEE
14 years 10 months ago
Generalized spectral bounds for sparse LDA
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
Baback Moghaddam, Yair Weiss, Shai Avidan
COLT
2005
Springer
13 years 11 months ago
Loss Bounds for Online Category Ranking
Category ranking is the task of ordering labels with respect to their relevance to an input instance. In this paper we describe and analyze several algorithms for online category r...
Koby Crammer, Yoram Singer
ALT
2005
Springer
14 years 6 months ago
Monotone Conditional Complexity Bounds on Future Prediction Errors
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true ...
Alexey V. Chernov, Marcus Hutter
FOCM
2007
76views more  FOCM 2007»
13 years 9 months ago
Risk Bounds for Random Regression Graphs
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...
Andrea Caponnetto, Steve Smale