Lecture 4 How to Forecast
|
|
- Karen Hoover
- 5 years ago
- Views:
Transcription
1 Lecture 4 How to Forecast Munich Center for Mathematical Philosophy March 2016 Glenn Shafer, Rutgers University 1. Neutral strategies for Forecaster 2. How Forecaster can win (defensive forecasting) 3. Must Skeptic s tests of Forecaster be continuous? 4. The meaning of probability 1
2 Four ways of using probability games 1. Statistical testing. Put a theory in the role of Forecaster. Take the role of Skeptic and test the theory. 2. Forecasting. Put ourselves in the role of Forecaster and try to make good probability predictions. 3. Probability judgement. Use a battery of probability games as a scale of canonical examples to which to compare evidence. 4. Causal investigation. Hypothesize a hidden game in which Nature plays Forecaster. We see only some of Reality s moves. 2
3 Game theoretic probability. On each round: 1. Forecaster offers bets (i.e., probabilistic predictions). 2. Skeptic decides which offers to accept. 3. Reality decides the outcome. Probability theory and statistical testing are about strategies for Skeptic. Prediction is about strategies for Forecaster. 3
4 How to forecast Part 1. Strategies for Forecaster Forecaster s moves never determine global probabilities. But a global probability distribution provides a strategy for Forecaster. Bayes provides only one way of constructing strategies for Forecaster. Part 2. How Forecaster can win (defensive forecasting) Winning when Skeptic s strategy is known Beating an all purpose strategy for Skeptic Part 3. Must Skeptic s tests of Forecaster be continuous? Putnam s and Dawid s objection Randomization as a response Part 4. The meaning of probability Statistical models mean less than we thought. Neyman s inductive behavior Probability judgement 4
5 Part 1. Strategies for Forecaster Forecaster s actual moves fall far short of specifying a probability distribution for the sequence of moves made by Reality. But a global probability distribution for Reality s moves provides a strategy for Forecaster. Bayes provides only one way of constructing strategies for Forecaster. 5
6 Part 1. Strategies for Forecaster Game theoretic probability. On each round: 1. Forecaster offers bets (i.e., probabilistic predictions). 2. Skeptic decides which offers to accept. 3. Reality decides the outcome. Example: Each evening for a year, Bob the weather forecaster gives probabilities for rain the next day. 6
7 Part 1. Strategies for Forecaster 1 Path taken
8 Part 1. Strategies for Forecaster
9 Part 1. Strategies for Forecaster 9
10 Part 1. Strategies for Forecaster Two ways of finding a relatively robust strategy for Forecaster This can be called Bayesian. Collect a variety of strategies for Forecaster and average them. Asymptotically, the average may be as successful as the most successful of the individual strategies. We call this defensive forecasting. Collect a variety of strategies for Skeptic, which enforce different properties we expect when we say y n has probability p n. Average these strategies for Skeptic and play against them. 10
11 Part 1. Strategies for Forecaster p 1,y 1,p 2,y 2, the different properties we expect when we say y n has probability p n. This phrase calls out for acknowledgement of Phil Dawid s insights. Dawid s outstanding insight was that these expectations do not depend on further details of any purported joint distribution for y 1,y 2,. In particular, they do not require independence. Alexander Philip Dawid Born
12 Part 2. How Forecaster can win Winning when Skeptic s strategy is known Beating an all purpose strategy for Skeptic Karl Menger Leonid Levin born 1948 Jean Ville invented the notion of an all purpose betting test after hearing about von Mises s ideas from Abraham Wald in Menger s seminar in Vienna in Leonid Levin developed the idea of playing against such a test in the 1970s. 12
13 Part 2. How Forecaster can win Basic intuition For each way that we expect Reality s moves to conform to Forecaster s predictions, Skeptic has a strategy that multiplies his capital if Reality does not conform. Forecaster can keep Skeptic s strategy from making money by adapting to Reality s past moves. Forecast can adapt so well that Reality conforms to his forecasts better than we would expect by chance. Example 13
14 Part 2. How Forecaster can win Defensive forecasting The name was introduced in the working paper Defensive Forecasting, by Vovk, Takemura, and Shafer (September 2004). See also Working Papers 7, 9, 10, 11, 13, 14, 16, 17, 18, 20, 21, 22, and 30 at Akimichi Takemura Born 1952 Volodya Vovk Born
15 Part 2. How Forecaster can win Important idea: Any test (betting strategy for Skeptic) Forecaster wants to pass is continuous. 1. The strategies for Skeptic used by Shafer and Vovk in Probability and Finance were continuous (& computable & relatively simple). 2. Conjecture: every high probability or probability one result in classical theory can be proven by a strategy for Skeptic that is computable in Brouwer s sense. 3. L. E. J. Brouwer s continuity principle (1916): only continuous functions are computable. Why can t discontinuous functions be computed? Because you would need infinite precision. 15
16 How Forecaster can beat any single strategy S Part 2. How Forecaster can win 16
17 Defensive Forecasting, page 4: Part 2. How Forecaster can win 17
18 Part 2. How Forecaster can win Suppose E is an event in this protocol: Suppose Skeptic has a continuous strategy that does not risk bankruptcy and makes him infinitely rich if his opponents do not make E happen. Corollary of theorem: In this case, Forecaster can guarantee E. Corollary of conjecture: Forecaster can guarantee any interesting high probability E. 18
19 Part 2. How Forecaster can win Crucial idea: all the tests (betting strategies for Skeptic) Forecaster needs to pass can be merged into a single all purpose test for Forecaster to pass. 1. If Skeptic has two strategies for multiplying capital risked, he can average them (i.e., divide his capital between them). 2. Formally: average the strategies. 3. You can average countably many strategies. 4. There are only countably many tests (Wald). 5. Forecaster can beat any single test (including the all purpose test). Abraham Wald 1936 {1937 Laurent BIENVENU, Glenn SHAFER and Alexander SHEN : On the history of martingales in the study of randomness, Electronic Journal for History of Probability and Statistics, 5(1), June
20 Part 2. How Forecaster can win Constructing an all purpose test In practice, we want to test calibration (y=1 happens 30% of the times you say p=.3) resolution (also true just for times when it rained yesterday) For simplicity, consider only calibration. Use Bernoulli s theorem to test calibration for each p. Merge the tests for different p. 20
21 Part 2. How Forecaster can win 21
22 Part 2. How Forecaster can win 22
23 Part 2. How Forecaster can win 23
24 Part 2. How Forecaster can win 24
25 Part 2. How Forecaster can win 25
26 Part 2. How Forecaster can win 26
27 Part 2. How Forecaster can win 27
28 Part 3. Must tests of Forecaster be continuous? Putnam s and Dawid s objection Randomization as a response 28
29 Part 3. Must tests of Forecaster be continuous? Hilary Putnam s counterexample Hilary Putnam, born 1926, on the right, with Bruno Latour, born
30 Part 3. Must tests of Forecaster be continuous? 30
31 Part 3. Must tests of Forecaster be continuous? 31
32 Part 3. Must tests of Forecaster be continuous? 32
33 Part 3. Must tests of Forecaster be continuous? Two paths to successful probability forecasting 1. Insist that tests be continuous. Conventional tests can be implemented with continuous betting strategies (Shafer & Vovk, 2001). Only continuous functions are constructive (L. E. J. Brouwer). 2. Allow Forecaster to hide his precise prediction from Reality using a bit of randomization. 33
34 Part 4. The meaning of probability Statistical models mean less than we thought. Neyman s inductive behavior Probability judgement 34
35 Part 4. The meaning of probability Giving probabilities for successive events. Think stochastic process, unknown probabilities, not iid. Can I assign probabilities that will pass statistical tests? 1. If you insist that I announce all probabilities before seeing any outcomes, NO. 2. If you always let me see the preceding outcomes before I announce the next probability, YES. 35
36 Part 4. The meaning of probability We knew that a probability can be estimated from a random sample. But this depends on the idd assumption. Defensive forecasting tells us something new. 1. Our opponent is Reality rather than Nature. (Nature follows laws; Reality plays as he pleases.) 2. Defensive forecasting gives probabilities that pass statistical tests regardless of how Reality behaves. 3. The notion of a stochastic process with unknown probabilities loses its empirical content. 4. But the prediction of y n from x n depends on the sequence in which we have placed it. 36
37 Part 4. The meaning of probability Jeyzy Neyman s inductive behavior A statistician who makes predictions with 95% confidence has two goals: be informative be right 95% of the time Why isn t this good enough for probability judgment? Answer: Two statisticians who are right 95% of the time may tell the court different and even contradictory things. They are placing the current event in different sequences. 37
38 Part 4. The meaning of probability Three settings for probability 38
Defensive Forecasting: 4. Good probabilities mean less than we thought.
Defensive Forecasting: Good probabilities mean less than we thought! Foundations of Probability Seminar Departments of Statistics and Philosophy November 2, 206 Glenn Shafer, Rutgers University 0. Game
More informationGame-Theoretic Probability: Theory and Applications Glenn Shafer
ISIPTA 07 July 17, 2007, Prague Game-Theoretic Probability: Theory and Applications Glenn Shafer Theory To prove a probabilistic prediction, construct a betting strategy that makes you rich if the prediction
More informationWhat is risk? What is probability? Game-theoretic answers. Glenn Shafer. For 170 years: objective vs. subjective probability
SIPTA School 08 July 8, 2008, Montpellier What is risk? What is probability? Game-theoretic answers. Glenn Shafer For 170 years: objective vs. subjective probability Game-theoretic probability (Shafer
More informationGood randomized sequential probability forecasting is always possible
Good randomized sequential probability forecasting is always possible Vladimir Vovk Department of Computer Science Royal Holloway, University of London Egham, Surrey TW20 0EX, England vovk@cs.rhul.ac.uk
More informationarxiv: v1 [math.pr] 26 Mar 2008
arxiv:0803.3679v1 [math.pr] 26 Mar 2008 The game-theoretic martingales behind the zero-one laws Akimichi Takemura 1 takemura@stat.t.u-tokyo.ac.jp, http://www.e.u-tokyo.ac.jp/ takemura Vladimir Vovk 2 vovk@cs.rhul.ac.uk,
More informationWhat is risk? What is probability? Glenn Shafer
Fusion 2007 July 9, 2007, Quebec City What is risk? What is probability? Glenn Shafer For 170 years: objective vs. subjective probability Game-theoretic probability (Shafer & Vovk, 2001) asks more concrete
More informationDiscussion of Dempster by Shafer. Dempster-Shafer is fiducial and so are you.
Fourth Bayesian, Fiducial, and Frequentist Conference Department of Statistics, Harvard University, May 1, 2017 Discussion of Dempster by Shafer (Glenn Shafer at Rutgers, www.glennshafer.com) Dempster-Shafer
More informationThe Complexity of Forecast Testing
The Complexity of Forecast Testing LANCE FORTNOW and RAKESH V. VOHRA Northwestern University Consider a weather forecaster predicting the probability of rain for the next day. We consider tests that given
More informationHoeffding s inequality in game-theoretic probability
Hoeffding s inequality in game-theoretic probability Vladimir Vovk $5 Peter Paul $0 $50 Peter $0 Paul $100 The Game-Theoretic Probability and Finance Project Answer to Frequently Asked Question #3 August
More informationHow to base probability theory on perfect-information games
How to base probability theory on perfect-information games Glenn Shafer, Vladimir Vovk, and Roman Chychyla $25 Peter Paul $0 $50 Peter $0 Paul $100 The Game-Theoretic Probability and Finance Project Working
More informationDefensive forecasting for linear protocols
Defensive forecasting for linear protocols Vladimir Vovk, Ilia Nouretdinov, Akimichi Takemura, and Glenn Shafer $5 Peter Paul $0 $50 Peter $0 Paul $100 The Game-Theoretic Probability and Finance Project
More informationMostly calibrated. Yossi Feinberg Nicolas S. Lambert
Int J Game Theory (2015) 44:153 163 DOI 10.1007/s00182-014-0423-0 Mostly calibrated Yossi Feinberg Nicolas S. Lambert Accepted: 27 March 2014 / Published online: 16 April 2014 Springer-Verlag Berlin Heidelberg
More informationHypothesis Testing. Rianne de Heide. April 6, CWI & Leiden University
Hypothesis Testing Rianne de Heide CWI & Leiden University April 6, 2018 Me PhD-student Machine Learning Group Study coordinator M.Sc. Statistical Science Peter Grünwald Jacqueline Meulman Projects Bayesian
More informationarxiv: v3 [math.pr] 5 Jun 2011
arxiv:0905.0254v3 [math.pr] 5 Jun 2011 Lévy s zero-one law in game-theoretic probability Glenn Shafer, Vladimir Vovk, and Akimichi Takemura The Game-Theoretic Probability and Finance Project Working Paper
More informationCMPT Machine Learning. Bayesian Learning Lecture Scribe for Week 4 Jan 30th & Feb 4th
CMPT 882 - Machine Learning Bayesian Learning Lecture Scribe for Week 4 Jan 30th & Feb 4th Stephen Fagan sfagan@sfu.ca Overview: Introduction - Who was Bayes? - Bayesian Statistics Versus Classical Statistics
More informationLecture 4 An Introduction to Stochastic Processes
Lecture 4 An Introduction to Stochastic Processes Prof. Massimo Guidolin Prep Course in Quantitative Methods for Finance August-September 2017 Plan of the lecture Motivation and definitions Filtrations
More informationPredictions as statements and decisions
Predictions as statements and decisions Vladimir Vovk $25 Peter Paul $0 $50 Peter $0 Paul $100 The Game-Theoretic Probability and Finance Project Working Paper #17 June 30, 2006 Project web site: http://www.probabilityandfinance.com
More informationOn a simple strategy weakly forcing the strong law of large numbers in the bounded forecasting game
arxiv:math/050890v3 [math.pr] 0 Nov 2005 On a simple strategy weakly forcing the strong law of large numbers in the bounded forecasting game Masayuki Kumon Risk Analysis Research Center Institute of Statistical
More informationDuality. Peter Bro Mitersen (University of Aarhus) Optimization, Lecture 9 February 28, / 49
Duality Maximize c T x for x F = {x (R + ) n Ax b} If we guess x F, we can say that c T x is a lower bound for the optimal value without executing the simplex algorithm. Can we make similar easy guesses
More informationThe Game of Normal Numbers
The Game of Normal Numbers Ehud Lehrer September 4, 2003 Abstract We introduce a two-player game where at each period one player, say, Player 2, chooses a distribution and the other player, Player 1, a
More informationKolmogorov-Loveland Randomness and Stochasticity
Kolmogorov-Loveland Randomness and Stochasticity Wolfgang Merkle 1 Joseph Miller 2 André Nies 3 Jan Reimann 1 Frank Stephan 4 1 Institut für Informatik, Universität Heidelberg 2 Department of Mathematics,
More informationA Bayesian model for event-based trust
A Bayesian model for event-based trust Elements of a foundation for computational trust Vladimiro Sassone ECS, University of Southampton joint work K. Krukow and M. Nielsen Oxford, 9 March 2007 V. Sassone
More informationPreliminary Statistics Lecture 2: Probability Theory (Outline) prelimsoas.webs.com
1 School of Oriental and African Studies September 2015 Department of Economics Preliminary Statistics Lecture 2: Probability Theory (Outline) prelimsoas.webs.com Gujarati D. Basic Econometrics, Appendix
More informationDeterministic Calibration and Nash Equilibrium
University of Pennsylvania ScholarlyCommons Statistics Papers Wharton Faculty Research 2-2008 Deterministic Calibration and Nash Equilibrium Sham M. Kakade Dean P. Foster University of Pennsylvania Follow
More informationThe No-Regret Framework for Online Learning
The No-Regret Framework for Online Learning A Tutorial Introduction Nahum Shimkin Technion Israel Institute of Technology Haifa, Israel Stochastic Processes in Engineering IIT Mumbai, March 2013 N. Shimkin,
More informationGame-theoretic probability in continuous time
Game-theoretic probability in continuous time Vladimir Vovk Department of Computer Science Royal Holloway, University of London Workshop on game-theoretic probability and related topics February 28, 2008
More informationThe Logical Approach to Randomness
The Logical Approach to Randomness Christopher P. Porter University of Florida UC Irvine C-ALPHA Seminar May 12, 2015 Introduction The concept of randomness plays an important role in mathematical practice,
More informationIndustrial Engineering Prof. Inderdeep Singh Department of Mechanical & Industrial Engineering Indian Institute of Technology, Roorkee
Industrial Engineering Prof. Inderdeep Singh Department of Mechanical & Industrial Engineering Indian Institute of Technology, Roorkee Module - 04 Lecture - 05 Sales Forecasting - II A very warm welcome
More information6.080 / Great Ideas in Theoretical Computer Science Spring 2008
MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More informationDiscrete Mathematics and Probability Theory Fall 2014 Anant Sahai Note 15. Random Variables: Distributions, Independence, and Expectations
EECS 70 Discrete Mathematics and Probability Theory Fall 204 Anant Sahai Note 5 Random Variables: Distributions, Independence, and Expectations In the last note, we saw how useful it is to have a way of
More informationMACHINE LEARNING INTRODUCTION: STRING CLASSIFICATION
MACHINE LEARNING INTRODUCTION: STRING CLASSIFICATION THOMAS MAILUND Machine learning means different things to different people, and there is no general agreed upon core set of algorithms that must be
More informationLecture 14, Thurs March 2: Nonlocal Games
Lecture 14, Thurs March 2: Nonlocal Games Last time we talked about the CHSH Game, and how no classical strategy lets Alice and Bob win it more than 75% of the time. Today we ll see how, by using entanglement,
More informationIntroduction to Modern Cryptography. Benny Chor
Introduction to Modern Cryptography Benny Chor Hard Core Bits Coin Flipping Over the Phone Zero Knowledge Lecture 10 (version 1.1) Tel-Aviv University 18 March 2008. Slightly revised March 19. Hard Core
More informationProbability Theory and Simulation Methods
Feb 28th, 2018 Lecture 10: Random variables Countdown to midterm (March 21st): 28 days Week 1 Chapter 1: Axioms of probability Week 2 Chapter 3: Conditional probability and independence Week 4 Chapters
More informationA True Expert Knows which Question Should be Asked.
A True Expert Knows which Question Should be Asked. Eddie Dekel and Yossi Feinberg June 2004 Abstract We suggest a test for discovering whether a potential expert is informed of the distribution of a stochastic
More informationIntroduction To Mathematical Modeling
CHAPTER 1 Introduction To Mathematical Modeling In his book The Possible and the Actual, published by the University of Washington Press as a part of the Jessie and John Danz Lectures, Françis Jacob 1920-2013),
More informationBayesian Inference. STA 121: Regression Analysis Artin Armagan
Bayesian Inference STA 121: Regression Analysis Artin Armagan Bayes Rule...s! Reverend Thomas Bayes Posterior Prior p(θ y) = p(y θ)p(θ)/p(y) Likelihood - Sampling Distribution Normalizing Constant: p(y
More informationLecture 4: September Reminder: convergence of sequences
36-705: Intermediate Statistics Fall 2017 Lecturer: Siva Balakrishnan Lecture 4: September 6 In this lecture we discuss the convergence of random variables. At a high-level, our first few lectures focused
More informationConditional probabilities and graphical models
Conditional probabilities and graphical models Thomas Mailund Bioinformatics Research Centre (BiRC), Aarhus University Probability theory allows us to describe uncertainty in the processes we model within
More informationWeighted Majority and the Online Learning Approach
Statistical Techniques in Robotics (16-81, F12) Lecture#9 (Wednesday September 26) Weighted Majority and the Online Learning Approach Lecturer: Drew Bagnell Scribe:Narek Melik-Barkhudarov 1 Figure 1: Drew
More informationInference for Stochastic Processes
Inference for Stochastic Processes Robert L. Wolpert Revised: June 19, 005 Introduction A stochastic process is a family {X t } of real-valued random variables, all defined on the same probability space
More informationKolmogorov complexity and its applications
CS860, Winter, 2010 Kolmogorov complexity and its applications Ming Li School of Computer Science University of Waterloo http://www.cs.uwaterloo.ca/~mli/cs860.html We live in an information society. Information
More informationMITOCW watch?v=7q32wnm4dew
MITOCW watch?v=7q32wnm4dew BARTON ZWIEBACH: Hydrogen atom is the beginning of our analysis. It still won't solve differential equations, but we will now two particles, a proton, whose coordinates are going
More informationSelf-calibrating Probability Forecasting
Self-calibrating Probability Forecasting Vladimir Vovk Computer Learning Research Centre Department of Computer Science Royal Holloway, University of London Egham, Surrey TW20 0EX, UK vovk@cs.rhul.ac.uk
More information2) There should be uncertainty as to which outcome will occur before the procedure takes place.
robability Numbers For many statisticians the concept of the probability that an event occurs is ultimately rooted in the interpretation of an event as an outcome of an experiment, others would interpret
More informationDefensive forecasting for optimal prediction with expert advice
Defensive forecasting for optimal prediction with expert advice Vladimir Vovk $25 Peter Paul $0 $50 Peter $0 Paul $100 The Game-Theoretic Probability and Finance Project Working Paper #20 August 11, 2007
More informationFundamental Probability and Statistics
Fundamental Probability and Statistics "There are known knowns. These are things we know that we know. There are known unknowns. That is to say, there are things that we know we don't know. But there are
More informationLinear Classifiers and the Perceptron
Linear Classifiers and the Perceptron William Cohen February 4, 2008 1 Linear classifiers Let s assume that every instance is an n-dimensional vector of real numbers x R n, and there are only two possible
More informationSTOCHASTIC MODELS LECTURE 1 MARKOV CHAINS. Nan Chen MSc Program in Financial Engineering The Chinese University of Hong Kong (ShenZhen) Sept.
STOCHASTIC MODELS LECTURE 1 MARKOV CHAINS Nan Chen MSc Program in Financial Engineering The Chinese University of Hong Kong (ShenZhen) Sept. 6, 2016 Outline 1. Introduction 2. Chapman-Kolmogrov Equations
More informationSmooth Calibration, Leaky Forecasts, Finite Recall, and Nash Dynamics
Smooth Calibration, Leaky Forecasts, Finite Recall, and Nash Dynamics Sergiu Hart August 2016 Smooth Calibration, Leaky Forecasts, Finite Recall, and Nash Dynamics Sergiu Hart Center for the Study of Rationality
More informationOne-Parameter Processes, Usually Functions of Time
Chapter 4 One-Parameter Processes, Usually Functions of Time Section 4.1 defines one-parameter processes, and their variations (discrete or continuous parameter, one- or two- sided parameter), including
More informationChapter One. The Real Number System
Chapter One. The Real Number System We shall give a quick introduction to the real number system. It is imperative that we know how the set of real numbers behaves in the way that its completeness and
More informationPrequential Analysis
Prequential Analysis Philip Dawid University of Cambridge NIPS 2008 Tutorial Forecasting 2 Context and purpose...................................................... 3 One-step Forecasts.......................................................
More informationData Mining. CS57300 Purdue University. March 22, 2018
Data Mining CS57300 Purdue University March 22, 2018 1 Hypothesis Testing Select 50% users to see headline A Unlimited Clean Energy: Cold Fusion has Arrived Select 50% users to see headline B Wedding War
More information6.041/6.431 Spring 2009 Quiz 1 Wednesday, March 11, 7:30-9:30 PM. SOLUTIONS
6.0/6.3 Spring 009 Quiz Wednesday, March, 7:30-9:30 PM. SOLUTIONS Name: Recitation Instructor: Question Part Score Out of 0 all 0 a 5 b c 5 d 5 e 5 f 5 3 a b c d 5 e 5 f 5 g 5 h 5 Total 00 Write your solutions
More informationUncertainty. Michael Peters December 27, 2013
Uncertainty Michael Peters December 27, 20 Lotteries In many problems in economics, people are forced to make decisions without knowing exactly what the consequences will be. For example, when you buy
More informationKolmogorov s contributions to the foundations of probability
Kolmogorov s contributions to the foundations of probability Vladimir Vovk Department of Computer Science, Royal Holloway, University of London Egham, Surrey TW20 0EX UK vovk@cs.rhul.ac.uk Glenn Shafer
More informationDynamics of Inductive Inference in a Uni ed Model
Dynamics of Inductive Inference in a Uni ed Model Itzhak Gilboa, Larry Samuelson, and David Schmeidler September 13, 2011 Gilboa, Samuelson, and Schmeidler () Dynamics of Inductive Inference in a Uni ed
More informationTEACHING INDEPENDENCE AND EXCHANGEABILITY
TEACHING INDEPENDENCE AND EXCHANGEABILITY Lisbeth K. Cordani Instituto Mauá de Tecnologia, Brasil Sergio Wechsler Universidade de São Paulo, Brasil lisbeth@maua.br Most part of statistical literature,
More informationUniversal probability-free conformal prediction
Universal probability-free conformal prediction Vladimir Vovk and Dusko Pavlovic March 20, 2016 Abstract We construct a universal prediction system in the spirit of Popper s falsifiability and Kolmogorov
More information8: Hypothesis Testing
Some definitions 8: Hypothesis Testing. Simple, compound, null and alternative hypotheses In test theory one distinguishes between simple hypotheses and compound hypotheses. A simple hypothesis Examples:
More informationNondeterministic finite automata
Lecture 3 Nondeterministic finite automata This lecture is focused on the nondeterministic finite automata (NFA) model and its relationship to the DFA model. Nondeterminism is an important concept in the
More informationExpected Value II. 1 The Expected Number of Events that Happen
6.042/18.062J Mathematics for Computer Science December 5, 2006 Tom Leighton and Ronitt Rubinfeld Lecture Notes Expected Value II 1 The Expected Number of Events that Happen Last week we concluded by showing
More informationOne sided tests. An example of a two sided alternative is what we ve been using for our two sample tests:
One sided tests So far all of our tests have been two sided. While this may be a bit easier to understand, this is often not the best way to do a hypothesis test. One simple thing that we can do to get
More informationSome Remarks on Alternating Temporal Epistemic Logic
Some Remarks on Alternating Temporal Epistemic Logic Corrected version: July 2003 Wojciech Jamroga Parlevink Group, University of Twente, Netherlands Institute of Mathematics, University of Gdansk, Poland
More informationContents. Decision Making under Uncertainty 1. Meanings of uncertainty. Classical interpretation
Contents Decision Making under Uncertainty 1 elearning resources Prof. Ahti Salo Helsinki University of Technology http://www.dm.hut.fi Meanings of uncertainty Interpretations of probability Biases in
More informationMassachusetts Institute of Technology Lecture J/18.062J: Mathematics for Computer Science 2 May 2000 Professors David Karger and Nancy Lynch
Massachusetts Institute of Technology Lecture 23 6.042J/18.062J: Mathematics for Computer Science 2 May 2000 Professors David Karger and Nancy Lynch Lecture Notes 1 The Expected Value of a Product This
More informationMAKING MONEY FROM FAIR GAMES: EXAMINING THE BOREL-CANTELLI LEMMA
MAKING MONEY FROM FAIR GAMES: EXAMINING THE BOREL-CANTELLI LEMMA SAM CANNON Abstract. In this paper we discuss and prove the Borel-Cantelli Lemma. We then show two interesting applications of the Borel-
More informationMath 300: Foundations of Higher Mathematics Northwestern University, Lecture Notes
Math 300: Foundations of Higher Mathematics Northwestern University, Lecture Notes Written by Santiago Cañez These are notes which provide a basic summary of each lecture for Math 300, Foundations of Higher
More informationStatistical Methods for Astronomy
Statistical Methods for Astronomy Probability (Lecture 1) Statistics (Lecture 2) Why do we need statistics? Useful Statistics Definitions Error Analysis Probability distributions Error Propagation Binomial
More informationDISCRETE STOCHASTIC PROCESSES Draft of 2nd Edition
DISCRETE STOCHASTIC PROCESSES Draft of 2nd Edition R. G. Gallager January 31, 2011 i ii Preface These notes are a draft of a major rewrite of a text [9] of the same name. The notes and the text are outgrowths
More informationClassification and Regression Trees
Classification and Regression Trees Ryan P Adams So far, we have primarily examined linear classifiers and regressors, and considered several different ways to train them When we ve found the linearity
More informationLecture Notes: Paradoxes in Probability and Statistics
Lecture Notes: Paradoxes in Probability and Statistics Kris Sankaran October 9, 011 I think it is much more interesting to live with uncertainty than to live with answers that might be wrong. Richard Feynman
More informationLecture 22/Chapter 19 Part 4. Statistical Inference Ch. 19 Diversity of Sample Proportions
Lecture 22/Chapter 19 Part 4. Statistical Inference Ch. 19 Diversity of Sample Proportions Probability versus Inference Behavior of Sample Proportions: Example Behavior of Sample Proportions: Conditions
More informationWhy Try Bayesian Methods? (Lecture 5)
Why Try Bayesian Methods? (Lecture 5) Tom Loredo Dept. of Astronomy, Cornell University http://www.astro.cornell.edu/staff/loredo/bayes/ p.1/28 Today s Lecture Problems you avoid Ambiguity in what is random
More informationLecture 2: Perfect Secrecy and its Limitations
CS 4501-6501 Topics in Cryptography 26 Jan 2018 Lecture 2: Perfect Secrecy and its Limitations Lecturer: Mohammad Mahmoody Scribe: Mohammad Mahmoody 1 Introduction Last time, we informally defined encryption
More informationGreat Theoretical Ideas in Computer Science
15-251 Great Theoretical Ideas in Computer Science Probability Theory: Counting in Terms of Proportions Lecture 10 (September 27, 2007) Some Puzzles Teams A and B are equally good In any one game, each
More informationLecture 10: Mechanism Design
Computational Game Theory Spring Semester, 2009/10 Lecture 10: Mechanism Design Lecturer: Yishay Mansour Scribe: Vera Vsevolozhsky, Nadav Wexler 10.1 Mechanisms with money 10.1.1 Introduction As we have
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 10
EECS 70 Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 10 Introduction to Basic Discrete Probability In the last note we considered the probabilistic experiment where we flipped
More informationLecture 9 - Symmetric Encryption
0368.4162: Introduction to Cryptography Ran Canetti Lecture 9 - Symmetric Encryption 29 December 2008 Fall 2008 Scribes: R. Levi, M. Rosen 1 Introduction Encryption, or guaranteeing secrecy of information,
More informationMean Vector Inferences
Mean Vector Inferences Lecture 5 September 21, 2005 Multivariate Analysis Lecture #5-9/21/2005 Slide 1 of 34 Today s Lecture Inferences about a Mean Vector (Chapter 5). Univariate versions of mean vector
More informationHidden Variables and Commutativity in Quantum Mechanics
Hidden Variables and Commutativity in Quantum Mechanics Benjamin Feintzeig Department of Logic and Philosophy of Science, University of California, Irvine bfeintze@uci.edu January 1, 2013 Abstract This
More information1 Review of the dot product
Any typographical or other corrections about these notes are welcome. Review of the dot product The dot product on R n is an operation that takes two vectors and returns a number. It is defined by n u
More informationTutorial on Venn-ABERS prediction
Tutorial on Venn-ABERS prediction Paolo Toccaceli (joint work with Alex Gammerman and Ilia Nouretdinov) Computer Learning Research Centre Royal Holloway, University of London 6th Symposium on Conformal
More informationDIMACS Technical Report March Game Seki 1
DIMACS Technical Report 2007-05 March 2007 Game Seki 1 by Diogo V. Andrade RUTCOR, Rutgers University 640 Bartholomew Road Piscataway, NJ 08854-8003 dandrade@rutcor.rutgers.edu Vladimir A. Gurvich RUTCOR,
More informationLecture 26: Arthur-Merlin Games
CS 710: Complexity Theory 12/09/2011 Lecture 26: Arthur-Merlin Games Instructor: Dieter van Melkebeek Scribe: Chetan Rao and Aaron Gorenstein Last time we compared counting versus alternation and showed
More informationCS 188: Artificial Intelligence Fall 2009
CS 188: Artificial Intelligence Fall 2009 Lecture 14: Bayes Nets 10/13/2009 Dan Klein UC Berkeley Announcements Assignments P3 due yesterday W2 due Thursday W1 returned in front (after lecture) Midterm
More informationReasoning with Uncertainty
Reasoning with Uncertainty Representing Uncertainty Manfred Huber 2005 1 Reasoning with Uncertainty The goal of reasoning is usually to: Determine the state of the world Determine what actions to take
More informationCS 361: Probability & Statistics
February 19, 2018 CS 361: Probability & Statistics Random variables Markov s inequality This theorem says that for any random variable X and any value a, we have A random variable is unlikely to have an
More informationInformation Retrieval and Web Search Engines
Information Retrieval and Web Search Engines Lecture 4: Probabilistic Retrieval Models April 29, 2010 Wolf-Tilo Balke and Joachim Selke Institut für Informationssysteme Technische Universität Braunschweig
More informationBayesian Inference: What, and Why?
Winter School on Big Data Challenges to Modern Statistics Geilo Jan, 2014 (A Light Appetizer before Dinner) Bayesian Inference: What, and Why? Elja Arjas UH, THL, UiO Understanding the concepts of randomness
More informationMerging of opinions in game-theoretic probability
Ann Inst Stat Math 009 61:969 993 DOI 10.1007/s10463-007-0165-x Merging of opinions in game-theoretic probability Vladimir Vovk Received: 7 May 007 / Revised: 9 October 007 / Published online: 1 January
More informationExamples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula:
Logic: The Big Picture Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and
More informationPRICING AND PROBABILITY DISTRIBUTIONS OF ATMOSPHERIC VARIABLES
PRICING AND PROBABILITY DISTRIBUTIONS OF ATMOSPHERIC VARIABLES TECHNICAL WHITE PAPER WILLIAM M. BRIGGS Abstract. Current methods of assessing the probability distributions of atmospheric variables are
More informationPhysics 509: Non-Parametric Statistics and Correlation Testing
Physics 509: Non-Parametric Statistics and Correlation Testing Scott Oser Lecture #19 Physics 509 1 What is non-parametric statistics? Non-parametric statistics is the application of statistical tests
More informationIFT Lecture 7 Elements of statistical learning theory
IFT 6085 - Lecture 7 Elements of statistical learning theory This version of the notes has not yet been thoroughly checked. Please report any bugs to the scribes or instructor. Scribe(s): Brady Neal and
More informationA Problem Involving Games. Paccioli s Solution. Problems for Paccioli: Small Samples. n / (n + m) m / (n + m)
Class #10: Introduction to Probability Theory Artificial Intelligence (CS 452/552): M. Allen, 27 Sept. 17 A Problem Involving Games } Two players put money in on a game of chance } First one to certain
More informationRobert Wilson (1977), A Bidding Model of Perfect Competition, Review of Economic
Econ 805 Advanced Micro Theory I Dan Quint Fall 2008 Lecture 10 Oct 7 2008 No lecture on Thursday New HW, and solutions to last one, online Today s papers: Robert Wilson (1977), A Bidding Model of Perfect
More informationDiscrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 16. Random Variables: Distribution and Expectation
CS 70 Discrete Mathematics and Probability Theory Spring 206 Rao and Walrand Note 6 Random Variables: Distribution and Expectation Example: Coin Flips Recall our setup of a probabilistic experiment as
More informationShould all Machine Learning be Bayesian? Should all Bayesian models be non-parametric?
Should all Machine Learning be Bayesian? Should all Bayesian models be non-parametric? Zoubin Ghahramani Department of Engineering University of Cambridge, UK zoubin@eng.cam.ac.uk http://learning.eng.cam.ac.uk/zoubin/
More information