메뉴 건너뛰기




Volumn , Issue , 2013, Pages 177-194

Efficient transductive online learning via randomized rounding

Author keywords

[No Author keywords available]

Indexed keywords

COLLABORATIVE FILTERING; EDUCATION; LEARNING ALGORITHMS;

EID: 84948092768     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-642-41136-6_16     Document Type: Chapter
Times cited : (10)

References (27)
  • 1
    • 85161980699 scopus 로고    scopus 로고
    • Repeated games against budgeted adversaries
    • Abernethy, J., Warmuth, M.: Repeated games against budgeted adversaries. In: NIPS, Vancouver (2010)
    • (2010) NIPS, Vancouver
    • Abernethy, J.1    Warmuth, M.2
  • 3
    • 46249124832 scopus 로고    scopus 로고
    • Consistency of trace-norm minimization
    • Bach, F.: Consistency of trace-norm minimization. J. Mach. Learn. Res. 9, 1019-1048 (2008)
    • (2008) J. Mach. Learn. Res , vol.9 , pp. 1019-1048
    • Bach, F.1
  • 4
    • 0041413385 scopus 로고    scopus 로고
    • Rademacher and Gaussian complexities: Risk bounds and structural results
    • Bartlett, P., Mendelson, S.: Rademacher and Gaussian complexities: risk bounds and structural results. In: COLT, Amsterdam (2001)
    • (2001) COLT, Amsterdam
    • Bartlett, P.1    Mendelson, S.2
  • 5
    • 0031245162 scopus 로고    scopus 로고
    • Online learning versus offline learning
    • Ben-David, S., Kushilevitz, E., Mansour, Y.: Online learning versus offline learning. Mach. Learn. 29(1), 45-63 (1997)
    • (1997) Mach. Learn , vol.29 , Issue.1 , pp. 45-63
    • Ben-David, S.1    Kushilevitz, E.2    Mansour, Y.3
  • 7
    • 0028517062 scopus 로고
    • Separating distribution-free and mistake-bound learning models over the Boolean domain
    • Blum, A.: Separating distribution-free and mistake-bound learning models over the Boolean domain. SIAM J. Comput. 23(5), 990-1000 (1994)
    • (1994) SIAM J. Comput , vol.23 , Issue.5 , pp. 990-1000
    • Blum, A.1
  • 10
    • 4544304381 scopus 로고    scopus 로고
    • On the generalization ability of on-line learning algorithms
    • Cesa-Bianchi, N., Conconi, A., Gentile, C.: On the generalization ability of on-line learning algorithms. IEEE Trans. Inf. Theory 50(9), 2050-2057 (2004)
    • (2004) IEEE Trans. Inf. Theory , vol.50 , Issue.9 , pp. 2050-2057
    • Cesa-Bianchi, N.1    Conconi, A.2    Gentile, C.3
  • 11
    • 85025652911 scopus 로고
    • Approximate methods for sequential decision making using expert advice
    • Chung, T.: Approximate methods for sequential decision making using expert advice. In: COLT, New Brunswick (1994)
    • (1994) COLT, New Brunswick
    • Chung, T.1
  • 13
    • 85162455237 scopus 로고    scopus 로고
    • Learning with the weighted trace-norm under arbitrary sampling distributions
    • Foygel, R., Salakhutdinov, R., Shamir, O., Srebro, N.: Learning with the weighted trace-norm under arbitrary sampling distributions. In: NIPS, Granada (2011)
    • (2011) NIPS, Granada
    • Foygel, R.1    Salakhutdinov, R.2    Shamir, O.3    Srebro, N.4
  • 14
    • 84867129418 scopus 로고    scopus 로고
    • The convex optimization approach to regret minimization
    • Nowozin, S., Sra, S., Wright, S. (eds.), MIT, Cambridge
    • Hazan, E.: The convex optimization approach to regret minimization. In: Nowozin, S., Sra, S., Wright, S. (eds.) Optimization for Machine Learning. MIT, Cambridge (2012)
    • (2012) Optimization for Machine Learning
    • Hazan, E.1
  • 16
    • 84864059297 scopus 로고    scopus 로고
    • From batch to transductive online learning
    • Kakade, S., Kalai, A.: From batch to transductive online learning. In: NIPS, Vancouver (2005)
    • (2005) NIPS, Vancouver
    • Kakade, S.1    Kalai, A.2
  • 17
    • 70350647708 scopus 로고    scopus 로고
    • Collaborative filtering with temporal dynamics
    • Koren, Y.: Collaborative filtering with temporal dynamics. In: KDD, Paris (2009)
    • (2009) KDD, Paris
    • Koren, Y.1
  • 19
    • 85162027798 scopus 로고    scopus 로고
    • Online learning: Random averages, combinatorial parameters, and learnability
    • Rakhlin, A., Sridharan, K., Tewari, A.: Online learning: random averages, combinatorial parameters, and learnability. In: NIPS, Vancouver (2010)
    • (2010) NIPS, Vancouver
    • Rakhlin, A.1    Sridharan, K.2    Tewari, A.3
  • 20
    • 84948098008 scopus 로고    scopus 로고
    • Relax and localize: From value to algorithms
    • abs/1204.0870
    • Rakhlin, A., Shamir, O., Sridharan, K.: Relax and localize: from value to algorithms. CoRR abs/1204.0870 (2012)
    • (2012) CoRR
    • Rakhlin, A.1    Shamir, O.2    Sridharan, K.3
  • 22
    • 85161986396 scopus 로고    scopus 로고
    • Collaborative filtering in a non-uniform world: Learning with the weighted trace norm
    • Salakhutdinov, R., Srebro, N.: Collaborative filtering in a non-uniform world: learning with the weighted trace norm. In: NIPS, Vancouver (2010)
    • (2010) NIPS, Vancouver
    • Salakhutdinov, R.1    Srebro, N.2
  • 23
    • 84859418371 scopus 로고    scopus 로고
    • Online learning and online convex optimization
    • Shalev-Shwartz, S.: Online learning and online convex optimization. Found. Trends Mach. Learn. 4(2), 107-194 (2012)
    • (2012) Found. Trends Mach. Learn , vol.4 , Issue.2 , pp. 107-194
    • Shalev-Shwartz, S.1
  • 24
    • 84860616726 scopus 로고    scopus 로고
    • Collaborative filtering with the trace norm: Learning, bounding, and transducing
    • Shamir, O., Shalev-Shwartz, S.: Collaborative filtering with the trace norm: learning, bounding, and transducing. In: COLT, Budapest (2011)
    • (2011) COLT, Budapest
    • Shamir, O.1    Shalev-Shwartz, S.2


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