6 search results - page 1 / 2 » Tighter bounds for random projections of manifolds |
COMPGEOM
2008
ACM
13 years 6 months ago
2008
ACM
The Johnson-Lindenstrauss random projection lemma gives a simple way to reduce the dimensionality of a set of points while approximately preserving their pairwise distances. The m...
ICPR
2010
IEEE
13 years 12 months ago
2010
IEEE
We consider the problem of classification in nonadaptive dimensionality reduction. Specifically, we bound the increase in classification error of Fisher’s Linear Discriminant...
ICML
2002
IEEE
14 years 5 months ago
2002
IEEE
We study generalization properties of linear learning algorithms and develop a data dependent approach that is used to derive generalization bounds that depend on the margin distr...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The Random Projection Tree (RPTREE) structures proposed in [1] are space partitioning data structures that automatically adapt to various notions of intrinsic dimensionality of da...
NIPS
2007
13 years 6 months ago
2007
We give a new class of outer bounds on the marginal polytope, and propose a cutting-plane algorithm for efficiently optimizing over these constraints. When combined with a concav...