Amortized Inference in Probabilistic Reasoning

@inproceedings{Gershman2014AmortizedII,
  title={Amortized Inference in Probabilistic Reasoning},
  author={Samuel J Gershman and Noah D. Goodman},
  booktitle={CogSci},
  year={2014}
}
Recent studies of probabilistic reasoning have postulated general-purpose inference algorithms that can be used to answer arbitrary queries. These algorithms are memoryless, in the sense that each query is processed independently, without reuse of earlier computation. We argue that the brain operates in the setting of amortized inference, where numerous related queries must be answered (e.g., recognizing a scene from multiple viewpoints); in this setting, memoryless algorithms can be… CONTINUE READING
Highly Cited
This paper has 84 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 63 extracted citations

Learning 3D Shape Completion Under Weak Supervision

International Journal of Computer Vision • 2018
View 3 Excerpts
Highly Influenced

Recurrent latent variable conditional heteroscedasticity

2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) • 2017
View 10 Excerpts
Highly Influenced

85 Citations

0102030'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 85 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…