Accelerated sampling for the Indian buffet process

Proceedings of the 26th International Conference On Machine Learning, ICML 2009

Volumn , Issue , 2009, Pages 273-280

  Doshi Velez, Finale ^a   Ghahramani, Zoubin ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

GIBBS SAMPLERS; INFERENCE TECHNIQUES; NON-PARAMETRIC; REAL-WORLD DATASETS; RUNNING TIME;

ROBOT LEARNING;

SAMPLING;

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

References (14)

1. Chu, W., Ghahramani, Z., Krause, R., & Wild, D. (2006). Identifying protein complexes in high-throughput protein interaction screens using an infinite latent feature model. Pacific Symposium on Biocomputing (pp. 231-242).
2. Doshi-Velez, F., Miller, K. T., Gael, J. V., & Teh, Y. W. (2009). Variational inference for the Indian buffet process. Proceedings of the Intl. Conf. on Artificial Intelligence and Statistics (pp. 137-144).
3. Gelman, A., Carlin, J. B., Stern, H. S., & Rubin, D. B. (2003). Bayesian Data Analysis. Chapman & Hall/CRC.
4. Georghiades, A., Belhumeur, P., & Kriegman, D. (2001). From few to many: Illumination cone models for face recognition under variable lighting and pose. IEEE Trans. Pattern Anal. Mach. Intelligence, 23, 643-660.
5. Görür, D., Jäkel, F., & Rasmussen, C. E. (2006). A choice model with infinitely many latent features. Intl. Conf. on Machine Learning (pp. 361-368).
6. Griffiths, T., & Ghahramani, Z. (2005). Infinite latent feature models and the Indian buffet process. TR 2005-001, Gatsby Comp. Neuroscience Unit.
7. Hoffmann, U., Vesin, J.-M., Ebrahimi, T., & Diserens, K. (2008). An efficient P300-based brain-computer interface for disabled subjects. Journal of Neuroscience Methods, 167, 115-125.
8. Mart'inez, A. M., & Kak, A. C. (2001). PCA versus IDA. IEEE Trans. Pattern Anal. Mach. Intelligence, 23, 228-233.
9. Meeds, E., Ghahramani, Z., Neal, R., & Roweis, S. (2007). Modeling dyadic data with binary latent factors. Advances in Neural Information Processing Systems (pp. 977-984).
10. Navarro, D. J., & Griffiths, T. L. (2008). Latent features in similarity judgments: A nonparametric Bayesian approach. Neural Comp., 20, 2597-2628.
11. Poliner, G. E., & Ellis, D. P. W. (2007). A discriminative model for polyphonic piano transcription. EURASIP J. Appl. Signal Process., 2007, 154-154.
12. Teh, Y. W., Görür, D., & Ghahramani, Z. (2007). Stick-breaking construction for the Indian buffet process. Proceedings of the Intl. Conf. on Artificial Intelligence and Statistics (pp. 556-563).
13. Welling, M., & Kurihara, K. (2009). Bayesian K-means as a "maximization-expectation" algorithm. Neural Computation (pp. 1145-1172).
14. Wood, F., & Griffiths, T. L. (2007). Particle filtering for nonparametric Bayesian matrix factorization. Advances in Neural Information Processing Systems (pp. 1513-1520).