Approximate Inference and Scientific Method
نویسندگان
چکیده
منابع مشابه
Approximate Inference and Scientific Method
A new identification criterion, motivated by notions of successively improving approximations in the philosophy of science, is defined. It is shown that the class of recursive functions is identifiable under this criterion. This result is extended to permit somewhat more realistic types of data than usual. This criterion is then modified to consider restrictions on the quality of approximations...
متن کاملParallelizing a Convergent Approximate Inference Method
The ability to efficiently perform probabilistic inference task is critical to large scale applications in statistics and artificial intelligence. Dramatic speedup might be achieved by appropriately mapping the current inference algorithms to the parallel framework. Parallel exact inference methods still suffer from exponential complexity in the worst case. Approximate inference methods have be...
متن کاملExtension of Path Probability Method to Approximate Inference over Time
There has been a tremendous growth in publicly available digital video footage over the past decade. This has necessitated the development of new techniques in computer vision geared towards efficient analysis, storage and retrieval of such data. Many midlevel computer vision tasks such as segmentation, object detection, tracking, etc. involve an inference problem based on the video data availa...
متن کاملApproximate Inference and Constrained Optimization
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms correspond to extrema of the Bethe and Kikuchi free energy (Yedidia et al., 2001). However, belief propagation does not always converge, which motivates approaches that explicitly minimize the Kikuchi/Bethe free energy, such as...
متن کاملApproximate Inference and Protein-Folding
Side-chain prediction is an important subtask in the protein-folding problem. We show that finding a minimal energy side-chain configuration is equivalent to performing inference in an undirected graphical model. The graphical model is relatively sparse yet has many cycles. We used this equivalence to assess the performance of approximate inference algorithms in a real-world setting. Specifical...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1994
ISSN: 0890-5401
DOI: 10.1006/inco.1994.1084