메뉴 건너뛰기




Volumn 32, Issue , 2019, Pages

Bayesian batch active learning as sparse subset approximation

Author keywords

[No Author keywords available]

Indexed keywords

QUERY PROCESSING;

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

References (38)
  • 2
    • 0000695404 scopus 로고
    • Information-based objective functions for active data selection
    • David JC MacKay. Information-based objective functions for active data selection. Neural computation, 4(4):590-604, 1992.
    • (1992) Neural computation , vol.4 , Issue.4 , pp. 590-604
    • MacKay, David JC1
  • 14
    • 84856462978 scopus 로고    scopus 로고
    • Adaptive submodularity: Theory and applications in active learning and stochastic optimization
    • Daniel Golovin and Andreas Krause. Adaptive submodularity: Theory and applications in active learning and stochastic optimization. Journal of Artificial Intelligence Research, 42: 427-486, 2011.
    • (2011) Journal of Artificial Intelligence Research , vol.42 , pp. 427-486
    • Golovin, Daniel1    Krause, Andreas2
  • 17
    • 3042813990 scopus 로고    scopus 로고
    • Fisher information inequalities and the central limit theorem
    • Oliver Johnson and Andrew Barron. Fisher information inequalities and the central limit theorem. Probability Theory and Related Fields, 129(3):391-409, 2004.
    • (2004) Probability Theory and Related Fields , vol.129 , Issue.3 , pp. 391-409
    • Johnson, Oliver1    Barron, Andrew2
  • 23
    • 0000023163 scopus 로고
    • Tables for computing bivariate normal probabilities
    • Donald B Owen. Tables for computing bivariate normal probabilities. The Annals of Mathematical Statistics, 27(4):1075-1090, 1956.
    • (1956) The Annals of Mathematical Statistics , vol.27 , Issue.4 , pp. 1075-1090
    • Owen, Donald B1
  • 30
    • 84965123646 scopus 로고    scopus 로고
    • Parallel predictive entropy search for batch global optimization of expensive objective functions
    • Amar Shah and Zoubin Ghahramani. Parallel predictive entropy search for batch global optimization of expensive objective functions. In Advances in Neural Information Processing Systems, pages 3330-3338, 2015.
    • (2015) Advances in Neural Information Processing Systems , pp. 3330-3338
    • Shah, Amar1    Ghahramani, Zoubin2
  • 33
    • 84942597150 scopus 로고    scopus 로고
    • Parallelizing exploration-exploitation tradeoffs in gaussian process bandit optimization
    • Thomas Desautels, Andreas Krause, and Joel W Burdick. Parallelizing exploration-exploitation tradeoffs in gaussian process bandit optimization. The Journal of Machine Learning Research, 15(1):3873-3923, 2014.
    • (2014) The Journal of Machine Learning Research , vol.15 , Issue.1 , pp. 3873-3923
    • Desautels, Thomas1    Krause, Andreas2    Burdick, Joel W3


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