Lecture 10: October 30, 2017
|
|
- Harry Harrington
- 5 years ago
- Views:
Transcription
1 Information an Coing Theory Autumn 2017 Lecturer: Mahur Tulsiani Lecture 10: October 30, I-Projections an applications In this lecture, we will talk more about fining the istribution in a set Π that minimizes D(P Q) for a fixe istribution Q. We encountere this when iscussing Sanov s theorem an will not iscuss its properties in some etail. When Q is the uniform istribution on U. Then we also have, D(P Q) = log U H(P) Hence, in this case P is a istribution that maximizes entropy. In general, when the given information oes not uniquely etermine a istribution, we choose P that maximizes entropy. This can be thought of as picking P in the set of istributions Π, subject to the least amount of aitional assumptions. This is sometimes calle the Maximum Entropy Principle. In this lecture we will charcterize the istributions obtaine by minimizing Klivergence (or maximizing entropy). For close convex set Π, such a P is calle the I-projection of Q onto Π. Definition 1.1 Let Π be a close convex set of istributions over U. In aition, assume that Supp(Q) = U. Then Proj Π (Q) := arg min D(P Q) = P P Π Note that the assumption Supp(Q) = U above is without loss of generality since D(P Q) = for any P such that Supp(P) Supp(Q). Use the (strict) convexity of KL-ivergence to check the following. Exercise 1.2 For a close, convex set Π, the projection P = Proj Π (Q) exists an is unique. It is immeiate from efinition that if P Π, then D(P Q) D(P Q). In fact, P tells us more. It also tells us how far P is away from Q in KL-ivergence measure. Theorem 1.3 Let P = Proj Π (Q). Then, for all P Π, Supp(P) Supp(P ) D(P Q) D(P P ) + D(P Q) 1
2 Proof: Define P t = tp + (1 t)p, where t [0, 1]. By minimality of P, it is clear that D(P t Q) D(P Q) 0. By the mean value theorem, we also have that 0 1 t (D(P t Q) D(P Q)) t D(P t Q) t=t [0,t] Since t 0 as t 0, we get We now compute t D(P t Q). lim t 0 t D(P t Q) 0. Note that t D(P t Q) = Using these facts, we have t p t(a) log p t(a) q(a) + p t (a) t (log p t(a) log q(a)) t p t(a) = p(a) p (a) t log p t(a) = 1 1 ln 2 p t (a) (p(a) p (a)) t D(P t Q) = (p(a) p (a)) log p t(a) q(a) + 1 ln 2 (p(a) p (a)) = (p(a) p (a)) log p t(a) q(a) Here, note that if ( a) such that p(a) > 0 an p (a) = 0, then lim t 0 t D(P t Q), which contraicts the fact that t D(P t Q) 0. Hence, if p(a) > 0, then p (a) > 0 an therefore, Supp(P) Supp(P ). This proves the first part of the theorem. Now we evaluate t D(P t Q) at t = 0. t D(P t Q) t=0 = p(a) log p (a) q(a) p (a) log p (a) q(a) = p(a) log p (a) p(a) q(a) p(a) D(P Q) Hence, D(P Q) D(P P ) + D(P Q). = p(a) log p(a) q(a) p(a) log p(a) p (a) D(P Q) = D(P Q) D(P P ) D(P Q) 0 2
3 Consier the following example, which shows that the inequality can in fact be strict. Exercise 1.4 Let U = 0, 1 an Π = P : P(1) 1/2. Let Q be efine as 1 with prob. 3/4 Q = 0 with prob. 1/4 1. Show that P = 1 with prob. 1/2 0 with prob. 1/2 2. Show that D(P Q) > D(P P ) + D(P Q) for the above example. Next, we show how to compute an characterize I-projections for some special sets of istributions. 1.1 Linear families an I-projections Definition 1.5 For any given functions f 1, f 2,..., f k on U an α 1, α 2,..., α k R, the set L = P is calle a linear family of istributions. P(a) f i (a) = E [ f i (a)] = α i, i [k] a P We show that for linear families, the inequality prove above, is in fact tight. Moreover, the projection P lies in the interior of the polytope efining L. Lemma 1.6 Let L be a linear family given by L = P : p(a) f i (a) = α i, i [k] an P L Supp(P) = U. Let P = Proj L (Q). Then, for all P L 1. There exists β > 0 such that for t [ β, 0], P t = tp + (1 t)p L. 2. D(P Q) = D(P P ) + D(P Q) Then the I-Projection P of Q onto L satisfies the Pythagorean ientity D(P Q) = D(P P ) + D(P Q) 3
4 Proof: Recall that Supp(P) Supp(P ) an p t (a) = t p(a) + (1 t) p (a). Since the conitions efining L are linear, we have that for all t R an all i [k] p t (a) f i (a) = t p(a) f i (a) + (1 t) p (a) f i (a) = α i However, we may not have p t (a) 0 for all t < 0. We fin a β > 0 such that for t [ β, 0] p t (a) 0 t(p(a) p (a)) p (a) Note that above inequality clearly hols if p(a) p (a) < 0. Now choose β such that p β = (a) min a:p(a) p (a)>0 p(a) p (a) Notice that β > 0 since Supp(P ) P L Supp(P). The above implies that t D(P t Q) t=0 = 0 by the minimality of P, which in turn implies the equality D(P Q) = D(P P ) + D(P Q). The above can also be use to show that the I-projection onto L is of a special form. To escribe this, we efine the following family of istributions. Definition 1.7 Let Q be a given istribution. For any given functions g 1, g 2,..., g k on U an λ 1, λ 2,..., λ k R, the set ( ) k E Q = P : p(a) = c Q(a) exp λ i g i (a) i=1 is calle an exponential family of istributions. We will show that P = Proj L (Q) E Q ( f 1,..., f k ). We prove this for a linear family efine by a single constraint. The proof for families with multiple constraints is ientical. Let f : U R an let L be efine as L = P P(a) f (a) = E [ f (a)] = α a P The projection P is the optimal solution to the convex program minimize subject to D(P Q) P(a) f (a) = α P(a) = 1 P(a) 0 a U. 4
5 For λ 0, λ 1 R, we write the Lagrangian as ( ) ( ) Λ(P; λ 0, λ 1 ) = D(P Q) + λ 0 P(a) 1 a + λ 1 P(a) f (a) α a The problem above can be written in terms of the Lagrangian as inf Λ(P; λ 0, λ 1 ). From the lemma above, we know that P lies in the relative interior of the polytope efining L. Then, strong uality hols for the above program an we can write. inf Λ(P; λ 0, λ 1 ) = inf Λ(P; λ 0, λ 1 ). We now characterize the form of the optimal solution by consiering the secon (ual) program. For a given value of λ 0, λ 1, we can fin the optimal solution P by setting the erivative of Λ(P; λ 0, λ 1 ) with respect to P(a) to zero, for every a U. This gives ( p ) (a) log + 1 q(a) ln 2 + λ 0 + λ 1 f (a) = 0 Thus, we have for all a U p (a) = q(a) 2 λ 0 λ 1 f (a). The proof for linear families efine by multiple constraints is ientical. The above also shows that maximum entropy istributions subject to linear constraints, always belong to an exponential family. 5
1 Lecture 20: Implicit differentiation
Lecture 20: Implicit ifferentiation. Outline The technique of implicit ifferentiation Tangent lines to a circle Derivatives of inverse functions by implicit ifferentiation Examples.2 Implicit ifferentiation
More informationSYSTEMS OF DIFFERENTIAL EQUATIONS, EULER S FORMULA. where L is some constant, usually called the Lipschitz constant. An example is
SYSTEMS OF DIFFERENTIAL EQUATIONS, EULER S FORMULA. Uniqueness for solutions of ifferential equations. We consier the system of ifferential equations given by x = v( x), () t with a given initial conition
More informationConvergence of Random Walks
Chapter 16 Convergence of Ranom Walks This lecture examines the convergence of ranom walks to the Wiener process. This is very important both physically an statistically, an illustrates the utility of
More informationLinear First-Order Equations
5 Linear First-Orer Equations Linear first-orer ifferential equations make up another important class of ifferential equations that commonly arise in applications an are relatively easy to solve (in theory)
More informationQF101: Quantitative Finance September 5, Week 3: Derivatives. Facilitator: Christopher Ting AY 2017/2018. f ( x + ) f(x) f(x) = lim
QF101: Quantitative Finance September 5, 2017 Week 3: Derivatives Facilitator: Christopher Ting AY 2017/2018 I recoil with ismay an horror at this lamentable plague of functions which o not have erivatives.
More informationLecture 9: October 25, Lower bounds for minimax rates via multiple hypotheses
Information and Coding Theory Autumn 07 Lecturer: Madhur Tulsiani Lecture 9: October 5, 07 Lower bounds for minimax rates via multiple hypotheses In this lecture, we extend the ideas from the previous
More informationLecture 6: Calculus. In Song Kim. September 7, 2011
Lecture 6: Calculus In Song Kim September 7, 20 Introuction to Differential Calculus In our previous lecture we came up with several ways to analyze functions. We saw previously that the slope of a linear
More informationRobust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k
A Proof of Lemma 2 B Proof of Lemma 3 Proof: Since the support of LL istributions is R, two such istributions are equivalent absolutely continuous with respect to each other an the ivergence is well-efine
More informationCalculus and optimization
Calculus an optimization These notes essentially correspon to mathematical appenix 2 in the text. 1 Functions of a single variable Now that we have e ne functions we turn our attention to calculus. A function
More informationSchrödinger s equation.
Physics 342 Lecture 5 Schröinger s Equation Lecture 5 Physics 342 Quantum Mechanics I Wenesay, February 3r, 2010 Toay we iscuss Schröinger s equation an show that it supports the basic interpretation of
More information7.1 Support Vector Machine
67577 Intro. to Machine Learning Fall semester, 006/7 Lecture 7: Support Vector Machines an Kernel Functions II Lecturer: Amnon Shashua Scribe: Amnon Shashua 7. Support Vector Machine We return now to
More informationTwo formulas for the Euler ϕ-function
Two formulas for the Euler ϕ-function Robert Frieman A multiplication formula for ϕ(n) The first formula we want to prove is the following: Theorem 1. If n 1 an n 2 are relatively prime positive integers,
More information164 Final Solutions 1
164 Final Solutions 1 1. Question 1 True/False a) Let f : R R be a C 3 function such that fx) for all x R. Then the graient escent algorithm starte at the point will fin the global minimum of f. FALSE.
More informationLecture 2: Correlated Topic Model
Probabilistic Moels for Unsupervise Learning Spring 203 Lecture 2: Correlate Topic Moel Inference for Correlate Topic Moel Yuan Yuan First of all, let us make some claims about the parameters an variables
More informationSome Examples. Uniform motion. Poisson processes on the real line
Some Examples Our immeiate goal is to see some examples of Lévy processes, an/or infinitely-ivisible laws on. Uniform motion Choose an fix a nonranom an efine X := for all (1) Then, {X } is a [nonranom]
More informationREAL ANALYSIS I HOMEWORK 5
REAL ANALYSIS I HOMEWORK 5 CİHAN BAHRAN The questions are from Stein an Shakarchi s text, Chapter 3. 1. Suppose ϕ is an integrable function on R with R ϕ(x)x = 1. Let K δ(x) = δ ϕ(x/δ), δ > 0. (a) Prove
More informationPDE Notes, Lecture #11
PDE Notes, Lecture # from Professor Jalal Shatah s Lectures Febuary 9th, 2009 Sobolev Spaces Recall that for u L loc we can efine the weak erivative Du by Du, φ := udφ φ C0 If v L loc such that Du, φ =
More informationcosh x sinh x So writing t = tan(x/2) we have 6.4 Integration using tan(x/2) 2t 1 + t 2 cos x = 1 t2 sin x =
6.4 Integration using tan/ We will revisit the ouble angle ientities: sin = sin/ cos/ = tan/ sec / = tan/ + tan / cos = cos / sin / tan = = tan / sec / tan/ tan /. = tan / + tan / So writing t = tan/ we
More informationLECTURE NOTES ON DVORETZKY S THEOREM
LECTURE NOTES ON DVORETZKY S THEOREM STEVEN HEILMAN Abstract. We present the first half of the paper [S]. In particular, the results below, unless otherwise state, shoul be attribute to G. Schechtman.
More informationAn Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
Journal of Machine Learning Research 8 07) - Submitte /6; Publishe 5/7 An Optimal Algorithm for Banit an Zero-Orer Convex Optimization with wo-point Feeback Oha Shamir Department of Computer Science an
More informationUC Berkeley Department of Electrical Engineering and Computer Science Department of Statistics
UC Berkeley Department of Electrical Engineering an Computer Science Department of Statistics EECS 8B / STAT 4B Avance Topics in Statistical Learning Theory Solutions 3 Spring 9 Solution 3. For parti,
More informationProblem set 2: Solutions Math 207B, Winter 2016
Problem set : Solutions Math 07B, Winter 016 1. A particle of mass m with position x(t) at time t has potential energy V ( x) an kinetic energy T = 1 m x t. The action of the particle over times t t 1
More informationFormulas From Calculus
Formulas You Shoul Memorize (an I o mean Memorize!) S 997 Pat Rossi Formulas From Calculus. [sin ()] = cos () 2. [cos ()] = sin () 3. [tan ()] = sec2 () 4. [cot ()] = csc2 () 5. [sec ()] = sec () tan ()
More informationLectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs
Lectures - Week 10 Introuction to Orinary Differential Equations (ODES) First Orer Linear ODEs When stuying ODEs we are consiering functions of one inepenent variable, e.g., f(x), where x is the inepenent
More informationTopic 2.3: The Geometry of Derivatives of Vector Functions
BSU Math 275 Notes Topic 2.3: The Geometry of Derivatives of Vector Functions Textbook Sections: 13.2 From the Toolbox (what you nee from previous classes): Be able to compute erivatives scalar-value functions
More information(a 1 m. a n m = < a 1/N n
Notes on a an log a Mat 9 Fall 2004 Here is an approac to te eponential an logaritmic functions wic avois any use of integral calculus We use witout proof te eistence of certain limits an assume tat certain
More informationA new proof of the sharpness of the phase transition for Bernoulli percolation on Z d
A new proof of the sharpness of the phase transition for Bernoulli percolation on Z Hugo Duminil-Copin an Vincent Tassion October 8, 205 Abstract We provie a new proof of the sharpness of the phase transition
More informationLecture 1: Entropy, convexity, and matrix scaling CSE 599S: Entropy optimality, Winter 2016 Instructor: James R. Lee Last updated: January 24, 2016
Lecture 1: Entropy, convexity, and matrix scaling CSE 599S: Entropy optimality, Winter 2016 Instructor: James R. Lee Last updated: January 24, 2016 1 Entropy Since this course is about entropy maximization,
More informationLecture 5. Symmetric Shearer s Lemma
Stanfor University Spring 208 Math 233: Non-constructive methos in combinatorics Instructor: Jan Vonrák Lecture ate: January 23, 208 Original scribe: Erik Bates Lecture 5 Symmetric Shearer s Lemma Here
More informationcosh x sinh x So writing t = tan(x/2) we have 6.4 Integration using tan(x/2) = 2 2t 1 + t 2 cos x = 1 t2 We will revisit the double angle identities:
6.4 Integration using tanx/) We will revisit the ouble angle ientities: sin x = sinx/) cosx/) = tanx/) sec x/) = tanx/) + tan x/) cos x = cos x/) sin x/) tan x = = tan x/) sec x/) tanx/) tan x/). = tan
More informationConvergence of random variables, and the Borel-Cantelli lemmas
Stat 205A Setember, 12, 2002 Convergence of ranom variables, an the Borel-Cantelli lemmas Lecturer: James W. Pitman Scribes: Jin Kim (jin@eecs) 1 Convergence of ranom variables Recall that, given a sequence
More informationSturm-Liouville Theory
LECTURE 5 Sturm-Liouville Theory In the three preceing lectures I emonstrate the utility of Fourier series in solving PDE/BVPs. As we ll now see, Fourier series are just the tip of the iceberg of the theory
More informationA PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networks
A PAC-Bayesian Approach to Spectrally-Normalize Margin Bouns for Neural Networks Behnam Neyshabur, Srinah Bhojanapalli, Davi McAllester, Nathan Srebro Toyota Technological Institute at Chicago {bneyshabur,
More information1. Aufgabenblatt zur Vorlesung Probability Theory
24.10.17 1. Aufgabenblatt zur Vorlesung By (Ω, A, P ) we always enote the unerlying probability space, unless state otherwise. 1. Let r > 0, an efine f(x) = 1 [0, [ (x) exp( r x), x R. a) Show that p f
More informationJUST THE MATHS UNIT NUMBER DIFFERENTIATION 2 (Rates of change) A.J.Hobson
JUST THE MATHS UNIT NUMBER 10.2 DIFFERENTIATION 2 (Rates of change) by A.J.Hobson 10.2.1 Introuction 10.2.2 Average rates of change 10.2.3 Instantaneous rates of change 10.2.4 Derivatives 10.2.5 Exercises
More informationLecture 12: November 6, 2013
Information an Coing Theory Autumn 204 Lecturer: Mahur Tulsiani Lecture 2: November 6, 203 Scribe: Davi Kim Recall: We were looking at coes of the form C : F k q F n q, where q is prime, k is the message
More informationTutorial on Maximum Likelyhood Estimation: Parametric Density Estimation
Tutorial on Maximum Likelyhoo Estimation: Parametric Density Estimation Suhir B Kylasa 03/13/2014 1 Motivation Suppose one wishes to etermine just how biase an unfair coin is. Call the probability of tossing
More informationThe derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x)
Y. D. Chong (2016) MH2801: Complex Methos for the Sciences 1. Derivatives The erivative of a function f(x) is another function, efine in terms of a limiting expression: f (x) f (x) lim x δx 0 f(x + δx)
More informationQubit channels that achieve capacity with two states
Qubit channels that achieve capacity with two states Dominic W. Berry Department of Physics, The University of Queenslan, Brisbane, Queenslan 4072, Australia Receive 22 December 2004; publishe 22 March
More informationConnections Between Duality in Control Theory and
Connections Between Duality in Control heory an Convex Optimization V. Balakrishnan 1 an L. Vanenberghe 2 Abstract Several important problems in control theory can be reformulate as convex optimization
More informationOnline Appendix for Trade Policy under Monopolistic Competition with Firm Selection
Online Appenix for Trae Policy uner Monopolistic Competition with Firm Selection Kyle Bagwell Stanfor University an NBER Seung Hoon Lee Georgia Institute of Technology September 6, 2018 In this Online
More informationDiophantine Approximations: Examining the Farey Process and its Method on Producing Best Approximations
Diophantine Approximations: Examining the Farey Process an its Metho on Proucing Best Approximations Kelly Bowen Introuction When a person hears the phrase irrational number, one oes not think of anything
More informationThe Exact Form and General Integrating Factors
7 The Exact Form an General Integrating Factors In the previous chapters, we ve seen how separable an linear ifferential equations can be solve using methos for converting them to forms that can be easily
More informationCounting Lattice Points in Polytopes: The Ehrhart Theory
3 Counting Lattice Points in Polytopes: The Ehrhart Theory Ubi materia, ibi geometria. Johannes Kepler (1571 1630) Given the profusion of examples that gave rise to the polynomial behavior of the integer-point
More informationPhysics 5153 Classical Mechanics. The Virial Theorem and The Poisson Bracket-1
Physics 5153 Classical Mechanics The Virial Theorem an The Poisson Bracket 1 Introuction In this lecture we will consier two applications of the Hamiltonian. The first, the Virial Theorem, applies to systems
More information12.11 Laplace s Equation in Cylindrical and
SEC. 2. Laplace s Equation in Cylinrical an Spherical Coorinates. Potential 593 2. Laplace s Equation in Cylinrical an Spherical Coorinates. Potential One of the most important PDEs in physics an engineering
More informationEuler equations for multiple integrals
Euler equations for multiple integrals January 22, 2013 Contents 1 Reminer of multivariable calculus 2 1.1 Vector ifferentiation......................... 2 1.2 Matrix ifferentiation........................
More informationFall 2016: Calculus I Final
Answer the questions in the spaces provie on the question sheets. If you run out of room for an answer, continue on the back of the page. NO calculators or other electronic evices, books or notes are allowe
More informationSolutions to MATH 271 Test #3H
Solutions to MATH 71 Test #3H This is the :4 class s version of the test. See pages 4 7 for the 4:4 class s. (1) (5 points) Let a k = ( 1)k. Is a k increasing? Decreasing? Boune above? Boune k below? Convergant
More informationCriteria for Global Stability of Coupled Systems with Application to Robust Output Feedback Design for Active Surge Control
Criteria for Global Stability of Couple Systems with Application to Robust Output Feeback Design for Active Surge Control Shiriaev, Anton; Johansson, Rolf; Robertsson, Aners; Freiovich, Leoni 9 Link to
More informationLower bounds on Locality Sensitive Hashing
Lower bouns on Locality Sensitive Hashing Rajeev Motwani Assaf Naor Rina Panigrahy Abstract Given a metric space (X, X ), c 1, r > 0, an p, q [0, 1], a istribution over mappings H : X N is calle a (r,
More informationA. Incorrect! The letter t does not appear in the expression of the given integral
AP Physics C - Problem Drill 1: The Funamental Theorem of Calculus Question No. 1 of 1 Instruction: (1) Rea the problem statement an answer choices carefully () Work the problems on paper as neee (3) Question
More informationConservation Laws. Chapter Conservation of Energy
20 Chapter 3 Conservation Laws In orer to check the physical consistency of the above set of equations governing Maxwell-Lorentz electroynamics [(2.10) an (2.12) or (1.65) an (1.68)], we examine the action
More informationSYMPLECTIC GEOMETRY: LECTURE 3
SYMPLECTIC GEOMETRY: LECTURE 3 LIAT KESSLER 1. Local forms Vector fiels an the Lie erivative. A vector fiel on a manifol M is a smooth assignment of a vector tangent to M at each point. We think of M as
More informationGeneralized Tractability for Multivariate Problems
Generalize Tractability for Multivariate Problems Part II: Linear Tensor Prouct Problems, Linear Information, an Unrestricte Tractability Michael Gnewuch Department of Computer Science, University of Kiel,
More informationProblem Sheet 2: Eigenvalues and eigenvectors and their use in solving linear ODEs
Problem Sheet 2: Eigenvalues an eigenvectors an their use in solving linear ODEs If you fin any typos/errors in this problem sheet please email jk28@icacuk The material in this problem sheet is not examinable
More informationExam 2 Answers Math , Fall log x dx = x log x x + C. log u du = 1 3
Exam Answers Math -, Fall 7. Show, using any metho you like, that log x = x log x x + C. Answer: (x log x x+c) = x x + log x + = log x. Thus log x = x log x x+c.. Compute these. Remember to put boxes aroun
More informationImplicit Differentiation. Lecture 16.
Implicit Differentiation. Lecture 16. We are use to working only with functions that are efine explicitly. That is, ones like f(x) = 5x 3 + 7x x 2 + 1 or s(t) = e t5 3, in which the function is escribe
More informationMath 342 Partial Differential Equations «Viktor Grigoryan
Math 342 Partial Differential Equations «Viktor Grigoryan 6 Wave equation: solution In this lecture we will solve the wave equation on the entire real line x R. This correspons to a string of infinite
More informationProof of SPNs as Mixture of Trees
A Proof of SPNs as Mixture of Trees Theorem 1. If T is an inuce SPN from a complete an ecomposable SPN S, then T is a tree that is complete an ecomposable. Proof. Argue by contraiction that T is not a
More informationDifferentiability, Computing Derivatives, Trig Review. Goals:
Secants vs. Derivatives - Unit #3 : Goals: Differentiability, Computing Derivatives, Trig Review Determine when a function is ifferentiable at a point Relate the erivative graph to the the graph of an
More informationCalculus in the AP Physics C Course The Derivative
Limits an Derivatives Calculus in the AP Physics C Course The Derivative In physics, the ieas of the rate change of a quantity (along with the slope of a tangent line) an the area uner a curve are essential.
More information1 dx. where is a large constant, i.e., 1, (7.6) and Px is of the order of unity. Indeed, if px is given by (7.5), the inequality (7.
Lectures Nine an Ten The WKB Approximation The WKB metho is a powerful tool to obtain solutions for many physical problems It is generally applicable to problems of wave propagation in which the frequency
More informationIterated Point-Line Configurations Grow Doubly-Exponentially
Iterate Point-Line Configurations Grow Doubly-Exponentially Joshua Cooper an Mark Walters July 9, 008 Abstract Begin with a set of four points in the real plane in general position. A to this collection
More informationImplicit Differentiation
Implicit Differentiation Thus far, the functions we have been concerne with have been efine explicitly. A function is efine explicitly if the output is given irectly in terms of the input. For instance,
More informationALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS
ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS MARK SCHACHNER Abstract. When consiere as an algebraic space, the set of arithmetic functions equippe with the operations of pointwise aition an
More informationCalculus of Variations
Calculus of Variations Lagrangian formalism is the main tool of theoretical classical mechanics. Calculus of Variations is a part of Mathematics which Lagrangian formalism is base on. In this section,
More informationFURTHER BOUNDS FOR THE ESTIMATION ERROR VARIANCE OF A CONTINUOUS STREAM WITH STATIONARY VARIOGRAM
FURTHER BOUNDS FOR THE ESTIMATION ERROR VARIANCE OF A CONTINUOUS STREAM WITH STATIONARY VARIOGRAM N. S. BARNETT, S. S. DRAGOMIR, AND I. S. GOMM Abstract. In this paper we establish an upper boun for the
More informationExtreme Values by Resnick
1 Extreme Values by Resnick 1 Preliminaries 1.1 Uniform Convergence We will evelop the iea of something calle continuous convergence which will be useful to us later on. Denition 1. Let X an Y be metric
More informationChapter 9 Method of Weighted Residuals
Chapter 9 Metho of Weighte Resiuals 9- Introuction Metho of Weighte Resiuals (MWR) is an approimate technique for solving bounary value problems. It utilizes a trial functions satisfying the prescribe
More informationDerivatives and the Product Rule
Derivatives an the Prouct Rule James K. Peterson Department of Biological Sciences an Department of Mathematical Sciences Clemson University January 28, 2014 Outline Differentiability Simple Derivatives
More informationinflow outflow Part I. Regular tasks for MAE598/494 Task 1
MAE 494/598, Fall 2016 Project #1 (Regular tasks = 20 points) Har copy of report is ue at the start of class on the ue ate. The rules on collaboration will be release separately. Please always follow the
More informationLower Bounds for the Smoothed Number of Pareto optimal Solutions
Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.
More informationGeneralized Nonhomogeneous Abstract Degenerate Cauchy Problem
Applie Mathematical Sciences, Vol. 7, 213, no. 49, 2441-2453 HIKARI Lt, www.m-hikari.com Generalize Nonhomogeneous Abstract Degenerate Cauchy Problem Susilo Hariyanto Department of Mathematics Gajah Maa
More informationUnit vectors with non-negative inner products
Unit vectors with non-negative inner proucts Bos, A.; Seiel, J.J. Publishe: 01/01/1980 Document Version Publisher s PDF, also known as Version of Recor (inclues final page, issue an volume numbers) Please
More informationComputing Derivatives
Chapter 2 Computing Derivatives 2.1 Elementary erivative rules Motivating Questions In this section, we strive to unerstan the ieas generate by the following important questions: What are alternate notations
More informationSection 7.2. The Calculus of Complex Functions
Section 7.2 The Calculus of Complex Functions In this section we will iscuss limits, continuity, ifferentiation, Taylor series in the context of functions which take on complex values. Moreover, we will
More informationZachary Scherr Math 503 HW 3 Due Friday, Feb 12
Zachary Scherr Math 503 HW 3 Due Friay, Feb 1 1 Reaing 1. Rea sections 7.5, 7.6, 8.1 of Dummit an Foote Problems 1. DF 7.5. Solution: This problem is trivial knowing how to work with universal properties.
More informationPure Further Mathematics 1. Revision Notes
Pure Further Mathematics Revision Notes June 20 2 FP JUNE 20 SDB Further Pure Complex Numbers... 3 Definitions an arithmetical operations... 3 Complex conjugate... 3 Properties... 3 Complex number plane,
More informationNew bounds on Simonyi s conjecture
New bouns on Simonyi s conjecture Daniel Soltész soltesz@math.bme.hu Department of Computer Science an Information Theory, Buapest University of Technology an Economics arxiv:1510.07597v1 [math.co] 6 Oct
More informationII. First variation of functionals
II. First variation of functionals The erivative of a function being zero is a necessary conition for the etremum of that function in orinary calculus. Let us now tackle the question of the equivalent
More information. Using a multinomial model gives us the following equation for P d. , with respect to same length term sequences.
S 63 Lecture 8 2/2/26 Lecturer Lillian Lee Scribes Peter Babinski, Davi Lin Basic Language Moeling Approach I. Special ase of LM-base Approach a. Recap of Formulas an Terms b. Fixing θ? c. About that Multinomial
More information1 Math 285 Homework Problem List for S2016
1 Math 85 Homework Problem List for S016 Note: solutions to Lawler Problems will appear after all of the Lecture Note Solutions. 1.1 Homework 1. Due Friay, April 8, 016 Look at from lecture note exercises:
More informationThe Sokhotski-Plemelj Formula
hysics 25 Winter 208 The Sokhotski-lemelj Formula. The Sokhotski-lemelj formula The Sokhotski-lemelj formula is a relation between the following generalize functions (also calle istributions), ±iǫ = iπ(),
More informationWUCHEN LI AND STANLEY OSHER
CONSTRAINED DYNAMICAL OPTIMAL TRANSPORT AND ITS LAGRANGIAN FORMULATION WUCHEN LI AND STANLEY OSHER Abstract. We propose ynamical optimal transport (OT) problems constraine in a parameterize probability
More informationEntanglement is not very useful for estimating multiple phases
PHYSICAL REVIEW A 70, 032310 (2004) Entanglement is not very useful for estimating multiple phases Manuel A. Ballester* Department of Mathematics, University of Utrecht, Box 80010, 3508 TA Utrecht, The
More informationLecture 4 : General Logarithms and Exponentials. a x = e x ln a, a > 0.
For a > 0 an x any real number, we efine Lecture 4 : General Logarithms an Exponentials. a x = e x ln a, a > 0. The function a x is calle the exponential function with base a. Note that ln(a x ) = x ln
More informationFree rotation of a rigid body 1 D. E. Soper 2 University of Oregon Physics 611, Theoretical Mechanics 5 November 2012
Free rotation of a rigi boy 1 D. E. Soper 2 University of Oregon Physics 611, Theoretical Mechanics 5 November 2012 1 Introuction In this section, we escribe the motion of a rigi boy that is free to rotate
More informationChapter 6: Energy-Momentum Tensors
49 Chapter 6: Energy-Momentum Tensors This chapter outlines the general theory of energy an momentum conservation in terms of energy-momentum tensors, then applies these ieas to the case of Bohm's moel.
More information05 The Continuum Limit and the Wave Equation
Utah State University DigitalCommons@USU Founations of Wave Phenomena Physics, Department of 1-1-2004 05 The Continuum Limit an the Wave Equation Charles G. Torre Department of Physics, Utah State University,
More informationComputing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions
Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5
More informationContinuity equations and ODE flows with non-smooth velocity
Continuity equations an ODE flows with non-smooth velocity Luigi Ambrosio an Gianluca Crippa Einburgh, April 15-16, 213 Contents 1 Introuction 1 2 Transport equation an continuity equation within the Cauchy-Lipschitz
More informationTime-of-Arrival Estimation in Non-Line-Of-Sight Environments
2 Conference on Information Sciences an Systems, The Johns Hopkins University, March 2, 2 Time-of-Arrival Estimation in Non-Line-Of-Sight Environments Sinan Gezici, Hisashi Kobayashi an H. Vincent Poor
More informationConvergence of Langevin MCMC in KL-divergence
Convergence of Langevin MCMC in KL-ivergence Xiang Cheng x.cheng@berkeley.eu an Peter Bartlett peter@berkeley.eu Eitor: Abstract Langevin iffusion is a commonly use tool for sampling from a given istribution.
More information1 Heisenberg Representation
1 Heisenberg Representation What we have been ealing with so far is calle the Schröinger representation. In this representation, operators are constants an all the time epenence is carrie by the states.
More informationFebruary 21 Math 1190 sec. 63 Spring 2017
February 21 Math 1190 sec. 63 Spring 2017 Chapter 2: Derivatives Let s recall the efinitions an erivative rules we have so far: Let s assume that y = f (x) is a function with c in it s omain. The erivative
More informationG4003 Advanced Mechanics 1. We already saw that if q is a cyclic variable, the associated conjugate momentum is conserved, L = const.
G4003 Avance Mechanics 1 The Noether theorem We alreay saw that if q is a cyclic variable, the associate conjugate momentum is conserve, q = 0 p q = const. (1) This is the simplest incarnation of Noether
More informationDesigning Information Devices and Systems II Spring 2018 J. Roychowdhury and M. Maharbiz Discussion 2A
EECS 6B Designing Information Devices an Systems II Spring 208 J. Roychowhury an M. Maharbiz Discussion 2A Secon-Orer Differential Equations Secon-orer ifferential equations are ifferential equations of
More information1 Lecture 13: The derivative as a function.
1 Lecture 13: Te erivative as a function. 1.1 Outline Definition of te erivative as a function. efinitions of ifferentiability. Power rule, erivative te exponential function Derivative of a sum an a multiple
More informationSection The Chain Rule and Implicit Differentiation with Application on Derivative of Logarithm Functions
Section 3.4-3.6 The Chain Rule an Implicit Differentiation with Application on Derivative of Logarithm Functions Ruipeng Shen September 3r, 5th Ruipeng Shen MATH 1ZA3 September 3r, 5th 1 / 3 The Chain
More information