Scribe: Chris Berlind Date: Feb 1, 2010

Size: px
Start display at page:

Download "Scribe: Chris Berlind Date: Feb 1, 2010"

Transcription

1 CS/CNS/EE 253: Advanced Topcs n Machne Learnng Topc: Dealng wth Partal Feedback #2 Lecturer: Danel Golovn Scrbe: Chrs Berlnd Date: Feb 1, Revew In the prevous lecture we began lookng at algorthms for dealng wth sequental decson problems n the bandt or partal) feedback model. In ths model, there are K arms ndexed by 1, 2,..., K, each wth an assocated payoff functon r t) whch s unknown. In each round t, an arm s chosen and the reward r t) 0, 1 s ganed. Only r t) s revealed to the algorthm at the end of round t, where s the arm chosen n that round; t s kept gnorant of r j t) for all other arms j. The goal s to fnd an algorthm specfyng how to choose an arm n each round that wll maxmze the total reward over all rounds. We began our study of ths model wth an assumpton of stochastc rewards, as opposed to the harder adversaral rewards case. Thus we assume there s an underlyng dstrbuton R for each arm, and each r t) s drawn from R ndependently of all other rewards both of arm durng rounds other than t, and of other arms durng round t). Note we assume the rewards are bounded; specfcally, r t) 0, 1 for all and t. We frst explored the t -Greedy algorthm n whch wth probablty t an arm s chosen unformly at random, and wth probablty 1 t the arm wth the hghest observed average reward s chosen. For the rght choce of t, ths algorthm has expected regret logarthmc n T. We can mprove upon ths algorthm by takng better advantage of the nformaton we have avalable to us. In addton to the average payoff for each arm, we also know how many tmes we have played each arm. Ths allows us to estmate confdence bounds for each arm whch leads to the Upper Confdence Bound UCB) algorthm explaned n detal n the last lecture. The UCB1 algorthm also has expected regret logarthmc n T. 8.2 Exp3 The regret bounds for the t -Greedy and UCB1 algorthms were proved under the assumpton of stochastc payoff functons. When the payoff functons are non-stochastc e.g. adversaral) these algorthms do not far so well. Because UCB1 s entrely determnstc, an adversary could predct ts play and choose payoffs to force UCB1 nto makng bad decsons. Ths flaw motvates the ntroducton of a new bandt algorthm, Exp3 1 whch s useful n the non-stochastc payoff case. In these notes, we wll develop a varant of Exp3, and gve a regret bound for t. The algorthm and analyss here are non-standard, and are provded to expose the role of unbased estmates and ther varances n the developng effectve no-regret algorthms n the non-stochastc payoff case Hedge & the Power of Unbased Estmates Back n Lecture 2, the Hedge algorthm was ntroduced to deal wth sequental decson-makng under the full nformaton model. The reward-maxmzng verson of the Hedge algorthm s defned 1

2 as Hedge) 1 w 1) = 1 = 1,..., K 2 for t = 1 to T 3 Play X t = w.p. w t) j w jt) 4 w t + 1) = w t)1 + ) r t) = 1,..., K At every tmestep t, each arm has weght w t) = 1 + ) t t r t ) and an arm s chosen wth probablty proportonal to the weghts. We let X t denote the arm chosen n round t. In ths algorthm, Hedge always sees the true payoff r t) n each round. Fx some real number b 1. Suppose each r t) n Hedge s replaced wth a random varable R t) such that R t) s always n 0, 1 and ER t) = r t)/b. We magne Hedge gets actual reward r t) f t pcks but only gets to see feedback R j t) for each j rather than the true rewards r j t). We can fnd a lower bound for the expected payoff E t b R X t t) = E t r X t t) as follows. Frst note that the upper bound on Hedge s expected regret on the payoffs R t) ensures T E R Xt t) E max Also note that for any set of random varables R 1, R 2,..., R n E max R max ER T R t) 1 ) ln K One way to see ths s to let j = argmax ER and note that max R } R j, always. Hence Emax R ER j = max ER. Usng these two nequaltes together wth ER t) = r t)/b we nfer the followng bound. Below, expectaton s taken wth respect to both the randomness of R t) and wth respect to the randomness we used for Hedge. T T T t) = E b R Xt t) = b E R Xt t) Hence T t) b E = max = max max b E T T T r t) max T 2 R t) 1 ) ln K R t) 1 ) b ln K 1 2 ) b ln K r t) 1 ) b ln K 8.2.1)

3 Ths ndcates that even though Hedge s not seeng the correct payoffs, t stll has nearly the same regret bound due to the lnearty of expectaton. The only dfference s that the ln K term n the regret ncreases to b ln K. Ths wll turn out to be a very useful property A Varaton on the Exp3 Algorthm The dea here s to observe a random varable and feed t to Hedge, snce the above analyss shows ths wll not hurt our performance. Defne 0 f s not played n round t R t) = otherwse r t) p t) where p t) = PrX t =. Then ER t) = r t). To use the above deas we need to scale these random rewards so that they always fall n 0, 1. Snce r t) 0, 1 by assumpton, the requred scalng factor s b = mn,t p t). Ths suggests that usng Hedge drectly n the bandt model would result n a poor bound on the expected regret because some arms mght see ther selecton probablty p t) tend to zero, whch wll cause b to tend to, renderng our bound n equaton 8.2.1) useless. Intutvely ths makes sense. Snce we are workng n the adversaral payoffs model, and lousy hstorcal performance s no guarantee on lousy future performance, we cannot gnore any arm for too long. We must contnuously explore the space of arms n case one of the prevously bad arms turns out to be the best one overall n hndsght. Alternately, we can vew the problem as controllng the varance of our estmate for the average reward averaged over all rounds so far) for a gven arm. Even f our estmate s unbased so that the mean s correct), there s a prce we pay for ts varance. To enforce the constrant that we contnuously explore all arms and keep these varances under control), we put a lower bound of /K on the probabltes p t). Ths ensures that b = K/ suffces. The result s a modfed form of Hedge. In ths algorthm, a varaton on Exp3, each tmestep plays accordng to the Hedge algorthm wth reward R t) := R t)/b = R t)/k wth probablty 1 and plays an arm unformly at random otherwse. Formally, t s defned as follows: Exp3-Varant, ) 1 for t = 1 to T w 2 p t) = 1 ) t) j w jt) + K = 1,..., K 3 Play X t = w.p. p t) r t) p t) f X t = 4 Let R t) = K 0 otherwse 5 w t + 1) = w t)1 + ) R t) = 1,..., K Let OPTS) := max t S r t) be the reward of the best fxed arm n hndsght over rounds n S, and let OPT T := OPT1, 2,..., T }) Usng Equaton 8.2.1), we get the followng bound on 3

4 expected reward bound, where X t s what we played on round t. T t) E max r t) 1 ) K ln K 2 t EXPLOIT Here, EXPLOIT s the random) set of rounds on whch the algorthm exploted prevous knowledge rather than explored 1. It s not too hard to see that EOPTEXPLOIT) 1 )OPT T. In effect, gvng up the reward for each round wth probablty to explore should only cause us to lose a fracton of the statc optmum OPT T ). Thus we get the followng regret bound. Theorem The algorthm above obtans expected reward at least EOPTEXPLOIT) 1 2) K ln K and so has expected regret at most 2 + ) OPT T + K ln K. Notng OPT T T and balancng terms, we can optmze the bound by settng, = ΘK ln K) 1/3 T 1/3 ) for a regret bound of OT 2/3 K log K) 1/3 ). Compared to the OK log T ) regret bounds n the stochatc reward settng, ths s much worse. Ignorng the dependence on K, t means the average regret shrnks as OT 1/3 ) nstead of O log T T ). Ths algorthm and analyss are not the best possble; As we dscuss below, Exp3 acheves a O T K log K) regret bound, and a lower bound of Ω T K) s known for the adversaral payoff case The Orgnal Exp3 Algorthm The orgnal Exp3 algorthm has only one parameter,, and s obtaned by settng = e 1 n our varant,.e., Exp3) Exp3-Varante 1, ). Here s the psuedocode. Exp3) 1 for t = 1 to T w 2 p t) = 1 ) t) j w jt) + K = 1,..., K 3 Play X t = w.p. p t) r t) p t) f X t = 4 Let R t) = K 0 otherwse 5 w t + 1) = w t) expr t)) = 1,..., K Auer et al. 1 then prove the followng regret bound for Exp3. Theorem The expected regret of Exp3) after T rounds s at most e 1) OPT T K ln K where OPT T s the statc optmum for the frst T rounds. 1 To decde f a round t was an explotaton or an exploraton round, let be the arm chosen n round t, and flp a con wth bas Kp t)) 1. If t comes up heads, ts an exploraton round. Otherwse ts an explotaton round. Provng EOPTEXPLOIT) 1 )OPT T s easy f you note that ths can be done after all the rounds have been played. 4

5 Wth the optmum choce of t s possble to acheve a regret bound of O OPT T K ln K). 8.3 Gradent Descent wthout the Gradent Unbased estmates are used n other algorthms n the bandt feedback model as well. For example, Flaxman et al.2 have shown that t s possble to perform gradent descent n the bandt settng by gettng an unbased estmate of an n-dmensonal gradent 2 from an observed scalar) reward! See ther paper and references theren for more on ths topc. References 1 Peter Auer, Ncolo Cesa-Banch, Yaov Freund, and Robert E. Schapre. The non-stochastc mult-armed bandt problem. SIAM journal on computng, 32:48 77, Abraham D. Flaxman, Adam Tauman Kala, and H. Brendan McMahan. Onlne convex optmzaton n the bandt settng: gradent descent wthout a gradent. In SODA 05: Proceedngs of the sxteenth annual ACM-SIAM symposum on Dscrete algorthms, pages Socety for Industral and Appled Mathematcs, They estmate the gradent of a smoothed verson of the objectve functon, rather than the gradent of the objectve functon tself. 5

COS 511: Theoretical Machine Learning. Lecturer: Rob Schapire Lecture #21 Scribe: Lawrence Diao April 23, 2013

COS 511: Theoretical Machine Learning. Lecturer: Rob Schapire Lecture #21 Scribe: Lawrence Diao April 23, 2013 COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #21 Scrbe: Lawrence Dao Aprl 23, 2013 1 On-Lne Log Loss To recap the end of the last lecture, we have the followng on-lne problem wth N

More information

MgtOp 215 Chapter 13 Dr. Ahn

MgtOp 215 Chapter 13 Dr. Ahn MgtOp 5 Chapter 3 Dr Ahn Consder two random varables X and Y wth,,, In order to study the relatonshp between the two random varables, we need a numercal measure that descrbes the relatonshp The covarance

More information

OPERATIONS RESEARCH. Game Theory

OPERATIONS RESEARCH. Game Theory OPERATIONS RESEARCH Chapter 2 Game Theory Prof. Bbhas C. Gr Department of Mathematcs Jadavpur Unversty Kolkata, Inda Emal: bcgr.umath@gmal.com 1.0 Introducton Game theory was developed for decson makng

More information

Lecture 7. We now use Brouwer s fixed point theorem to prove Nash s theorem.

Lecture 7. We now use Brouwer s fixed point theorem to prove Nash s theorem. Topcs on the Border of Economcs and Computaton December 11, 2005 Lecturer: Noam Nsan Lecture 7 Scrbe: Yoram Bachrach 1 Nash s Theorem We begn by provng Nash s Theorem about the exstance of a mxed strategy

More information

15-451/651: Design & Analysis of Algorithms January 22, 2019 Lecture #3: Amortized Analysis last changed: January 18, 2019

15-451/651: Design & Analysis of Algorithms January 22, 2019 Lecture #3: Amortized Analysis last changed: January 18, 2019 5-45/65: Desgn & Analyss of Algorthms January, 09 Lecture #3: Amortzed Analyss last changed: January 8, 09 Introducton In ths lecture we dscuss a useful form of analyss, called amortzed analyss, for problems

More information

Topics on the Border of Economics and Computation November 6, Lecture 2

Topics on the Border of Economics and Computation November 6, Lecture 2 Topcs on the Border of Economcs and Computaton November 6, 2005 Lecturer: Noam Nsan Lecture 2 Scrbe: Arel Procacca 1 Introducton Last week we dscussed the bascs of zero-sum games n strategc form. We characterzed

More information

Chapter 5 Student Lecture Notes 5-1

Chapter 5 Student Lecture Notes 5-1 Chapter 5 Student Lecture Notes 5-1 Basc Busness Statstcs (9 th Edton) Chapter 5 Some Important Dscrete Probablty Dstrbutons 004 Prentce-Hall, Inc. Chap 5-1 Chapter Topcs The Probablty Dstrbuton of a Dscrete

More information

II. Random Variables. Variable Types. Variables Map Outcomes to Numbers

II. Random Variables. Variable Types. Variables Map Outcomes to Numbers II. Random Varables Random varables operate n much the same way as the outcomes or events n some arbtrary sample space the dstncton s that random varables are smply outcomes that are represented numercally.

More information

Tests for Two Correlations

Tests for Two Correlations PASS Sample Sze Software Chapter 805 Tests for Two Correlatons Introducton The correlaton coeffcent (or correlaton), ρ, s a popular parameter for descrbng the strength of the assocaton between two varables.

More information

Economics 1410 Fall Section 7 Notes 1. Define the tax in a flexible way using T (z), where z is the income reported by the agent.

Economics 1410 Fall Section 7 Notes 1. Define the tax in a flexible way using T (z), where z is the income reported by the agent. Economcs 1410 Fall 2017 Harvard Unversty Yaan Al-Karableh Secton 7 Notes 1 I. The ncome taxaton problem Defne the tax n a flexble way usng T (), where s the ncome reported by the agent. Retenton functon:

More information

Ch Rival Pure private goods (most retail goods) Non-Rival Impure public goods (internet service)

Ch Rival Pure private goods (most retail goods) Non-Rival Impure public goods (internet service) h 7 1 Publc Goods o Rval goods: a good s rval f ts consumpton by one person precludes ts consumpton by another o Excludable goods: a good s excludable f you can reasonably prevent a person from consumng

More information

Tests for Two Ordered Categorical Variables

Tests for Two Ordered Categorical Variables Chapter 253 Tests for Two Ordered Categorcal Varables Introducton Ths module computes power and sample sze for tests of ordered categorcal data such as Lkert scale data. Assumng proportonal odds, such

More information

Linear Combinations of Random Variables and Sampling (100 points)

Linear Combinations of Random Variables and Sampling (100 points) Economcs 30330: Statstcs for Economcs Problem Set 6 Unversty of Notre Dame Instructor: Julo Garín Sprng 2012 Lnear Combnatons of Random Varables and Samplng 100 ponts 1. Four-part problem. Go get some

More information

Elements of Economic Analysis II Lecture VI: Industry Supply

Elements of Economic Analysis II Lecture VI: Industry Supply Elements of Economc Analyss II Lecture VI: Industry Supply Ka Hao Yang 10/12/2017 In the prevous lecture, we analyzed the frm s supply decson usng a set of smple graphcal analyses. In fact, the dscusson

More information

/ Computational Genomics. Normalization

/ Computational Genomics. Normalization 0-80 /02-70 Computatonal Genomcs Normalzaton Gene Expresson Analyss Model Computatonal nformaton fuson Bologcal regulatory networks Pattern Recognton Data Analyss clusterng, classfcaton normalzaton, mss.

More information

3: Central Limit Theorem, Systematic Errors

3: Central Limit Theorem, Systematic Errors 3: Central Lmt Theorem, Systematc Errors 1 Errors 1.1 Central Lmt Theorem Ths theorem s of prme mportance when measurng physcal quanttes because usually the mperfectons n the measurements are due to several

More information

Chapter 3 Student Lecture Notes 3-1

Chapter 3 Student Lecture Notes 3-1 Chapter 3 Student Lecture otes 3-1 Busness Statstcs: A Decson-Makng Approach 6 th Edton Chapter 3 Descrbng Data Usng umercal Measures 005 Prentce-Hall, Inc. Chap 3-1 Chapter Goals After completng ths chapter,

More information

Quiz on Deterministic part of course October 22, 2002

Quiz on Deterministic part of course October 22, 2002 Engneerng ystems Analyss for Desgn Quz on Determnstc part of course October 22, 2002 Ths s a closed book exercse. You may use calculators Grade Tables There are 90 ponts possble for the regular test, or

More information

Survey of Math: Chapter 22: Consumer Finance Borrowing Page 1

Survey of Math: Chapter 22: Consumer Finance Borrowing Page 1 Survey of Math: Chapter 22: Consumer Fnance Borrowng Page 1 APR and EAR Borrowng s savng looked at from a dfferent perspectve. The dea of smple nterest and compound nterest stll apply. A new term s the

More information

Multifactor Term Structure Models

Multifactor Term Structure Models 1 Multfactor Term Structure Models A. Lmtatons of One-Factor Models 1. Returns on bonds of all maturtes are perfectly correlated. 2. Term structure (and prces of every other dervatves) are unquely determned

More information

Applications of Myerson s Lemma

Applications of Myerson s Lemma Applcatons of Myerson s Lemma Professor Greenwald 28-2-7 We apply Myerson s lemma to solve the sngle-good aucton, and the generalzaton n whch there are k dentcal copes of the good. Our objectve s welfare

More information

2.1 Rademacher Calculus... 3

2.1 Rademacher Calculus... 3 COS 598E: Unsupervsed Learnng Week 2 Lecturer: Elad Hazan Scrbe: Kran Vodrahall Contents 1 Introducton 1 2 Non-generatve pproach 1 2.1 Rademacher Calculus............................... 3 3 Spectral utoencoders

More information

Appendix - Normally Distributed Admissible Choices are Optimal

Appendix - Normally Distributed Admissible Choices are Optimal Appendx - Normally Dstrbuted Admssble Choces are Optmal James N. Bodurtha, Jr. McDonough School of Busness Georgetown Unversty and Q Shen Stafford Partners Aprl 994 latest revson September 00 Abstract

More information

Economic Design of Short-Run CSP-1 Plan Under Linear Inspection Cost

Economic Design of Short-Run CSP-1 Plan Under Linear Inspection Cost Tamkang Journal of Scence and Engneerng, Vol. 9, No 1, pp. 19 23 (2006) 19 Economc Desgn of Short-Run CSP-1 Plan Under Lnear Inspecton Cost Chung-Ho Chen 1 * and Chao-Yu Chou 2 1 Department of Industral

More information

Teaching Note on Factor Model with a View --- A tutorial. This version: May 15, Prepared by Zhi Da *

Teaching Note on Factor Model with a View --- A tutorial. This version: May 15, Prepared by Zhi Da * Copyrght by Zh Da and Rav Jagannathan Teachng Note on For Model th a Ve --- A tutoral Ths verson: May 5, 2005 Prepared by Zh Da * Ths tutoral demonstrates ho to ncorporate economc ves n optmal asset allocaton

More information

Supplementary material for Non-conjugate Variational Message Passing for Multinomial and Binary Regression

Supplementary material for Non-conjugate Variational Message Passing for Multinomial and Binary Regression Supplementary materal for Non-conjugate Varatonal Message Passng for Multnomal and Bnary Regresson October 9, 011 1 Alternatve dervaton We wll focus on a partcular factor f a and varable x, wth the am

More information

OCR Statistics 1 Working with data. Section 2: Measures of location

OCR Statistics 1 Working with data. Section 2: Measures of location OCR Statstcs 1 Workng wth data Secton 2: Measures of locaton Notes and Examples These notes have sub-sectons on: The medan Estmatng the medan from grouped data The mean Estmatng the mean from grouped data

More information

CS 286r: Matching and Market Design Lecture 2 Combinatorial Markets, Walrasian Equilibrium, Tâtonnement

CS 286r: Matching and Market Design Lecture 2 Combinatorial Markets, Walrasian Equilibrium, Tâtonnement CS 286r: Matchng and Market Desgn Lecture 2 Combnatoral Markets, Walrasan Equlbrum, Tâtonnement Matchng and Money Recall: Last tme we descrbed the Hungaran Method for computng a maxmumweght bpartte matchng.

More information

Problem Set 6 Finance 1,

Problem Set 6 Finance 1, Carnege Mellon Unversty Graduate School of Industral Admnstraton Chrs Telmer Wnter 2006 Problem Set 6 Fnance, 47-720. (representatve agent constructon) Consder the followng two-perod, two-agent economy.

More information

Likelihood Fits. Craig Blocker Brandeis August 23, 2004

Likelihood Fits. Craig Blocker Brandeis August 23, 2004 Lkelhood Fts Crag Blocker Brandes August 23, 2004 Outlne I. What s the queston? II. Lkelhood Bascs III. Mathematcal Propertes IV. Uncertantes on Parameters V. Mscellaneous VI. Goodness of Ft VII. Comparson

More information

Foundations of Machine Learning II TP1: Entropy

Foundations of Machine Learning II TP1: Entropy Foundatons of Machne Learnng II TP1: Entropy Gullaume Charpat (Teacher) & Gaétan Marceau Caron (Scrbe) Problem 1 (Gbbs nequalty). Let p and q two probablty measures over a fnte alphabet X. Prove that KL(p

More information

Data Mining Linear and Logistic Regression

Data Mining Linear and Logistic Regression 07/02/207 Data Mnng Lnear and Logstc Regresson Mchael L of 26 Regresson In statstcal modellng, regresson analyss s a statstcal process for estmatng the relatonshps among varables. Regresson models are

More information

CHAPTER 9 FUNCTIONAL FORMS OF REGRESSION MODELS

CHAPTER 9 FUNCTIONAL FORMS OF REGRESSION MODELS CHAPTER 9 FUNCTIONAL FORMS OF REGRESSION MODELS QUESTIONS 9.1. (a) In a log-log model the dependent and all explanatory varables are n the logarthmc form. (b) In the log-ln model the dependent varable

More information

A MODEL OF COMPETITION AMONG TELECOMMUNICATION SERVICE PROVIDERS BASED ON REPEATED GAME

A MODEL OF COMPETITION AMONG TELECOMMUNICATION SERVICE PROVIDERS BASED ON REPEATED GAME A MODEL OF COMPETITION AMONG TELECOMMUNICATION SERVICE PROVIDERS BASED ON REPEATED GAME Vesna Radonć Đogatovć, Valentna Radočć Unversty of Belgrade Faculty of Transport and Traffc Engneerng Belgrade, Serba

More information

Introduction to game theory

Introduction to game theory Introducton to game theory Lectures n game theory ECON5210, Sprng 2009, Part 1 17.12.2008 G.B. Ashem, ECON5210-1 1 Overvew over lectures 1. Introducton to game theory 2. Modelng nteractve knowledge; equlbrum

More information

Final Exam. 7. (10 points) Please state whether each of the following statements is true or false. No explanation needed.

Final Exam. 7. (10 points) Please state whether each of the following statements is true or false. No explanation needed. Fnal Exam Fall 4 Econ 8-67 Closed Book. Formula Sheet Provded. Calculators OK. Tme Allowed: hours Please wrte your answers on the page below each queston. (5 ponts) Assume that the rsk-free nterest rate

More information

Financial mathematics

Financial mathematics Fnancal mathematcs Jean-Luc Bouchot jean-luc.bouchot@drexel.edu February 19, 2013 Warnng Ths s a work n progress. I can not ensure t to be mstake free at the moment. It s also lackng some nformaton. But

More information

Random Variables. b 2.

Random Variables. b 2. Random Varables Generally the object of an nvestgators nterest s not necessarly the acton n the sample space but rather some functon of t. Techncally a real valued functon or mappng whose doman s the sample

More information

Consumption Based Asset Pricing

Consumption Based Asset Pricing Consumpton Based Asset Prcng Mchael Bar Aprl 25, 208 Contents Introducton 2 Model 2. Prcng rsk-free asset............................... 3 2.2 Prcng rsky assets................................ 4 2.3 Bubbles......................................

More information

ECONOMETRICS - FINAL EXAM, 3rd YEAR (GECO & GADE)

ECONOMETRICS - FINAL EXAM, 3rd YEAR (GECO & GADE) ECONOMETRICS - FINAL EXAM, 3rd YEAR (GECO & GADE) May 17, 2016 15:30 Frst famly name: Name: DNI/ID: Moble: Second famly Name: GECO/GADE: Instructor: E-mal: Queston 1 A B C Blank Queston 2 A B C Blank Queston

More information

Problems to be discussed at the 5 th seminar Suggested solutions

Problems to be discussed at the 5 th seminar Suggested solutions ECON4260 Behavoral Economcs Problems to be dscussed at the 5 th semnar Suggested solutons Problem 1 a) Consder an ultmatum game n whch the proposer gets, ntally, 100 NOK. Assume that both the proposer

More information

Global Optimization in Multi-Agent Models

Global Optimization in Multi-Agent Models Global Optmzaton n Mult-Agent Models John R. Brge R.R. McCormck School of Engneerng and Appled Scence Northwestern Unversty Jont work wth Chonawee Supatgat, Enron, and Rachel Zhang, Cornell 11/19/2004

More information

REFINITIV INDICES PRIVATE EQUITY BUYOUT INDEX METHODOLOGY

REFINITIV INDICES PRIVATE EQUITY BUYOUT INDEX METHODOLOGY REFINITIV INDICES PRIVATE EQUITY BUYOUT INDEX METHODOLOGY 1 Table of Contents INTRODUCTION 3 TR Prvate Equty Buyout Index 3 INDEX COMPOSITION 3 Sector Portfolos 4 Sector Weghtng 5 Index Rebalance 5 Index

More information

2) In the medium-run/long-run, a decrease in the budget deficit will produce:

2) In the medium-run/long-run, a decrease in the budget deficit will produce: 4.02 Quz 2 Solutons Fall 2004 Multple-Choce Questons ) Consder the wage-settng and prce-settng equatons we studed n class. Suppose the markup, µ, equals 0.25, and F(u,z) = -u. What s the natural rate of

More information

Parallel Prefix addition

Parallel Prefix addition Marcelo Kryger Sudent ID 015629850 Parallel Prefx addton The parallel prefx adder presented next, performs the addton of two bnary numbers n tme of complexty O(log n) and lnear cost O(n). Lets notce the

More information

An Application of Alternative Weighting Matrix Collapsing Approaches for Improving Sample Estimates

An Application of Alternative Weighting Matrix Collapsing Approaches for Improving Sample Estimates Secton on Survey Research Methods An Applcaton of Alternatve Weghtng Matrx Collapsng Approaches for Improvng Sample Estmates Lnda Tompkns 1, Jay J. Km 2 1 Centers for Dsease Control and Preventon, atonal

More information

Which of the following provides the most reasonable approximation to the least squares regression line? (a) y=50+10x (b) Y=50+x (d) Y=1+50x

Which of the following provides the most reasonable approximation to the least squares regression line? (a) y=50+10x (b) Y=50+x (d) Y=1+50x Whch of the followng provdes the most reasonable approxmaton to the least squares regresson lne? (a) y=50+10x (b) Y=50+x (c) Y=10+50x (d) Y=1+50x (e) Y=10+x In smple lnear regresson the model that s begn

More information

4.4 Doob s inequalities

4.4 Doob s inequalities 34 CHAPTER 4. MARTINGALES 4.4 Doob s nequaltes The frst nterestng consequences of the optonal stoppng theorems are Doob s nequaltes. If M n s a martngale, denote M n =max applen M. Theorem 4.8 If M n s

More information

Hedging Greeks for a portfolio of options using linear and quadratic programming

Hedging Greeks for a portfolio of options using linear and quadratic programming MPRA Munch Personal RePEc Archve Hedgng reeks for a of otons usng lnear and quadratc rogrammng Panka Snha and Archt Johar Faculty of Management Studes, Unversty of elh, elh 5. February 200 Onlne at htt://mra.ub.un-muenchen.de/20834/

More information

ISE Cloud Computing Index Methodology

ISE Cloud Computing Index Methodology ISE Cloud Computng Index Methodology Index Descrpton The ISE Cloud Computng Index s desgned to track the performance of companes nvolved n the cloud computng ndustry. Index Calculaton The ISE Cloud Computng

More information

Chapter 10 Making Choices: The Method, MARR, and Multiple Attributes

Chapter 10 Making Choices: The Method, MARR, and Multiple Attributes Chapter 0 Makng Choces: The Method, MARR, and Multple Attrbutes INEN 303 Sergy Butenko Industral & Systems Engneerng Texas A&M Unversty Comparng Mutually Exclusve Alternatves by Dfferent Evaluaton Methods

More information

A Case Study for Optimal Dynamic Simulation Allocation in Ordinal Optimization 1

A Case Study for Optimal Dynamic Simulation Allocation in Ordinal Optimization 1 A Case Study for Optmal Dynamc Smulaton Allocaton n Ordnal Optmzaton Chun-Hung Chen, Dongha He, and Mchael Fu 4 Abstract Ordnal Optmzaton has emerged as an effcent technque for smulaton and optmzaton.

More information

Mathematical Thinking Exam 1 09 October 2017

Mathematical Thinking Exam 1 09 October 2017 Mathematcal Thnkng Exam 1 09 October 2017 Name: Instructons: Be sure to read each problem s drectons. Wrte clearly durng the exam and fully erase or mark out anythng you do not want graded. You may use

More information

Problem Set #4 Solutions

Problem Set #4 Solutions 4.0 Sprng 00 Page Problem Set #4 Solutons Problem : a) The extensve form of the game s as follows: (,) Inc. (-,-) Entrant (0,0) Inc (5,0) Usng backwards nducton, the ncumbent wll always set hgh prces,

More information

Simulation Budget Allocation for Further Enhancing the Efficiency of Ordinal Optimization

Simulation Budget Allocation for Further Enhancing the Efficiency of Ordinal Optimization Dscrete Event Dynamc Systems: Theory and Applcatons, 10, 51 70, 000. c 000 Kluwer Academc Publshers, Boston. Manufactured n The Netherlands. Smulaton Budget Allocaton for Further Enhancng the Effcency

More information

Bid-auction framework for microsimulation of location choice with endogenous real estate prices

Bid-auction framework for microsimulation of location choice with endogenous real estate prices Bd-aucton framework for mcrosmulaton of locaton choce wth endogenous real estate prces Rcardo Hurtuba Mchel Berlare Francsco Martínez Urbancs Termas de Chllán, Chle March 28 th 2012 Outlne 1) Motvaton

More information

Equilibrium in Prediction Markets with Buyers and Sellers

Equilibrium in Prediction Markets with Buyers and Sellers Equlbrum n Predcton Markets wth Buyers and Sellers Shpra Agrawal Nmrod Megddo Benamn Armbruster Abstract Predcton markets wth buyers and sellers of contracts on multple outcomes are shown to have unque

More information

FM303. CHAPTERS COVERED : CHAPTERS 5, 8 and 9. LEARNER GUIDE : UNITS 1, 2 and 3.1 to 3.3. DUE DATE : 3:00 p.m. 19 MARCH 2013

FM303. CHAPTERS COVERED : CHAPTERS 5, 8 and 9. LEARNER GUIDE : UNITS 1, 2 and 3.1 to 3.3. DUE DATE : 3:00 p.m. 19 MARCH 2013 Page 1 of 11 ASSIGNMENT 1 ST SEMESTER : FINANCIAL MANAGEMENT 3 () CHAPTERS COVERED : CHAPTERS 5, 8 and 9 LEARNER GUIDE : UNITS 1, 2 and 3.1 to 3.3 DUE DATE : 3:00 p.m. 19 MARCH 2013 TOTAL MARKS : 100 INSTRUCTIONS

More information

Members not eligible for this option

Members not eligible for this option DC - Lump sum optons R6.1 Uncrystallsed funds penson lump sum An uncrystallsed funds penson lump sum, known as a UFPLS (also called a FLUMP), s a way of takng your penson pot wthout takng money from a

More information

CHAPTER 3: BAYESIAN DECISION THEORY

CHAPTER 3: BAYESIAN DECISION THEORY CHATER 3: BAYESIAN DECISION THEORY Decson makng under uncertanty 3 rogrammng computers to make nference from data requres nterdscplnary knowledge from statstcs and computer scence Knowledge of statstcs

More information

Elton, Gruber, Brown and Goetzmann. Modern Portfolio Theory and Investment Analysis, 7th Edition. Solutions to Text Problems: Chapter 4

Elton, Gruber, Brown and Goetzmann. Modern Portfolio Theory and Investment Analysis, 7th Edition. Solutions to Text Problems: Chapter 4 Elton, Gruber, Brown and Goetzmann Modern ortfolo Theory and Investment Analyss, 7th Edton Solutons to Text roblems: Chapter 4 Chapter 4: roblem 1 A. Expected return s the sum of each outcome tmes ts assocated

More information

How Likely Is Contagion in Financial Networks?

How Likely Is Contagion in Financial Networks? OFFICE OF FINANCIAL RESEARCH How Lkely Is Contagon n Fnancal Networks? Paul Glasserman & Peyton Young Systemc Rsk: Models and Mechansms Isaac Newton Insttute, Unversty of Cambrdge August 26-29, 2014 Ths

More information

- contrast so-called first-best outcome of Lindahl equilibrium with case of private provision through voluntary contributions of households

- contrast so-called first-best outcome of Lindahl equilibrium with case of private provision through voluntary contributions of households Prvate Provson - contrast so-called frst-best outcome of Lndahl equlbrum wth case of prvate provson through voluntary contrbutons of households - need to make an assumpton about how each household expects

More information

Analysis of Variance and Design of Experiments-II

Analysis of Variance and Design of Experiments-II Analyss of Varance and Desgn of Experments-II MODULE VI LECTURE - 4 SPLIT-PLOT AND STRIP-PLOT DESIGNS Dr. Shalabh Department of Mathematcs & Statstcs Indan Insttute of Technology Kanpur An example to motvate

More information

Fast Laplacian Solvers by Sparsification

Fast Laplacian Solvers by Sparsification Spectral Graph Theory Lecture 19 Fast Laplacan Solvers by Sparsfcaton Danel A. Spelman November 9, 2015 Dsclamer These notes are not necessarly an accurate representaton of what happened n class. The notes

More information

Value of L = V L = VL = VU =$48,000,000 (ii) Owning 1% of firm U provides a dollar return of.01 [EBIT(1-T C )] =.01 x 6,000,000 = $60,000.

Value of L = V L = VL = VU =$48,000,000 (ii) Owning 1% of firm U provides a dollar return of.01 [EBIT(1-T C )] =.01 x 6,000,000 = $60,000. OLUTION 1. A company wll call a bond when the market prce of the bond s at or above the call prce. For a zero-coupon bond, ths wll never happen because the market prce wll always be below the face value.

More information

A Set of new Stochastic Trend Models

A Set of new Stochastic Trend Models A Set of new Stochastc Trend Models Johannes Schupp Longevty 13, Tape, 21 th -22 th September 2017 www.fa-ulm.de Introducton Uncertanty about the evoluton of mortalty Measure longevty rsk n penson or annuty

More information

Jeffrey Ely. October 7, This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 License.

Jeffrey Ely. October 7, This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 License. October 7, 2012 Ths work s lcensed under the Creatve Commons Attrbuton-NonCommercal-ShareAlke 3.0 Lcense. Recap We saw last tme that any standard of socal welfare s problematc n a precse sense. If we want

More information

Option pricing and numéraires

Option pricing and numéraires Opton prcng and numérares Daro Trevsan Unverstà degl Stud d Psa San Mnato - 15 September 2016 Overvew 1 What s a numerare? 2 Arrow-Debreu model Change of numerare change of measure 3 Contnuous tme Self-fnancng

More information

Financial Risk Management in Portfolio Optimization with Lower Partial Moment

Financial Risk Management in Portfolio Optimization with Lower Partial Moment Amercan Journal of Busness and Socety Vol., o., 26, pp. 2-2 http://www.ascence.org/journal/ajbs Fnancal Rsk Management n Portfolo Optmzaton wth Lower Partal Moment Lam Weng Sew, 2, *, Lam Weng Hoe, 2 Department

More information

Spatial Variations in Covariates on Marriage and Marital Fertility: Geographically Weighted Regression Analyses in Japan

Spatial Variations in Covariates on Marriage and Marital Fertility: Geographically Weighted Regression Analyses in Japan Spatal Varatons n Covarates on Marrage and Martal Fertlty: Geographcally Weghted Regresson Analyses n Japan Kenj Kamata (Natonal Insttute of Populaton and Socal Securty Research) Abstract (134) To understand

More information

Single-Item Auctions. CS 234r: Markets for Networks and Crowds Lecture 4 Auctions, Mechanisms, and Welfare Maximization

Single-Item Auctions. CS 234r: Markets for Networks and Crowds Lecture 4 Auctions, Mechanisms, and Welfare Maximization CS 234r: Markets for Networks and Crowds Lecture 4 Auctons, Mechansms, and Welfare Maxmzaton Sngle-Item Auctons Suppose we have one or more tems to sell and a pool of potental buyers. How should we decde

More information

ISE High Income Index Methodology

ISE High Income Index Methodology ISE Hgh Income Index Methodology Index Descrpton The ISE Hgh Income Index s desgned to track the returns and ncome of the top 30 U.S lsted Closed-End Funds. Index Calculaton The ISE Hgh Income Index s

More information

Hewlett Packard 10BII Calculator

Hewlett Packard 10BII Calculator Hewlett Packard 0BII Calculator Keystrokes for the HP 0BII are shown n the tet. However, takng a mnute to revew the Quk Start secton, below, wll be very helpful n gettng started wth your calculator. Note:

More information

EuroMTS Eurozone Government Bill Index Rules

EuroMTS Eurozone Government Bill Index Rules EuroMTS Eurozone Government Bll Index Rules 1 of 11 MTS 21 Contents 1. MTS Indces Structure 1.1 Summary of MTS Indces 1.2 emtx[z]: EuroMTS Eurozone Government Bll Indces 1.3 Selecton Crtera 2. Generc Features

More information

Optimal Service-Based Procurement with Heterogeneous Suppliers

Optimal Service-Based Procurement with Heterogeneous Suppliers Optmal Servce-Based Procurement wth Heterogeneous Supplers Ehsan Elah 1 Saf Benjaafar 2 Karen L. Donohue 3 1 College of Management, Unversty of Massachusetts, Boston, MA 02125 2 Industral & Systems Engneerng,

More information

Optimizing Merchant Revenue with Rebates

Optimizing Merchant Revenue with Rebates Optmzng Merchant Revenue wth Rebates Rakesh Agrawal Search Labs Mcrosoft Research rakesha@mcrosoft.com Samuel Ieong Search Labs Mcrosoft Research saeong@mcrosoft.com Raja Velu School of Management Syracuse

More information

The IBM Translation Models. Michael Collins, Columbia University

The IBM Translation Models. Michael Collins, Columbia University The IBM Translaton Models Mchael Collns, Columba Unversty Recap: The Nosy Channel Model Goal: translaton system from French to Englsh Have a model p(e f) whch estmates condtonal probablty of any Englsh

More information

ECE 586GT: Problem Set 2: Problems and Solutions Uniqueness of Nash equilibria, zero sum games, evolutionary dynamics

ECE 586GT: Problem Set 2: Problems and Solutions Uniqueness of Nash equilibria, zero sum games, evolutionary dynamics Unversty of Illnos Fall 08 ECE 586GT: Problem Set : Problems and Solutons Unqueness of Nash equlbra, zero sum games, evolutonary dynamcs Due: Tuesday, Sept. 5, at begnnng of class Readng: Course notes,

More information

Money, Banking, and Financial Markets (Econ 353) Midterm Examination I June 27, Name Univ. Id #

Money, Banking, and Financial Markets (Econ 353) Midterm Examination I June 27, Name Univ. Id # Money, Bankng, and Fnancal Markets (Econ 353) Mdterm Examnaton I June 27, 2005 Name Unv. Id # Note: Each multple-choce queston s worth 4 ponts. Problems 20, 21, and 22 carry 10, 8, and 10 ponts, respectvely.

More information

Appendix for Solving Asset Pricing Models when the Price-Dividend Function is Analytic

Appendix for Solving Asset Pricing Models when the Price-Dividend Function is Analytic Appendx for Solvng Asset Prcng Models when the Prce-Dvdend Functon s Analytc Ovdu L. Caln Yu Chen Thomas F. Cosmano and Alex A. Hmonas January 3, 5 Ths appendx provdes proofs of some results stated n our

More information

Optimising a general repair kit problem with a service constraint

Optimising a general repair kit problem with a service constraint Optmsng a general repar kt problem wth a servce constrant Marco Bjvank 1, Ger Koole Department of Mathematcs, VU Unversty Amsterdam, De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands Irs F.A. Vs Department

More information

Oracle inequalities for computationally budgeted model selection

Oracle inequalities for computationally budgeted model selection Oracle nequaltes for computatonally budgeted model selecton Alekh Agarwal John C. Duch Unversty of Calforna, Berkeley alekh,jduch}@cs.berkeley.edu Peter L. Bartlett QUT and UC Berkeley bartlett@cs.berkeley.edu

More information

Members not eligible for this option

Members not eligible for this option DC - Lump sum optons R6.2 Uncrystallsed funds penson lump sum An uncrystallsed funds penson lump sum, known as a UFPLS (also called a FLUMP), s a way of takng your penson pot wthout takng money from a

More information

A Distributed Algorithm for Constrained Multi-Robot Task Assignment for Grouped Tasks

A Distributed Algorithm for Constrained Multi-Robot Task Assignment for Grouped Tasks A Dstrbuted Algorthm for Constraned Mult-Robot Tas Assgnment for Grouped Tass Lngzh Luo Robotcs Insttute Carnege Mellon Unversty Pttsburgh, PA 15213 lngzhl@cs.cmu.edu Nlanjan Charaborty Robotcs Insttute

More information

ISyE 512 Chapter 9. CUSUM and EWMA Control Charts. Instructor: Prof. Kaibo Liu. Department of Industrial and Systems Engineering UW-Madison

ISyE 512 Chapter 9. CUSUM and EWMA Control Charts. Instructor: Prof. Kaibo Liu. Department of Industrial and Systems Engineering UW-Madison ISyE 512 hapter 9 USUM and EWMA ontrol harts Instructor: Prof. Kabo Lu Department of Industral and Systems Engneerng UW-Madson Emal: klu8@wsc.edu Offce: Room 317 (Mechancal Engneerng Buldng) ISyE 512 Instructor:

More information

PhysicsAndMathsTutor.com

PhysicsAndMathsTutor.com PhscsAndMathsTutor.com phscsandmathstutor.com June 2005 6. A scentst found that the tme taken, M mnutes, to carr out an eperment can be modelled b a normal random varable wth mean 155 mnutes and standard

More information

Physics 4A. Error Analysis or Experimental Uncertainty. Error

Physics 4A. Error Analysis or Experimental Uncertainty. Error Physcs 4A Error Analyss or Expermental Uncertanty Slde Slde 2 Slde 3 Slde 4 Slde 5 Slde 6 Slde 7 Slde 8 Slde 9 Slde 0 Slde Slde 2 Slde 3 Slde 4 Slde 5 Slde 6 Slde 7 Slde 8 Slde 9 Slde 20 Slde 2 Error n

More information

Random Variables. 8.1 What is a Random Variable? Announcements: Chapter 8

Random Variables. 8.1 What is a Random Variable? Announcements: Chapter 8 Announcements: Quz starts after class today, ends Monday Last chance to take probablty survey ends Sunday mornng. Next few lectures: Today, Sectons 8.1 to 8. Monday, Secton 7.7 and extra materal Wed, Secton

More information

Introduction to PGMs: Discrete Variables. Sargur Srihari

Introduction to PGMs: Discrete Variables. Sargur Srihari Introducton to : Dscrete Varables Sargur srhar@cedar.buffalo.edu Topcs. What are graphcal models (or ) 2. Use of Engneerng and AI 3. Drectonalty n graphs 4. Bayesan Networks 5. Generatve Models and Samplng

More information

Monte Carlo Rendering

Monte Carlo Rendering Last Tme? Monte Carlo Renderng Monte-Carlo Integraton Probabltes and Varance Analyss of Monte-Carlo Integraton Monte-Carlo n Graphcs Stratfed Samplng Importance Samplng Advanced Monte-Carlo Renderng Monte-Carlo

More information

Robust Stochastic Lot-Sizing by Means of Histograms

Robust Stochastic Lot-Sizing by Means of Histograms Robust Stochastc Lot-Szng by Means of Hstograms Abstract Tradtonal approaches n nventory control frst estmate the demand dstrbuton among a predefned famly of dstrbutons based on data fttng of hstorcal

More information

Probability Distributions. Statistics and Quantitative Analysis U4320. Probability Distributions(cont.) Probability

Probability Distributions. Statistics and Quantitative Analysis U4320. Probability Distributions(cont.) Probability Statstcs and Quanttatve Analss U430 Dstrbutons A. Dstrbutons: How do smple probablt tables relate to dstrbutons?. What s the of gettng a head? ( con toss) Prob. Segment 4: Dstrbutons, Unvarate & Bvarate

More information

>1 indicates country i has a comparative advantage in production of j; the greater the index, the stronger the advantage. RCA 1 ij

>1 indicates country i has a comparative advantage in production of j; the greater the index, the stronger the advantage. RCA 1 ij 69 APPENDIX 1 RCA Indces In the followng we present some maor RCA ndces reported n the lterature. For addtonal varants and other RCA ndces, Memedovc (1994) and Vollrath (1991) provde more thorough revews.

More information

Cyclic Scheduling in a Job shop with Multiple Assembly Firms

Cyclic Scheduling in a Job shop with Multiple Assembly Firms Proceedngs of the 0 Internatonal Conference on Industral Engneerng and Operatons Management Kuala Lumpur, Malaysa, January 4, 0 Cyclc Schedulng n a Job shop wth Multple Assembly Frms Tetsuya Kana and Koch

More information

FORD MOTOR CREDIT COMPANY SUGGESTED ANSWERS. Richard M. Levich. New York University Stern School of Business. Revised, February 1999

FORD MOTOR CREDIT COMPANY SUGGESTED ANSWERS. Richard M. Levich. New York University Stern School of Business. Revised, February 1999 FORD MOTOR CREDIT COMPANY SUGGESTED ANSWERS by Rchard M. Levch New York Unversty Stern School of Busness Revsed, February 1999 1 SETTING UP THE PROBLEM The bond s beng sold to Swss nvestors for a prce

More information

A Php 5,000 loan is being repaid in 10 yearly payments. If interest is 8% effective, find the annual payment. 1 ( ) 10) 0.

A Php 5,000 loan is being repaid in 10 yearly payments. If interest is 8% effective, find the annual payment. 1 ( ) 10) 0. Amortzaton If a loan s repad on nstalment (whch s usually n equal amounts); then the loan s sad to be repad by the amortzaton method. Under ths method, each nstalment ncludes the repayment of prncpal and

More information

Evaluating Performance

Evaluating Performance 5 Chapter Evaluatng Performance In Ths Chapter Dollar-Weghted Rate of Return Tme-Weghted Rate of Return Income Rate of Return Prncpal Rate of Return Daly Returns MPT Statstcs 5- Measurng Rates of Return

More information

A FRAMEWORK FOR PRIORITY CONTACT OF NON RESPONDENTS

A FRAMEWORK FOR PRIORITY CONTACT OF NON RESPONDENTS A FRAMEWORK FOR PRIORITY CONTACT OF NON RESPONDENTS Rchard McKenze, Australan Bureau of Statstcs. 12p36 Exchange Plaza, GPO Box K881, Perth, WA 6001. rchard.mckenze@abs.gov.au ABSTRACT Busnesses whch have

More information

4. Greek Letters, Value-at-Risk

4. Greek Letters, Value-at-Risk 4 Greek Letters, Value-at-Rsk 4 Value-at-Rsk (Hull s, Chapter 8) Math443 W08, HM Zhu Outlne (Hull, Chap 8) What s Value at Rsk (VaR)? Hstorcal smulatons Monte Carlo smulatons Model based approach Varance-covarance

More information