Smoothed analysis of the perceptron algorithm for linear programming

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 905-914

  Blum, Avrim ^a   Dunagan, John ^b  

^a Carnegie Mellon University ^*  (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR PROGRAMMING; POLYNOMIALS; RANDOM PROCESSES;

EXPECTED RUNNING TIME; GREEDY ALGORITHMS; HIGH PROBABILITY; PERCEPTRON ALGORITHMS; RANDOM PERTURBATIONS; RUNNING TIME; SIMPLEX ALGORITHM; SMOOTHED ANALYSIS;

ALGORITHMS;

EID: 26844495299     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. D. Spielman, S. Teng, "Smoothed Analysis: Why The Simplex Algorithm Usually Takes Polynomial Time, " In Proc. of the 33rd ACM Symposium, on the Theory of Computing, Crete, 2001.
2. F. Rosenblatt. Principles of Neurodynamics, Spartan Books, 1962.
3. S. Agmon. The relaxation method for linear inequalities. Canadian Journal of Mathematics, 6(3):382-392, 1954.
4. T. Bylander. Polynomial learnibility of linear threshold approximations. In Proceedings of the Sixth Annual Workshop on Computational Learning Theory, pages 297-302. ACM Press, New York, NY, 1993.
5. T. Bylander. Learning linear threshold functions in the presence of classification noise. In Proceedings of the Seventh Annual Workshop on Computational Learning Theory, pages 340-347. ACM Press, New York, NY, 1994.
6. M. Kearns. Efficient noise-tolerant learning from statistical queries. In Proceedings of the Twenty-Fifth An-nual ACM Symposium on Theory of Computing, pages 392-401, 1993.
7. M. Minsky and S. Papert. Perceptrons: An Introduction to Computational Geometry. The MIT Press, 1969.
8. S. Dasgupta, A. Gupta. An elementary proof of the Johnson-Lindenstrauss Lemma. International Computer Science Institute, Technical Report 99-006.
9. R. J. Gardner. The Brunn-Minkowski Inequality, http://www.ac.wwu.edu/-gardner/Submitted for publication.
10. P. M. Gruber, J. M. Wills, editors. Handbook of convex geometry, chapter 1.2. Elsevier Science Publishers, 1993.