Archive

Archive for the ‘slides’ Category

Inference after eliminating Bayesian models of excessive codelength

1 November 2017 Comments off

“The maximum-entropy and minimax redundancy distribution classes of sufficiently small codelength”

10th Workshop on Information Theoretic Methods in Science and Engineering

Paris, France

September 11, 2017

David R. Bickel

University of Ottawa

Inference after eliminating Bayesian models of insufficient evidence

1 December 2016 Comments off

“Inference under the entropy-maximizing Bayesian model of sufficient evidence”

The Third International Conference on Mathematical and Computational Medicine

Columbus, Ohio

David R. Bickel

18 May 2016

A Bayesian approach to informing decision makers

23 September 2016 Comments off

False discovery rates are misleadingly low

2 March 2016 Comments off

D. R. Bickel, “Correcting false discovery rates for their bias toward false positives,” Working Paper, University of Ottawa, deposited in uO Research at https://goo.gl/GcUjJe (2016). 2016 preprint | Slides: CFDR and RFDR for SSC 2017

12 June 2017: URL updated and slides added

 

Inference after checking the prior & sampling model

1 September 2015 Comments off

D. R. Bickel, “Inference after checking multiple Bayesian models for data conflict and applications to mitigating the influence of rejected priors,” International Journal of Approximate Reasoning 66, 53–72 (2015). Simple explanation | Published version2014 preprint | Slides

S0888613X

The proposed procedure combines Bayesian model checking with robust Bayes acts to guide inference whether or not the model is found to be inadequate:

  1. The first stage of the procedure checks each model within a large class of models to determine which models are in conflict with the data and which are adequate for purposes of data analysis.
  2. The second stage of the procedure applies distribution combination or decision rules developed for imprecise probability.

This proposed procedure is illustrated by the application of a class of hierarchical models to a simple data set.

The link Simple explanation was added on 6 June 2017.

Maximum entropy over a set of posteriors

10 August 2015 Comments off

D. R. Bickel, “Blending Bayesian and frequentist methods according to the precision of prior information with applications to hypothesis testing,” Statistical Methods & Applications 24, 523-546 (2015). Published article2012 preprint | 2011 preprint | Slides

SMA

This framework of statistical inference facilitates the development of new methodology to bridge the gap between the frequentist and Bayesian theories. As an example, a simple and practical method for combining p-values with a set of possible posterior probabilities is provided.

In this general approach, Bayesian inference is used when the prior distribution is known, frequentist inference is used when nothing is known about the prior, and both types of inference are blended according to game theory when the prior is known to be a member of some set. (The robust Bayes framework represents knowledge about a prior in terms of a set of possible priors.) If the benchmark posterior that corresponds to frequentist inference lies within the set of Bayesian posteriors derived from the set of priors, then the benchmark posterior is used for inference. Otherwise, the posterior within that set that minimizes the cross entropy to the benchmark posterior is used for inference.

Assessing multiple models

1 June 2014 Comments off

D. R. Bickel, “Inference after checking multiple Bayesian models for data conflict,” Working Paper, University of Ottawa, deposited in uO Research at http://hdl.handle.net/1039/31135 (2014). 2014 preprint | Slides