Learning stochastic inverses

Advances in Neural Information Processing Systems

Volumn , Issue , 2013, Pages

  Stuhlmüller, Andreas ^a   Taylor, Jessica ^b   Goodman, Noah D ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Stanford University   (United States)

^c STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BAYESIAN NETWORKS; FACTORIZATION; STOCHASTIC SYSTEMS;

COMPUTATION STEPS; CONDITIONAL DISTRIBUTION; JOINT DISTRIBUTIONS; MCMC ALGORITHMS; METROPOLIS-HASTINGS; ONLINE INFERENCES; PARAMETER REGIMES; TRAINING SAMPLE;

INFERENCE ENGINES;

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

References (16)

1. J. Cheng and M. Druzdzel. AIS-BN: An adaptive importance sampling algorithm for evidential reasoning in large bayesian networks. Journal of Artificial Intelligence Research, 2000.
2. H. Haario, M. Laine, A. Mira, and E. Saksman. DRAM: efficient adaptive MCMC. Statistics and Computing, 16(4):339-354, 2006.
3. L. D. Hernandez, S. Moral, and A. Salmeron. A Monte Carlo algorithm for probabilistic propagation in belief networks based on importance sampling and stratified simulation techniques. International Journal of Approximate Reasoning, 18(1):53-91, 1998.
4. B. K. Horn. Understanding image intensities. Artificial intelligence, 8(2):201-231, 1977.
5. R. Mateescu, K. Kask, V. Gogate, and R. Dechter. Join-graph propagation algorithms. Journal of Artificial Intelligence Research, 37(1):279-328, 2010.
6. Q. Morris. Recognition networks for approximate inference in BN20 networks. Morgan Kaufmann Publishers Inc., Aug. 2001.
7. L. E. Ortiz and L. P. Kaelbling. Adaptive importance sampling for estimation in structured domains. In Proc. of the 16th Ann. Conf. on Uncertainty in A.I. (UAI-00), pages 446-454. Morgan Kaufmann Publishers, 2000.
8. M. Plummer et al. Jags: A program for analysis of bayesian graphical models using gibbs sampling. URL http://citeseer.ist.psu.edu/plummer03jags.html, 2003.
9. G. Roberts and J. Rosenthal. Examples of adaptive MCMC. Journal of Computational and Graphical Statistics, 18(2):349-367, 2009.
10. A. Salmeron, A. Cano, and S. Moral. Importance sampling in Bayesian networks using probability trees. Computational Statistics and Data Analysis, 34(4):387-413, Oct. 2000.
11. A. N. Sanborn, V. K. Mansinghka, and T. L. Griffiths. Reconciling intuitive physics and Newtonian mechanics for colliding objects. Psychological Review, 120(2):411, Apr. 2013.
12. R. D. Shachter and M. A. Peot. Simulation approaches to general probabilistic inference on belief networks. In Proc. of the 5th Ann. Conf. on Uncertainty in A.I. (UAI-89), pages 311-318, New York, NY, 1989. Elsevier Science.
13. K. Watanabe and S. Shimojo. When sound affects vision: effects of auditory grouping on visual motion perception. Psychological Science, 12(2):109-116, 2001.
14. D. Wingate and T. Weber. Automated variational inference in probabilistic programming. arXiv preprint arXiv:1301.1299, 2013.
15. H. Yu and R. A. Van Engelen. Refractor importance sampling. arXiv preprint arXiv:1206.3295, 2012.
16. C. Yuan and M. J. Druzdzel. Importance sampling in Bayesian networks: An influence-based approximation strategy for importance functions. arXiv preprint arXiv:1207.1422, 2012.