Online Learning Applications
|
|
- Brianna Dorsey
- 5 years ago
- Views:
Transcription
1 Online Learning Applicaions Sepember 19, 2016 In he las lecure we saw he following guaranee for minimizing misakes wih Randomized Weighed Majoriy (RWM). Theorem 1 Le M be misakes of RWM and M i he misakes of exper i. Then, RWM saisfies E[M] (1 + ɛ)m i + log n/ɛ. Recall ha o prove his, we kep weighs w (i) on each exper i, and updaed hem as w +1 (i) = (1 m (i)η)w (i). Here m was he misake vecor (oucome). RWM played i wih probabiliy p (i) = w (i)/w, where W = i w (i). This gives W +1 = W (1 ηm p ). We hen used ha any exper ha makes k misakes mus have weigh w 0 (1 η) k. 1 The General Seing There is nohing special abou m being 0-1. So one can consider a more general game. Alernae Game: Online declares disribuion p a ime. Then, naure gives a loss vecor l a ime. Then Online incurs cos p l. We now wan o compare wih he loss of he bes exper in hindsigh. We ge his heorem. Theorem 2 General maser heorem (hm 2.1 in AHK). If losses l [ 1, 1] n and L = p l. For each exper i, L L i + log n + ɛ l (i) ɛ Le us noe a few quick corollaries. Corollary 3 If losses l [0, 1] n, can wrie above as relaive guaranee. L (1 + ɛ)l i + (log n)/ɛ If have gains g [0, 1] n, and wan o maximize i, we ge When losses or gains are in [0, ρ] n, ge G (1 ɛ)g i log n/ɛ G (1 ɛ)g i ρ log n/ɛ This follows by jus feeding g /ρ o he RWM algorihm (gain version). Of course, an analogous guaranee holds for loss. 1
2 Remark: Bw, we noe ha when we run RWM for he gain version, we updae weigh as w +1 (i) = (1 + g (i)η)w (i) Tha is, you wan o increase probabiliy of he expers geing a high gain. If losses or gains have arbirary signs, he following Corollary 4 If l [ 1, 1] n. By balancing he erms, ge average per ime sep regre of 1 log n (L min L i ) O( T i T ). So, o ge ime average regre +ɛ, need log n/ɛ 2 ime seps. If l [ ρ, ρ] n, we need O(ρ 2 log n/ɛ 2 ) ime o ge average regre of ɛ. Analogous bounds holds for gain. 2 Zero sum games Payoff marix M. Row player wans o maximize his gain. Column player wans o minimize. Who should go firs? If Row player plays row x firs, Column player picks y (in second sep) o minimize payoff M(x, y). Le us hink of x and y as indicaor (or more generally disribuions) on rows and columns. Then payoff can be wrien as x T My. Le C(x) = min(x T M)y = min(x T M)e j y denoe he column sraegy (in second sep) given row plays x firs. Here j indexs a column. Similarly, if Row player has o go firs, he mus jus play x ha achieves max x C(x). If column player goes firs and chooses y, row player will pick row i wih maximum e T i My. Call his sraegy for row player R(y) = max x T My = e T x i My The following says (as we would expec) ha he row player never wans o go firs. Fac 1 For any y and x. R(y) = max x x T My x T My min x T My = C(x). y In fac, no maer wha y column player plays in is firs sep, R(y) C(x ), where x is he bes hing row player could have played if we had o go firs. Now, he amazing his is ha if you allow mixed sraegies (randomized over heir choices), he gap disappears. Row player does no care wheher he has o go firs or no. Moreover, he can even publish his sraegy and he column player can opimize all he wans, bu i sill canno gain any advanage! Theorem 5 If you allow mixed (randomized) sraegies, and he payoff marix is finie. I does no maer who goes firs. In oher words, here exis x and ỹ, so ha R(ỹ) = C( x) j 2
3 Proof: By he fac above, R(ỹ) C( x) for any ỹ and x. So, we jus need o prove he oher direcion. Le us scale all enries of payoff marix o be in [ 1, 1]. Will show ha for every ɛ > 0, can find some x and ỹ saisfying he claim of he heorem. Leing ɛ go o 0 will imply he resul. Le us use muliplicaive updae. Row and Column will play a game over rounds. In round, Row player chooses disribuion x, hen Column chooses y o penalize Row mos. So he gain g of row player a ime is g = x T My = min x T y My If row player does MWU, by he corollary for gain version on average we ge ha in T = O((log n)/ɛ 2 ) seps For every i, 1 T x My 1 T max e T i ( i My ) ɛ (1) Le x := (1/T ) x and ỹ = My. To finish proof, noe ha he rhs in (1) is R(ỹ) ɛ. Moreover, if we fix any column j for he column player, we also have ha (1/T ) x My xme j because he column player hurs Row he mos when i choose y. So he lhs in (1) is a mos min xme j = C( x) j This gives C( x) R(ỹ) ɛ, and we are done. 3 Solving LPs approximaely We discuss a MWU based framework for solving LPs approximaely, which can somes gives surprisingly good resuls. We firs discuss he Plokin, Shmoys, Tardos framework for Packing/covering LPs, and laer skech wha is needed for general LP. Consider a packing LP (wih non-negaive A), and where P is some simple polyope. A j x 1 max cx j = 1,..., m x P A useful example o keep in mind is s- maxflow. Insead of he flow conservaion consrains based LP, le us consider a differen equivalen one (jus for ease of descripion). Each edge has a capaciy of 1. We have variable f p for each s- pah p. So he polyope P is jus f p 0. The marix A has a consrains for each edge e, ha f e = (Af) e 1, where f e denoe he flow on edge e. Le us also assume (by binary search) ha he opimum objecive value is known. The resul is he following. 3
4 Theorem 6 Suppose ha given any probabiliy disribuion on rows, you have a fas oracle o find a feasible soluion o cx >= F, p T Ax 1 x P Then one can find a soluion ha saisfies all consrains o wihin 1+ɛ in ime O(ρ log m/ɛ 2 ). Here ρ is he widh, defined as maximum violaion in any consrain for any soluion can be reurned by he oracle. We also remark ha he above resul also holds (easily) wih an approximae oracle p T Ax 1+ɛ. Exercise 7 Show ha he oracle for max-flow example is he shores pah problem. Also, show ha he widh is m. For a general packing LP, he widh can also depend on he coefficiens, bu one can use some ricks o ge rid of his (we will see such a rick laer). Proof: We will use MWU. A key idea is ha he row player will mainain a disribuion on rows, bu use he oracle o learn he righ flow over ime. A ime, he row player gives a disribuion p. The oracle reurns a soluion x () wih p T Ax () 1. Noe ha if no such soluion exiss, his gives an infeasibiliy cerificae. So le us assume his is always possible. Given x (), we feed he gain vecor g = Ax (). By definiion of widh g [0, ρ] m. By he corollary abou posiive gains, we know ha for each j [m], which is p g (1 ɛ) p Ax () (1 ɛ) e j g ρ log m ɛ (Ax () ) j ρ log m ɛ Noe ha he lef hand side is a mos T by he propery of x (). Consider he soluion x = ( x )/T. Then, choosing T = (ρ log m)/ɛ 2 and dividing above by T gives 1 (1 ɛ)(ax () ) j ɛ for every j. So he heorem is proved. The same proof works for covering LPs. For general LPs, he gain/loss vecors can be boh negaive or posiive. So we acually ge a dependence on ρ in he running ime insead of ρ above. Exercise 8 I is insrucive o open he black box and see wha MWU is acually doing. If a consrain/row is violaed oo much, i will ge penalized a lo. So i canno be doing consisenly much worse han he average. 4
5 Mea principle: The following is an ofen appicable mea-principle o remember for applicaions of MWU. If here are several requiremens o be saisfied, bu you can do well for any averaging of he requiremens hen MWU can be used well o find a soluion o almos saisfies all requiremens. 4 Approx Max flow in m 4/3 The above approach gives a roughly (ignoring polylog facors) O(m 2 ) ime algorihm, as he widh is O(m). We will show how o reduce he widh o m 1/2, using elecrical neworks. Laer we will use some simple properies of flows and elecrical neworks o reduce his furher o m 1/3. We remark ha now almos linear ime algorihms are known for his, bu he above is sill a good applicaion of MWU. As previously, we consider he case when c e = 1. I suffices o solve his version, via sandard preprocessing argumens. max F f e 1 Le maxflow be F, which we assume is known. I will be useful o work wih weighs w e direcly insead of probabiliies p e (slighly opening he MWU black box). In his above framework his means ha given w e, we need he oracle o reurn a flow wih value F saisfying w e f e w e. e Recall ha i also suffices o have w e f e (1 + ɛ) e w e. 4.1 Basic elerical neworks Given a graph wih resiances r e on edges, here are wo hings we need o know abou elecrical flows. Fac 2 If we pu volage Φ s = 1 and Φ = 0, hen naure s law is o choose Φ(v) s on remaining nodes o minimize he energy E(Φ) = (Φ(u) Φ(v) 2 )/r e e:e=(u,v) If E if he energy, we call R eff = E he effecive resisance of (s, ). Exercise 9 Take derivaive of energy wr Φ(v) and see ha you ge flow (curren) conservaion. Fac 3 Anoher useful (in fac dual) view is ha if we injec one uni of curren ino s and remove i from, hen naure s law is o choose currens so ha fe 2 r e e:e=(u,v) In fac, his induces Φ s so ha f u,v = (Φ(u) Φ(v))/r e. 5
6 4.2 The Widh m 1/2 oracle The oracle is implemened as follows. Given weighs w e, se resisance r e = w e + ɛw/m, where W = e w e. Consider he leas energy flow, obained by injeced F unis of curren from s o. Le f e be he flow on he edges. Claim 10 Le E be he opimum energy, E (1 + ɛ)w. Proof: Consider a feasible flow of value F saisfying he capaciies. This has energy fe 2 r e r e (1 + ɛ)w e e Claim 11 max e f e (m/ɛ) 1/2. Proof: As he oal energy is a mos W (1 + ɛ), he energy on any edge saisfies. fe 2 r e = fe 2 (w e + ɛw/m) (1 + ɛ)w. So, fe 2 m(1 + ɛ)/ɛ. As previously, we will feed f e as he gain vecors o MWU rouine. So, we wan o bounded he average gain e f ew e Lemma 12 For f e above, we have f e w e (1 + ɛ)w Proof: By Cauchy Schwarz, and he firs claim above ( e f e w e ) 2 ( e f 2 e w e )( e w e ) (1 + ɛ)w 2 Tha s i. This gives good oracle. However, m 3/2 running ime is no oo impressive, as even exac algorihms are known in his ime. 4.3 Improving he widh Though experimen: Widh as defined is a raher brile noion. Wha if only a couple of edges in he flow reurned by he oracle have congesion m 1/2. If we could hrow away hese edges from he graph, he max flow could only decrease by a mos 2. In fac we can afford o hrow away ɛf fracion of he edges. 4.4 Algorihm Le ρ be a parameer ha we will opimize laer. 1. Sar wih w 1 e = 1 iniially. 2. Feed resisances r e = w e + ɛw /m. The oracle reurns flow f e. If f e > ρ, delee e and repea his sep. 3. Updae rule he weighs now as w +1 e = w e(1 + f e/ρ) 6
7 We will ensure ha ρ is chosen in such a way ha he number of edges deleed, call i k, is never more han ɛf. Observaion 1 The above ensures ha here is a sill a maxflow of value of (1 ɛ)f in he graph. So one can sill injec F unis of flow, so ha each edge has congesion a mos 1/(1 ɛ) 1 + ɛ. Running Time of algorihm will be roughly ρm log m/ɛ 2 + km where k is he number edges deleed, because you need o call oracle abou (ρ log m/ɛ 2 ) + k imes. 4.5 Analysis We will choose k m 1/3, as we shall see. Observaion 2 If F k log m, hen we can jus solve he problem using Ford Fulkerson. So le us assume F k. By observaion 1 we can afford o delee k m 1/3 edges and ensure ha e r ef 2 e (1 + 3ɛ)W. By argumen in lemma 12, his ensures Claim 13 w e f e W (1 + 4ɛ). As he weigh increases as W ( + 1) = e w e ()(1 + f e ) W ()(1 + 1/ρ) ρ wih muliplicaive updae, he above implies ha afer l ieraions of weigh updaes, he oal weigh is sill m(1 + 1/ρ) l. If he widh was always less han ρ, we need abou l = (ρ log m)/ɛ 2 ieraions. Undersanding edge deleions: Bu wha happens when we delee an edge. We will find anoher parameer, effecive resisance, ha rises oo fas. Evenually, since he oal weigh (which is he sum of resisances of all he edges) is growing prey slowly, we will ge a bound on he number of deleions by arguing ha he resisance could no have risen so much. If f e ρ, his means ha f 2 e (w e + ɛw/m) ρ 2 R e ρ 2 ɛw/m On he oher hand, he energy used overall is a mos W (1 + 3ɛ). So he energy on e is a leas abou β = ρ 2 ɛ/m fracion of oal energy. The following lemma is key. Lemma If we increase resisance on edges, effecive resisance can only go up. 2. If we delee an edge e wih β fracion of energy consumed, he effecive resisance can go up by a leas 1/(1 β) facor. 7
8 Proof: Pu one vol on s, hen 1/R eff = min v (i,j) e Φ(i) Φ(j) 2 If we increase denominaor and keep he same volages, he expression can only decrease. Now he opimum choice of volages wih hese new resisances can only lower his furher. For he second par, we have As e conribues a leas β fracion of energy, r(ij) Φ(i) Φ(j) 2 1/R eff = min v r(ij) (i,j) (1 β)/r eff (i,j) E\{e} v(i) v(j) 2 Bu he rhs is he energy in he nework using old volages and his edge removed. Opimum choice of volages can only reduce he rhs furher, which he new inverse effecive resisance 1/R eff. So, 1/R eff (1 β)/r eff r(ij) which implies ha R eff R eff /(1 β). So, afer k edge deleions R eff (T ) (1 + β) k R eff0 (1 + β) k (1/m) Effecive resisance iniially mus be a leas 1/m as each edge has 1 resisance. Bu by he rae of rise of weighs, and claim?? above, he oal energy is a mos W 0 (1 + ɛ/ρ) ρ log m/ɛ2 exp(log m/ɛ) As injeced curren F is a leas 1 (infac a leas m 4/3 ), (1 + β) k (1/m) R eff W (T ) exp(log m/ɛ) To opimize running ime se k = ρ. Then we ge (ignoring log facors) ha So, ρ m 1/3 as he resul follows. exp(ρ 3 /m) = exp(log m/ɛ). 8
1 Review of Zero-Sum Games
COS 5: heoreical Machine Learning Lecurer: Rob Schapire Lecure #23 Scribe: Eugene Brevdo April 30, 2008 Review of Zero-Sum Games Las ime we inroduced a mahemaical model for wo player zero-sum games. Any
More informationInventory Analysis and Management. Multi-Period Stochastic Models: Optimality of (s, S) Policy for K-Convex Objective Functions
Muli-Period Sochasic Models: Opimali of (s, S) Polic for -Convex Objecive Funcions Consider a seing similar o he N-sage newsvendor problem excep ha now here is a fixed re-ordering cos (> 0) for each (re-)order.
More informationLecture 2-1 Kinematics in One Dimension Displacement, Velocity and Acceleration Everything in the world is moving. Nothing stays still.
Lecure - Kinemaics in One Dimension Displacemen, Velociy and Acceleraion Everyhing in he world is moving. Nohing says sill. Moion occurs a all scales of he universe, saring from he moion of elecrons in
More informationLecture 2 October ε-approximation of 2-player zero-sum games
Opimizaion II Winer 009/10 Lecurer: Khaled Elbassioni Lecure Ocober 19 1 ε-approximaion of -player zero-sum games In his lecure we give a randomized ficiious play algorihm for obaining an approximae soluion
More informationNotes for Lecture 17-18
U.C. Berkeley CS278: Compuaional Complexiy Handou N7-8 Professor Luca Trevisan April 3-8, 2008 Noes for Lecure 7-8 In hese wo lecures we prove he firs half of he PCP Theorem, he Amplificaion Lemma, up
More information23.2. Representing Periodic Functions by Fourier Series. Introduction. Prerequisites. Learning Outcomes
Represening Periodic Funcions by Fourier Series 3. Inroducion In his Secion we show how a periodic funcion can be expressed as a series of sines and cosines. We begin by obaining some sandard inegrals
More informationE β t log (C t ) + M t M t 1. = Y t + B t 1 P t. B t 0 (3) v t = P tc t M t Question 1. Find the FOC s for an optimum in the agent s problem.
Noes, M. Krause.. Problem Se 9: Exercise on FTPL Same model as in paper and lecure, only ha one-period govenmen bonds are replaced by consols, which are bonds ha pay one dollar forever. I has curren marke
More informationT L. t=1. Proof of Lemma 1. Using the marginal cost accounting in Equation(4) and standard arguments. t )+Π RB. t )+K 1(Q RB
Elecronic Companion EC.1. Proofs of Technical Lemmas and Theorems LEMMA 1. Le C(RB) be he oal cos incurred by he RB policy. Then we have, T L E[C(RB)] 3 E[Z RB ]. (EC.1) Proof of Lemma 1. Using he marginal
More informationFinish reading Chapter 2 of Spivak, rereading earlier sections as necessary. handout and fill in some missing details!
MAT 257, Handou 6: Ocober 7-2, 20. I. Assignmen. Finish reading Chaper 2 of Spiva, rereading earlier secions as necessary. handou and fill in some missing deails! II. Higher derivaives. Also, read his
More information3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon
3..3 INRODUCION O DYNAMIC OPIMIZAION: DISCREE IME PROBLEMS A. he Hamilonian and Firs-Order Condiions in a Finie ime Horizon Define a new funcion, he Hamilonian funcion, H. H he change in he oal value of
More informationPENALIZED LEAST SQUARES AND PENALIZED LIKELIHOOD
PENALIZED LEAST SQUARES AND PENALIZED LIKELIHOOD HAN XIAO 1. Penalized Leas Squares Lasso solves he following opimizaion problem, ˆβ lasso = arg max β R p+1 1 N y i β 0 N x ij β j β j (1.1) for some 0.
More informationLinear Response Theory: The connection between QFT and experiments
Phys540.nb 39 3 Linear Response Theory: The connecion beween QFT and experimens 3.1. Basic conceps and ideas Q: How do we measure he conduciviy of a meal? A: we firs inroduce a weak elecric field E, and
More informationUnit Root Time Series. Univariate random walk
Uni Roo ime Series Univariae random walk Consider he regression y y where ~ iid N 0, he leas squares esimae of is: ˆ yy y y yy Now wha if = If y y hen le y 0 =0 so ha y j j If ~ iid N 0, hen y ~ N 0, he
More information20. Applications of the Genetic-Drift Model
0. Applicaions of he Geneic-Drif Model 1) Deermining he probabiliy of forming any paricular combinaion of genoypes in he nex generaion: Example: If he parenal allele frequencies are p 0 = 0.35 and q 0
More informationt is a basis for the solution space to this system, then the matrix having these solutions as columns, t x 1 t, x 2 t,... x n t x 2 t...
Mah 228- Fri Mar 24 5.6 Marix exponenials and linear sysems: The analogy beween firs order sysems of linear differenial equaions (Chaper 5) and scalar linear differenial equaions (Chaper ) is much sronger
More informationMath 2142 Exam 1 Review Problems. x 2 + f (0) 3! for the 3rd Taylor polynomial at x = 0. To calculate the various quantities:
Mah 4 Eam Review Problems Problem. Calculae he 3rd Taylor polynomial for arcsin a =. Soluion. Le f() = arcsin. For his problem, we use he formula f() + f () + f ()! + f () 3! for he 3rd Taylor polynomial
More informationChapter 2. First Order Scalar Equations
Chaper. Firs Order Scalar Equaions We sar our sudy of differenial equaions in he same way he pioneers in his field did. We show paricular echniques o solve paricular ypes of firs order differenial equaions.
More informationHamilton- J acobi Equation: Explicit Formulas In this lecture we try to apply the method of characteristics to the Hamilton-Jacobi equation: u t
M ah 5 2 7 Fall 2 0 0 9 L ecure 1 0 O c. 7, 2 0 0 9 Hamilon- J acobi Equaion: Explici Formulas In his lecure we ry o apply he mehod of characerisics o he Hamilon-Jacobi equaion: u + H D u, x = 0 in R n
More informationEcon107 Applied Econometrics Topic 7: Multicollinearity (Studenmund, Chapter 8)
I. Definiions and Problems A. Perfec Mulicollineariy Econ7 Applied Economerics Topic 7: Mulicollineariy (Sudenmund, Chaper 8) Definiion: Perfec mulicollineariy exiss in a following K-variable regression
More informationMath 334 Fall 2011 Homework 11 Solutions
Dec. 2, 2 Mah 334 Fall 2 Homework Soluions Basic Problem. Transform he following iniial value problem ino an iniial value problem for a sysem: u + p()u + q() u g(), u() u, u () v. () Soluion. Le v u. Then
More informationLet us start with a two dimensional case. We consider a vector ( x,
Roaion marices We consider now roaion marices in wo and hree dimensions. We sar wih wo dimensions since wo dimensions are easier han hree o undersand, and one dimension is a lile oo simple. However, our
More informationCourse Notes for EE227C (Spring 2018): Convex Optimization and Approximation
Course Noes for EE7C Spring 018: Convex Opimizaion and Approximaion Insrucor: Moriz Hard Email: hard+ee7c@berkeley.edu Graduae Insrucor: Max Simchowiz Email: msimchow+ee7c@berkeley.edu Ocober 15, 018 3
More informationDiebold, Chapter 7. Francis X. Diebold, Elements of Forecasting, 4th Edition (Mason, Ohio: Cengage Learning, 2006). Chapter 7. Characterizing Cycles
Diebold, Chaper 7 Francis X. Diebold, Elemens of Forecasing, 4h Ediion (Mason, Ohio: Cengage Learning, 006). Chaper 7. Characerizing Cycles Afer compleing his reading you should be able o: Define covariance
More informationThe Brock-Mirman Stochastic Growth Model
c December 3, 208, Chrisopher D. Carroll BrockMirman The Brock-Mirman Sochasic Growh Model Brock and Mirman (972) provided he firs opimizing growh model wih unpredicable (sochasic) shocks. The social planner
More informationKINEMATICS IN ONE DIMENSION
KINEMATICS IN ONE DIMENSION PREVIEW Kinemaics is he sudy of how hings move how far (disance and displacemen), how fas (speed and velociy), and how fas ha how fas changes (acceleraion). We say ha an objec
More informationLongest Common Prefixes
Longes Common Prefixes The sandard ordering for srings is he lexicographical order. I is induced by an order over he alphabe. We will use he same symbols (,
More informationOnline Learning, Regret Minimization, Minimax Optimality, and Correlated Equilibrium
Algorihm Online Learning, Regre Minimizaion, Minimax Opimaliy, and Correlaed Equilibrium High level Las ime we discussed noion of Nash equilibrium Saic concep: se of prob Disribuions (p,q, ) such ha nobody
More informationTwo Coupled Oscillators / Normal Modes
Lecure 3 Phys 3750 Two Coupled Oscillaors / Normal Modes Overview and Moivaion: Today we ake a small, bu significan, sep owards wave moion. We will no ye observe waves, bu his sep is imporan in is own
More information10. State Space Methods
. Sae Space Mehods. Inroducion Sae space modelling was briefly inroduced in chaper. Here more coverage is provided of sae space mehods before some of heir uses in conrol sysem design are covered in he
More information( ) is the stretch factor, and x the
(Lecures 7-8) Liddle, Chaper 5 Simple cosmological models (i) Hubble s Law revisied Self-similar srech of he universe All universe models have his characerisic v r ; v = Hr since only his conserves homogeneiy
More informationVehicle Arrival Models : Headway
Chaper 12 Vehicle Arrival Models : Headway 12.1 Inroducion Modelling arrival of vehicle a secion of road is an imporan sep in raffic flow modelling. I has imporan applicaion in raffic flow simulaion where
More informationSome Basic Information about M-S-D Systems
Some Basic Informaion abou M-S-D Sysems 1 Inroducion We wan o give some summary of he facs concerning unforced (homogeneous) and forced (non-homogeneous) models for linear oscillaors governed by second-order,
More informationSeminar 4: Hotelling 2
Seminar 4: Hoelling 2 November 3, 211 1 Exercise Par 1 Iso-elasic demand A non renewable resource of a known sock S can be exraced a zero cos. Demand for he resource is of he form: D(p ) = p ε ε > A a
More informationWe just finished the Erdős-Stone Theorem, and ex(n, F ) (1 1/(χ(F ) 1)) ( n
Lecure 3 - Kövari-Sós-Turán Theorem Jacques Versraëe jacques@ucsd.edu We jus finished he Erdős-Sone Theorem, and ex(n, F ) ( /(χ(f ) )) ( n 2). So we have asympoics when χ(f ) 3 bu no when χ(f ) = 2 i.e.
More informationLecture 33: November 29
36-705: Inermediae Saisics Fall 2017 Lecurer: Siva Balakrishnan Lecure 33: November 29 Today we will coninue discussing he boosrap, and hen ry o undersand why i works in a simple case. In he las lecure
More informationThe Arcsine Distribution
The Arcsine Disribuion Chris H. Rycrof Ocober 6, 006 A common heme of he class has been ha he saisics of single walker are ofen very differen from hose of an ensemble of walkers. On he firs homework, we
More informationTopics in Machine Learning Theory
Topics in Machine Learning Theory The Adversarial Muli-armed Bandi Problem, Inernal Regre, and Correlaed Equilibria Avrim Blum 10/8/14 Plan for oday Online game playing / combining exper advice bu: Wha
More informationThe Residual Graph. 11 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm
Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,
More informationGames Against Nature
Advanced Course in Machine Learning Spring 2010 Games Agains Naure Handous are joinly prepared by Shie Mannor and Shai Shalev-Shwarz In he previous lecures we alked abou expers in differen seups and analyzed
More informationOnline Convex Optimization Example And Follow-The-Leader
CSE599s, Spring 2014, Online Learning Lecure 2-04/03/2014 Online Convex Opimizaion Example And Follow-The-Leader Lecurer: Brendan McMahan Scribe: Sephen Joe Jonany 1 Review of Online Convex Opimizaion
More informationThe Residual Graph. 12 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm
Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,
More informationHamilton- J acobi Equation: Weak S olution We continue the study of the Hamilton-Jacobi equation:
M ah 5 7 Fall 9 L ecure O c. 4, 9 ) Hamilon- J acobi Equaion: Weak S oluion We coninue he sudy of he Hamilon-Jacobi equaion: We have shown ha u + H D u) = R n, ) ; u = g R n { = }. ). In general we canno
More information( ) ( ) if t = t. It must satisfy the identity. So, bulkiness of the unit impulse (hyper)function is equal to 1. The defining characteristic is
UNIT IMPULSE RESPONSE, UNIT STEP RESPONSE, STABILITY. Uni impulse funcion (Dirac dela funcion, dela funcion) rigorously defined is no sricly a funcion, bu disribuion (or measure), precise reamen requires
More informationIMPLICIT AND INVERSE FUNCTION THEOREMS PAUL SCHRIMPF 1 OCTOBER 25, 2013
IMPLICI AND INVERSE FUNCION HEOREMS PAUL SCHRIMPF 1 OCOBER 25, 213 UNIVERSIY OF BRIISH COLUMBIA ECONOMICS 526 We have exensively sudied how o solve sysems of linear equaions. We know how o check wheher
More information) were both constant and we brought them from under the integral.
YIELD-PER-RECRUIT (coninued The yield-per-recrui model applies o a cohor, bu we saw in he Age Disribuions lecure ha he properies of a cohor do no apply in general o a collecion of cohors, which is wha
More informationPhys1112: DC and RC circuits
Name: Group Members: Dae: TA s Name: Phys1112: DC and RC circuis Objecives: 1. To undersand curren and volage characerisics of a DC RC discharging circui. 2. To undersand he effec of he RC ime consan.
More informationApproximation Algorithms for Unique Games via Orthogonal Separators
Approximaion Algorihms for Unique Games via Orhogonal Separaors Lecure noes by Konsanin Makarychev. Lecure noes are based on he papers [CMM06a, CMM06b, LM4]. Unique Games In hese lecure noes, we define
More informationReading from Young & Freedman: For this topic, read sections 25.4 & 25.5, the introduction to chapter 26 and sections 26.1 to 26.2 & 26.4.
PHY1 Elecriciy Topic 7 (Lecures 1 & 11) Elecric Circuis n his opic, we will cover: 1) Elecromoive Force (EMF) ) Series and parallel resisor combinaions 3) Kirchhoff s rules for circuis 4) Time dependence
More informationSolutions to Assignment 1
MA 2326 Differenial Equaions Insrucor: Peronela Radu Friday, February 8, 203 Soluions o Assignmen. Find he general soluions of he following ODEs: (a) 2 x = an x Soluion: I is a separable equaion as we
More informationGMM - Generalized Method of Moments
GMM - Generalized Mehod of Momens Conens GMM esimaion, shor inroducion 2 GMM inuiion: Maching momens 2 3 General overview of GMM esimaion. 3 3. Weighing marix...........................................
More informationINDEX. Transient analysis 1 Initial Conditions 1
INDEX Secion Page Transien analysis 1 Iniial Condiions 1 Please inform me of your opinion of he relaive emphasis of he review maerial by simply making commens on his page and sending i o me a: Frank Mera
More informationSection 3.5 Nonhomogeneous Equations; Method of Undetermined Coefficients
Secion 3.5 Nonhomogeneous Equaions; Mehod of Undeermined Coefficiens Key Terms/Ideas: Linear Differenial operaor Nonlinear operaor Second order homogeneous DE Second order nonhomogeneous DE Soluion o homogeneous
More informationPredator - Prey Model Trajectories and the nonlinear conservation law
Predaor - Prey Model Trajecories and he nonlinear conservaion law James K. Peerson Deparmen of Biological Sciences and Deparmen of Mahemaical Sciences Clemson Universiy Ocober 28, 213 Ouline Drawing Trajecories
More informationLearning a Class from Examples. Training set X. Class C 1. Class C of a family car. Output: Input representation: x 1 : price, x 2 : engine power
Alpaydin Chaper, Michell Chaper 7 Alpaydin slides are in urquoise. Ehem Alpaydin, copyrigh: The MIT Press, 010. alpaydin@boun.edu.r hp://www.cmpe.boun.edu.r/ ehem/imle All oher slides are based on Michell.
More informationStationary Distribution. Design and Analysis of Algorithms Andrei Bulatov
Saionary Disribuion Design and Analysis of Algorihms Andrei Bulaov Algorihms Markov Chains 34-2 Classificaion of Saes k By P we denoe he (i,j)-enry of i, j Sae is accessible from sae if 0 for some k 0
More informationEXERCISES FOR SECTION 1.5
1.5 Exisence and Uniqueness of Soluions 43 20. 1 v c 21. 1 v c 1 2 4 6 8 10 1 2 2 4 6 8 10 Graph of approximae soluion obained using Euler s mehod wih = 0.1. Graph of approximae soluion obained using Euler
More informationChallenge Problems. DIS 203 and 210. March 6, (e 2) k. k(k + 2). k=1. f(x) = k(k + 2) = 1 x k
Challenge Problems DIS 03 and 0 March 6, 05 Choose one of he following problems, and work on i in your group. Your goal is o convince me ha your answer is correc. Even if your answer isn compleely correc,
More informationChristos Papadimitriou & Luca Trevisan November 22, 2016
U.C. Bereley CS170: Algorihms Handou LN-11-22 Chrisos Papadimiriou & Luca Trevisan November 22, 2016 Sreaming algorihms In his lecure and he nex one we sudy memory-efficien algorihms ha process a sream
More informationNetwork Flows: Introduction & Maximum Flow
CSC 373 - lgorihm Deign, nalyi, and Complexiy Summer 2016 Lalla Mouaadid Nework Flow: Inroducion & Maximum Flow We now urn our aenion o anoher powerful algorihmic echnique: Local Search. In a local earch
More informationL07. KALMAN FILTERING FOR NON-LINEAR SYSTEMS. NA568 Mobile Robotics: Methods & Algorithms
L07. KALMAN FILTERING FOR NON-LINEAR SYSTEMS NA568 Mobile Roboics: Mehods & Algorihms Today s Topic Quick review on (Linear) Kalman Filer Kalman Filering for Non-Linear Sysems Exended Kalman Filer (EKF)
More informationSimulation-Solving Dynamic Models ABE 5646 Week 2, Spring 2010
Simulaion-Solving Dynamic Models ABE 5646 Week 2, Spring 2010 Week Descripion Reading Maerial 2 Compuer Simulaion of Dynamic Models Finie Difference, coninuous saes, discree ime Simple Mehods Euler Trapezoid
More informationHW6: MRI Imaging Pulse Sequences (7 Problems for 100 pts)
HW6: MRI Imaging Pulse Sequences (7 Problems for 100 ps) GOAL The overall goal of HW6 is o beer undersand pulse sequences for MRI image reconsrucion. OBJECTIVES 1) Design a spin echo pulse sequence o image
More informationEssential Microeconomics : OPTIMAL CONTROL 1. Consider the following class of optimization problems
Essenial Microeconomics -- 6.5: OPIMAL CONROL Consider he following class of opimizaion problems Max{ U( k, x) + U+ ( k+ ) k+ k F( k, x)}. { x, k+ } = In he language of conrol heory, he vecor k is he vecor
More informationElectrical Circuits. 1. Circuit Laws. Tools Used in Lab 13 Series Circuits Damped Vibrations: Energy Van der Pol Circuit
V() R L C 513 Elecrical Circuis Tools Used in Lab 13 Series Circuis Damped Vibraions: Energy Van der Pol Circui A series circui wih an inducor, resisor, and capacior can be represened by Lq + Rq + 1, a
More informationMachine Learning 4771
ony Jebara, Columbia Universiy achine Learning 4771 Insrucor: ony Jebara ony Jebara, Columbia Universiy opic 20 Hs wih Evidence H Collec H Evaluae H Disribue H Decode H Parameer Learning via JA & E ony
More informationMath 333 Problem Set #2 Solution 14 February 2003
Mah 333 Problem Se #2 Soluion 14 February 2003 A1. Solve he iniial value problem dy dx = x2 + e 3x ; 2y 4 y(0) = 1. Soluion: This is separable; we wrie 2y 4 dy = x 2 + e x dx and inegrae o ge The iniial
More informationContinuous Time. Time-Domain System Analysis. Impulse Response. Impulse Response. Impulse Response. Impulse Response. ( t) + b 0.
Time-Domain Sysem Analysis Coninuous Time. J. Robers - All Righs Reserved. Edied by Dr. Rober Akl 1. J. Robers - All Righs Reserved. Edied by Dr. Rober Akl 2 Le a sysem be described by a 2 y ( ) + a 1
More informationEECE 301 Signals & Systems Prof. Mark Fowler
EECE 3 Signals & Sysems Prof. Mark Fowler Noe Se # Wha are Coninuous-Time Signals??? /6 Coninuous-Time Signal Coninuous Time (C-T) Signal: A C-T signal is defined on he coninuum of ime values. Tha is:
More informationMATH 4330/5330, Fourier Analysis Section 6, Proof of Fourier s Theorem for Pointwise Convergence
MATH 433/533, Fourier Analysis Secion 6, Proof of Fourier s Theorem for Poinwise Convergence Firs, some commens abou inegraing periodic funcions. If g is a periodic funcion, g(x + ) g(x) for all real x,
More information= ( ) ) or a system of differential equations with continuous parametrization (T = R
XIII. DIFFERENCE AND DIFFERENTIAL EQUATIONS Ofen funcions, or a sysem of funcion, are paramerized in erms of some variable, usually denoed as and inerpreed as ime. The variable is wrien as a funcion of
More informationBasic Circuit Elements Professor J R Lucas November 2001
Basic Circui Elemens - J ucas An elecrical circui is an inerconnecion of circui elemens. These circui elemens can be caegorised ino wo ypes, namely acive and passive elemens. Some Definiions/explanaions
More informationPhysics for Scientists & Engineers 2
Direc Curren Physics for Scieniss & Engineers 2 Spring Semeser 2005 Lecure 16 This week we will sudy charges in moion Elecric charge moving from one region o anoher is called elecric curren Curren is all
More informationChapter 6. Systems of First Order Linear Differential Equations
Chaper 6 Sysems of Firs Order Linear Differenial Equaions We will only discuss firs order sysems However higher order sysems may be made ino firs order sysems by a rick shown below We will have a sligh
More informationChapter 7: Solving Trig Equations
Haberman MTH Secion I: The Trigonomeric Funcions Chaper 7: Solving Trig Equaions Le s sar by solving a couple of equaions ha involve he sine funcion EXAMPLE a: Solve he equaion sin( ) The inverse funcions
More informationLie Derivatives operator vector field flow push back Lie derivative of
Lie Derivaives The Lie derivaive is a mehod of compuing he direcional derivaive of a vecor field wih respec o anoher vecor field We already know how o make sense of a direcional derivaive of real valued
More informationR t. C t P t. + u t. C t = αp t + βr t + v t. + β + w t
Exercise 7 C P = α + β R P + u C = αp + βr + v (a) (b) C R = α P R + β + w (c) Assumpions abou he disurbances u, v, w : Classical assumions on he disurbance of one of he equaions, eg. on (b): E(v v s P,
More informationComparing Means: t-tests for One Sample & Two Related Samples
Comparing Means: -Tess for One Sample & Two Relaed Samples Using he z-tes: Assumpions -Tess for One Sample & Two Relaed Samples The z-es (of a sample mean agains a populaion mean) is based on he assumpion
More information16 Max-Flow Algorithms
A process canno be undersood by sopping i. Undersanding mus move wih he flow of he process, mus join i and flow wih i. The Firs Law of Mena, in Frank Herber s Dune (196) There s a difference beween knowing
More informationCHAPTER 12 DIRECT CURRENT CIRCUITS
CHAPTER 12 DIRECT CURRENT CIUITS DIRECT CURRENT CIUITS 257 12.1 RESISTORS IN SERIES AND IN PARALLEL When wo resisors are conneced ogeher as shown in Figure 12.1 we said ha hey are conneced in series. As
More informationMATH 128A, SUMMER 2009, FINAL EXAM SOLUTION
MATH 28A, SUMME 2009, FINAL EXAM SOLUTION BENJAMIN JOHNSON () (8 poins) [Lagrange Inerpolaion] (a) (4 poins) Le f be a funcion defined a some real numbers x 0,..., x n. Give a defining equaion for he Lagrange
More informationOnline Learning with Partial Feedback. 1 Online Mirror Descent with Estimated Gradient
Avance Course in Machine Learning Spring 2010 Online Learning wih Parial Feeback Hanous are joinly prepare by Shie Mannor an Shai Shalev-Shwarz In previous lecures we alke abou he general framework of
More informationLecture 9: September 25
0-725: Opimizaion Fall 202 Lecure 9: Sepember 25 Lecurer: Geoff Gordon/Ryan Tibshirani Scribes: Xuezhi Wang, Subhodeep Moira, Abhimanu Kumar Noe: LaTeX emplae couresy of UC Berkeley EECS dep. Disclaimer:
More information3.1 More on model selection
3. More on Model selecion 3. Comparing models AIC, BIC, Adjused R squared. 3. Over Fiing problem. 3.3 Sample spliing. 3. More on model selecion crieria Ofen afer model fiing you are lef wih a handful of
More informationChapter Three Systems of Linear Differential Equations
Chaper Three Sysems of Linear Differenial Equaions In his chaper we are going o consier sysems of firs orer orinary ifferenial equaions. These are sysems of he form x a x a x a n x n x a x a x a n x n
More informationLearning a Class from Examples. Training set X. Class C 1. Class C of a family car. Output: Input representation: x 1 : price, x 2 : engine power
Alpaydin Chaper, Michell Chaper 7 Alpaydin slides are in urquoise. Ehem Alpaydin, copyrigh: The MIT Press, 010. alpaydin@boun.edu.r hp://www.cmpe.boun.edu.r/ ehem/imle All oher slides are based on Michell.
More informationChapter Floating Point Representation
Chaper 01.05 Floaing Poin Represenaion Afer reading his chaper, you should be able o: 1. conver a base- number o a binary floaing poin represenaion,. conver a binary floaing poin number o is equivalen
More informationFrom Complex Fourier Series to Fourier Transforms
Topic From Complex Fourier Series o Fourier Transforms. Inroducion In he previous lecure you saw ha complex Fourier Series and is coeciens were dened by as f ( = n= C ne in! where C n = T T = T = f (e
More information23.5. Half-Range Series. Introduction. Prerequisites. Learning Outcomes
Half-Range Series 2.5 Inroducion In his Secion we address he following problem: Can we find a Fourier series expansion of a funcion defined over a finie inerval? Of course we recognise ha such a funcion
More informationMATH 5720: Gradient Methods Hung Phan, UMass Lowell October 4, 2018
MATH 5720: Gradien Mehods Hung Phan, UMass Lowell Ocober 4, 208 Descen Direcion Mehods Consider he problem min { f(x) x R n}. The general descen direcions mehod is x k+ = x k + k d k where x k is he curren
More informationSupplement for Stochastic Convex Optimization: Faster Local Growth Implies Faster Global Convergence
Supplemen for Sochasic Convex Opimizaion: Faser Local Growh Implies Faser Global Convergence Yi Xu Qihang Lin ianbao Yang Proof of heorem heorem Suppose Assumpion holds and F (w) obeys he LGC (6) Given
More information2.7. Some common engineering functions. Introduction. Prerequisites. Learning Outcomes
Some common engineering funcions 2.7 Inroducion This secion provides a caalogue of some common funcions ofen used in Science and Engineering. These include polynomials, raional funcions, he modulus funcion
More informationEnsamble methods: Bagging and Boosting
Lecure 21 Ensamble mehods: Bagging and Boosing Milos Hauskrech milos@cs.pi.edu 5329 Senno Square Ensemble mehods Mixure of expers Muliple base models (classifiers, regressors), each covers a differen par
More informationMath 10B: Mock Mid II. April 13, 2016
Name: Soluions Mah 10B: Mock Mid II April 13, 016 1. ( poins) Sae, wih jusificaion, wheher he following saemens are rue or false. (a) If a 3 3 marix A saisfies A 3 A = 0, hen i canno be inverible. True.
More informationProblem Set 5. Graduate Macro II, Spring 2017 The University of Notre Dame Professor Sims
Problem Se 5 Graduae Macro II, Spring 2017 The Universiy of Nore Dame Professor Sims Insrucions: You may consul wih oher members of he class, bu please make sure o urn in your own work. Where applicable,
More information6.2 Transforms of Derivatives and Integrals.
SEC. 6.2 Transforms of Derivaives and Inegrals. ODEs 2 3 33 39 23. Change of scale. If l( f ()) F(s) and c is any 33 45 APPLICATION OF s-shifting posiive consan, show ha l( f (c)) F(s>c)>c (Hin: In Probs.
More informationMATH 31B: MIDTERM 2 REVIEW. x 2 e x2 2x dx = 1. ue u du 2. x 2 e x2 e x2] + C 2. dx = x ln(x) 2 2. ln x dx = x ln x x + C. 2, or dx = 2u du.
MATH 3B: MIDTERM REVIEW JOE HUGHES. Inegraion by Pars. Evaluae 3 e. Soluion: Firs make he subsiuion u =. Then =, hence 3 e = e = ue u Now inegrae by pars o ge ue u = ue u e u + C and subsiue he definiion
More informationToday: Falling. v, a
Today: Falling. v, a Did you ge my es email? If no, make sure i s no in your junk box, and add sbs0016@mix.wvu.edu o your address book! Also please email me o le me know. I will be emailing ou pracice
More informationAppendix to Online l 1 -Dictionary Learning with Application to Novel Document Detection
Appendix o Online l -Dicionary Learning wih Applicaion o Novel Documen Deecion Shiva Prasad Kasiviswanahan Huahua Wang Arindam Banerjee Prem Melville A Background abou ADMM In his secion, we give a brief
More informationHomework sheet Exercises done during the lecture of March 12, 2014
EXERCISE SESSION 2A FOR THE COURSE GÉOMÉTRIE EUCLIDIENNE, NON EUCLIDIENNE ET PROJECTIVE MATTEO TOMMASINI Homework shee 3-4 - Exercises done during he lecure of March 2, 204 Exercise 2 Is i rue ha he parameerized
More informationPhysics 127b: Statistical Mechanics. Fokker-Planck Equation. Time Evolution
Physics 7b: Saisical Mechanics Fokker-Planck Equaion The Langevin equaion approach o he evoluion of he velociy disribuion for he Brownian paricle migh leave you uncomforable. A more formal reamen of his
More information