CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_upper_j_idt184",{id:"formSmash:upper:j_idt184",widgetVar:"widget_formSmash_upper_j_idt184",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:upper:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt186_j_idt188",{id:"formSmash:upper:j_idt186:j_idt188",widgetVar:"widget_formSmash_upper_j_idt186_j_idt188",target:"formSmash:upper:j_idt186:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Bayesian Inference in Large Data ProblemsPrimeFaces.cw("AccordionPanel","widget_formSmash_some",{id:"formSmash:some",widgetVar:"widget_formSmash_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_all",{id:"formSmash:all",widgetVar:"widget_formSmash_all",multiple:true});
function selectAll()
{
var panelSome = $(PrimeFaces.escapeClientId("formSmash:some"));
var panelAll = $(PrimeFaces.escapeClientId("formSmash:all"));
panelAll.toggle();
toggleList(panelSome.get(0).childNodes, panelAll);
toggleList(panelAll.get(0).childNodes, panelAll);
}
/*Toggling the list of authorPanel nodes according to the toggling of the closeable second panel */
function toggleList(childList, panel)
{
var panelWasOpen = (panel.get(0).style.display == 'none');
// console.log('panel was open ' + panelWasOpen);
for (var c = 0; c < childList.length; c++) {
if (childList[c].classList.contains('authorPanel')) {
clickNode(panelWasOpen, childList[c]);
}
}
}
/*nodes have styleClass ui-corner-top if they are expanded and ui-corner-all if they are collapsed */
function clickNode(collapse, child)
{
if (collapse && child.classList.contains('ui-corner-top')) {
// console.log('collapse');
child.click();
}
if (!collapse && child.classList.contains('ui-corner-all')) {
// console.log('expand');
child.click();
}
}
2015 (English)Doctoral thesis, comprehensive summary (Other academic)
##### Abstract [en]

##### Place, publisher, year, edition, pages

Stockholm: Department of Statistics, Stockholm University , 2015. , p. 50
##### Keywords [en]

Bayesian inference, Large data sets, Markov chain Monte Carlo, Survey sampling, Pseudo-marginal MCMC, Delayed acceptance MCMC
##### National Category

Probability Theory and Statistics
##### Research subject

Statistics
##### Identifiers

URN: urn:nbn:se:su:diva-118836ISBN: 978-91-7649-199-7 (print)OAI: oai:DiVA.org:su-118836DiVA, id: diva2:840507
##### Public defence

2015-09-07, Ahlmannsalen, Geovetenskapens hus, Svante Arrhenius väg 12, Stockholm, 10:00 (English)
##### Opponent

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt585",{id:"formSmash:j_idt585",widgetVar:"widget_formSmash_j_idt585",multiple:true});
##### Supervisors

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt591",{id:"formSmash:j_idt591",widgetVar:"widget_formSmash_j_idt591",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt597",{id:"formSmash:j_idt597",widgetVar:"widget_formSmash_j_idt597",multiple:true});
##### Funder

VINNOVA, 2010-02635
##### Note

##### List of papers

In the last decade or so, there has been a dramatic increase in storage facilities and the possibility of processing huge amounts of data. This has made large high-quality data sets widely accessible for practitioners. This technology innovation seriously challenges traditional modeling and inference methodology.

This thesis is devoted to developing inference and modeling tools to handle large data sets. Four included papers treat various important aspects of this topic, with a special emphasis on Bayesian inference by scalable Markov Chain Monte Carlo (MCMC) methods.

In the first paper, we propose a novel mixture-of-experts model for longitudinal data. The model and inference methodology allows for manageable computations with a large number of subjects. The model dramatically improves the out-of-sample predictive density forecasts compared to existing models.

The second paper aims at developing a scalable MCMC algorithm. Ideas from the survey sampling literature are used to estimate the likelihood on a random subset of data. The likelihood estimate is used within the pseudomarginal MCMC framework and we develop a theoretical framework for such algorithms based on subsets of the data.

The third paper further develops the ideas introduced in the second paper. We introduce the difference estimator in this framework and modify the methods for estimating the likelihood on a random subset of data. This results in scalable inference for a wider class of models.

Finally, the fourth paper brings the survey sampling tools for estimating the likelihood developed in the thesis into the delayed acceptance MCMC framework. We compare to an existing approach in the literature and document promising results for our algorithm.

At the time of the doctoral defense, the following papers were unpublished and had a status as follows: Paper 1: Submitted. Paper 2: Submitted. Paper 3: Manuscript. Paper 4: Manuscript.

Available from: 2015-08-14 Created: 2015-07-08 Last updated: 2015-08-13Bibliographically approved1. Dynamic mixture-of-experts models for longitudinal and discrete-time survival data$(function(){PrimeFaces.cw("OverlayPanel","overlay820444",{id:"formSmash:j_idt648:0:j_idt652",widgetVar:"overlay820444",target:"formSmash:j_idt648:0:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

2. Speeding up MCMC by efficient data subsampling$(function(){PrimeFaces.cw("OverlayPanel","overlay820453",{id:"formSmash:j_idt648:1:j_idt652",widgetVar:"overlay820453",target:"formSmash:j_idt648:1:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

3. Scalable MCMC for large data problems using data subsampling and the difference estimator$(function(){PrimeFaces.cw("OverlayPanel","overlay820454",{id:"formSmash:j_idt648:2:j_idt652",widgetVar:"overlay820454",target:"formSmash:j_idt648:2:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

4. Speeding up MCMC by delayed acceptance and data subsampling$(function(){PrimeFaces.cw("OverlayPanel","overlay820465",{id:"formSmash:j_idt648:3:j_idt652",widgetVar:"overlay820465",target:"formSmash:j_idt648:3:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

isbn
urn-nbn$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_j_idt1599",{id:"formSmash:j_idt1599",widgetVar:"widget_formSmash_j_idt1599",showEffect:"fade",hideEffect:"fade",showDelay:500,hideDelay:300,target:"formSmash:altmetricDiv"});});

CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_lower_j_idt1685",{id:"formSmash:lower:j_idt1685",widgetVar:"widget_formSmash_lower_j_idt1685",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:lower:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt1687_j_idt1689",{id:"formSmash:lower:j_idt1687:j_idt1689",widgetVar:"widget_formSmash_lower_j_idt1687_j_idt1689",target:"formSmash:lower:j_idt1687:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});