JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for ALLSTAT Archives


ALLSTAT Archives

ALLSTAT Archives


allstat@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

ALLSTAT Home

ALLSTAT Home

ALLSTAT  April 2016

ALLSTAT April 2016

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

WORKSHOP: Afternoon meeting on Bayesian Computation, 19th April 2016, University of Reading

From:

Richard Geoffrey Everitt <[log in to unmask]>

Reply-To:

Richard Geoffrey Everitt <[log in to unmask]>

Date:

Mon, 4 Apr 2016 15:30:56 +0000

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (1 lines)

Afternoon meeting on Bayesian Computation

Joint meeting of the RSS Reading Local Group and the University of Reading

Tuesday 19th April 2016, 1230-1815

University of Reading, Nike Lecture Theatre, Agriculture Building



Schedule:

1230-1315  Antonietta Mira, Università della Svizzera italiana

1315-1345  Ingmar Schuster, Université Paris-Dauphine

1345-1415  Francois-Xavier Briol, University of Warwick

1415-1445  Jack Baker, University of Lancaster

1445-1515  Alexander Mihailov, University of Reading

1515-1545  Coffee break

1545-1630  Arnaud Doucet, University of Oxford

1630-1700  Philip Maybank, University of Reading

1700-1730  Elske van der Vaart, University of Reading

1730-1800  Reham Badawy, Aston University

1815-late  Pub and food (SCR, UoR campus)



Description:

The Bayesian approach to statistical inference has seen major successes in the past twenty years, finding application in many areas of science, engineering, finance and elsewhere.  The main drivers of these successes were developments in Monte Carlo methods and the wide availability of desktop computers.  More recently, the use of standard Monte Carlo methods has become infeasible due the size and complexity of data now available.  This has been countered by the development of next-generation Monte Carlo techniques, which are the topic of this meeting.



Registration:

The event is open to all, and there is no registration fee.



Directions:

The meeting is in the Nike Lecture Theatre, Agriculture Building, which is building number 59 on the map at http://goo.gl/AtV6rU.  The university is easily accessed by bus from the railway station (see http://goo.gl/Ybe9AB for further details).  Parking is limited on campus - please contact Richard Everitt ([log in to unmask]) if you require a parking permit.



Titles and abstracts:



Speaker: Prof. Antonietta Mira

Title: TBC

Abstract: TBC



Speaker: Dr Ingmar Schuster

Title: Gradient Importance Sampling

Abstract: Adaptive Monte Carlo schemes developed over the last years usually seek to ensure ergodicity of the sampling process in line with MCMC tradition. This poses constraints on what is possible in terms of adaptation. In the general case ergodicity can only be guaranteed if adaptation is diminished at a certain rate. Importance Sampling approaches offer a way to circumvent this limitation and design sampling algorithms that keep adapting. Here I present an adaptive variant of the discretized Langevin algorithm for estimating integrals wrt some target density that uses an Importance Sampling instead of the usual Metropolis-Hastings correction.



Speaker: Francois-Xavier Briol

Title: Probabilistic Numerics Approaches to Integration

Abstract: Probabilistic numerical methods aim to model numerical error as a source of epistemic uncertainty that is subject to probabilistic analysis and reasoning, enabling the principled propagation of numerical uncertainty through a computational pipeline. This talk will present probabilistic numerical integrators based on Markov chain and Quasi Monte Carlo methods and provide asymptotic results on the coverage of the associated probability models for numerical integration error. The performance of probabilistic integrators is guaranteed to be no worse than non-probabilistic integrators and is, in many cases, asymptotically superior. These probabilistic integrators therefore enjoy the "best of both worlds", leveraging the sampling efficiency of advanced Monte Carlo methods whilst being equipped with valid probabilistic models for uncertainty quantification, which will be shown to be essential in cases with expensive integrands.



Speaker: Jack Baker

Title: A Comparison of MCMC for Big Data

Abstract: https://www.dropbox.com/s/7pimk973qgu11sy/abstract.pdf?dl=0



Speaker: Dr Alexander Mihailov

Title: What Do Latin American Inflation Targeters Care About? A Comparative Bayesian Estimation of Central Bank Preferences

Abstract: This paper aims to reveal and compare the central bank preferences of the big five Latin American inflation targeting (LAIT) countries: Brazil, Chile, Colombia, Mexico, and Peru. Using a small open economy New Keynesian model with incomplete asset markets and incomplete exchange-rate pass-through, we estimate by Bayesian methods the loss function parameters for each central bank. Our results suggest a significant degree of heterogeneity in central bank objectives across the region. While Brazil and Peru placed priority on minimizing the volatility of nominal interest rate changes, Chile, Colombia and Mexico were more concerned about stabilizing inflation. Out of the five countries, only Brazil assigned a sizeable weight to output gap stabilization, whereas only Mexico assigned a significant weight to stabilizing the real exchange rate.



Speaker: Prof. Arnaud Doucet

Title: On a novel class of pseudo-marginal algorithms

Abstract: The pseudo-marginal algorithm is a popular variant of the Metropolis--Hastings scheme which allows us to sample asymptotically from a target probability density when we are only able to estimate unbiasedly an unnormalized version of this target. It has found numerous applications in Bayesian statistics as there are many scenarios where the likelihood function is intractable but can be estimated unbiasedly using Monte Carlo samples. For a fixed computing time, it has been shown in several recent contributions that an efficient implementation of the pseudo-marginal method requires the variance of the log-likelihood ratio estimator appearing in the acceptance probability of the algorithm to be of order 1, which in turn usually requires scaling the number N of Monte Carlo samples linearly with the number T of data points. We propose two novel pseudo-marginal algorithms which are based on low-variance estimators of the log-likelihood ratio appearing in Metropolis-Hastings. We show that the parameters of these schemes can be selected such that the variance of these estimators is of order 1 as $N,T\rightarrow\infty$ whenever $N/T\rightarrow0$; e.g. N=log(T). In our numerical examples, the efficiency of computations is increased relative to the standard pseudo-marginal algorithm by several order of magnitude for large data sets.



Speaker: Philip Maybank

Title: MCMC for Inverse Problems in Brain Imaging

Abstract: In Neuroscience, mean-field models are nonlinear dynamical systems that are used to describe the evolution of mean neural population activity, within a given brain region such as the cortex. Mean-field models typically contain 10-100 unknown parameters, and receive high-dimensional noisy input from other brain regions. Here we present preliminary results on inferring mechanistic parameters in the differential equations.



Speaker: Dr Elske van der Vaart

Title: Using Approximate Bayesian Computation with Repeated Measures Data: Assessing and Improving Accuracy

Abstract: Approximate Bayesian Computation (ABC) is an increasingly popular technique for calibrating and evaluating complex simulation models. Originally developed within population genetics, it is now widely applied across a variety of fields, but ensuring the accuracy of its estimates remains difficult. In this paper, we offer an improved approach to evaluation for cases where the empirical data consists of repeated measures of the same quantity – such as a time series. As ABC can give exact results under the assumption of model and / or measurement error, an accurate estimate of this error should make it possible to produce accurate posteriors. Our key insight is that for repeated measures data, the error can be estimated from the discrepancy between the observations and the model at its best-fitting parameter values, as would routinely be done in classical statistics. Using this approach, we derive the correct acceptance probabilities for a probabilistic rejection algorithm and apply it to both a toy example and a realistic ecological case study. A comparison with exact methods and an updated coverage test suggest that our approach produces accurate posteriors for both models. At the same time, we reach new conclusions about the interpretation of coverage tests more generally.



Speaker: Reham Badawy

Title: MCMC-ABC for neurobiological modelling of smartphone data

Abstract: https://www.dropbox.com/s/bdpk4t7rj7c89wx/MCMC-ABC%20for%20neurobiological%20modelling%20of%20smartphone%20data%20Reham%20Badawy.docx?dl=0



You may leave the list at any time by sending the command



SIGNOFF allstat



to [log in to unmask], leaving the subject line blank.

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

April 2024
March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
July 2023
June 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
October 2022
September 2022
August 2022
July 2022
June 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
July 2021
June 2021
May 2021
April 2021
March 2021
February 2021
January 2021
December 2020
November 2020
October 2020
September 2020
August 2020
July 2020
June 2020
May 2020
April 2020
March 2020
February 2020
January 2020
December 2019
November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
2006
2005
2004
2003
2002
2001
2000
1999
1998


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

For help and support help@jisc.ac.uk

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager