메뉴 건너뛰기




Volumn 1, Issue January, 2014, Pages 694-702

Online and stochastic gradient methods for non-decomposable loss functions

Author keywords

[No Author keywords available]

Indexed keywords

BIOMETRICS; GRADIENT METHODS; INFORMATION SCIENCE; LEARNING ALGORITHMS; OPTIMIZATION; RISK ASSESSMENT; SOCIAL NETWORKING (ONLINE); STOCHASTIC SYSTEMS;

EID: 84937825297     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (74)

References (26)
  • 3
    • 31844446804 scopus 로고    scopus 로고
    • A support vector method for multivariate performance measures
    • Thorsten Joachims. A Support Vector Method for Multivariate Performance Measures. In ICML, 2005.
    • (2005) ICML
    • Joachims, T.1
  • 4
    • 36448983903 scopus 로고    scopus 로고
    • A support vector method for optimizing average precision
    • Yisong Yue, Thomas Finley, Filip Radlinski, and Thorsten Joachims. A Support Vector Method for Optimizing Average Precision. In SIGIR, 2007.
    • (2007) SIGIR
    • Yue, Y.1    Finley, T.2    Radlinski, F.3    Joachims, T.4
  • 6
    • 77956528213 scopus 로고    scopus 로고
    • Metric learning to rank
    • Brian McFee and Gert Lanckriet. Metric Learning to Rank. In ICML, 2010.
    • (2010) ICML
    • McFee, B.1    Lanckriet, G.2
  • 7
    • 85008480264 scopus 로고    scopus 로고
    • SVMtpiAghUt C: A new support vector method for optimizing partial AUC based on a tight convex upper bound
    • Harikrishna Narasimhan and Shivani Agarwal. SVMtpiAghUt C: A New Support Vector Method for Optimizing Partial AUC Based on a Tight Convex Upper Bound. In KDD, 2013.
    • (2013) KDD
    • Narasimhan, H.1    Agarwal, S.2
  • 13
    • 84897547320 scopus 로고    scopus 로고
    • On the generalization ability of online learning algorithms for pairwise loss functions
    • Purushottam Kar, Bharath K Sriperumbudur, Prateek Jain, and Harish Karnick. On the Generalization Ability of Online Learning Algorithms for Pairwise Loss Functions. In ICML, 2013.
    • (2013) ICML
    • Kar, P.1    Sriperumbudur, B.K.2    Jain, P.3    Karnick, H.4
  • 16
  • 17
    • 51049098491 scopus 로고    scopus 로고
    • Ranking and empirical minimization of U-statistics
    • Stéphan Clémençon, Gábor Lugosi, and Nicolas Vayatis. Ranking and empirical minimization of U-statistics. Annals of Statistics, 36:844-874, 2008.
    • (2008) Annals of Statistics , vol.36 , pp. 844-874
    • Clémençon, S.1    Lugosi, G.2    Vayatis, N.3
  • 18
    • 33746081666 scopus 로고    scopus 로고
    • Logarithmic regret algorithms for online convex optimization
    • Elad Hazan, Adam Kalai, Satyen Kale, and Amit Agarwal. Logarithmic Regret Algorithms for Online Convex Optimization. In COLT, pages 499-513, 2006.
    • (2006) COLT , pp. 499-513
    • Hazan, E.1    Kalai, A.2    Kale, S.3    Agarwal, A.4
  • 19
    • 33646421421 scopus 로고    scopus 로고
    • Evaluation of classifiers for an uneven class distribution problem
    • Sophia Daskalaki, Ioannis Kopanas, and Nikolaos Avouris. Evaluation of Classifiers for an Uneven Class Distribution Problem. Applied Artificial Intelligence, 20:381-417, 2006.
    • (2006) Applied Artificial Intelligence , vol.20 , pp. 381-417
    • Daskalaki, S.1    Kopanas, I.2    Avouris, N.3
  • 21
    • 33646018046 scopus 로고    scopus 로고
    • Evaluation of different biological data and computational classification methods for use in protein interaction prediction
    • Yanjun Qi, Ziv Bar-Joseph, and Judith Klein-Seetharaman. Evaluation of Different Biological Data and Computational Classification Methods for Use in Protein Interaction Prediction. Proteins, 63:490-500, 2006.
    • (2006) Proteins , vol.63 , pp. 490-500
    • Qi, Y.1    Bar-Joseph, Z.2    Klein-Seetharaman, J.3
  • 22
    • 78649934709 scopus 로고    scopus 로고
    • University of California, Irvine, School of Information and Computer Sciences
    • A. Frank and Arthur Asuncion. The UCI Machine Learning Repository. http://archive.ics.uci.edu/ml, 2010. University of California, Irvine, School of Information and Computer Sciences.
    • (2010) The UCI Machine Learning Repository
    • Frank, A.1    Asuncion, A.2
  • 23
    • 84937823921 scopus 로고    scopus 로고
    • The interplay between stability and regret in online learning
    • Ankan Saha, Prateek Jain, and Ambuj Tewari. The interplay between stability and regret in online learning. CoRR, abs/1211.6158, 2012.
    • (2012) CoRR, Abs/1211.6158
    • Saha, A.1    Jain, P.2    Tewari, A.3
  • 24
    • 1942484421 scopus 로고    scopus 로고
    • Online convex programming and generalized infinitesimal gradient ascent
    • Martin Zinkevich. Online Convex Programming and Generalized Infinitesimal Gradient Ascent. In ICML, pages 928-936, 2003.
    • (2003) ICML , pp. 928-936
    • Zinkevich, M.1
  • 25
    • 0001899764 scopus 로고
    • Probability inequalities for the sum in sampling without replacement
    • Robert J. Serfling. Probability Inequalities for the Sum in Sampling without Replacement. Annals of Statistics, 2(1):39-48, 1974.
    • (1974) Annals of Statistics , vol.2 , Issue.1 , pp. 39-48
    • Serfling, R.J.1
  • 26
    • 0003713964 scopus 로고    scopus 로고
    • 2nd Edition. Belmont, MA: Athena Scientific
    • Dimitri P. Bertsekas. Nonlinear Programming: 2nd Edition. Belmont, MA: Athena Scientific, 2004.
    • (2004) Nonlinear Programming
    • Bertsekas, D.P.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.