Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
16,572
Variational algorithms for approximate Bayesian inference
, 2003
"... The Bayesian framework for machine learning allows for the incorporation of prior knowledge in a coherent way, avoids overfitting problems, and provides a principled basis for selecting between alternative models. Unfortunately the computations required are usually intractable. This thesis presents ..."
Abstract
-
Cited by 440 (9 self)
- Add to MetaCart
a unified variational Bayesian (VB) framework which approximates these computations in models with latent variables using a lower bound on the marginal likelihood. Chapter 1 presents background material on Bayesian inference, graphical models, and propaga-tion algorithms. Chapter 2 forms
Approximate Bayesian Inference for Quantiles
"... Suppose data consist of a random sample from a distribution function FY, which is unknown, and that interest focuses on inferences on θ, a vector of quantiles of FY. When the likelihood function is not fully specified, a posterior density cannot be calculated and Bayesian infer-ence is difficult. Th ..."
Abstract
-
Cited by 20 (1 self)
- Add to MetaCart
Suppose data consist of a random sample from a distribution function FY, which is unknown, and that interest focuses on inferences on θ, a vector of quantiles of FY. When the likelihood function is not fully specified, a posterior density cannot be calculated and Bayesian infer-ence is difficult
A family of algorithms for approximate Bayesian inference
, 2001
"... One of the major obstacles to using Bayesian methods for pattern recognition has been its computational expense. This thesis presents an approximation technique that can perform Bayesian inference faster and more accurately than previously possible. This method, "Expectation Propagation," ..."
Abstract
-
Cited by 366 (11 self)
- Add to MetaCart
One of the major obstacles to using Bayesian methods for pattern recognition has been its computational expense. This thesis presents an approximation technique that can perform Bayesian inference faster and more accurately than previously possible. This method, "Expectation Propagation
Approximate Bayesian Inference for Survival Models
, 2010
"... Bayesian analysis of time-to-event data, usually called survival analysis, has received increasing attention in the last years. In Cox-type models it allows to use information from the full likelihood instead of from a partial likelihood, so that the baseline hazard function and the model parameters ..."
Abstract
-
Cited by 15 (2 self)
- Add to MetaCart
slow at delivering answers. In this paper, we show how a new inferential tool named Integrated Nested Laplace approximations (INLA) can be adapted and applied to many survival models making Bayesian analysis both fast and accurate without having to rely on MCMC based inference.
Expectation Propagation for Approximate Bayesian Inference
"... This paper presents a new deterministic approximation technique in Bayesian networks. This method, “Expectation Propagation, ” unifies two previous techniques: assumed-density filtering, an extension of the Kalman filter, and loopy belief propagation, an extension of belief propagation in Bayesian n ..."
Abstract
- Add to MetaCart
This paper presents a new deterministic approximation technique in Bayesian networks. This method, “Expectation Propagation, ” unifies two previous techniques: assumed-density filtering, an extension of the Kalman filter, and loopy belief propagation, an extension of belief propagation in Bayesian
Approximate Bayesian inference for complex ecosystems
"... All F1000Prime Reports articles are distributed under the terms of the Creative Commons Attribution-Non Commercial License ..."
Abstract
- Add to MetaCart
All F1000Prime Reports articles are distributed under the terms of the Creative Commons Attribution-Non Commercial License
A Simple Sequential Algorithm for Approximating Bayesian Inference
"... People can apparently make surprisingly sophisticated inductive inferences, despite the fact that there are constraints on cognitive resources that would make performing exact Bayesian inference computationally intractable. What algorithms could they be using to make this possible? We show that a si ..."
Abstract
-
Cited by 8 (3 self)
- Add to MetaCart
simple sequential algorithm, Win-Stay, Lose-Shift (WSLS), can be used to approximate Bayesian inference, and is consistent with human behavior on a causal learning task. This algorithm provides a new way to understand people’s judgments and a new efficient method for performing Bayesian inference.
Approximate Bayesian Inference via Rejection Filtering
"... Abstract We introduce a method, rejection filtering, for approximating Bayesian inference using rejection sampling. We not only make the process efficient, but also dramatically reduce the memory required relative to conventional methods by combining rejection sampling with particle filtering to es ..."
Abstract
- Add to MetaCart
Abstract We introduce a method, rejection filtering, for approximating Bayesian inference using rejection sampling. We not only make the process efficient, but also dramatically reduce the memory required relative to conventional methods by combining rejection sampling with particle filtering
Results 1 - 10
of
16,572
