Markov determinantal point processes

Uncertainty in Artificial Intelligence - Proceedings of the 28th Conference, UAI 2012

Volumn , Issue , 2012, Pages 26-35

  Affandi, Raja Hafiz ^a   Kulesza, Alex ^b   Fox, Emily B ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL PROBLEM; EFFICIENT SAMPLING; QUALITY MEASURES; RANDOM SUBSETS; STATIONARY PROCESS; SUBSET SELECTION; TOPIC PREFERENCES; USER'S INTEREST;

RANDOM PROCESSES; SET THEORY;

ARTIFICIAL INTELLIGENCE;

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

References (14)

1. V. Anantharam, P. Varaiya, and J.Walrand. Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: IID rewards. Automatic Control, IEEE Transactions on, 32(11):968-976, 1987.
2. R. A. Bernstein and M. Gobbel. Partitioning of space in communities of ants. Journal of Animal Ecology, 48(3): 931-942, 1979.
3. D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent Dirichlet allocation. The Journal of Machine Learning Research, 3: 993-1022, 2003.
4. A. Borodin and E. Rains. Eynard-Mehta theorem, Schur process, and their Pfaffian analogs. Journal of Statistical Physics, 121:291-317, 2005.
5. J. Ginibre. Statistical ensembles of complex, quaternion, and real matrices. Journal of Mathematical Physics, 6:440, 1965.
6. D. Graff and C. Cieri. English Gigaword, 2009.
7. J. B. Hough, M. Krishnapur, Y. Peres, and B. Virag. Determinantal processes and independence. Probability Surveys, 3:206-229, 2006.
8. A. Kulesza and B. Taskar. Structured determinantal point processes. In Advances in Neural Information Processing Systems, 2010.
9. A. Kulesza and B. Taskar. k-DPPs: Fixed-size determinantal point processes. In Proc. International Conference on Machine Learning, 2011a.
10. A. Kulesza and B. Taskar. Learning determinantal point processes. In Proc. Conference on Uncertainty in Artificial Intelligence, 2011b. J. Langford and T. Zhang. The epoch-greedy algorithm for contextual multi-armed bandits. In Advances in Neural Information Processing Systems, volume 20, 2007.
11. O. Macchi. The coincidence approach to stochastic point processes. Advances in Applied Probability, 7(1):83-122, 1975.
12. M. L. Mehta and M. Gaudin. On the density of eigenvalues of a random matrix. Nuclear Physics, 18(0):420-427, 1960.
13. T. Neeff, G. S. Biging, L. V. Dutra, C. C. Freitas, and J. R. Dos Santos. Markov point processes for modeling of spatial forest patterns in Amazonia derived from interferometric height. Remote Sensing of Environment, 97(4): 484-494, 2005.
14. Y. Yue and C. Guestrin. Linear submodular bandits and their application to diversified retrieval. In Advances in Neural Information Processing Systems, 2011.