The Community for Technology Leaders
Proceedings of 37th Conference on Foundations of Computer Science (1996)
Burlington, VT
Oct. 14, 1996 to Oct. 16, 1996
ISBN: 0-8186-7594-2
pp: 359
A. Frieze , Dept. of Math., Carnegie Mellon Univ., Pittsburgh, PA, USA
M. Jerrum , Dept. of Math., Carnegie Mellon Univ., Pittsburgh, PA, USA
R. Kannan , Dept. of Math., Carnegie Mellon Univ., Pittsburgh, PA, USA
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.
INDEX TERMS
learning (artificial intelligence); polynomial time algorithm; linear transformations; learning; Valiant's PAC model; arbitrarily oriented cube; distributed sample points
CITATION

R. Kannan, M. Jerrum and A. Frieze, "Learning linear transformations," Proceedings of 37th Conference on Foundations of Computer Science(FOCS), Burlington, VT, 1996, pp. 359.
doi:10.1109/SFCS.1996.548495
94 ms
(Ver 3.3 (11022016))