Online Learning from Experts: Minimax Regret
|
|
- Darren Cannon
- 7 years ago
- Views:
Transcription
1 E0 370 tatstcal Learnng Theory Lecture 2 Nov 24, 20) Onlne Learnng from Experts: Mn Regret Lecturer: hvan garwal crbe: Nkhl Vdhan Introducton In the last three lectures we have been dscussng the onlne learnng algorthms where we receve the nstance x t and then ts label y t for t =,..., T. pecfcally n the last lecture we talked about onlne learnng from experts and onlne predcton. We saw many algorthms lke Halvng algorthm, Weghted Majorty WM) algorthm and lastly Weghted Majorty Contnuous WMC) algorthm. We also saw bounds on the cumulatve loss ncurred by these algorthms. Today, we wll focus on onlne predcton. For the WMC algorthm the settng s: we have N experts who predct the outcome label) n [0,], then we combne these predctons usng a weghted average of these. Then we receve the true label and ncur some loss absolute loss n our settng), then we make an update to the weght vectors based on the loss. The ntuton s that the hgher the loss ncurred by an expert, the more drastcally we reduce ts weght. For the WMC algorthm, we proved that: [W MCη)] lnn) e η + η mn [ξ ] e η where the symbols have ther meanngs as explaned n the last lecture. lso f the number of examples T s known n advance, then we can choose the WMC parameter η s.t. [W MCη )] mn [ξ ] + 2T lnn) + lnn) 2 Mn Regret Lets defne the regret of an algorthm w.r.t. the set of experts ξ = {ξ,..., ξ N } on the sample = x, y ),..., x T, y T )) as: R l ξ,[] = L l [] mn L l [ξ ].e. the dfference between the total loss of your algorthm and the total loss of the best expert. Thus f we had chosen the best expert always for our predcton then our regret would be zero; ths makes sense as n onlne settng absolute loss s nsgnfcant as the adversary may always choose the label other than what we predcted. The goal of the predctor s to mnmze the regret whle the goal of adversary s to mze t. In general, we can formalze t as a game where at each tral you receve expert s predctons, then you make your own predcton and fnally the true label s revealed by the adversary. In ths settng we want to get close to the best possble loss mnmum regret). Thus we want to choose an algorthm that mnmzes the total regret, however we do not have any control over the set of expert predctons and the sample as adversary can choose a set of experts or sample whch gves a larger regret over the algorthm. Here, we can defne the mn value regret) of the game as: V l = mn ξ, Rl ξ,[] It s the worst case guarantee on the regret over all the sequences of labels and expert predctons. From the last lecture we know that: 2T lnn) + lnn) natural queston here s can we bound the mn regret for other loss functon? Is ths the best possble mn regret?
2 2 Onlne Learnng from Experts: Mn Regret 3 Mn regret for varous loss functons In ths secton we wll look at upper bound on mn regret for some other loss functons whch we have seen before. We wll focus on bnary outcomes y t {0, } wth experts predctng n [0,]; ξ t [0, ] and ŷ t [0, ]. ξ t can be seen as probablty of th expert predctng the label as. Defne the loss functon l : {0, } [0, ] [0, ) Lets us also defne l 0 ŷ) = l0, ŷ) and l ŷ) = l, ŷ). 3. quared Loss For squared loss ly, ŷ) = y ŷ) 2, t can be easly seen that l 0 ŷ) = ŷ 2 and l ŷ) = ŷ) 2. Let us defne some new quanttes assumng l 0 ) and l ) beng twce dfferentable): l ŷ) = l 0ŷ) l ŷ) l ŷ) l 0ŷ) R l ŷ) = l 0ŷ) l ŷ) 2 l ŷ) l 0ŷ) 2 l ŷ) c l = sup R l ŷ) 0<ŷ< Theorem 3.. Haussler et al., 998) Let l be such that l 0 0) = l ) = 0. Let l 0 ) be strctly ncreasng n 0,) and l ) be strctly decreasng n 0,). Let l 0 ) and l ) be three tmes dfferentable n 0,). If l ŷ) > 0 n 0,) and c l <, then: V l = ΘlnN)) pecfcally, we have V l c l lnn) and V l c l o)) lnn) For the squared loss: l 0ŷ) = 2ŷ, l ŷ) = 2ŷ ), l 0ŷ) = 2, l ŷ) = 2 Thus, l ŷ) = 4 > 0, and R l ŷ) = 2ŷ ŷ). Clearly, sup 0<ŷ< R l ŷ) = /2 <. Therefore, for squared loss we have, V lsq 2 lnn) 3.2 Logarthmc Loss Ths type of loss functon haven t been dscussed before n the lectures. Let us defne t frst. { lnŷ) f y = l log y, ŷ) = ln ŷ) f y = 0 For l log loss, l 0 ŷ) = ln ŷ) and l ŷ) = ln ŷ). mple mathematcs wll lead us to: Thus, we get l 0ŷ) = ŷ, l ŷ) = ŷ, l 0ŷ) = ŷ) 2, l ŷ) = ŷ 2 l ŷ) = Therefore for the logarthmc loss we get, ŷ) 2 ŷ 2 and subsequently R lŷ) =, c l = V l log lnn)
3 Onlne Learnng from Experts: Mn Regret bsolute Loss For the absolute loss we have l abs y, ŷ) = y ŷ, here t s easy to see that l 0 ŷ) = ŷ and l ŷ) = ŷ, for ŷ 0, ). lso l 0ŷ) =, l ŷ) =, l 0ŷ) = 0, l ŷ) = 0 nd therefore we get l ŷ) = 0 c l =. Thus, the above theorem doesn t apply n the absolute loss settng. Thus for the absolute loss we have the result of WMC algorthm from the last lecture whch gves an upper bound on the regret. Clearly for the squared and logarthmc loss we saw a much tghter bound; then a natural queston arses: can we do better for the absolute loss too? It turns out that we can only mprove the constants n the WMC regret bound for the absolute error case. Theorem 3.2. Let l be s.t. l 0 ) s strctly ncreasng n 0,) whle l ) s strctly decreasng n 0,) and both beng three tmes dfferentable n 0,). Then, If l ŷ) = 0 for some ŷ 0, ), then V = Ω T /6 ) lnn) T ) If l ŷ) < 0 or a < b, s.t. l ŷ) = 0 ŷ [a, b], then V = Ω lnn) Note. Clearly, l abs falls n the second category of the above theorem. T ) T ) = O lnn). Thus, = Θ lnn) []. nce, we have already seen that 4 Vovk s lgorthm, 990 Ths algorthm s very smlar to the Weghted Majorty algorthm. The dfference les n the update,.e. how do we combne the predctons from the experts to make our own predctons. lgorthm Vovk Parameters: c, η > 0 Intal weght vector w = [N] Loss functon l : {0, } [0, ] [0, ) For t =,..., T : Receve expert predctons ξ, t..., ξn t )[0, ] Compute y = c ln for y = 0,. wt e ηly,ξt ) wt Predct any ŷ satsfyng: ly, ŷ t ) y y {0, }. If such a ŷ, then the algorthm fals. Receve true label y t {0, } Incur loss ly t, ŷ) Update [N] : w t+ w t e ηlyt,ξ t ) nalyss of Vovk s lgorthm uppose that the algorthm doesn t fals. Defne U t = c lnw t ), where W t = N = wt. Then for each tral t, ly t, ŷ t ) U t+ U t t y ummng over t =,..., T, Now, L l [Vovkc, η)] U T + U T U T + = c lnw T + ) c lnw T + ), W T + w T +
4 4 Onlne Learnng from Experts: Mn Regret lso, U = c lnn) Thus, ) L l [Vovkc, η)] c lnn) + η mn L l [ξ ] Note. The above s true for all for whch the algorthm wth parameters c, η) doesn t fal. Thus gven the loss functon of nterest, f one can fnd the parameters c and η such that the algorthm never fals, then we get the above bound for all possble sequence. The proof of above nvolves takng c = c l, η = /c l wth l beng c, η)-realzable. howng n general that any loss functon satsfyng these condtons s realzable w.r.t. these values nvolves a sgnfcant amount of work. Defnton. Defne l to be c, η)-realzable f, ξ; Vovkc, η) doesn t fal. Now, we wll see what condtons are suffcent for the Vovk s algorthm not to fal. We wll verfy t for some loss functons. Logarthmc Loss Run Vovk algorthm wth c = c l and η = /c l. For the l log loss we have, c =, η =. Defne p t = w t N j= wt j to be the normalzed verson of the weght vector. ) ) 0 = c ln p t e ηl0ξt ) = ln p t e ln ξt ) = ln p t ξ t) We bascally need: whch s same as requrng: ) ) = c ln p t e ηlξt ) = ln p t e lnξt ) = ln p t ξ t) l 0 ŷ t ) ln p t ξ t) l ŷ t ) ln p t ξ t) l 0 ln pt ξ t)) ŷ t ŷ p t ξ t ln pt ξ t)) ŷ t ŷ p t ξ t l Thus there s only one value ŷ t = p t ξ t satsfyng t. Exercse. Work out the condtons for the Vovk s algorthm to be c, η)-realzable n the squared loss settng. bsolute Loss We start wth some η > 0 and c abs η) = 2. 2 ln +e η For the above choce of c, l abs turns out to be realzable for any η > 0. The bound that we get here s [Vovkη, c absη))] lnn) + η mn [ξ ] 2 2 ln +e η ) The above holds for any η > 0. The bound seems qute smlar to the one n Weghted Majorty algorthm except for the denomnator term. nce, t holds for all η, f we choose η carefully, we can get a bound of the form [Vovkη, c abs η ))] T lnn)+lnn)/2. For the absolute loss the best possble bound happens to be T/2) lnn + ) + lnn + )/2, whch s obtaned when we add an addtonal arbtrary expert ξ N+, who always predct the nverse of one of the experts say ξ ). Here, at least one of the two experts ξ and ξ N+ ) must have loss at most T/2 tmes.
5 Onlne Learnng from Experts: Mn Regret 5 5 Lower Bound on Mn Regret for bsolute Loss From earler secton we know that, = mn ξ, [] mn ) [ξ ] mn ξ, Rl abs ξ, [] Clam. For any and any ξ,..., ξ N [0, ] T some label sequence for whch the regret follows: [0,] T R l abs ξ, [] T 2 E [0,] T [mn ] [ξ ] Proof. t each tral the algorthm s predctng some value ŷ t. The label for the tral s unformly ether 0 or,.e. w.p. 2 the label s 0 and w.p. 2 t s. Thus, [ ] [ E [0,] T = 2 ŷt 0) + ] 2 ŷt ) T = T/2 The clam follows by observng that, [ ] R l abs [0,] T ξ, [] E R l abs [0,] T ξ, [] Now, = mn mn mn mn ξ { R l abs ξ {0,} T ) N E ξ {0,} T ) N ξ, [] } { } R l abs ξ, [] [ T [ 2 E [0,] T [ T 2 E ξ {0,} T ) N, [0,] T [ mn mn ] ] [ξ ] ] ] [ξ ] 6 Next Lecture In the next lecture we wll study the connectons of the onlne learnng wth the batch learnng and also see some methods to transform the onlne learnng problem nto a batch learnng problem. References [] Ncolo Cesa-Banch, Yoav Freund, Davd P. Helmbold, Davd Haussler, Robert E. chapre and Manfred K. Warmuth. How to use expert advce. Journal of the CM, 443): , 997. [2] Davd Haussler, Jyrk Kvnen and Manfred K. Warmuth. equental predcton of ndvdual sequences under general loss functons. IEEE Transactons on Informaton Theory, 445): , 998.
8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by
6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng
More information1. Measuring association using correlation and regression
How to measure assocaton I: Correlaton. 1. Measurng assocaton usng correlaton and regresson We often would lke to know how one varable, such as a mother's weght, s related to another varable, such as a
More informationLuby s Alg. for Maximal Independent Sets using Pairwise Independence
Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent
More informationForecasting the Direction and Strength of Stock Market Movement
Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract - Stock market s one of the most complcated systems
More information1 Example 1: Axis-aligned rectangles
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton
More informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
More informationThe Mathematical Derivation of Least Squares
Pscholog 885 Prof. Federco The Mathematcal Dervaton of Least Squares Back when the powers that e forced ou to learn matr algera and calculus, I et ou all asked ourself the age-old queston: When the hell
More informationLogistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification
Lecture 4: More classfers and classes C4B Machne Learnng Hlary 20 A. Zsserman Logstc regresson Loss functons revsted Adaboost Loss functons revsted Optmzaton Multple class classfcaton Logstc Regresson
More informationAn Alternative Way to Measure Private Equity Performance
An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate
More informationFinite Math Chapter 10: Study Guide and Solution to Problems
Fnte Math Chapter 10: Study Gude and Soluton to Problems Basc Formulas and Concepts 10.1 Interest Basc Concepts Interest A fee a bank pays you for money you depost nto a savngs account. Prncpal P The amount
More informationv a 1 b 1 i, a 2 b 2 i,..., a n b n i.
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
More informationHow To Calculate The Accountng Perod Of Nequalty
Inequalty and The Accountng Perod Quentn Wodon and Shlomo Ytzha World Ban and Hebrew Unversty September Abstract Income nequalty typcally declnes wth the length of tme taen nto account for measurement.
More informationRecurrence. 1 Definitions and main statements
Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.
More informationThe Greedy Method. Introduction. 0/1 Knapsack Problem
The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton
More informationExtending Probabilistic Dynamic Epistemic Logic
Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set
More informationTHE METHOD OF LEAST SQUARES THE METHOD OF LEAST SQUARES
The goal: to measure (determne) an unknown quantty x (the value of a RV X) Realsaton: n results: y 1, y 2,..., y j,..., y n, (the measured values of Y 1, Y 2,..., Y j,..., Y n ) every result s encumbered
More informationn + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2)
MATH 16T Exam 1 : Part I (In-Class) Solutons 1. (0 pts) A pggy bank contans 4 cons, all of whch are nckels (5 ), dmes (10 ) or quarters (5 ). The pggy bank also contans a con of each denomnaton. The total
More informationLecture 3: Annuity. Study annuities whose payments form a geometric progression or a arithmetic progression.
Lecture 3: Annuty Goals: Learn contnuous annuty and perpetuty. Study annutes whose payments form a geometrc progresson or a arthmetc progresson. Dscuss yeld rates. Introduce Amortzaton Suggested Textbook
More informationLogistic Regression. Steve Kroon
Logstc Regresson Steve Kroon Course notes sectons: 24.3-24.4 Dsclamer: these notes do not explctly ndcate whether values are vectors or scalars, but expects the reader to dscern ths from the context. Scenaro
More informationLearning Permutations with Exponential Weights
Journal of Machne Learnng Research 2009 (10) 1705-1736 Submtted 9/08; Publshed 7/09 Learnng Permutatons wth Exponental Weghts Davd P. Helmbold Manfred K. Warmuth Computer Scence Department Unversty of
More information8 Algorithm for Binary Searching in Trees
8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the
More informationSection 2.3 Present Value of an Annuity; Amortization
Secton 2.3 Present Value of an Annuty; Amortzaton Prncpal Intal Value PV s the present value or present sum of the payments. PMT s the perodc payments. Gven r = 6% semannually, n order to wthdraw $1,000.00
More informationForecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network
700 Proceedngs of the 8th Internatonal Conference on Innovaton & Management Forecastng the Demand of Emergency Supples: Based on the CBR Theory and BP Neural Network Fu Deqang, Lu Yun, L Changbng School
More informationAn Interest-Oriented Network Evolution Mechanism for Online Communities
An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne
More informationGeneral Auction Mechanism for Search Advertising
General Aucton Mechansm for Search Advertsng Gagan Aggarwal S. Muthukrshnan Dávd Pál Martn Pál Keywords game theory, onlne auctons, stable matchngs ABSTRACT Internet search advertsng s often sold by an
More informationTexas Instruments 30X IIS Calculator
Texas Instruments 30X IIS Calculator Keystrokes for the TI-30X IIS are shown for a few topcs n whch keystrokes are unque. Start by readng the Quk Start secton. Then, before begnnng a specfc unt of the
More informationImplementation of Deutsch's Algorithm Using Mathcad
Implementaton of Deutsch's Algorthm Usng Mathcad Frank Roux The followng s a Mathcad mplementaton of Davd Deutsch's quantum computer prototype as presented on pages - n "Machnes, Logc and Quantum Physcs"
More informationInstitute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic
Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange
More informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More informationFeature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College
Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure
More informationPSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12
14 The Ch-squared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed
More informationINVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS
21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech-2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS
More informationA hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm
Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel
More informationSupport Vector Machines
Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.
More informationUsage of LCG/CLCG numbers for electronic gambling applications
Usage of LCG/CLCG numbers for electronc gamblng applcatons Anders Knutsson Smovts Consultng, Wenner-Gren Center, Sveavägen 166, 113 46 Stockholm, Sweden anders.knutsson@smovts.com Abstract. Several attacks
More informationFisher Markets and Convex Programs
Fsher Markets and Convex Programs Nkhl R. Devanur 1 Introducton Convex programmng dualty s usually stated n ts most general form, wth convex objectve functons and convex constrants. (The book by Boyd and
More informationSimple Interest Loans (Section 5.1) :
Chapter 5 Fnance The frst part of ths revew wll explan the dfferent nterest and nvestment equatons you learned n secton 5.1 through 5.4 of your textbook and go through several examples. The second part
More informationOnline Multiple Kernel Learning: Algorithms and Mistake Bounds
Onlne Multple Kernel Learnng: Algorthms and Mstake Bounds Rong Jn 1, Steven C.H. Ho 2, and Tanbao Yang 1 1 Department of Computer Scence and Engneerng, Mchgan State Unversty, MI, 48824, USA 2 School of
More informationJoe Pimbley, unpublished, 2005. Yield Curve Calculations
Joe Pmbley, unpublshed, 005. Yeld Curve Calculatons Background: Everythng s dscount factors Yeld curve calculatons nclude valuaton of forward rate agreements (FRAs), swaps, nterest rate optons, and forward
More informationMarginal Returns to Education For Teachers
The Onlne Journal of New Horzons n Educaton Volume 4, Issue 3 MargnalReturnstoEducatonForTeachers RamleeIsmal,MarnahAwang ABSTRACT FacultyofManagementand Economcs UnverstPenddkanSultan Idrs ramlee@fpe.ups.edu.my
More informationSPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background:
SPEE Recommended Evaluaton Practce #6 efnton of eclne Curve Parameters Background: The producton hstores of ol and gas wells can be analyzed to estmate reserves and future ol and gas producton rates and
More information14.74 Lecture 5: Health (2)
14.74 Lecture 5: Health (2) Esther Duflo February 17, 2004 1 Possble Interventons Last tme we dscussed possble nterventons. Let s take one: provdng ron supplements to people, for example. From the data,
More informationJ. Parallel Distrib. Comput.
J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n
More informationBERNSTEIN POLYNOMIALS
On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful
More informationStochastic Bandits with Side Observations on Networks
Stochastc Bandts wth Sde Observatons on Networks Swapna Buccapatnam, Atlla Erylmaz Department of ECE The Oho State Unversty Columbus, OH - 430 buccapat@eceosuedu, erylmaz@osuedu Ness B Shroff Departments
More informationCS 2750 Machine Learning. Lecture 3. Density estimation. CS 2750 Machine Learning. Announcements
Lecture 3 Densty estmaton Mlos Hauskrecht mlos@cs.ptt.edu 5329 Sennott Square Next lecture: Matlab tutoral Announcements Rules for attendng the class: Regstered for credt Regstered for audt (only f there
More informationProblem Set 3. a) We are asked how people will react, if the interest rate i on bonds is negative.
Queston roblem Set 3 a) We are asked how people wll react, f the nterest rate on bonds s negatve. When
More informationTrivial lump sum R5.0
Optons form Once you have flled n ths form, please return t wth your orgnal brth certfcate to: Premer PO Box 2067 Croydon CR90 9ND. Fll n ths form usng BLOCK CAPITALS and black nk. Mark all answers wth
More informationLecture 3: Force of Interest, Real Interest Rate, Annuity
Lecture 3: Force of Interest, Real Interest Rate, Annuty Goals: Study contnuous compoundng and force of nterest Dscuss real nterest rate Learn annuty-mmedate, and ts present value Study annuty-due, and
More informationbenefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
More informationCan Auto Liability Insurance Purchases Signal Risk Attitude?
Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159-164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? Chu-Shu L Department of Internatonal Busness, Asa Unversty, Tawan Sheng-Chang
More informationCHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol
CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK Sample Stablty Protocol Background The Cholesterol Reference Method Laboratory Network (CRMLN) developed certfcaton protocols for total cholesterol, HDL
More informationSmall pots lump sum payment instruction
For customers Small pots lump sum payment nstructon Please read these notes before completng ths nstructon About ths nstructon Use ths nstructon f you re an ndvdual wth Aegon Retrement Choces Self Invested
More informationNordea G10 Alpha Carry Index
Nordea G10 Alpha Carry Index Index Rules v1.1 Verson as of 10/10/2013 1 (6) Page 1 Index Descrpton The G10 Alpha Carry Index, the Index, follows the development of a rule based strategy whch nvests and
More informationANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING
ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 610-519-4390,
More informationWe are now ready to answer the question: What are the possible cardinalities for finite fields?
Chapter 3 Fnte felds We have seen, n the prevous chapters, some examples of fnte felds. For example, the resdue class rng Z/pZ (when p s a prme) forms a feld wth p elements whch may be dentfed wth the
More informationHARVARD John M. Olin Center for Law, Economics, and Business
HARVARD John M. Oln Center for Law, Economcs, and Busness ISSN 1045-6333 ASYMMETRIC INFORMATION AND LEARNING IN THE AUTOMOBILE INSURANCE MARKET Alma Cohen Dscusson Paper No. 371 6/2002 Harvard Law School
More informationPeak Inverse Voltage
9/13/2005 Peak Inerse Voltage.doc 1/6 Peak Inerse Voltage Q: I m so confused! The brdge rectfer and the fullwae rectfer both prode full-wae rectfcaton. Yet, the brdge rectfer use 4 juncton dodes, whereas
More informationThe Application of Fractional Brownian Motion in Option Pricing
Vol. 0, No. (05), pp. 73-8 http://dx.do.org/0.457/jmue.05.0..6 The Applcaton of Fractonal Brownan Moton n Opton Prcng Qng-xn Zhou School of Basc Scence,arbn Unversty of Commerce,arbn zhouqngxn98@6.com
More informationCombinatorial Agency of Threshold Functions
Combnatoral Agency of Threshold Functons Shal Jan Computer Scence Department Yale Unversty New Haven, CT 06520 shal.jan@yale.edu Davd C. Parkes School of Engneerng and Appled Scences Harvard Unversty Cambrdge,
More informationFINANCIAL MATHEMATICS. A Practical Guide for Actuaries. and other Business Professionals
FINANCIAL MATHEMATICS A Practcal Gude for Actuares and other Busness Professonals Second Edton CHRIS RUCKMAN, FSA, MAAA JOE FRANCIS, FSA, MAAA, CFA Study Notes Prepared by Kevn Shand, FSA, FCIA Assstant
More informationChapter 7: Answers to Questions and Problems
19. Based on the nformaton contaned n Table 7-3 of the text, the food and apparel ndustres are most compettve and therefore probably represent the best match for the expertse of these managers. Chapter
More informationVision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION
Vson Mouse Saurabh Sarkar a* a Unversty of Cncnnat, Cncnnat, USA ABSTRACT The report dscusses a vson based approach towards trackng of eyes and fngers. The report descrbes the process of locatng the possble
More informationSoftware project management with GAs
Informaton Scences 177 (27) 238 241 www.elsever.com/locate/ns Software project management wth GAs Enrque Alba *, J. Francsco Chcano Unversty of Málaga, Grupo GISUM, Departamento de Lenguajes y Cencas de
More informationTo Fill or not to Fill: The Gas Station Problem
To Fll or not to Fll: The Gas Staton Problem Samr Khuller Azarakhsh Malekan Julán Mestre Abstract In ths paper we study several routng problems that generalze shortest paths and the Travelng Salesman Problem.
More informationSection 5.4 Annuities, Present Value, and Amortization
Secton 5.4 Annutes, Present Value, and Amortzaton Present Value In Secton 5.2, we saw that the present value of A dollars at nterest rate per perod for n perods s the amount that must be deposted today
More informationJet Engine. Figure 1 Jet engine
Jet Engne Prof. Dr. Mustafa Cavcar Anadolu Unversty, School of Cvl Avaton Esksehr, urkey GROSS HRUS INAKE MOMENUM DRAG NE HRUS Fgure 1 Jet engne he thrust for a turboet engne can be derved from Newton
More informationEnabling P2P One-view Multi-party Video Conferencing
Enablng P2P One-vew Mult-party Vdeo Conferencng Yongxang Zhao, Yong Lu, Changja Chen, and JanYn Zhang Abstract Mult-Party Vdeo Conferencng (MPVC) facltates realtme group nteracton between users. Whle P2P
More informationL10: Linear discriminants analysis
L0: Lnear dscrmnants analyss Lnear dscrmnant analyss, two classes Lnear dscrmnant analyss, C classes LDA vs. PCA Lmtatons of LDA Varants of LDA Other dmensonalty reducton methods CSCE 666 Pattern Analyss
More informationThe Development of Web Log Mining Based on Improve-K-Means Clustering Analysis
The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
More informationChapter 11 Practice Problems Answers
Chapter 11 Practce Problems Answers 1. Would you be more wllng to lend to a frend f she put all of her lfe savngs nto her busness than you would f she had not done so? Why? Ths problem s ntended to make
More informationLoop Parallelization
- - Loop Parallelzaton C-52 Complaton steps: nested loops operatng on arrays, sequentell executon of teraton space DECLARE B[..,..+] FOR I :=.. FOR J :=.. I B[I,J] := B[I-,J]+B[I-,J-] ED FOR ED FOR analyze
More informationRing structure of splines on triangulations
www.oeaw.ac.at Rng structure of splnes on trangulatons N. Vllamzar RICAM-Report 2014-48 www.rcam.oeaw.ac.at RING STRUCTURE OF SPLINES ON TRIANGULATIONS NELLY VILLAMIZAR Introducton For a trangulated regon
More informationConversion between the vector and raster data structures using Fuzzy Geographical Entities
Converson between the vector and raster data structures usng Fuzzy Geographcal Enttes Cdála Fonte Department of Mathematcs Faculty of Scences and Technology Unversty of Combra, Apartado 38, 3 454 Combra,
More informationDynamic Cost-Per-Action Mechanisms and Applications to Online Advertising
Dynamc Cost-Per-Acton Mechansms and Applcatons to Onlne Advertsng Hamd Nazerzadeh Amn Saber Rakesh Vohra September 9, 2008 Abstract We examne the problem of allocatng a resource repeatedly over tme amongst
More informationUsing Series to Analyze Financial Situations: Present Value
2.8 Usng Seres to Analyze Fnancal Stuatons: Present Value In the prevous secton, you learned how to calculate the amount, or future value, of an ordnary smple annuty. The amount s the sum of the accumulated
More informationGeneralizing the degree sequence problem
Mddlebury College March 2009 Arzona State Unversty Dscrete Mathematcs Semnar The degree sequence problem Problem: Gven an nteger sequence d = (d 1,...,d n ) determne f there exsts a graph G wth d as ts
More informationAn Empirical Study of Search Engine Advertising Effectiveness
An Emprcal Study of Search Engne Advertsng Effectveness Sanjog Msra, Smon School of Busness Unversty of Rochester Edeal Pnker, Smon School of Busness Unversty of Rochester Alan Rmm-Kaufman, Rmm-Kaufman
More informationAn Overview of Financial Mathematics
An Overvew of Fnancal Mathematcs Wllam Benedct McCartney July 2012 Abstract Ths document s meant to be a quck ntroducton to nterest theory. It s wrtten specfcally for actuaral students preparng to take
More informationTesting The Torah Code Hypothesis: The Experimental Protocol
Testng The Torah Code Hypothess: The Expermental Protocol Robert M. Haralck Computer Scence, Graduate Center Cty Unversty of New York 365 Ffth Avenue New York, NY 10016 Abstract Ths s the second part of
More informationCalibration and Linear Regression Analysis: A Self-Guided Tutorial
Calbraton and Lnear Regresson Analyss: A Self-Guded Tutoral Part The Calbraton Curve, Correlaton Coeffcent and Confdence Lmts CHM314 Instrumental Analyss Department of Chemstry, Unversty of Toronto Dr.
More informationThe descriptive complexity of the family of Banach spaces with the π-property
Arab. J. Math. (2015) 4:35 39 DOI 10.1007/s40065-014-0116-3 Araban Journal of Mathematcs Ghadeer Ghawadrah The descrptve complexty of the famly of Banach spaces wth the π-property Receved: 25 March 2014
More informationAN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE
AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE Yu-L Huang Industral Engneerng Department New Mexco State Unversty Las Cruces, New Mexco 88003, U.S.A. Abstract Patent
More informationTo manage leave, meeting institutional requirements and treating individual staff members fairly and consistently.
Corporate Polces & Procedures Human Resources - Document CPP216 Leave Management Frst Produced: Current Verson: Past Revsons: Revew Cycle: Apples From: 09/09/09 26/10/12 09/09/09 3 years Immedately Authorsaton:
More informationDisagreement-Based Multi-System Tracking
Dsagreement-Based Mult-System Trackng Quannan L 1, Xnggang Wang 2, We Wang 3, Yuan Jang 3, Zh-Hua Zhou 3, Zhuowen Tu 1 1 Lab of Neuro Imagng, Unversty of Calforna, Los Angeles 2 Huazhong Unversty of Scence
More informationAvailability-Based Path Selection and Network Vulnerability Assessment
Avalablty-Based Path Selecton and Network Vulnerablty Assessment Song Yang, Stojan Trajanovsk and Fernando A. Kupers Delft Unversty of Technology, The Netherlands {S.Yang, S.Trajanovsk, F.A.Kupers}@tudelft.nl
More informationDynamic Cost-Per-Action Mechanisms and Applications to Online Advertising
Dynamc Cost-Per-Acton Mechansms and Applcatons to Onlne Advertsng Hamd Nazerzadeh Amn Saber Rakesh Vohra Abstract We examne the problem of allocatng a resource repeatedly over tme amongst a set of agents.
More informationLinear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits
Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.
More informationAddendum to: Importing Skill-Biased Technology
Addendum to: Importng Skll-Based Technology Arel Bursten UCLA and NBER Javer Cravno UCLA August 202 Jonathan Vogel Columba and NBER Abstract Ths Addendum derves the results dscussed n secton 3.3 of our
More informationHeuristic Static Load-Balancing Algorithm Applied to CESM
Heurstc Statc Load-Balancng Algorthm Appled to CESM 1 Yur Alexeev, 1 Sher Mckelson, 1 Sven Leyffer, 1 Robert Jacob, 2 Anthony Crag 1 Argonne Natonal Laboratory, 9700 S. Cass Avenue, Argonne, IL 60439,
More informationHow Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence
1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh
More informationChapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT
Chapter 4 ECOOMIC DISATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the
More informationPRIVATE SCHOOL CHOICE: THE EFFECTS OF RELIGIOUS AFFILIATION AND PARTICIPATION
PRIVATE SCHOOL CHOICE: THE EFFECTS OF RELIIOUS AFFILIATION AND PARTICIPATION Danny Cohen-Zada Department of Economcs, Ben-uron Unversty, Beer-Sheva 84105, Israel Wllam Sander Department of Economcs, DePaul
More informationExistence of an infinite particle limit of stochastic ranking process
Exstence of an nfnte partcle lmt of stochastc rankng process Kumko Hattor Tetsuya Hattor February 8, 23 arxv:84.32v2 [math.pr] 25 Feb 29 ABSTRAT We study a stochastc partcle system whch models the tme
More informationPower-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts
Power-of-wo Polces for Sngle- Warehouse Mult-Retaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)
More informationInterest Rate Fundamentals
Lecture Part II Interest Rate Fundamentals Topcs n Quanttatve Fnance: Inflaton Dervatves Instructor: Iraj Kan Fundamentals of Interest Rates In part II of ths lecture we wll consder fundamental concepts
More informationNMT EE 589 & UNM ME 482/582 ROBOT ENGINEERING. Dr. Stephen Bruder NMT EE 589 & UNM ME 482/582
NMT EE 589 & UNM ME 482/582 ROBOT ENGINEERING Dr. Stephen Bruder NMT EE 589 & UNM ME 482/582 7. Root Dynamcs 7.2 Intro to Root Dynamcs We now look at the forces requred to cause moton of the root.e. dynamcs!!
More informationBrigid Mullany, Ph.D University of North Carolina, Charlotte
Evaluaton And Comparson Of The Dfferent Standards Used To Defne The Postonal Accuracy And Repeatablty Of Numercally Controlled Machnng Center Axes Brgd Mullany, Ph.D Unversty of North Carolna, Charlotte
More information1 Introduction. 2 Prediction with Expert Advice. Online Learning 9.520 Lecture 09
1 Introduction Most of the course is concerned with the batch learning problem. In this lecture, however, we look at a different model, called online. Let us first compare and contrast the two. In batch
More information