Arrow Research search
Back to FOCS

FOCS 1996

Learning Linear Transformations

Conference Paper Accepted Paper Algorithms and Complexity ยท Theoretical Computer Science

Abstract

We present a polynomial time algorithm to learn (in Valiant's PAC model) an arbitrarily oriented cube in n-space, given uniformly distributed sample points from it. In fact, we solve the more general problem of learning, in polynomial time, a linear (affine) transformation of a product distribution.

Authors

Keywords

  • Polynomials
  • Computer science
  • Mathematics
  • Random variables
  • Probability distribution
  • Linear algebra
  • Independent component analysis
  • Collaboration
  • Gaussian distribution
  • Computer networks
  • Linear Transformation
  • Product Distribution
  • Polynomial-time Algorithm
  • Normal Distribution
  • Local Maxima
  • Variance-covariance Matrix
  • Second Moment
  • Correction Algorithm
  • Matrix M
  • Nonsingular
  • Isometry
  • Unknown Vector
  • Proof Of The Lemma
  • Identically Zero
  • Fourth Moment
  • Standard Basis Vector

Context

Venue
IEEE Symposium on Foundations of Computer Science
Archive span
1975-2025
Indexed papers
3809
Paper id
1102178162018965390