Bayesian Model Robust and Model Discrimination Designs William Li Operations and Management Science Department University of Minnesota (joint work with.

Slides:



Advertisements
Similar presentations
Connie M. Borror, Arizona State University West Christine M. Anderson-Cook, Los Alamos National Laboratory Bradley Jones, JMP SAS Institute Construction.
Advertisements

Fast Algorithms For Hierarchical Range Histogram Constructions
Data Mining Methodology 1. Why have a Methodology  Don’t want to learn things that aren’t true May not represent any underlying reality ○ Spurious correlation.
Vanderbilt University Medical Center SRC Presentation Vincent Kokouvi Agboto Assistant Professor/Director of Biostatistics, Meharry Medical College Assistant.
Patch to the Future: Unsupervised Visual Prediction
A system Performance Model Instructor: Dr. Yanqing Zhang Presented by: Rajapaksage Jayampthi S.
Optimal Design Laboratory | University of Michigan, Ann Arbor 2011 Design Preference Elicitation Using Efficient Global Optimization Yi Ren Panos Y. Papalambros.
CHAPTER 16 MARKOV CHAIN MONTE CARLO
Hidden Markov Model based 2D Shape Classification Ninad Thakoor 1 and Jean Gao 2 1 Electrical Engineering, University of Texas at Arlington, TX-76013,
Bayesian Nonparametric Matrix Factorization for Recorded Music Reading Group Presenter: Shujie Hou Cognitive Radio Institute Friday, October 15, 2010 Authors:
A Generic Framework for Handling Uncertain Data with Local Correlations Xiang Lian and Lei Chen Department of Computer Science and Engineering The Hong.
Integrating Bayesian Networks and Simpson’s Paradox in Data Mining Alex Freitas University of Kent Ken McGarry University of Sunderland.
Date:2011/06/08 吳昕澧 BOA: The Bayesian Optimization Algorithm.
On Computing Compression Trees for Data Collection in Wireless Sensor Networks Jian Li, Amol Deshpande and Samir Khuller Department of Computer Science,
Classification and risk prediction
1 Abstract This paper presents a novel modification to the classical Competitive Learning (CL) by adding a dynamic branching mechanism to neural networks.
Jierui Xie, Boleslaw Szymanski, Mohammed J. Zaki Department of Computer Science Rensselaer Polytechnic Institute Troy, NY 12180, USA {xiej2, szymansk,
Predictive Automatic Relevance Determination by Expectation Propagation Yuan (Alan) Qi Thomas P. Minka Rosalind W. Picard Zoubin Ghahramani.
Frank Hutter, Holger Hoos, Kevin Leyton-Brown
Bayesian Analysis for Extreme Events Pao-Shin Chu and Xin Zhao Department of Meteorology School of Ocean & Earth Science & Technology University of Hawaii-
A Bidirectional Matching Algorithm for Deformable Pattern Detection with Application to Handwritten Word Retrieval by K.W. Cheung, D.Y. Yeung, R.T. Chin.
Slide 1 Tutorial: Optimal Learning in the Laboratory Sciences Working with nonlinear belief models December 10, 2014 Warren B. Powell Kris Reyes Si Chen.
1 A Discriminative Approach to Topic- Based Citation Recommendation Jie Tang and Jing Zhang Presented by Pei Li Knowledge Engineering Group, Dept. of Computer.
Alignment and classification of time series gene expression in clinical studies Tien-ho Lin, Naftali Kaminski and Ziv Bar-Joseph.
Bayesian parameter estimation in cosmology with Population Monte Carlo By Darell Moodley (UKZN) Supervisor: Prof. K Moodley (UKZN) SKA Postgraduate conference,
ArrayCluster: an analytic tool for clustering, data visualization and module finder on gene expression profiles 組員:李祥豪 謝紹陽 江建霖.
Influence of the size of the cohorts in adaptive design for nonlinear mixed effect models: an evaluation by simulation for a pharmacokinetic (PK) and pharmacodynamic.
1 Formal Models for Expert Finding on DBLP Bibliography Data Presented by: Hongbo Deng Co-worked with: Irwin King and Michael R. Lyu Department of Computer.
Genetic Approximate Matching of Attributed Relational Graphs Thomas Bärecke¹, Marcin Detyniecki¹, Stefano Berretti² and Alberto Del Bimbo² ¹ Université.
Mining High Utility Itemset in Big Data
1 Sampling-based Program Locality Approximation Yutao Zhong, Wentao Chang Department of Computer Science George Mason University June 8th,2008.
Comparison of Bayesian Neural Networks with TMVA classifiers Richa Sharma, Vipin Bhatnagar Panjab University, Chandigarh India-CMS March, 2009 Meeting,
Predictive Design Space Exploration Using Genetically Programmed Response Surfaces Henry Cook Department of Electrical Engineering and Computer Science.
Center for Radiative Shock Hydrodynamics Fall 2011 Review Assessment of predictive capability Derek Bingham 1.
Xiangnan Kong,Philip S. Yu Multi-Label Feature Selection for Graph Classification Department of Computer Science University of Illinois at Chicago.
Iterated Local Search (ILS) for the Quadratic Assignment Problem (QAP) Tim Daniëlse en Vincent Delvigne.
Test Architecture Design and Optimization for Three- Dimensional SoCs Li Jiang, Lin Huang and Qiang Xu CUhk Reliable Computing Laboratry Department of.
Kanpur Genetic Algorithms Laboratory IIT Kanpur 25, July 2006 (11:00 AM) Multi-Objective Dynamic Optimization using Evolutionary Algorithms by Udaya Bhaskara.
Dual Transfer Learning Mingsheng Long 1,2, Jianmin Wang 2, Guiguang Ding 2 Wei Cheng, Xiang Zhang, and Wei Wang 1 Department of Computer Science and Technology.
Multi-Speaker Modeling with Shared Prior Distributions and Model Structures for Bayesian Speech Synthesis Kei Hashimoto, Yoshihiko Nankaku, and Keiichi.
Answering Top-k Queries Using Views Gautam Das (Univ. of Texas), Dimitrios Gunopulos (Univ. of California Riverside), Nick Koudas (Univ. of Toronto), Dimitris.
CHAPTER 17 O PTIMAL D ESIGN FOR E XPERIMENTAL I NPUTS Organization of chapter in ISSO –Background Motivation Finite sample and asymptotic (continuous)
Variational Bayesian Methods for Audio Indexing
1 A Comparison of Information Management using Imprecise Probabilities and Precise Bayesian Updating of Reliability Estimates Jason Matthew Aughenbaugh,
- 1 - Overall procedure of validation Calibration Validation Figure 12.4 Validation, calibration, and prediction (Oberkampf and Barone, 2004 ). Model accuracy.
July 9-13, 2006 Nankai University Design of Experiments Conference Combining Combinatorics and D-optimal Designs Dean Sterling Hoskins Arizona State University.
Threshold Setting and Performance Monitoring for Novel Text Mining Wenyin Tang and Flora S. Tsai School of Electrical and Electronic Engineering Nanyang.
Designing Factorial Experiments with Binary Response Tel-Aviv University Faculty of Exact Sciences Department of Statistics and Operations Research Hovav.
Learning a Monolingual Language Model from a Multilingual Text Database Rayid Ghani & Rosie Jones School of Computer Science Carnegie Mellon University.
Maximin D-optimal designs for binary longitudinal responses Fetene B. Tekle, Frans E. S. Tan and Martijn P. F. Berger Department of Methodology and Statistics,
Nonlinear differential equation model for quantification of transcriptional regulation applied to microarray data of Saccharomyces cerevisiae Vu, T. T.,
Predicting Consensus Ranking in Crowdsourced Setting Xi Chen Mentors: Paul Bennett and Eric Horvitz Collaborator: Kevyn Collins-Thompson Machine Learning.
The Effect of Database Size Distribution on Resource Selection Algorithms Luo Si and Jamie Callan School of Computer Science Carnegie Mellon University.
Classification Cheng Lei Department of Electrical and Computer Engineering University of Victoria April 24, 2015.
Parameter Estimation. Statistics Probability specified inferred Steam engine pump “prediction” “estimation”
Rowwise Complementary Designs Shao-Wei Cheng Institute of Statistical Science Academia Sinica Taiwan (based on a joint work with a Ph.D student Chien-Yu.
A Complete Catalog of Geometrically non-isomorphic OA18 Kenny Ye Albert Einstein College of Medicine June 10, 2006, 南開大學.
Dependency Networks for Inference, Collaborative filtering, and Data Visualization Heckerman et al. Microsoft Research J. of Machine Learning Research.
1 Introduce to the Count Function and Its Applications Chang-Yun Lin Institute of Statistics, NCHU.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Intelligent Exploration for Genetic Algorithms Using Self-Organizing.
Optimal marketing strategy: A decision-making with ANP and TOPSIS
Variable Selection for Gaussian Process Models in Computer Experiments
Lei Sha, Jing Liu, Chin-Yew Lin, Sujian Li, Baobao Chang, Zhifang Sui
Limitations of Hierarchical and Mixture Model Comparisons
A Short Tutorial on Causal Network Modeling and Discovery
John Lafferty, Chengxiang Zhai School of Computer Science
Penalized designs of multi-response experiments
Learning Incoherent Sparse and Low-Rank Patterns from Multiple Tasks
Speech Enhancement Based on Nonparametric Factor Analysis
Experimental setup for HIL Bayesian optimization.
Presentation transcript:

Bayesian Model Robust and Model Discrimination Designs William Li Operations and Management Science Department University of Minnesota (joint work with Chris Nachtsheim and Vincent Agtobo)

Outline Introduction Bayesian model-robust designs Bayesian model discrimination designs

Part I: Introduction Main objective: find designs that are efficient over a class of models –Model estimation: Are all models estimable? –Model discrimination: Can estimable models be discriminated? Brief literature review –Early work: Lauter (1974), Srivastava (1975), Cook and Nachtsheim (1982) –Cheng, Steinberg, and Sun (1999) –Li and Nachtsheim (2000) –Jones, Li, Nachtsheim, Ye (2006)

More literature review Bingham and Chipman (2002): Bayesian Hellinger distance Miller and Sitter (2005): the probability that the true model is identified Montgomery et al. (2005): application of new tools in model- robust designs Loeppky, Sitter, and Tang (2005): projection model space Jones, Li, Nachtsheim, Ye (2006): model-robust supersaturated designs

A general framework Li (2006): a review on model-robust designs Framework: three main elements –Model space: F={f 1, f 2, …, f u } –Criterion (e.g., EC, D-, EPD) –Candidates designs (e.g., orthogonal designs) Objective (rephrase): select an optimal design from candidate designs, such that it is optimal over all models in F, with respect to a criterion

Model spaces Srivastava (1975): search designs –F = {all effects of type (ii) + up to g effects of type (iii)} Sun (1993), Li and Nachtsheim (2000) –F g = {all main effects + up to g 2f interactions} Supersaturated designs –F = {any g out of m main effects} Loeppky, Sitter, and Tang (2005) –F g = {g out of m main effects + all 2f interactions}

Criteria and candidate designs Criteria –Bayesian model-robust criterion (related to EC and IC of LN) –Bayesian model discrimination criteria (related to EPD of Jones et al.) Candidate designs –Orthogonal designs –Optimal designs

Bayesian optimal designs Main elements –Prior distribution: p(  ) –Distribution of data: p(y |  ) –Utility function: U(d,  y) –Design space

Selected literature “Bayesian Experimental Design: A Review” – Chaloner and Verdinelli (1995) DuMouchel and Jones (1994): Bayesian D- optimal designs Jones, Lin, and Nachtsheim (2006): Bayesian supersaturated designs

Part II: Bayesian model-robust designs Focus: estimability of designs –Estimation capacity (EC): percentage of estimable models Model-robust designs: EC=100% –Information capacity (IC): average D-criterion value over all models Model space –LN (2000): main effects + g 2fi’s –Loeppky et al. (2006): g main effects + all 2fi’s among g factors

Bayesian criterion

Bayesian criterion for model- robust designs

Bayesian model-robust design Prior probabilities –Uniform prior –Hierarchical prior Chipman, Hamada, and Wu (1997) Bayesian model-robust (BMR) criterion Bayesian model-robust design (BMRD)

Design evaluations Evaluating existing orthogonal designs –12-, 16-, and 20-run designs (Sun, Li, and Ye, 2002) –Two model spaces –Compute BMR values and rank designs –Compare BMR ranks with generalized WLP ranks Generalized WLP: Deng and Tang (1999) Ranks for GWLP: given in Li, Lin, and Ye (2003)

Rank comparison plot (for 16*7 designs)

Design constructions Optimal designs –Balanced (equal # of +’s and –’s) CP algorithm of Li and Wu (1997) –General (unbalanced) optimal designs Coordinate-exchange algorithm of Meyer and Nachtsheim (1995)

Part III: Bayesian model discrimination designs Issues beyond model estimation –How well can estimable models be distinguished from each other? –If true model is known, is it fully aliased with other models through the design?

Criteria Atkinson and Fedorov (1975) EPD (expected prediction differnce) criterion (Jones et al. 2006)

Expected non-centrality parameter (ENCP) criterion

Bayesian EPD criterion

Design results Evaluating orthogonal designs –A comprehensive study of designs –Candidate designs: 12-, 16-, 20-run designs –Model space: both LN and the projected space of Loeppky et al. (2006) –Criteria: all model discrimination criteria (Bayesian and non-Bayesian) Constructing optimal designs –CP: balanced –Coordinate-exchange: general (unbalanced)

An example mEPD aEPD mAF aAF mENCP aENCP (n=16, m=5, g=2) 1-3 EC < 100% EC < 100% EC < 100%

THANK YOU! More information: