Table of Contents Author Guidelines Submit a Manuscript
Computational Intelligence and Neuroscience
Volume 2015, Article ID 973696, 17 pages
Research Article

Optimism in Active Learning

1CentraleSupélec, MaLIS Research Group, 57070 Metz, France
2GeorgiaTech-CNRS UMI 2958, 57070 Metz, France
3Université de Lille-CRIStAL UMR 9189, SequeL Team, 59650 Villeneuve d’Ascq, France
4Institut Universitaire de France (IUF), 75005 Paris, France

Received 15 April 2015; Accepted 12 August 2015

Academic Editor: Francesco Camastra

Copyright © 2015 Timothé Collet and Olivier Pietquin. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. Cohn, L. Atlas, and R. Ladner, “Improving generalization with active learning,” Machine Learning, vol. 15, no. 2, pp. 201–221, 1994. View at Publisher · View at Google Scholar · View at Scopus
  2. M. H. DeGroot, Optimal Statistical Decisions, vol. 82, John Wiley & Sons, Hoboken, NJ, USA, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  3. W. R. Thompson, “On the likelihood that one unknown probability exceeds another in view of the evidence of two samples,” Biometrika, vol. 25, no. 3-4, pp. 285–294, 1933. View at Publisher · View at Google Scholar
  4. S. Bubeck and N. Cesa-Bianchi, “Regret analysis of stochastic and nonstochastic multi-armed bandit problems,” Foundations and Trends in Machine Learning, vol. 5, no. 1, pp. 1–122, 2012. View at Google Scholar
  5. P. Auer, N. Cesa-Bianchi, and P. Fischer, “Finite-time analysis of the multiarmed bandit problem,” Machine Learning, vol. 47, no. 2-3, pp. 235–256, 2002. View at Publisher · View at Google Scholar · View at Scopus
  6. B. Settles, Active Learning Literature Survey, University of Wisconsin, Madison, Wis, USA, 2010.
  7. D. D. Lewis and W. A. Gale, “A sequential algorithm for training text classifiers,” in SIGIR '94: Proceedings of the Seventeenth Annual International ACM-SIGIR Conference on Research and Development in Information Retrieval, organised by Dublin City University, pp. 3–12, Springer, New York, NY, USA, 1994. View at Publisher · View at Google Scholar
  8. H. S. Seung, M. Opper, and H. Sompolinsky, “Query by committee,” in Proceedings of the 5th Annual ACM Workshop on Computational Learning Theory, pp. 287–294, ACM, July 1992. View at Scopus
  9. R. D. Nowak, “Noisy generalized binary search,” in Proceedings of the 23rd Annual Conference on Neural Information Processing Systems (NIPS '09), Vancouver, Canada, 2009.
  10. M.-F. Balcan, A. Beygelzimer, and J. Langford, “Agnostic active learning,” in Proceedings of the 23rd International Conference on Machine Learning (ICML '06), Pittsburgh, Pa, USA, June 2006.
  11. M. Naghshvar, T. Javidi, and K. Chaudhuri, “Noisy Bayesian active learning,” in Proceedings of the 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton '12), pp. 1626–1633, IEEE, October 2012. View at Publisher · View at Google Scholar · View at Scopus
  12. D. Golovin, A. Krause, and D. Ray, “Near-optimal bayesian active learning with noisy observations,” in Proceedings of the 24th Annual Conference on Neural Information Processing Systems (NIPS '10), Vancouver, Canada, December 2010.
  13. Y. Guo, “Active instance sampling via matrix partition,” in Advances in Neural Information Processing Systems, pp. 802–810, 2010. View at Google Scholar
  14. B. Settles and M. Craven, “An analysis of active learning strategies for sequence labeling tasks,” in Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP '08), pp. 1070–1079, Association for Computational Linguistics, 2008.
  15. N. Roy and A. McCallum, “Toward optimal active learning through Monte Carlo estimation of error reduction,” in Proceedings of the International Conference on Machine Learning (ICML '01), Williamstown, Mass, USA, 2001.
  16. X. Zhu, J. Lafferty, and Z. Ghahramani, “Combining active learning and semi-supervised learning using gaussian fields and harmonic functions,” in Proceedings of the Workshop on the Continuum from Labeled to Unlabeled Data in Machine Learning and Data Mining (ICML '03), pp. 58–65, Washington, DC, USA, 2003.
  17. A. Kapoor, K. Grauman, R. Urtasun, and T. Darrell, “Active learning with Gaussian processes for object categorization,” in Proceedings of the 11th IEEE International Conference on Computer Vision (ICCV '07), pp. 1–8, IEEE, Rio de Janeiro, Brazil, October 2007. View at Publisher · View at Google Scholar
  18. Q. Gu, T. Zhang, and J. Han, “Batchmode active learning via error bound minimization,” in Proceedings of the 30th Conference on Uncertainty in Artificial Intelligence (UAI '14), vol. 51, pp. 300–309, Quebec City, Canada, 2014.
  19. R. Ganti and A. G. Gray, “Building bridges: viewing active learning from the multi-armed bandit lens,” in Uncertainty in Artificial Intelligence, p. 232, 2013. View at Google Scholar
  20. A. Carpentier and R. Munos, “Finite time analysis of stratified sampling for Monte Carlo,” in Proceedings of the Annual Conference on Neural Information Processing Systems, 2011.
  21. E. T. Jaynes and O. Kempthorne, “Confidence intervals vs bayesian intervals,” in Foundations of Probability Theory, Statistical Inference, and Statistical Theories of Science, pp. 175–257, Springer, 1976. View at Google Scholar
  22. L. Breiman, “Random forests,” Machine Learning, vol. 45, no. 1, pp. 5–32, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  23. A. G. Barto, Reinforcement Learning: An Introduction, MIT Press, 1998.
  24. M. Lichman, “UCI machine learning repository,” 2013.