Online learning of noisy data with kernels

COLT 2010 - The 23rd Conference on Learning Theory

Volumn , Issue , 2010, Pages 218-230

  Cesa Bianchi, Nicolò ^a   Shwartz, Shai Shalev ^b   Shamir, Ohad ^b  

^a UNIVERSITY OF MILAN   (Italy)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

GAUSSIAN KERNELS; GRADIENT DESCENT; HIGH PROBABILITY; MULTIPLE QUERIES; NOISE DISTRIBUTION; NONLINEAR FUNCTIONS; ONLINE LEARNING; UNBIASED ESTIMATOR;

FUNCTIONS;

E-LEARNING;

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

References (18)

1. J. Abernethy, E. Hazan, and A. Rakhlin. Competing in the dark: An efficient algorithm for bandit linear optimization. In COLT, pages 263-274, 2008.
2. S. Bhandari and A. Bose. Existence of unbiased estimators in sequential binomial experiments. Sankhya: The Indian Journal of Statistics, 52(1):127-130, 1990.
3. N. Bshouty, J. Jackson, and C. Tamon. Uniform-distribution attribute noise learnability. Information and Computation, 187(2):277-290, 2003.
4. N. Cesa-Bianchi, A. Conconi, and C. Gentile. On the generalization ability of on-line learning algorithms. IEEE Transactions on Information Theory, 50(9):2050-2057, September 2004.
5. N. Cesa-Bianchi, E. Dichterman, P. Fischer, E. Shamir, and H. Simon. Sample-efficient strategies for learning in the presence of noise. Journal of the ACM, 46(5):684-719, 1999.
6. N. Cesa-Bianchi and G. Lugosi. Prediction, learning, and games. Cambridge University Press, 2006.
7. N. Cesa-Bianchi, S. Shalev-Shwartz, and O. Shamir. Online learning of noisy data with kernels. Technical Report, available at arXiv:1005.2996.
8. A. Flaxman, A. Tauman Kalai, and H. McMahan. Online convex optimization in the bandit setting: gradient descent without a gradient. In Proceedings of SODA, pages 385-394, 2005.
9. S. Goldman and R. Sloan. Can pac learning algorithms tolerate random attribute noise? Al-gorithmica, 14(1):70-84, 1995.
10. M. Kearns and M. Li. Learning in the presence of malicious errors. SIAM Journal on Computing, 22(4):807-837, 1993.
11. N. Littlestone. Redundant noisy attributes, attribute errors, and linear threshold learning using Winnow. In Proceedings of COLT, pages 147-156, 1991.
12. D. Nettleton, A. Orriols-Puig, and A. Fornells. A study of the effect of different types of noise on the precision of supervised learning techniques. Artificial Intelligence Review, 2010.
13. M. Jordan P. Bartlett and J. McAuliffe. Convexity, classification and risk bounds. Journal of the American Statistical Association, 101(473):138-156, March 2006.
14. L. Paninski. Estimation of entropy and mutual information. Neural Computation, 15(6):1191-1253, 2003.
15. B. Schölkopf and A. Smola. Learning with Kernels. MIT Press, 2002.
16. R. Singh. Existence of unbiased estimates. Sankhya: The Indian Journal of Statistics, 26(1):93-96, 1964.
17. I. Steinwart and A. Christmann. Support Vector Machines. Springer, 2008.
18. M. Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In Proceedings of ICML, pages 928-936, 2003.