Defensive Forecasting: 4. Good probabilities mean less than we thought.
|
|
- Erica Moody
- 5 years ago
- Views:
Transcription
1 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 theoretic probability.. Strategies for Forecaster 2. How Forecaster can win (defensive forecasting) 3. Must Skeptic s tests of Forecaster be continuous? 4. Good probabilities mean less than we thought.
2 Game theoretic probability. On each round:. Forecaster offers bets (i.e., probabilistic predictions). 2. Skeptic decides which offers to accept. 3. Reality decides the outcome. Classical mathematical probability and statistical testing are about strategies for Skeptic. Skeptic tests Forecaster by trying to multiply capital risked by large factor. All statistical tests can be put in this form. Game theoretic Cournot principle says there is no other way to evaluate Forecaster. Prediction is about strategies for Forecaster. Forecaster wants to give good forecasts. Game theoretic Cournot principle says forecasts are good if they pass Skeptic s tests. What else could you ask for? 2
3 Four ways of using probability games. Statistical testing. Take role of Skeptic and test Forecaster (= theory/algorithm/person making forecasts). 2. Forecasting. Take role of Forecaster and try to make good probability predictions. 3. Probability judgement. Use battery of probability games as scale of canonical examples for measuring import of evidence. 4. Causal investigation. Hypothesize hidden game in which Nature plays Forecaster. We see only some of Reality s moves. 3
4 Outline of today s talk Part. Strategies for Forecaster Forecaster s moves are less than a global probability distribution. Aglobal probability distribution is a strategy for Forecaster. Bayes is only one way of constructing a strategy 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? Hilary Putnam s and A. P. Dawid s objection Randomization as a response Part 4. Good probabilities mean less than we thought. Neyman s inductive behavior Probability judgement 4
5 Part. Strategies for Forecaster Forecaster s moves are less than a probability distribution for Reality s path (sequence of moves). But a probability distribution for Reality s path is a strategy for Forecaster. Here we understand probability distribution in classical, pre Kolmogorov sense. Bayes provides one way of constructing strategies for Forecaster. Defensive forecasting is another way. 5
6 Part. Strategies for Forecaster Example: Each evening for a year, Bob the weather forecaster gives probabilities for rain the next day. 6
7 Part. Strategies for Forecaster Path taken
8 Part. Strategies for Forecaster This is a classical (pre Kolmogorov) probability distribution. The Kolmogorov probability measure may have less information, because the conditional probability will not be defined if the condition has probability zero. Classical probability distribution = strategy for Forecaster 8
9 Part. Strategies for Forecaster 9
10 WHAT IS FORECASTER TRYING TO ACCOMPLISH? Part. Strategies for Forecaster Phil Dawid s insight: Properties we expect depend only on probabilities Forecaster gives. No need to impute a strategy to Forecaster. A. P. Dawid Born 946 Counterfactuals are irrelevant to testing Forecaster. 0
11 Part 2. How Forecaster can win Theorem : Forecaster can beat Reality and Skeptic if he knows Skeptic s strategy. Forecaster can pass any given test. Theorem 2: If Forecaster beats the average of many strategies for Skeptic, he beats them all. Forecaster only needs to pass one test. Leonid Levin born 948 Kolmogorov s student starting in high school, Levin is now at Boston University. He developed the idea of playing against an all purpose test in the 970s.
12 Part 2. How Forecaster can win One example where Forecaster beats a strategy for Skeptic. 2
13 Part 2. How Forecaster can win 3
14 Part 2. How Forecaster can win Theorem. Forecaster can keep Skeptic from making money. It is convenient to prove the theorem in a slightly stronger form: Theorem. Forecaster can keep Skeptic from making money. 4
15 Part 2. How Forecaster can win (Recall mean value theorem for a continuous function.) 5
16 Part 2. How Forecaster can win You can merge all the tests Forecaster needs to pass into a single allpurpose test for Forecaster to pass.. If Skeptic has two strategies for multiplying capital risked, he can average them (i.e., divide his capital between them). 2. If Skeptic beats the average, he beats both tests. 3. There are only countably many strategies (Abraham Wald). 4. You can average countably many strategies. 5. Forecaster can beat any single test (including the average). Abraham Wald 936 {937 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(), June
17 Part 2. How Forecaster can win 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 y n has probability p n. Average these strategies for Skeptic and play against them. 7
18 Part 2. How Forecaster can win We call this method 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, 0,, 3, 4, 6, 7, 8, 20, 2, 22, and 30 at Akimichi Takemura Born 952 Volodya Vovk Born 960 8
19 Part 3. Must tests of Forecaster be continuous? Putnam s counterexample Two solutions: Insist that all computable functions are continuous. Randomize. Hilary Putnam ( ), on the right, with Bruno Latour, born 947 9
20 Part 3. Must tests of Forecaster be continuous? 20
21 Part 3. Must tests of Forecaster be continuous? 2
22 Part 3. Must tests of Forecaster be continuous? 22
23 THE ARGUMENT FOR CONTINUITY Part 3. Must tests of Forecaster be continuous? In practice, the tests (strategies for Skeptic) Forecaster wants to pass are continuous as functions of Forecaster s last move.. 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 (96): only continuous functions are computable. Why can t discontinuous functions be computed? Because you would need infinite precision. 23
24 Part 3. Must tests of Forecaster be continuous? Alternative: Allow Forecaster to hide his precise prediction from Reality using a bit of randomization.. Good randomized sequential probability forecasting is always possible, by Vladimir Vovk and Glenn Shafer. Journal of the Royal Statistical Society, Series B , Asymptotic calibration, by Dean Foster and Rakesh Vohra. Biometrika, 85: ,
25 Part 4. Good probabilities mean less than we thought. Neyman s inductive behavior Probability judgement 25
26 Part 4. Good probabilities mean less than we thought. Giving probabilities for successive events. Think stochastic process, unknown probabilities, not iid. Can I assign probabilities that will pass statistical tests?. 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. 26
27 Part 4. Good probabilities mean less than we thought. 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.. 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. 27
28 Part 4. Good probabilities mean less than we thought. 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. 28
Lecture 4 How to Forecast
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.
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationCalibration and Nash Equilibrium
Calibration and Nash Equilibrium Dean Foster University of Pennsylvania and Sham Kakade TTI September 22, 2005 What is a Nash equilibrium? Cartoon definition of NE: Leroy Lockhorn: I m drinking because
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 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 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 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 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 informationProblem statement. The data: Orthonormal regression with lots of X s (possible lots of β s are zero: Y i = β 0 + β j X ij + σz i, Z i N(0, 1),
Problem statement The data: Orthonormal regression with lots of X s (possible lots of β s are zero: Y i = β 0 + p j=1 β j X ij + σz i, Z i N(0, 1), Equivalent form: Normal mean problem (known σ) Y i =
More informationIndicative conditionals
Indicative conditionals PHIL 43916 November 14, 2012 1. Three types of conditionals... 1 2. Material conditionals... 1 3. Indicatives and possible worlds... 4 4. Conditionals and adverbs of quantification...
More informationIntroduction to Proofs
Introduction to Proofs Many times in economics we will need to prove theorems to show that our theories can be supported by speci c assumptions. While economics is an observational science, we use mathematics
More informationarxiv: v1 [math.pr] 14 Dec 2016
Random Knockout Tournaments arxiv:1612.04448v1 [math.pr] 14 Dec 2016 Ilan Adler Department of Industrial Engineering and Operations Research University of California, Berkeley Yang Cao Department of Industrial
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 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 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 informationPrinciples of Statistical Inference
Principles of Statistical Inference Nancy Reid and David Cox August 30, 2013 Introduction Statistics needs a healthy interplay between theory and applications theory meaning Foundations, rather than theoretical
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 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 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 informationCS 361: Probability & Statistics
February 12, 2018 CS 361: Probability & Statistics Random Variables Monty hall problem Recall the setup, there are 3 doors, behind two of them are indistinguishable goats, behind one is a car. You pick
More informationPrinciples of Statistical Inference
Principles of Statistical Inference Nancy Reid and David Cox August 30, 2013 Introduction Statistics needs a healthy interplay between theory and applications theory meaning Foundations, rather than theoretical
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 informationNon-Bayesian Testing of an Expert.
Non-Bayesian Testing of an Expert. Eddie Dekel and Yossi Feinberg February 2005 Abstract We suggest a test for discovering whether a potential expert is informed of the distribution of a stochastic process.
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 informationLecture 3: Probabilistic Retrieval Models
Probabilistic Retrieval Models Information Retrieval and Web Search Engines Lecture 3: Probabilistic Retrieval Models November 5 th, 2013 Wolf-Tilo Balke and Kinda El Maarry Institut für Informationssysteme
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 informationStatistical Learning. Philipp Koehn. 10 November 2015
Statistical Learning Philipp Koehn 10 November 2015 Outline 1 Learning agents Inductive learning Decision tree learning Measuring learning performance Bayesian learning Maximum a posteriori and maximum
More informationThe problem Countable additivity Finite additivity Conglomerability Structure Puzzle. The Measure Problem. Alexander R. Pruss
The Measure Problem Alexander R. Pruss Department of Philosophy Baylor University July 11, 2013 The problem and the claim There are infinitely many observers (or types of observers, or observations, or
More informationPRODUCTS THAT ARE POWERS. A mathematical vignette Ed Barbeau, University of Toronto
PRODUCTS THAT ARE POWERS. A mathematical vignette Ed Barbeau, University of Toronto This investigation was originally designed for school students to gain fluency with the factoring of positive integers
More information2.4 The Extreme Value Theorem and Some of its Consequences
2.4 The Extreme Value Theorem and Some of its Consequences The Extreme Value Theorem deals with the question of when we can be sure that for a given function f, (1) the values f (x) don t get too big or
More informationAsymptotic calibration
Biometrika (1998), 85, 2, pp. 379-390 Printed in Great Britain Asymptotic calibration BY DEAN P. FOSTER Department of Statistics, The Wharton School, University of Pennsylvania, Philadelphia, Pennsylvania
More informationTheory and Applications of A Repeated Game Playing Algorithm. Rob Schapire Princeton University [currently visiting Yahoo!
Theory and Applications of A Repeated Game Playing Algorithm Rob Schapire Princeton University [currently visiting Yahoo! Research] Learning Is (Often) Just a Game some learning problems: learn from training
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 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 information1 Primals and Duals: Zero Sum Games
CS 124 Section #11 Zero Sum Games; NP Completeness 4/15/17 1 Primals and Duals: Zero Sum Games We can represent various situations of conflict in life in terms of matrix games. For example, the game shown
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 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 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 informationMath 381 Discrete Mathematical Modeling
Math 381 Discrete Mathematical Modeling Sean Griffin Today: -Projects -Central Limit Theorem -Markov Chains Handout Projects Deadlines: Project groups and project descriptions due w/ homework (Due 7/23)
More informationDiscrete Mathematics and Probability Theory Fall 2013 Vazirani Note 12. Random Variables: Distribution and Expectation
CS 70 Discrete Mathematics and Probability Theory Fall 203 Vazirani Note 2 Random Variables: Distribution and Expectation We will now return once again to the question of how many heads in a typical sequence
More informationContinuum Probability and Sets of Measure Zero
Chapter 3 Continuum Probability and Sets of Measure Zero In this chapter, we provide a motivation for using measure theory as a foundation for probability. It uses the example of random coin tossing to
More informationSolving with Absolute Value
Solving with Absolute Value Who knew two little lines could cause so much trouble? Ask someone to solve the equation 3x 2 = 7 and they ll say No problem! Add just two little lines, and ask them to solve
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 informationEcon 325: Introduction to Empirical Economics
Econ 325: Introduction to Empirical Economics Chapter 9 Hypothesis Testing: Single Population Ch. 9-1 9.1 What is a Hypothesis? A hypothesis is a claim (assumption) about a population parameter: population
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 informationConsistent Beliefs in Extensive Form Games
Games 2010, 1, 415-421; doi:10.3390/g1040415 OPEN ACCESS games ISSN 2073-4336 www.mdpi.com/journal/games Article Consistent Beliefs in Extensive Form Games Paulo Barelli 1,2 1 Department of Economics,
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 informationData Mining Prof. Pabitra Mitra Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur
Data Mining Prof. Pabitra Mitra Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Lecture 21 K - Nearest Neighbor V In this lecture we discuss; how do we evaluate the
More informationAssignment 3 Logic and Reasoning KEY
Assignment 3 Logic and Reasoning KEY Print this sheet and fill in your answers. Please staple the sheets together. Turn in at the beginning of class on Friday, September 8. Recall this about logic: Suppose
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 informationPrequential Analysis
Prequential Analysis Philip Dawid University of Cambridge NIPS 2008 Tutorial Forecasting 2 Context and purpose...................................................... 3 One-step Forecasts.......................................................
More informationCOMP3702/7702 Artificial Intelligence Week1: Introduction Russell & Norvig ch.1-2.3, Hanna Kurniawati
COMP3702/7702 Artificial Intelligence Week1: Introduction Russell & Norvig ch.1-2.3, 3.1-3.3 Hanna Kurniawati Today } What is Artificial Intelligence? } Better know what it is first before committing the
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 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 informationStatistical methods research done as science rather than math: Estimates on the boundary in random regressions
Statistical methods research done as science rather than math: Estimates on the boundary in random regressions This lecture is about how we study statistical methods. It uses as an example a problem that
More informationFermat s Last Theorem for Regular Primes
Fermat s Last Theorem for Regular Primes S. M.-C. 22 September 2015 Abstract Fermat famously claimed in the margin of a book that a certain family of Diophantine equations have no solutions in integers.
More informationCS 124 Math Review Section January 29, 2018
CS 124 Math Review Section CS 124 is more math intensive than most of the introductory courses in the department. You re going to need to be able to do two things: 1. Perform some clever calculations to
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 informationGoals: Equipment: Introduction:
Goals: To explore the electric potential surrounding two equally and oppositely charged conductors To identify equipotential surfaces/lines To show how the electric field and electric potential are related
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 informationMathematical induction
Mathematical induction Notes and Examples These notes contain subsections on Proof Proof by induction Types of proof by induction Proof You have probably already met the idea of proof in your study of
More informationOckham Efficiency Theorem for Randomized Scientific Methods
Ockham Efficiency Theorem for Randomized Scientific Methods Conor Mayo-Wilson and Kevin T. Kelly Department of Philosophy Carnegie Mellon University Formal Epistemology Workshop (FEW) June 19th, 2009 1
More information1 Review of The Learning Setting
COS 5: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #8 Scribe: Changyan Wang February 28, 208 Review of The Learning Setting Last class, we moved beyond the PAC model: in the PAC model we
More information1 Multiple Choice. PHIL110 Philosophy of Science. Exam May 10, Basic Concepts. 1.2 Inductivism. Name:
PHIL110 Philosophy of Science Exam May 10, 2016 Name: Directions: The following exam consists of 24 questions, for a total of 100 points with 0 bonus points. Read each question carefully (note: answers
More informationSlope Fields: Graphing Solutions Without the Solutions
8 Slope Fields: Graphing Solutions Without the Solutions Up to now, our efforts have been directed mainly towards finding formulas or equations describing solutions to given differential equations. Then,
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 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 informationDiscrete Mathematics and Probability Theory Fall 2012 Vazirani Note 14. Random Variables: Distribution and Expectation
CS 70 Discrete Mathematics and Probability Theory Fall 202 Vazirani Note 4 Random Variables: Distribution and Expectation Random Variables Question: The homeworks of 20 students are collected in, randomly
More informationDiscrete Mathematics and Probability Theory Fall 2013 Vazirani Note 1
CS 70 Discrete Mathematics and Probability Theory Fall 013 Vazirani Note 1 Induction Induction is a basic, powerful and widely used proof technique. It is one of the most common techniques for analyzing
More informationWalras-Bowley Lecture 2003
Walras-Bowley Lecture 2003 Sergiu Hart This version: September 2004 SERGIU HART c 2004 p. 1 ADAPTIVE HEURISTICS A Little Rationality Goes a Long Way Sergiu Hart Center for Rationality, Dept. of Economics,
More informationCircuit Theory Prof. S.C. Dutta Roy Department of Electrical Engineering Indian Institute of Technology, Delhi
Circuit Theory Prof. S.C. Dutta Roy Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture - 43 RC and RL Driving Point Synthesis People will also have to be told I will tell,
More informationStructure learning in human causal induction
Structure learning in human causal induction Joshua B. Tenenbaum & Thomas L. Griffiths Department of Psychology Stanford University, Stanford, CA 94305 jbt,gruffydd @psych.stanford.edu Abstract We use
More informationMath Stochastic Processes & Simulation. Davar Khoshnevisan University of Utah
Math 5040 1 Stochastic Processes & Simulation Davar Khoshnevisan University of Utah Module 1 Generation of Discrete Random Variables Just about every programming language and environment has a randomnumber
More informationStochastic Processes
qmc082.tex. Version of 30 September 2010. Lecture Notes on Quantum Mechanics No. 8 R. B. Griffiths References: Stochastic Processes CQT = R. B. Griffiths, Consistent Quantum Theory (Cambridge, 2002) DeGroot
More informationHon.Algorithms (CSCI-GA 3520), Professor Yap Fall 2012 MIDTERM EXAM. Oct 11, 2012 SOLUTION
Hon.Algorithms (CSCI-GA 352), Professor Yap Fall 22 MIDTERM EXAM Oct, 22 SOLUTIONS Problem. ( Points) Consider the recurrence T(n) = 4T(n/2)+ n2 lgn. Reduce this to standard form and solve it to Θ-order.
More informationAlgorithmic Learning in a Random World
Algorithmic Learning in a Random World Algorithmic Learning in a Random World Vladimir Vovk University of London Egham, United Kingdom Alexander Gammerman University of London Egham, United Kingdom Glenn
More informationCan Theories be Tested? A Cryptographic Treatment of Forecast Testing
Can Theories be Tested? A Cryptographic Treatment of Forecast Testing Kai-Min Chung Cornell University chung@cs.cornell.edu Edward Lui Cornell University luied@cs.cornell.edu September 6, 202 Rafael Pass
More informationMathematical foundations of Econometrics
Mathematical foundations of Econometrics G.Gioldasis, UniFe & prof. A.Musolesi, UniFe March 13, 2016.Gioldasis, UniFe & prof. A.Musolesi, UniFe Mathematical foundations of Econometrics March 13, 2016 1
More informationTDA231. Logistic regression
TDA231 Devdatt Dubhashi dubhashi@chalmers.se Dept. of Computer Science and Engg. Chalmers University February 19, 2016 Some data 5 x2 0 5 5 0 5 x 1 In the Bayes classifier, we built a model of each class
More informationDiscrete Probability and State Estimation
6.01, Spring Semester, 2008 Week 12 Course Notes 1 MASSACHVSETTS INSTITVTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.01 Introduction to EECS I Spring Semester, 2008 Week
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 informationMatrix Inverses. November 19, 2014
Matrix Inverses November 9, 204 22 The Inverse of a Matrix Now that we have discussed how to multiply two matrices, we can finally have a proper discussion of what we mean by the expression A for a matrix
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 information6.896 Quantum Complexity Theory September 9, Lecture 2
6.96 Quantum Complexity Theory September 9, 00 Lecturer: Scott Aaronson Lecture Quick Recap The central object of study in our class is BQP, which stands for Bounded error, Quantum, Polynomial time. Informally
More information