Barycentric Interpolators for Continuous. Space & Time Reinforcement Learning. Robotics Institute, Carnegie Mellon University
|
|
- June Frederica Wade
- 6 years ago
- Views:
Transcription
1 Barycetrc Iterpolators for Cotuous Space & Tme Reforcemet Learg Rem Muos & Adrew Moore Robotcs Isttute, Carege Mello Uversty Pttsburgh, PA 15213, USA. E-mal:fmuos, Category : Reforcemet Learg ad Cotrol Preferece : oral presetato Abstract I order to d the optmal cotrol of cotuous state-space ad tme reforcemet learg (RL) problems, we appromate the value fucto (F) wth a partcular class of fuctos called the barycetrc terpolators. We establsh sucet codtos uder whch a RL algorthm coverges to the optmal F, eve whe we use appromate models of the state dyamcs ad the reforcemet fuctos. 1 INTRODUCTION I order to appromate the value fucto (F) of a cotuous state-space ad tme reforcemet learg (RL) problem, we dee a partcular class of fuctos called the barycetrc terpolator, that use some terpolato process based o te sets of pots. Ths class of fuctos, cludg cotuous or dscotuous pecewse lear ad mult-lear fuctos, provdes us wth a geeral method for desgg RL algorthms that coverge to the optmal value fucto. Ideed these fuctos permt us to dscretze the HJB equato of the cotuous cotrol problem by a cosstet (ad thus coverget) appromato scheme, whch s solved by usg some model of the state dyamcs ad the reforcemet fuctos. Secto 2 dees the barycetrc terpolators. Secto 3 descrbes the optmal cotrol problem the determstc cotuous case. Secto 4 states the covergece result for RL algorthms by gvg sucet codtos o the appled model. Secto 5 gves some computatoal ssues for ths method, ad Secto 6 descrbes the appromato scheme used here ad proves the covergece result.
2 2 DEFINITION OF BARYCENTRIC INTERPOLATORS Let = f g be a set of pots dstrbuted at some resoluto (see (4) below) o the state space of dmeso d. For ay state sde some smple ( 1 ; :::; ), we say that s the baryceter of the f g =1:: sde ths smple wth postve coecets p(j ) of sum 1, called the barycetrc coordates, f = P =1:: p(j ):. Let ( ) be the value of the fucto at the pots. s a barycetrc terpolator f for ay state whch s the baryceter of the pots f g =1:: for some smple ( 1 ; :::; ), wth the barycetrc coordates p(j ), we have : () = X =1:: p(j ): ( ) (1) Moreover we assume that the smple ( 1 ; :::; ) s of dameter O(). Let us descrbe some smple barycetrc terpolators : Pecewse lear fuctos deed by some tragulato o the state space (thus deg cotuous fuctos), see gure 1.a, or deed at ay by a lear combato of (d +1)values at ay pots ( 1 ; :::; d+1 ) 3 (such fuctos may be dscotuous at some boudares), see gure 1.b. Pecewse mult-lear fuctos deed by a mult-lear combato of the 2 d values at the vertces of d-dmesoal rectagles, see gure 1.c. I ths case as well, we ca buld cotuous terpolatos or allow dscotutes at the boudares of the rectagles. A mportat pot s that the covergece result stated Secto 4 does ot requre the cotuty of the fucto. Ths permts us to buld varable resoluto tragulatos (see gure 1.b) or grd (gure 1.c) easly. (a) (b) (c) Fgure 1: Some eamples of barycetrc appromators. These are pecewse cotuous (a) or dscotuous (b) lear or mult-lear (c) terpolators. Remark 1 I the geeral case, for a gve, the choce of a smple ( 1 ; :::; ) 3 s ot uque (see the two sets of grey ad black pots gure 1.b ad 1.c), ad oce the smple ( 1 ; :::; ) 3 s deed, f >d+1 (for eample gure 1.c), the the choce of the barycetrc coordates p(j ) s also ot uque. Remark 2 Depedg o the terpolato method we use, the tme eeded for computg the values wll vary. Followg [Dav96], the cotuous mult-lear terpolato must process 2 d values, whereas the lear cotuous terpolato sde a smple processes (d + 1) values O(d log d) tme.
3 I comparso to [Gor95], the fuctos used here are averagers that satsfy the barycetrc terpolato property (1). Ths addtoal geometrc costrat permts us to prove the cosstecy (see (15) below) of the appromato scheme ad thus the covergece to the optmal value the cotuous tme case. 3 THE OPTIMAL CONTROL PROBLEM Let us descrbe the optmal cotrol problem the determstc ad dscouted case for cotuous state-space ad tme varables ad dee the value fucto that we ted to appromate. We cosder a dyamcal system whose state dyamcs depeds o the curret state (t) 2 O (the state-space, wth O a ope subset of IR d ) ad cotrol u(t) 2 U (compact subset) by a deretal equato : d = f((t);u(t)) (2) dt From equato (2), the choce of a tal state ad a cotrol fucto u(t) leads to a uque trajectores (t) (see gure 2). Let be the et tme from O (wth the coveto that f (t) always stays O, the = 1). The, we dee the fuctoal J as the dscouted cumulatve reforcemet: J(; u(:)) = Z 0 t r((t);u(t))dt + R(()) where r(; u) s the rug reforcemet ad R() the boudary reforcemet. s the dscout factor (0 <1). We assume that f, r ad R are bouded ad Lpschtza, ad that the s C 2. RL uses the method of Dyamc Programmg (DP) that troduces the value fucto (F) : the mamal value of J as a fucto of tal state : () = sup J(; u(:)): u(:) From the DP prcple, we deduce that satses a rst-order deretal equato, called the Hamlto-Jacob-Bellma (HJB) equato (see [FS93] for a survey) : Theorem 1 If s deretable at 2 O, let D () be the gradet of at, the the followg HJB equato holds at. H(; D; ) def = ()l + sup[d ():f(; u)+ r(; u)] = 0 (3) u2u The challege of RL s to get a good appromato of the F, because from we ca deduce the optmal cotrol : for state, the cotrol u () that realzes the supremum the HJB equato provdes a optmal (feed-back) cotrol law. The followg hypothess s a sucet codto for to be cotuous wth O (see [Bar94]) ad s requred for provg the covergece result of the et secto. Hyp 1: For let,! () be the outward ormal of O at, we assume that : -If 9u 2 U; s.t. f(; u):,! () 0 the 9v 2 U; s.t. f(; v),! () < 0: -If 9u 2 U; s.t. f(; u):,! () 0 the 9v 2 U; s.t. f(; v),! () > 0: whch meas that at the states (f there est ay) where some trajectory s taget to the boudary, there ests, for some cotrol, a trajectory strctly comg sde ad oe strctly leavg the state space.
4 O f(,u) 2 1 η η 3 (t) ( τ) Fgure 2: The state space ad the set of pots (the black dots belog to the teror ad the whte oes to the boudary). The value at some pot s updated, at step, by the dscouted value at pot 2 ( 1; 2; 3). The ma requremet for covergece s that the pots appromate the sese : p( j ) = p(j )+O() (.e. the belog to the grey area). 4 THE CONERGENCE RESULT Let us troduce the set of pots = f g, composed of the teror ( \ O) ad the boudary (@ = O), such that ts cove hull covers the state space O, ad performg a dscretzato at some resoluto : 8 2 O; f jj, jj ad 8 f jj, j jj (4) 2 \O j2@ Moreover, we appromate the cotrol space U by some te cotrol spaces U U such that for 0, U 0 U ad lm!0 U = U. We would lke to update the value of ay: - teror pot 2 \ O wth the dscouted values at state (; u) (gure 2) : h +1() sup (;u) ( (; u)) + (; u):r (; u) (5) u2u for some state (; u), some tme delay (; u) ad some reforcemet r (; u). - boudary pot wth some termal reforcemet R () : +1 () R () (6) The followg theorem states that the values computed by a RL algorthm usg the model (because of some a pror partal ucertaty of the state dyamcs ad the reforcemet fuctos) (; u), (; u), r (; u) ad R () coverge to the optmal value fucto as the umber of teratos! 1ad the resoluto! 0. Let us dee the state (; u) (see gure 2) : (; u) = + (; u):f(; u) (7) for some tme delay (; u) (wth k 1 (; u) k 2 for some costats k 1 > 0 ad k 2 > 0), ad let p(j ) (resp. p( j )) be the barycetrc coordate of sde a smple cotag t (resp. sde the same smple). We wll wrte,,, r,..., stead of (; u), (; u), (; u), r(; u),... whe o cofuso s possble. Theorem 2 Assume that the hypotheses of the prevous sectos hold, ad that for ay resoluto, we use barycetrc terpolators deed o state spaces (satsfyg (4)) such that all pots of \ O are regularly updated wth rule (5) ad all pots are updated wth rule (6) at least oce. Suppose that,, r ad R appromate,, r ad R the sese : 8 ;p( j ) = p(j )+O() (8) = + O( 2 ) (9) r = r + O() (10) R = R + O() (11)
5 the we have lm!1 = uformly o ay compact O (.e. 8" >0; 8!0 compact O; 9; 9N, such that 8 ; 8 N;sup \ j, j"). Remark 3 For a gve value of, the rule (5) s ot a DP updatg rule for some Markov Decso Problem (MDP) sce the values ; ;r deped o. Ths pot s mportat the RL framework sce ths allows o-le mprovemet of the model of the state dyamcs ad the reforcemet fuctos. Remark 4 Ths result eteds the prevous results of covergece obtaed by Fte-Elemet or Fte-Derece methods (see [Mu97]). Ths theoretcal result ca be appled by startg from a rough (hgh ) ad by combg to the terato process (!1) some learg process of the model (! ) ad a creasg process of the umberofpots (! 0). 5 COMPUTATIONAL ISSUES From (8) we deduce that the method wll also coverge f we use a appromate barycetrc terpolator, deed at ay state 2 ( 1 ; :::; )by the value of the barycetrc terpolator at some state 0 2 ( 1 ; :::; ) such that p( 0 j )=p(j )+ O() (see gure 3). The fact that we eed ot be completely accurate ca be Appro-lear Lear O( δ) Fgure 3: The lear fucto ad the appromato error aroud t (the grey area). The value of the appromate lear fucto plotted here at some state s equal to the value of the lear oe at 0. Ay such appromate baryceter terpolator ca be used (5). used to our advatage. Frst, the computato of barycetrc coordates ca use very fast appromate matr methods. Secod, the model we use to tegrate the dyamcs eed ot be perfect. We ca make ao( 2 ) error, whch s useful f we are learg a model from data: we eed smply arrage to ot gather more data tha s ecessary for the curret. For eample, f we use earest eghbor for our dyamcs learg, we eed to esure eough data so that every observato s O( 2 ) from ts earest eghbor. If we use local regresso, the a mere O() desty s all that s requred [Omo87, AMS97]. 6 PROOF OF THE CONERGENCE RESULT 6.1 Descrpto of the appromato scheme We use a coverget scheme derved from Kusher (see [Kus90]) order to appromate the cotuous cotrol problem by a te MDP. The HJB equato s dscretzed, at some resoluto, to the followg DP equato : for 2 \ O, () =F (:) () def = sup u2u P p(j ): ( )+:r ad for () =R(). Ths s a ed-pot equato ad we ca prove that, thaks to the dscout factor, t satses the \strog" cotracto property: sup o (12) +1, : sup, for some <1 (13)
6 from whch we deduce that there ests eactly oe soluto to the DP equato, whch ca be computed by some value terato process : for ay tal 0,we terate +1 F.Thus for ay resoluto, the values! as!1. Moreover, as s a barycetrc terpolator ad from the deto (7) of, F (:) () = sup u2u ( + :f(; u)) + :r (14) from whch we deduce that the scheme F s cosstet : a formal sese, lm sup!0 1 jf [W ](), W ()j H(W;DW;) (15) ad obta, from the geeral covergece theorem of [BS91] (ad a result of strog ucty obtaed from hyp.1), the covergece of the scheme :! as! Use of the \weak cotracto" result of covergece Sce the RL approach used here, we oly have a appromato,,... of the true values,,..., the strog cotracto property (13) does ot hold ay more. However, prevous work ([Mu98]), we have prove the covergece for some weakeed codtos, recalled here : If the values updated by some algorthm satsfy the \weak" cotracto property wth respect to a soluto of a coverget appromato scheme (such as the prevous oe (12)) : sup \O +1, (1, k:): sup, + o() (16), +1 = O() (17) for some postve costat k, (wth the otato f() o() 9g() = o() wth f() g()) the we have lm!1 = uformly o ay compact O!0 (.e. 8" > 0, 8 compact O, 9 ad N such that 8 ; 8 N, sup \, "). 6.3 Proof of theorem 2 We are gog to use the appromatos (8), (9), (10) ad (11) to deduce that the weak cotracto property holds, ad the use the result of the prevous secto to prove theorem 2. The proof of (17) s mmedate sce, from (6) ad (11) we have :8 +1(), () = jr (), R()j = O() Now we eed to prove (16). Let us estmate the error E () = (), () betwee the value of the DP equato (12) ad the values computed by rule (5) after oe terato : E +1 () = sup u2u E +1 () = sup u2u P p(j ): ( ), p( j ): ( ) + :r, :r o P P [p(j ), p( j )] ( )+[, ] p( j ): ( ) o + P p( j ): ( ), ( ) + [r, r ]+[, ] r By usg (9) (from whch we deduce : = + O( 2 )) ad (10), we deduce : je +1 ()j sup u2u : P [p(j ), p( j )] ( ) + P p( j ): ( ), ( ) o + O( 2 ): (18)
7 From the basc propertes of the coecets p(j ) ad p( j )wehave: P [p(j ), p( j )] ( )= P [p(j ), p( j )] ( ), () (19) Moreover, j ( ), ()j j ( ), ( )j + j ( ), ()j + j (), ()j:, #0 From the covergece of the scheme,wehave sup \! 0 for ay compact O ad from the cotuty of ad the fact that the support of the smple fg 3 s O(), we have sup \ j ( ), ()j #0! 0 ad deduce that : sup \ ( ), () #0 X [p(j), p( j)] ( )! 0. Thus, from (19) ad (8), we obta : = o() (20) The \weak" cotracto property (16) holds : from the property of the epoetal fucto 1, l 1 for small values of 2, from (9) ad that k 1,we deduce that deduce that : +1(), () (1, k:) sup 1, k1 2 l 1 + O(2 ), ad from (18) ad (20) we +1(), () + o() wth k = k1 l 1, ad the property (16) holds. Thus the \weak cotracto" result 2 of covergece (descrbed secto 6.2) apples ad covergece occurs. FUTURE WORK Ths work proves the covergece to the optmal value as the resoluto teds to the lmt, but does ot provde us wth the rate of covergece. Our future work wll focus o deg upper bouds of the appromato error, especally for varable resoluto dscretzatos, ad we wll also cosder the stochastc case. Refereces [AMS97] C. G. Atkeso, A. W. Moore, ad S. A. Schaal. Locally Weghted Learg. AI Revew, 11:11{73, Aprl [Bar94] Guy Barles. Solutos de vscoste des equatos de Hamlto-Jacob, volume 17 of Mathematques et Applcatos. Sprger-erlag, [BS91] Guy Barles ad P.E. Sougads. Covergece of appromato schemes for fully olear secod order equatos. Asymptotc Aalyss, 4:271{283, [Dav96] [FS93] [Gor95] [Kus90] Scott Daves. Multdmesoal tragulato ad terpolato for reforcemet learg. Advaces Neural Iformato Processg Systems, 8, Wedell H. Flemg ad H. Mete Soer. Cotrolled Markov Processes ad scosty Solutos. Applcatos of Mathematcs. Sprger-erlag, G. Gordo. Stable fucto appromato dyamc programmg. Iteratoal Coferece o Mache Learg, Harold J. Kusher. Numercal methods for stochastc cotrol problems cotuous tme. SIAM J. Cotrol ad Optmzato, 28:999{1048, [Mu97] Rem Muos. A coverget reforcemet learg algorthm the cotuous case based o a te derece method. Iteratoal Jot Coferece o Artcal Itellgece, [Mu98] Rem Muos. A geeral covergece theorem for reforcemet learg the cotuous case. Europea Coferece o Mache Learg, [Omo87] S. M. Omohudro. Ecet Algorthms wth Neural Network Behavour. Joural of Comple Systems, 1(2):273{347, 1987.
Feature Selection: Part 2. 1 Greedy Algorithms (continued from the last lecture)
CSE 546: Mache Learg Lecture 6 Feature Selecto: Part 2 Istructor: Sham Kakade Greedy Algorthms (cotued from the last lecture) There are varety of greedy algorthms ad umerous amg covetos for these algorthms.
More informationStrong Convergence of Weighted Averaged Approximants of Asymptotically Nonexpansive Mappings in Banach Spaces without Uniform Convexity
BULLETIN of the MALAYSIAN MATHEMATICAL SCIENCES SOCIETY Bull. Malays. Math. Sc. Soc. () 7 (004), 5 35 Strog Covergece of Weghted Averaged Appromats of Asymptotcally Noepasve Mappgs Baach Spaces wthout
More informationCSE 5526: Introduction to Neural Networks Linear Regression
CSE 556: Itroducto to Neural Netorks Lear Regresso Part II 1 Problem statemet Part II Problem statemet Part II 3 Lear regresso th oe varable Gve a set of N pars of data , appromate d by a lear fucto
More informationFunctions of Random Variables
Fuctos of Radom Varables Chapter Fve Fuctos of Radom Varables 5. Itroducto A geeral egeerg aalyss model s show Fg. 5.. The model output (respose) cotas the performaces of a system or product, such as weght,
More informationChapter 5. Curve fitting
Chapter 5 Curve ttg Assgmet please use ecell Gve the data elow use least squares regresso to t a a straght le a power equato c a saturato-growthrate equato ad d a paraola. Fd the r value ad justy whch
More informationRegression and the LMS Algorithm
CSE 556: Itroducto to Neural Netorks Regresso ad the LMS Algorthm CSE 556: Regresso 1 Problem statemet CSE 556: Regresso Lear regresso th oe varable Gve a set of N pars of data {, d }, appromate d b a
More information1 Lyapunov Stability Theory
Lyapuov Stablty heory I ths secto we cosder proofs of stablty of equlbra of autoomous systems. hs s stadard theory for olear systems, ad oe of the most mportat tools the aalyss of olear systems. It may
More informationIntroduction to local (nonparametric) density estimation. methods
Itroducto to local (oparametrc) desty estmato methods A slecture by Yu Lu for ECE 66 Sprg 014 1. Itroducto Ths slecture troduces two local desty estmato methods whch are Parze desty estmato ad k-earest
More informationA Remark on the Uniform Convergence of Some Sequences of Functions
Advaces Pure Mathematcs 05 5 57-533 Publshed Ole July 05 ScRes. http://www.scrp.org/joural/apm http://dx.do.org/0.436/apm.05.59048 A Remark o the Uform Covergece of Some Sequeces of Fuctos Guy Degla Isttut
More informationPGE 310: Formulation and Solution in Geosystems Engineering. Dr. Balhoff. Interpolation
PGE 30: Formulato ad Soluto Geosystems Egeerg Dr. Balhoff Iterpolato Numercal Methods wth MATLAB, Recktewald, Chapter 0 ad Numercal Methods for Egeers, Chapra ad Caale, 5 th Ed., Part Fve, Chapter 8 ad
More informationResearch Article A New Iterative Method for Common Fixed Points of a Finite Family of Nonexpansive Mappings
Hdaw Publshg Corporato Iteratoal Joural of Mathematcs ad Mathematcal Sceces Volume 009, Artcle ID 391839, 9 pages do:10.1155/009/391839 Research Artcle A New Iteratve Method for Commo Fxed Pots of a Fte
More informationMu Sequences/Series Solutions National Convention 2014
Mu Sequeces/Seres Solutos Natoal Coveto 04 C 6 E A 6C A 6 B B 7 A D 7 D C 7 A B 8 A B 8 A C 8 E 4 B 9 B 4 E 9 B 4 C 9 E C 0 A A 0 D B 0 C C Usg basc propertes of arthmetc sequeces, we fd a ad bm m We eed
More information( ) = ( ) ( ) Chapter 13 Asymptotic Theory and Stochastic Regressors. Stochastic regressors model
Chapter 3 Asmptotc Theor ad Stochastc Regressors The ature of eplaator varable s assumed to be o-stochastc or fed repeated samples a regresso aalss Such a assumpto s approprate for those epermets whch
More informationLecture 7. Confidence Intervals and Hypothesis Tests in the Simple CLR Model
Lecture 7. Cofdece Itervals ad Hypothess Tests the Smple CLR Model I lecture 6 we troduced the Classcal Lear Regresso (CLR) model that s the radom expermet of whch the data Y,,, K, are the outcomes. The
More informationUnsupervised Learning and Other Neural Networks
CSE 53 Soft Computg NOT PART OF THE FINAL Usupervsed Learg ad Other Neural Networs Itroducto Mture Destes ad Idetfablty ML Estmates Applcato to Normal Mtures Other Neural Networs Itroducto Prevously, all
More informationA conic cutting surface method for linear-quadraticsemidefinite
A coc cuttg surface method for lear-quadratcsemdefte programmg Mohammad R. Osoorouch Calfora State Uversty Sa Marcos Sa Marcos, CA Jot wor wth Joh E. Mtchell RPI July 3, 2008 Outle: Secod-order coe: defto
More information. The set of these sums. be a partition of [ ab, ]. Consider the sum f( x) f( x 1)
Chapter 7 Fuctos o Bouded Varato. Subject: Real Aalyss Level: M.Sc. Source: Syed Gul Shah (Charma, Departmet o Mathematcs, US Sargodha Collected & Composed by: Atq ur Rehma (atq@mathcty.org, http://www.mathcty.org
More informationBayes (Naïve or not) Classifiers: Generative Approach
Logstc regresso Bayes (Naïve or ot) Classfers: Geeratve Approach What do we mea by Geeratve approach: Lear p(y), p(x y) ad the apply bayes rule to compute p(y x) for makg predctos Ths s essetally makg
More informationChapter 5 Properties of a Random Sample
Lecture 6 o BST 63: Statstcal Theory I Ku Zhag, /0/008 Revew for the prevous lecture Cocepts: t-dstrbuto, F-dstrbuto Theorems: Dstrbutos of sample mea ad sample varace, relatoshp betwee sample mea ad sample
More information1 0, x? x x. 1 Root finding. 1.1 Introduction. Solve[x^2-1 0,x] {{x -1},{x 1}} Plot[x^2-1,{x,-2,2}] 3
Adrew Powuk - http://www.powuk.com- Math 49 (Numercal Aalyss) Root fdg. Itroducto f ( ),?,? Solve[^-,] {{-},{}} Plot[^-,{,-,}] Cubc equato https://e.wkpeda.org/wk/cubc_fucto Quartc equato https://e.wkpeda.org/wk/quartc_fucto
More informationInitial-Value Problems for ODEs. numerical errors (round-off and truncation errors) Consider a perturbed system: dz dt
Ital-Value Problems or ODEs d GIVEN: t t,, a FIND: t or atb umercal errors (roud-o ad trucato errors) Cosder a perturbed sstem: dz t, z t, at b z a a Does z(t) (t)? () (uqueess) a uque soluto (t) exsts
More informationChapter 14 Logistic Regression Models
Chapter 4 Logstc Regresso Models I the lear regresso model X β + ε, there are two types of varables explaatory varables X, X,, X k ad study varable y These varables ca be measured o a cotuous scale as
More informationNumerical Simulations of the Complex Modied Korteweg-de Vries Equation. Thiab R. Taha. The University of Georgia. Abstract
Numercal Smulatos of the Complex Moded Korteweg-de Vres Equato Thab R. Taha Computer Scece Departmet The Uversty of Georga Athes, GA 002 USA Tel 0-542-2911 e-mal thab@cs.uga.edu Abstract I ths paper mplemetatos
More informationLINEARLY CONSTRAINED MINIMIZATION BY USING NEWTON S METHOD
Jural Karya Asl Loreka Ahl Matematk Vol 8 o 205 Page 084-088 Jural Karya Asl Loreka Ahl Matematk LIEARLY COSTRAIED MIIMIZATIO BY USIG EWTO S METHOD Yosza B Dasrl, a Ismal B Moh 2 Faculty Electrocs a Computer
More informationPart 4b Asymptotic Results for MRR2 using PRESS. Recall that the PRESS statistic is a special type of cross validation procedure (see Allen (1971))
art 4b Asymptotc Results for MRR usg RESS Recall that the RESS statstc s a specal type of cross valdato procedure (see Alle (97)) partcular to the regresso problem ad volves fdg Y $,, the estmate at the
More informationThe Mathematical Appendix
The Mathematcal Appedx Defto A: If ( Λ, Ω, where ( λ λ λ whch the probablty dstrbutos,,..., Defto A. uppose that ( Λ,,..., s a expermet type, the σ-algebra o λ λ λ are defed s deoted by ( (,,...,, σ Ω.
More informationLecture 12 APPROXIMATION OF FIRST ORDER DERIVATIVES
FDM: Appromato of Frst Order Dervatves Lecture APPROXIMATION OF FIRST ORDER DERIVATIVES. INTRODUCTION Covectve term coservato equatos volve frst order dervatves. The smplest possble approach for dscretzato
More informationECON 5360 Class Notes GMM
ECON 560 Class Notes GMM Geeralzed Method of Momets (GMM) I beg by outlg the classcal method of momets techque (Fsher, 95) ad the proceed to geeralzed method of momets (Hase, 98).. radtoal Method of Momets
More informationRademacher Complexity. Examples
Algorthmc Foudatos of Learg Lecture 3 Rademacher Complexty. Examples Lecturer: Patrck Rebesch Verso: October 16th 018 3.1 Itroducto I the last lecture we troduced the oto of Rademacher complexty ad showed
More informationBounds on the expected entropy and KL-divergence of sampled multinomial distributions. Brandon C. Roy
Bouds o the expected etropy ad KL-dvergece of sampled multomal dstrbutos Brado C. Roy bcroy@meda.mt.edu Orgal: May 18, 2011 Revsed: Jue 6, 2011 Abstract Iformato theoretc quattes calculated from a sampled
More informationRuntime analysis RLS on OneMax. Heuristic Optimization
Lecture 6 Rutme aalyss RLS o OeMax trals of {,, },, l ( + ɛ) l ( ɛ)( ) l Algorthm Egeerg Group Hasso Platter Isttute, Uversty of Potsdam 9 May T, We wat to rgorously uderstad ths behavor 9 May / Rutme
More informationCubic Nonpolynomial Spline Approach to the Solution of a Second Order Two-Point Boundary Value Problem
Joural of Amerca Scece ;6( Cubc Nopolyomal Sple Approach to the Soluto of a Secod Order Two-Pot Boudary Value Problem W.K. Zahra, F.A. Abd El-Salam, A.A. El-Sabbagh ad Z.A. ZAk * Departmet of Egeerg athematcs
More informationUNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS
UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS Postpoed exam: ECON430 Statstcs Date of exam: Jauary 0, 0 Tme for exam: 09:00 a.m. :00 oo The problem set covers 5 pages Resources allowed: All wrtte ad prted
More informationLecture 16: Backpropogation Algorithm Neural Networks with smooth activation functions
CO-511: Learg Theory prg 2017 Lecturer: Ro Lv Lecture 16: Bacpropogato Algorthm Dsclamer: These otes have ot bee subected to the usual scruty reserved for formal publcatos. They may be dstrbuted outsde
More informationSupervised learning: Linear regression Logistic regression
CS 57 Itroducto to AI Lecture 4 Supervsed learg: Lear regresso Logstc regresso Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square CS 57 Itro to AI Data: D { D D.. D D Supervsed learg d a set of eamples s
More informationSolving Constrained Flow-Shop Scheduling. Problems with Three Machines
It J Cotemp Math Sceces, Vol 5, 2010, o 19, 921-929 Solvg Costraed Flow-Shop Schedulg Problems wth Three Maches P Pada ad P Rajedra Departmet of Mathematcs, School of Advaced Sceces, VIT Uversty, Vellore-632
More informationPTAS for Bin-Packing
CS 663: Patter Matchg Algorthms Scrbe: Che Jag /9/00. Itroducto PTAS for B-Packg The B-Packg problem s NP-hard. If we use approxmato algorthms, the B-Packg problem could be solved polyomal tme. For example,
More informationC-1: Aerodynamics of Airfoils 1 C-2: Aerodynamics of Airfoils 2 C-3: Panel Methods C-4: Thin Airfoil Theory
ROAD MAP... AE301 Aerodyamcs I UNIT C: 2-D Arfols C-1: Aerodyamcs of Arfols 1 C-2: Aerodyamcs of Arfols 2 C-3: Pael Methods C-4: Th Arfol Theory AE301 Aerodyamcs I Ut C-3: Lst of Subects Problem Solutos?
More informationLecture 3 Probability review (cont d)
STATS 00: Itroducto to Statstcal Iferece Autum 06 Lecture 3 Probablty revew (cot d) 3. Jot dstrbutos If radom varables X,..., X k are depedet, the ther dstrbuto may be specfed by specfyg the dvdual dstrbuto
More information5 Short Proofs of Simplified Stirling s Approximation
5 Short Proofs of Smplfed Strlg s Approxmato Ofr Gorodetsky, drtymaths.wordpress.com Jue, 20 0 Itroducto Strlg s approxmato s the followg (somewhat surprsg) approxmato of the factoral,, usg elemetary fuctos:
More informationChapter 4 (Part 1): Non-Parametric Classification (Sections ) Pattern Classification 4.3) Announcements
Aoucemets No-Parametrc Desty Estmato Techques HW assged Most of ths lecture was o the blacboard. These sldes cover the same materal as preseted DHS Bometrcs CSE 90-a Lecture 7 CSE90a Fall 06 CSE90a Fall
More informationA tighter lower bound on the circuit size of the hardest Boolean functions
Electroc Colloquum o Computatoal Complexty, Report No. 86 2011) A tghter lower boud o the crcut sze of the hardest Boolea fuctos Masak Yamamoto Abstract I [IPL2005], Fradse ad Mlterse mproved bouds o the
More information( ) 2 2. Multi-Layer Refraction Problem Rafael Espericueta, Bakersfield College, November, 2006
Mult-Layer Refracto Problem Rafael Espercueta, Bakersfeld College, November, 006 Lght travels at dfferet speeds through dfferet meda, but refracts at layer boudares order to traverse the least-tme path.
More informationBlock-Based Compact Thermal Modeling of Semiconductor Integrated Circuits
Block-Based Compact hermal Modelg of Semcoductor Itegrated Crcuts Master s hess Defese Caddate: Jg Ba Commttee Members: Dr. Mg-Cheg Cheg Dr. Daqg Hou Dr. Robert Schllg July 27, 2009 Outle Itroducto Backgroud
More informationCOMPROMISE HYPERSPHERE FOR STOCHASTIC DOMINANCE MODEL
Sebasta Starz COMPROMISE HYPERSPHERE FOR STOCHASTIC DOMINANCE MODEL Abstract The am of the work s to preset a method of rakg a fte set of dscrete radom varables. The proposed method s based o two approaches:
More informationα1 α2 Simplex and Rectangle Elements Multi-index Notation of polynomials of degree Definition: The set P k will be the set of all functions:
Smplex ad Rectagle Elemets Mult-dex Notato = (,..., ), o-egatve tegers = = β = ( β,..., β ) the + β = ( + β,..., + β ) + x = x x x x = x x β β + D = D = D D x x x β β Defto: The set P of polyomals of degree
More informationLikewise, properties of the optimal policy for equipment replacement & maintenance problems can be used to reduce the computation.
Whe solvg a vetory repleshmet problem usg a MDP model, kowg that the optmal polcy s of the form (s,s) ca reduce the computatoal burde. That s, f t s optmal to replesh the vetory whe the vetory level s,
More informationSpecial Instructions / Useful Data
JAM 6 Set of all real umbers P A..d. B, p Posso Specal Istructos / Useful Data x,, :,,, x x Probablty of a evet A Idepedetly ad detcally dstrbuted Bomal dstrbuto wth parameters ad p Posso dstrbuto wth
More informationCS475 Parallel Programming
CS475 Parallel Programmg Deretato ad Itegrato Wm Bohm Colorado State Uversty Ecept as otherwse oted, the cotet o ths presetato s lcesed uder the Creatve Commos Attrbuto.5 lcese. Pheomea Physcs: heat, low,
More informationX X X E[ ] E X E X. is the ()m n where the ( i,)th. j element is the mean of the ( i,)th., then
Secto 5 Vectors of Radom Varables Whe workg wth several radom varables,,..., to arrage them vector form x, t s ofte coveet We ca the make use of matrx algebra to help us orgaze ad mapulate large umbers
More informationONE GENERALIZED INEQUALITY FOR CONVEX FUNCTIONS ON THE TRIANGLE
Joural of Pure ad Appled Mathematcs: Advaces ad Applcatos Volume 4 Number 205 Pages 77-87 Avalable at http://scetfcadvaces.co. DOI: http://.do.org/0.8642/jpamaa_7002534 ONE GENERALIZED INEQUALITY FOR CONVEX
More informationBeam Warming Second-Order Upwind Method
Beam Warmg Secod-Order Upwd Method Petr Valeta Jauary 6, 015 Ths documet s a part of the assessmet work for the subject 1DRP Dfferetal Equatos o Computer lectured o FNSPE CTU Prague. Abstract Ths documet
More informationarxiv: v1 [cs.lg] 22 Feb 2015
SDCA wthout Dualty Sha Shalev-Shwartz arxv:50.0677v cs.lg Feb 05 Abstract Stochastc Dual Coordate Ascet s a popular method for solvg regularzed loss mmzato for the case of covex losses. I ths paper we
More informationSTK4011 and STK9011 Autumn 2016
STK4 ad STK9 Autum 6 Pot estmato Covers (most of the followg materal from chapter 7: Secto 7.: pages 3-3 Secto 7..: pages 3-33 Secto 7..: pages 35-3 Secto 7..3: pages 34-35 Secto 7.3.: pages 33-33 Secto
More informationPoint Estimation: definition of estimators
Pot Estmato: defto of estmators Pot estmator: ay fucto W (X,..., X ) of a data sample. The exercse of pot estmato s to use partcular fuctos of the data order to estmate certa ukow populato parameters.
More informationBERNSTEIN COLLOCATION METHOD FOR SOLVING NONLINEAR DIFFERENTIAL EQUATIONS. Aysegul Akyuz Dascioglu and Nese Isler
Mathematcal ad Computatoal Applcatos, Vol. 8, No. 3, pp. 293-300, 203 BERNSTEIN COLLOCATION METHOD FOR SOLVING NONLINEAR DIFFERENTIAL EQUATIONS Aysegul Ayuz Dascoglu ad Nese Isler Departmet of Mathematcs,
More informationSupport vector machines
CS 75 Mache Learg Lecture Support vector maches Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square CS 75 Mache Learg Outle Outle: Algorthms for lear decso boudary Support vector maches Mamum marg hyperplae.
More information0/1 INTEGER PROGRAMMING AND SEMIDEFINTE PROGRAMMING
CONVEX OPIMIZAION AND INERIOR POIN MEHODS FINAL PROJEC / INEGER PROGRAMMING AND SEMIDEFINE PROGRAMMING b Luca Buch ad Natala Vktorova CONENS:.Itroducto.Formulato.Applcato to Kapsack Problem 4.Cuttg Plaes
More informationRandom Variate Generation ENM 307 SIMULATION. Anadolu Üniversitesi, Endüstri Mühendisliği Bölümü. Yrd. Doç. Dr. Gürkan ÖZTÜRK.
adom Varate Geerato ENM 307 SIMULATION Aadolu Üverstes, Edüstr Mühedslğ Bölümü Yrd. Doç. Dr. Gürka ÖZTÜK 0 adom Varate Geerato adom varate geerato s about procedures for samplg from a varety of wdely-used
More informationDKA method for single variable holomorphic functions
DKA method for sgle varable holomorphc fuctos TOSHIAKI ITOH Itegrated Arts ad Natural Sceces The Uversty of Toushma -, Mamhosama, Toushma, 770-8502 JAPAN Abstract: - Durad-Kerer-Aberth (DKA method for
More informationBinary classification: Support Vector Machines
CS 57 Itroducto to AI Lecture 6 Bar classfcato: Support Vector Maches Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square CS 57 Itro to AI Supervsed learg Data: D { D, D,.., D} a set of eamples D, (,,,,,
More informationCS5620 Intro to Computer Graphics
CS56 Itro to Computer Graphcs Geometrc Modelg art II Geometrc Modelg II hyscal Sples Curve desg pre-computers Cubc Sples Stadard sple put set of pots { } =, No dervatves specfed as put Iterpolate by cubc
More informationX ε ) = 0, or equivalently, lim
Revew for the prevous lecture Cocepts: order statstcs Theorems: Dstrbutos of order statstcs Examples: How to get the dstrbuto of order statstcs Chapter 5 Propertes of a Radom Sample Secto 55 Covergece
More informationOn Modified Interval Symmetric Single-Step Procedure ISS2-5D for the Simultaneous Inclusion of Polynomial Zeros
It. Joural of Math. Aalyss, Vol. 7, 2013, o. 20, 983-988 HIKARI Ltd, www.m-hkar.com O Modfed Iterval Symmetrc Sgle-Step Procedure ISS2-5D for the Smultaeous Icluso of Polyomal Zeros 1 Nora Jamalud, 1 Masor
More informationDimensionality Reduction and Learning
CMSC 35900 (Sprg 009) Large Scale Learg Lecture: 3 Dmesoalty Reducto ad Learg Istructors: Sham Kakade ad Greg Shakharovch L Supervsed Methods ad Dmesoalty Reducto The theme of these two lectures s that
More informationLogistic regression (continued)
STAT562 page 138 Logstc regresso (cotued) Suppose we ow cosder more complex models to descrbe the relatoshp betwee a categorcal respose varable (Y) that takes o two (2) possble outcomes ad a set of p explaatory
More informationGeneralization of the Dissimilarity Measure of Fuzzy Sets
Iteratoal Mathematcal Forum 2 2007 o. 68 3395-3400 Geeralzato of the Dssmlarty Measure of Fuzzy Sets Faramarz Faghh Boformatcs Laboratory Naobotechology Research Ceter vesa Research Isttute CECR Tehra
More informationComplete Convergence and Some Maximal Inequalities for Weighted Sums of Random Variables
Joural of Sceces, Islamc Republc of Ira 8(4): -6 (007) Uversty of Tehra, ISSN 06-04 http://sceces.ut.ac.r Complete Covergece ad Some Maxmal Iequaltes for Weghted Sums of Radom Varables M. Am,,* H.R. Nl
More informationECE 595, Section 10 Numerical Simulations Lecture 19: FEM for Electronic Transport. Prof. Peter Bermel February 22, 2013
ECE 595, Secto 0 Numercal Smulatos Lecture 9: FEM for Electroc Trasport Prof. Peter Bermel February, 03 Outle Recap from Wedesday Physcs-based devce modelg Electroc trasport theory FEM electroc trasport
More informationTHE PROBABILISTIC STABILITY FOR THE GAMMA FUNCTIONAL EQUATION
Joural of Scece ad Arts Year 12, No. 3(2), pp. 297-32, 212 ORIGINAL AER THE ROBABILISTIC STABILITY FOR THE GAMMA FUNCTIONAL EQUATION DOREL MIHET 1, CLAUDIA ZAHARIA 1 Mauscrpt receved: 3.6.212; Accepted
More informationSTRONG CONSISTENCY OF LEAST SQUARES ESTIMATE IN MULTIPLE REGRESSION WHEN THE ERROR VARIANCE IS INFINITE
Statstca Sca 9(1999), 289-296 STRONG CONSISTENCY OF LEAST SQUARES ESTIMATE IN MULTIPLE REGRESSION WHEN THE ERROR VARIANCE IS INFINITE J Mgzhog ad Che Xru GuZhou Natoal College ad Graduate School, Chese
More informationIdeal multigrades with trigonometric coefficients
Ideal multgrades wth trgoometrc coeffcets Zarathustra Brady December 13, 010 1 The problem A (, k) multgrade s defed as a par of dstct sets of tegers such that (a 1,..., a ; b 1,..., b ) a j = =1 for all
More informationC.11 Bang-bang Control
Itroucto to Cotrol heory Iclug Optmal Cotrol Nguye a e -.5 C. Bag-bag Cotrol. Itroucto hs chapter eals wth the cotrol wth restrctos: s boue a mght well be possble to have scotutes. o llustrate some of
More informationLarge and Moderate Deviation Principles for Kernel Distribution Estimator
Iteratoal Mathematcal Forum, Vol. 9, 2014, o. 18, 871-890 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.12988/mf.2014.4488 Large ad Moderate Devato Prcples for Kerel Dstrbuto Estmator Yousr Slaou Uversté
More information3. Basic Concepts: Consequences and Properties
: 3. Basc Cocepts: Cosequeces ad Propertes Markku Jutt Overvew More advaced cosequeces ad propertes of the basc cocepts troduced the prevous lecture are derved. Source The materal s maly based o Sectos.6.8
More informationSummary of the lecture in Biostatistics
Summary of the lecture Bostatstcs Probablty Desty Fucto For a cotuos radom varable, a probablty desty fucto s a fucto such that: 0 dx a b) b a dx A probablty desty fucto provdes a smple descrpto of the
More informationMATH 247/Winter Notes on the adjoint and on normal operators.
MATH 47/Wter 00 Notes o the adjot ad o ormal operators I these otes, V s a fte dmesoal er product space over, wth gve er * product uv, T, S, T, are lear operators o V U, W are subspaces of V Whe we say
More informationL5 Polynomial / Spline Curves
L5 Polyomal / Sple Curves Cotets Coc sectos Polyomal Curves Hermte Curves Bezer Curves B-Sples No-Uform Ratoal B-Sples (NURBS) Mapulato ad Represetato of Curves Types of Curve Equatos Implct: Descrbe a
More informationCHAPTER VI Statistical Analysis of Experimental Data
Chapter VI Statstcal Aalyss of Expermetal Data CHAPTER VI Statstcal Aalyss of Expermetal Data Measuremets do ot lead to a uque value. Ths s a result of the multtude of errors (maly radom errors) that ca
More informationLINEAR REGRESSION ANALYSIS
LINEAR REGRESSION ANALYSIS MODULE V Lecture - Correctg Model Iadequaces Through Trasformato ad Weghtg Dr. Shalabh Departmet of Mathematcs ad Statstcs Ida Isttute of Techology Kapur Aalytcal methods for
More informationUNIT 2 SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS
Numercal Computg -I UNIT SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS Structure Page Nos..0 Itroducto 6. Objectves 7. Ital Approxmato to a Root 7. Bsecto Method 8.. Error Aalyss 9.4 Regula Fals Method
More informationSimulation Output Analysis
Smulato Output Aalyss Summary Examples Parameter Estmato Sample Mea ad Varace Pot ad Iterval Estmato ermatg ad o-ermatg Smulato Mea Square Errors Example: Sgle Server Queueg System x(t) S 4 S 4 S 3 S 5
More informationAnalysis of Lagrange Interpolation Formula
P IJISET - Iteratoal Joural of Iovatve Scece, Egeerg & Techology, Vol. Issue, December 4. www.jset.com ISS 348 7968 Aalyss of Lagrage Iterpolato Formula Vjay Dahya PDepartmet of MathematcsMaharaja Surajmal
More informationEconometric Methods. Review of Estimation
Ecoometrc Methods Revew of Estmato Estmatg the populato mea Radom samplg Pot ad terval estmators Lear estmators Ubased estmators Lear Ubased Estmators (LUEs) Effcecy (mmum varace) ad Best Lear Ubased Estmators
More informationJohns Hopkins University Department of Biostatistics Math Review for Introductory Courses
Johs Hopks Uverst Departmet of Bostatstcs Math Revew for Itroductor Courses Ratoale Bostatstcs courses wll rel o some fudametal mathematcal relatoshps, fuctos ad otato. The purpose of ths Math Revew s
More informationMMJ 1113 FINITE ELEMENT METHOD Introduction to PART I
MMJ FINITE EEMENT METHOD Cotut requremets Assume that the fuctos appearg uder the tegral the elemet equatos cota up to (r) th order To esure covergece N must satsf Compatblt requremet the fuctos must have
More informationTESTS BASED ON MAXIMUM LIKELIHOOD
ESE 5 Toy E. Smth. The Basc Example. TESTS BASED ON MAXIMUM LIKELIHOOD To llustrate the propertes of maxmum lkelhood estmates ad tests, we cosder the smplest possble case of estmatg the mea of the ormal
More informationEVALUATION OF FUNCTIONAL INTEGRALS BY MEANS OF A SERIES AND THE METHOD OF BOREL TRANSFORM
EVALUATION OF FUNCTIONAL INTEGRALS BY MEANS OF A SERIES AND THE METHOD OF BOREL TRANSFORM Jose Javer Garca Moreta Ph. D research studet at the UPV/EHU (Uversty of Basque coutry) Departmet of Theoretcal
More informationSTATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS. x, where. = y - ˆ " 1
STATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS Recall Assumpto E(Y x) η 0 + η x (lear codtoal mea fucto) Data (x, y ), (x 2, y 2 ),, (x, y ) Least squares estmator ˆ E (Y x) ˆ " 0 + ˆ " x, where ˆ
More informationOrdinary Least Squares Regression. Simple Regression. Algebra and Assumptions.
Ordary Least Squares egresso. Smple egresso. Algebra ad Assumptos. I ths part of the course we are gog to study a techque for aalysg the lear relatoshp betwee two varables Y ad X. We have pars of observatos
More informationG S Power Flow Solution
G S Power Flow Soluto P Q I y y * 0 1, Y y Y 0 y Y Y 1, P Q ( k) ( k) * ( k 1) 1, Y Y PQ buses * 1 P Q Y ( k1) *( k) ( k) Q Im[ Y ] 1 P buses & Slack bus ( k 1) *( k) ( k) Y 1 P Re[ ] Slack bus 17 Calculato
More informationLecture Note to Rice Chapter 8
ECON 430 HG revsed Nov 06 Lecture Note to Rce Chapter 8 Radom matrces Let Y, =,,, m, =,,, be radom varables (r.v. s). The matrx Y Y Y Y Y Y Y Y Y Y = m m m s called a radom matrx ( wth a ot m-dmesoal dstrbuto,
More informationConsensus Control for a Class of High Order System via Sliding Mode Control
Cosesus Cotrol for a Class of Hgh Order System va Sldg Mode Cotrol Chagb L, Y He, ad Aguo Wu School of Electrcal ad Automato Egeerg, Taj Uversty, Taj, Cha, 300072 Abstract. I ths paper, cosesus problem
More informationMOLECULAR VIBRATIONS
MOLECULAR VIBRATIONS Here we wsh to vestgate molecular vbratos ad draw a smlarty betwee the theory of molecular vbratos ad Hückel theory. 1. Smple Harmoc Oscllator Recall that the eergy of a oe-dmesoal
More informationLecture 02: Bounding tail distributions of a random variable
CSCI-B609: A Theorst s Toolkt, Fall 206 Aug 25 Lecture 02: Boudg tal dstrbutos of a radom varable Lecturer: Yua Zhou Scrbe: Yua Xe & Yua Zhou Let us cosder the ubased co flps aga. I.e. let the outcome
More informationPROJECTION PROBLEM FOR REGULAR POLYGONS
Joural of Mathematcal Sceces: Advaces ad Applcatos Volume, Number, 008, Pages 95-50 PROJECTION PROBLEM FOR REGULAR POLYGONS College of Scece Bejg Forestry Uversty Bejg 0008 P. R. Cha e-mal: sl@bjfu.edu.c
More informationNon-uniform Turán-type problems
Joural of Combatoral Theory, Seres A 111 2005 106 110 wwwelsevercomlocatecta No-uform Turá-type problems DhruvMubay 1, Y Zhao 2 Departmet of Mathematcs, Statstcs, ad Computer Scece, Uversty of Illos at
More informationA Study of the Reproducibility of Measurements with HUR Leg Extension/Curl Research Line
HUR Techcal Report 000--9 verso.05 / Frak Borg (borgbros@ett.f) A Study of the Reproducblty of Measuremets wth HUR Leg Eteso/Curl Research Le A mportat property of measuremets s that the results should
More informationENGI 4430 Numerical Integration Page 5-01
ENGI 443 Numercal Itegrato Page 5-5. Numercal Itegrato I some o our prevous work, (most otaly the evaluato o arc legth), t has ee dcult or mpossle to d the dete tegral. Varous symolc algera ad calculus
More informationDepartment of Agricultural Economics. PhD Qualifier Examination. August 2011
Departmet of Agrcultural Ecoomcs PhD Qualfer Examato August 0 Istructos: The exam cossts of sx questos You must aswer all questos If you eed a assumpto to complete a questo, state the assumpto clearly
More information