Maximum mean discrepancy for class ratio estimation: Convergence bounds and kernel selection

31st International Conference on Machine Learning, ICML 2014

Volumn 1, Issue , 2014, Pages 808-823

  Iyer, Arun ^a   Nath, Saketh ^b   Sarawagi, Sunita ^b  

^a YAHOO RESEARCH   (United States)

^b Institute of Technology Bombay   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; ESTIMATION; LEARNING SYSTEMS;

CLASS SEPARATION; CONVERGENCE BOUNDS; CUTTING PLANE ALGORITHMS; GEOMETRIC QUANTITIES; KERNEL SELECTION; RATIO ESTIMATIONS; REPRODUCING KERNEL HILBERT SPACES; TRAINING SIZE;

LEARNING ALGORITHMS;

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

References (23)

1. Argyriou, Andreas, Hauser, Raphael, Micchelli, Charles A., and Pontil, Massimiliano. A DC-programming algorithm for kernel selection. In ICML, pp. 41-48, 2006.
2. Beck, Amir and Teboulle, Marc. Mirror descent and non linear projected subgradient methods for convex opti mization. Operations Research Letters, 31(3): 167-175, 2003.
3. Clémencon, Stéphan, Vayatis, Nicolas, and Depecker, Marine. AUC optimization and the two-sample problem. In NIPS, 2009.
4. Cortes, Corinna and Mohri, Mehryar. AUC optimization vs. error rate minimization. In NIPS, 2004.
5. Cortes, Corinna, Mohri, Mehryar, Riley, Michael, and Rostamizadeh, Afshin. Sample selection bias correction theory. In ALT, 2008.
6. Elkan, Charles. The foundations of cost-sensitive learning. IJCAI, 2001.
7. Gehler, Peter Vincent and Nowozin, Sebastian. Infinite ker nel learning. Technical report, Max Planck Institute for Biological Cybernetics, 2008.
8. Gretton, Arthur, Smola, Alexander J., Huang, Jiayuan, Schmittfull, Marcel, Borgwardt, Karsten M., and Scholkopf, Bernhard. Covariate shift and local learning by distribution matching, pp. 131-160. MIT Press, Cambridge, MA, USA, 2 2009.
9. Gretton, Arthur, Borgwardt, Karsten M., Rasch, Malte J., Scholkopf, Bernhard, and Smola, Alexander J. A kernel two-sample test. Journal of Machine Learning Research, 13:723-773, 2012a.
10. Gretton, Arthur, Sriperumbudur, Bharath K., Sejdinovic, Dino, Strathmann, Heiko, Balakrishnan, Sivaraman, Pontil, Massimiliano, and Fukumizu, Kenji. Optimal kernel choice for large-scale two-sample tests. In NIPS, 2012b.
11. Lanckriet, Gert, Cristianini, Nello, Bartlett, Peter, and Ghaoui, Laurent El. Learning the kernel matrix with semi-definite programming. JMLR, 2002.
12. Lin, Yi, Lee, Yoonkyung, and Wahba, Grace. Support vec tor machines for classification in nonstandard situations. Machine Learning Journal, 2002.
13. Plessis, Marthinus D. and Sugiyama, Masashi. Semi-supervised learning of class balance under class-prior change by distribution matching. In ICML, 2012.
14. Saerens, Marco, Latinne, Patrice, and Decaestecker, Christine. Adjusting the outputs of a classifier to new a priori probabilities: a simple procedure. Neural Computation, 2002.
15. Selvaraj, Sathiya Keerthi, Bhar, Bigyan, Sellamanickam, Sundararajan, and Shevade, Shirish. Semi-supervised SVMs for classification with unknown class proportions and a small labeled dataset. In CIKM, 2011.
16. Sriperumbudur, Bharath K., Fukumizu, Kenji, Gretton, Arthur, Lanckriet, Gert R. G., and Scholkopf, Bernhard. Kernel choice and classifiability for RKHS embeddings of probability distributions. In NIPS, pp. 1750-1758, 2009.
17. Titterington, D. M. Minimum distance non-parametric es timation of mixture proportions. Journal of the Royal Statistical Society. Series B (Methodological), 45(1):pp. 37-46, 1983.
18. Tsochantaridis, I., Joachims, T., Hofmann, T., and Altun, Y. Large margin methods for structured and interdependent output variables. JMLR, 6:1453-1484, 2005.
19. Vishwanathan, S. V. N., Sun, Zhaonan, Theera-Ampornpunt, Nawanol, and Varma, Manik. Multiple kernel learning and the SMO algorithm. In Advances in Neural Information Processing Systems, December 2010.
20. Woodward, Wayne A., Parr, William C, Schucany, William R., and Lindsey, Hildegard. A comparison of minimum distance and maximum likelihood estimation of a mixture proportion. Journal of the American Statis tical Association, 79(387):590-598, 1984.
21. Yu, Yaoliang and Szepesvari, Csaba. Analysis of kernel mean matching under covariate shift. In ICML, 2012.
22. Yuille, A. L. and Rangarajan, Anand. The concave-convex procedure. Neural Computation, 15(4):915936, 2003.
23. Zhang, Kun, Scholkopf, Bernhard, Muandet, Krikamol, and Wang, Zhikun. Domain adaptation under target and conditional shift. In ICML, 2013.