Hypo-elliptic simulated annealing
|
|
- Rosaline Morgan
- 7 years ago
- Views:
Transcription
1 Hypo-elliptic simulated annealing Christian Bayer 1 Josef Teichmann 2 Richard Warnung 3 1 Department of Mathematics Royal Institute of Technology, Stockholm 2 Department of Mathematics ETH Zurich 3 Raiffeisen Capital Investment, Vienna 07/30/2009 Berlin
2 Outline 1 Introduction Smoluchowski dynamics Simulated annealing in continuous time Motivation for hypo-elliptic simulated annealing 2 The theory of hypo-elliptic simulated annealing Setting of hypo-elliptic simulated annealing The gradient Hypo-elliptic simulated annealing 3 Numerical examples Example in R 3 Example on SO(3) 4 Conclusions
3 Smoluchowski dynamics (1) dy y t = 1 2 U(Y y t )dt + KTdW t Y y 0 = y Rn, U : R n R and W is an n-dimensional standard Wiener process Unique invariant measure given by the Gibbs measure µ KT (dy) = 1 e U(y) KT dy C T Ergodicity, i.e., Y y converges in law to µ KT Extensively used in physics and chemistry for the simulation of canonical ensemble (NVT), i.e., of an ensemble with constant temperature
4 Smoluchowski dynamics (1) dy y t = 1 2 U(Y y t )dt + KTdW t Y y 0 = y Rn, U : R n R and W is an n-dimensional standard Wiener process Unique invariant measure given by the Gibbs measure µ KT (dy) = 1 e U(y) KT dy C T Ergodicity, i.e., Y y converges in law to µ KT Extensively used in physics and chemistry for the simulation of canonical ensemble (NVT), i.e., of an ensemble with constant temperature
5 Smoluchowski dynamics (1) dy y t = 1 2 U(Y y t )dt + KTdW t Y y 0 = y Rn, U : R n R and W is an n-dimensional standard Wiener process Unique invariant measure given by the Gibbs measure µ KT (dy) = 1 e U(y) KT dy C T Ergodicity, i.e., Y y converges in law to µ KT Extensively used in physics and chemistry for the simulation of canonical ensemble (NVT), i.e., of an ensemble with constant temperature
6 Motivation of simulated annealing For T 0, the Gibbs measure µ KT (dy) = 1 e U(y) KT dy arg min U(y). C T y R n Choose a cooling schedule T = T(t) such that the instantaneously invariant measures µ KT(t) concentrate around arg min U(y) for t, the (time-inhomogeneous) Markov process dy y t = 1 2 U(Y y t )dt + KT(t)dW t remains ergodic.
7 Spectral gap Consider the infinitesimal generator L σ of the Smoluchowski SDE with constant σ = KT: L σ f = 1 2 U, f + σ 2 f. L σ is symmetric on L 2 (R n, µ σ ) and has a discrete, non-positive spectrum. Spectral gap λ σ = σ { } 2 inf f L 2 (µ σ ) f L 2 (µ σ ) = 1 and fdµ σ = 0 R n λ σ controls the convergence of the distribution of the Smoluchowski process to its invariant distribution.
8 Elliptic simulated annealing Assume that U is smooth, U and U converge to infinity for x, U 2 U is bounded from below. Theorem Given a decreasing cooling schedule σ = σ(t) 0, such that σ(t) = k/ log(t) for some constant k > c, where c = lim t σ(t) log(λ σ(t) ). Then the law of the process Y σ( ) t converges to a distribution supported on arg min y U(y).
9 Heisenberg groups construction We consider the Heisenberg groups as a prototype of the state space of hypo-elliptic simulated annealing. denotes the space of non-commutative polynomials of degree 2 in p variables {e 1,..., e p }. A 2 p Forms a nil-potent associative algebra of degree two. g 2 p denotes the Lie algebra generated by {e 1,..., e p } (with respect to [x, y] = xy yx, x, y A 2 p ). Define exp : g 2 p A 2 p by its (nil-potent) power series and set G 2 p exp ( g 2 p).
10 Heisenberg groups properties exp : g 2 p Gp 2 is a global chart of the Lie group G2 p. Representation as matrix group, e.g., for p = 2: 1 a c G b a, b, c R dim(gp) 2 = (p + 1)p/2 Brownian motion X t defined by X 0 = 1 Gp 2 and p dx t = X t e i dbt i i=1 Natural to use X t as driving noise for simulated annealing on Gp 2 or g2 p
11 Heisenberg groups properties exp : g 2 p Gp 2 is a global chart of the Lie group G2 p. Representation as matrix group, e.g., for p = 2: 1 a c G b a, b, c R dim(gp) 2 = (p + 1)p/2 Brownian motion X t defined by X 0 = 1 Gp 2 and p dx t = X t e i dbt i i=1 Natural to use X t as driving noise for simulated annealing on Gp 2 or g2 p
12 Elliptic vs. hypo-elliptic simulated annealing Starting point of elliptic simulated annealing A small stochastic perturbation of a classical gradient flow allows the flow to overcome local minima (having the Gibbs measure as invariant distribution). Decreasing the perturbation slowly enough induces convergence to arg min U. Starting point of hypo-elliptic simulated annealing Given a driving, hypo-elliptic process. Want to construct a Markov process with invariant measure given by the Gibbs measure. How does the appropriate drift look like?
13 Elliptic vs. hypo-elliptic simulated annealing Starting point of elliptic simulated annealing A small stochastic perturbation of a classical gradient flow allows the flow to overcome local minima (having the Gibbs measure as invariant distribution). Decreasing the perturbation slowly enough induces convergence to arg min U. Starting point of hypo-elliptic simulated annealing Given a driving, hypo-elliptic process. Want to construct a Markov process with invariant measure given by the Gibbs measure. How does the appropriate drift look like?
14 Homogeneous spaces Definition Given a Lie group G. A finite-dimensional smooth manifold M such that there is a right-action r : M G M, i.e., r(r(x, g), h) = r(x, gh), x M, g, h G, r is transitive, i.e., x M, g r(x, g) is surjective, is called homogeneous space. Projection: for a fixed point o M, define π : G M by π(g) = r(o, g).
15 Setting of hypo-elliptic simulated annealing Assumption A 1 G is a finite-dimensional, connected Lie group with Lie algebra g and right-invariant Haar measure η. 2 M is a compact homogeneous space w.r.t. G with a positive finite measure η M invariant w.r.t. the right action of G on M. 3 U C (M; [0, [). Remark Assumption A is satisfied by compact Lie groups like SO(3), acting on themselves.
16 Heisenberg torus G 2 p is not compact. Define a discrete sub-group of G 2 p. l 2 p = { e i i = 1,..., p } { 1 2 [e i, e j ] i < j } Z g 2 P Lp 2 exp(l 2 p) Gp 2 M L 2 p G 2 p = { L 2 p g g G2 p } is called Heisenberg torus (not a group!). Construct a right-invariant measure η M from the Lebesgue measure on T p(p+1)/2 using M T p(p+1)/2. E.g.,, for p = 2, set e 3 = 1 2 [e 1, e 2 ] and define φ : g 2 2 T3 by φ(z 1 e 1 + z 2 e 2 + z 3 e 3 ) = ([z 1 ], [z 2 ], [z 3 [z 2 ]z 1 + [z 1 ]z 2 ]), where [z] z mod 1. Get a diffeom. φ exp 1 : L 2 2 G2 2 T3. M together with η M satisfies Assumption A.
17 Hypo-ellipticity Assumption B Let n = dim(g) and assume that there are d < n left-invariant vector-fields V 1,..., V d on G, which already generate g (Hörmander condition). Define a stochastic process X t on G with X 0 = 1 G and d dx t = V i (X t ) dbt i. i=1 X t is hypo-elliptic, i.e., has a smooth transition density. For G = G 2 p, d = p < p(p+1) 2 = n and V i (x) = xe i, i = 1,..., p.
18 Hypo-ellipticity Assumption B Let n = dim(g) and assume that there are d < n left-invariant vector-fields V 1,..., V d on G, which already generate g (Hörmander condition). Define a stochastic process X t on G with X 0 = 1 G and d dx t = V i (X t ) dbt i. i=1 X t is hypo-elliptic, i.e., has a smooth transition density. For G = G 2 p, d = p < p(p+1) 2 = n and V i (x) = xe i, i = 1,..., p.
19 Sub-Riemannian gradient Drift 1 2 U is the direction of steepest descent in a Riemannian environment. Noise X t can traverse the whole space, but locally only horizontal directions are possible. Carré-du-champs operator d Γ(f, g)(x) = V i f(x)v i g(x), i=1 x G Γ(U, ) : f Γ(U, f) defines a left-invariant, horizontal vector-field.
20 Sub-Riemannian gradient Drift 1 2 U is the direction of steepest descent in a Riemannian environment. Noise X t can traverse the whole space, but locally only horizontal directions are possible. Carré-du-champs operator d Γ(f, g)(x) = V i f(x)v i g(x), i=1 x G Γ(U, ) : f Γ(U, f) defines a left-invariant, horizontal vector-field.
21 Hypo-elliptic Smoluchowski dynamics σ = σ(t) cooling schedule. Push the vector fields V 1,..., V d and Γ(U, ) to vector fields V M 1,..., V M d and ΓM (U, ) on M using π : G M. Define the Smoluchowski dynamics on M dy t = 1 2 ΓM (U, )(Y t )dt + σ(t) d i=1 V M i (Y t ) db i t. Locally invariant Gibbs measure µ σ (dx) = 1 ( exp U(x) ) η M (dx). C σ σ
22 Hypo-elliptic simulated annealing Theorem (Baudoin, Hairer and Teichmann) Let U 0 = min x M U(x). There are constants R, c > 0 such that the simulated annealing process Y t with σ(t) = c log(r + t) satisfies P(Y t A δ ) D µ σ(t) (A δ ), δ > 0, where A δ = { x M U(x) U0 + δ }. Remark For a non-compact state space M, there are additional boundedness conditions, e.g., on U(x) d(x, x0 ) 2.
23 Set-up in R 3 1 Since g 2 2 R3, hypo-elliptic simulated annealing in G 2 2 can be interpreted as hypo-elliptic simulated annealing in R V 1 (x) = 0, V 2(x) = 1. x 2 x 1 This corresponds to the sub-riemannian gradient x1 U(x) x 2 x3 U(x) Γ(U, )(x) = x2 U(x) + x 1 x3 U(x) x 1 x2 U(x) x 2 x1 U(x) + (x x2 2 ) x 3 U(x).
24 Set-up in R 3 2 We test a variant of the Rastrigin potential U(x) = i=1 ( x 2 i 10 cos(2πx i ) ). Note that min U = 0 attained at y min = (0, 0, 0). Remark The Riemannian gradient U grows linearly in x, whereas the sub-riemannian gradient Γ(U, ) grows like x 3, which requires a much finer time-resolution for the approximation of the SDE.
25 Results table Elliptic simulated annealing t E( Y t ) E(U(Y t )) min ω U(Y t (ω)) Hypo-elliptic simulated annealing t E( Y t ) E(U(Y t )) min ω U(Y t (ω)) Y 0 = (5, 5, 5), Y 0 = 8.66, U(Y 0 ) = 50.25, y min = (0, 0, 0) c = 15 E denotes an average over 500 sampled paths
26 Results histogram for t = 1 Starting value: Y 0 = (5, 5, 5), c = 15, y min = (0, 0, 0).
27 Results histogram for t = 4000 Starting value: Y 0 = (5, 5, 5), c = 15, y min = (0, 0, 0).
28 Results histogram for t = 4000 for too fast cooling Starting value: Y 0 = (5, 5, 5), c = 3, y min = (0, 0, 0).
29 Set-up Represent SO(3) S 3 Choose to vector fields from so(3) Potential V 1 =, V = U(x) = (x 1 + 1) 4 2 cos(2π(x 1 + 1)) + x 2 2 cos(πx 2)+ + x cos(2πx 3) + x 2 4 cos(πx 4).
30 Set up 2 Potential U(x) = (x 1 + 1) 4 2 cos(2π(x 1 + 1)) + x 2 2 cos(πx 2)+ + x cos(2πx 3) + x 2 4 cos(πx 4). Use a geometrical approximation scheme for the solution of the SDE, i.e., X n SO(3) for every n min y U(y) = 0 attained at y min = ( 1, 0, 0, 0) We start at y 0 = (1, 0, 0, 0). The scheme is simpler than any elliptic simulated annealing scheme.
31 Set up 2 Potential U(x) = (x 1 + 1) 4 2 cos(2π(x 1 + 1)) + x 2 2 cos(πx 2)+ + x cos(2πx 3) + x 2 4 cos(πx 4). Use a geometrical approximation scheme for the solution of the SDE, i.e., X n SO(3) for every n min y U(y) = 0 attained at y min = ( 1, 0, 0, 0) We start at y 0 = (1, 0, 0, 0). The scheme is simpler than any elliptic simulated annealing scheme.
32 Numerical results Hypo-elliptic simulated annealing, c = 1.4 t E( Y t y min ) E(U(Y t )) min ω Y t (ω) Hypo-elliptic simulated annealing, c = 5 t E( Y t y min ) E(U(Y t )) min ω Y t (ω) Y 0 = (1, 0, 0, 0), y min = ( 1, 0, 0, 0), Y 0 y min = 2, U(Y 0 ) = 16
33 Histogram t = 2, c =
34 Histogram t = 62, c =
35 Histogram t = 65534, c =
36 Histogram t = , c =
37 Conclusions Construction of hypo-elliptic Smoluchowski (or Ornstein-Uhlenbeck) processes with Gibbs measure as invariant measure Simulated annealing for hypo-elliptic Smoluchowski processes both theoretical and experimental justification Additional numerical cost due to instability in genuinely elliptic situations (e.g., when vector fields need to be non-linear for hypo-elliptic simulated annealing) Competitive in certain situations of constraint optimization
38 References F. Baudoin, M. Hairer, J. Teichmann. Ornstein-Uhlenbeck processes on Lie groups, J. Func. Anal., 255(4), B. Driver, T. Melcher. Hypoelliptic heat kernel inequalities on the Heisenberg group, J. Func. Anal., 221(2), R. Holley, S. Kusuoka, D. Stroock. Asymptotics of the spectral gap with applications to the theory of simulated annealing, J. Func. Anal., 83(2), S. Kirkpatrick, C. D. Gelett, M. P. Vecchi. Optimization by simulated annealing, Science 220, May L. Miclo. Recuit simulé sur R n. Etude del l évolution de l énergie libre., Ann. Inst. H. Poincaré Prob. Stat., 28(2), 1992.
EXIT TIME PROBLEMS AND ESCAPE FROM A POTENTIAL WELL
EXIT TIME PROBLEMS AND ESCAPE FROM A POTENTIAL WELL Exit Time problems and Escape from a Potential Well Escape From a Potential Well There are many systems in physics, chemistry and biology that exist
More informationTwo Topics in Parametric Integration Applied to Stochastic Simulation in Industrial Engineering
Two Topics in Parametric Integration Applied to Stochastic Simulation in Industrial Engineering Department of Industrial Engineering and Management Sciences Northwestern University September 15th, 2014
More informationA class of infinite dimensional stochastic processes
A class of infinite dimensional stochastic processes John Karlsson Linköping University CRM Barcelona, July 7, 214 Joint work with Jörg-Uwe Löbus John Karlsson (Linköping University) Infinite dimensional
More informationMathematical Finance
Mathematical Finance Option Pricing under the Risk-Neutral Measure Cory Barnes Department of Mathematics University of Washington June 11, 2013 Outline 1 Probability Background 2 Black Scholes for European
More informationPricing and calibration in local volatility models via fast quantization
Pricing and calibration in local volatility models via fast quantization Parma, 29 th January 2015. Joint work with Giorgia Callegaro and Martino Grasselli Quantization: a brief history Birth: back to
More informationAdaptive Search with Stochastic Acceptance Probabilities for Global Optimization
Adaptive Search with Stochastic Acceptance Probabilities for Global Optimization Archis Ghate a and Robert L. Smith b a Industrial Engineering, University of Washington, Box 352650, Seattle, Washington,
More informationMATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.
MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α
More informationIntroduction to Markov Chain Monte Carlo
Introduction to Markov Chain Monte Carlo Monte Carlo: sample from a distribution to estimate the distribution to compute max, mean Markov Chain Monte Carlo: sampling using local information Generic problem
More informationSOLUTIONS. f x = 6x 2 6xy 24x, f y = 3x 2 6y. To find the critical points, we solve
SOLUTIONS Problem. Find the critical points of the function f(x, y = 2x 3 3x 2 y 2x 2 3y 2 and determine their type i.e. local min/local max/saddle point. Are there any global min/max? Partial derivatives
More informationFuzzy Probability Distributions in Bayesian Analysis
Fuzzy Probability Distributions in Bayesian Analysis Reinhard Viertl and Owat Sunanta Department of Statistics and Probability Theory Vienna University of Technology, Vienna, Austria Corresponding author:
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationMonte Carlo Methods in Finance
Author: Yiyang Yang Advisor: Pr. Xiaolin Li, Pr. Zari Rachev Department of Applied Mathematics and Statistics State University of New York at Stony Brook October 2, 2012 Outline Introduction 1 Introduction
More informationIs a Brownian motion skew?
Is a Brownian motion skew? Ernesto Mordecki Sesión en honor a Mario Wschebor Universidad de la República, Montevideo, Uruguay XI CLAPEM - November 2009 - Venezuela 1 1 Joint work with Antoine Lejay and
More informationLecture 10. Finite difference and finite element methods. Option pricing Sensitivity analysis Numerical examples
Finite difference and finite element methods Lecture 10 Sensitivities and Greeks Key task in financial engineering: fast and accurate calculation of sensitivities of market models with respect to model
More informationStatistical Machine Learning
Statistical Machine Learning UoC Stats 37700, Winter quarter Lecture 4: classical linear and quadratic discriminants. 1 / 25 Linear separation For two classes in R d : simple idea: separate the classes
More informationOn the mathematical theory of splitting and Russian roulette
On the mathematical theory of splitting and Russian roulette techniques St.Petersburg State University, Russia 1. Introduction Splitting is an universal and potentially very powerful technique for increasing
More informationLipschitz classes of A-harmonic functions in Carnot groups
Lipschitz classes of A-harmonic functions in Carnot groups Craig A. Nolder Department of Mathematics Florida State University Tallahassee, FL 32306-4510, USA nolder@math.fsu.edu 30 October 2005 Abstract
More informationMaximum likelihood estimation of mean reverting processes
Maximum likelihood estimation of mean reverting processes José Carlos García Franco Onward, Inc. jcpollo@onwardinc.com Abstract Mean reverting processes are frequently used models in real options. For
More informationMetrics on SO(3) and Inverse Kinematics
Mathematical Foundations of Computer Graphics and Vision Metrics on SO(3) and Inverse Kinematics Luca Ballan Institute of Visual Computing Optimization on Manifolds Descent approach d is a ascent direction
More informationSome stability results of parameter identification in a jump diffusion model
Some stability results of parameter identification in a jump diffusion model D. Düvelmeyer Technische Universität Chemnitz, Fakultät für Mathematik, 09107 Chemnitz, Germany Abstract In this paper we discuss
More informationCommunication on the Grassmann Manifold: A Geometric Approach to the Noncoherent Multiple-Antenna Channel
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 2, FEBRUARY 2002 359 Communication on the Grassmann Manifold: A Geometric Approach to the Noncoherent Multiple-Antenna Channel Lizhong Zheng, Student
More informationBayesian Adaptive Trading with a Daily Cycle
Bayesian Adaptive Trading with a Daily Cycle Robert Almgren and Julian Lorenz July 28, 26 Abstract Standard models of algorithmic trading neglect the presence of a daily cycle. We construct a model in
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More informationLinköping University Electronic Press
Linköping University Electronic Press Report Well-posed boundary conditions for the shallow water equations Sarmad Ghader and Jan Nordström Series: LiTH-MAT-R, 0348-960, No. 4 Available at: Linköping University
More informationThe Black-Scholes-Merton Approach to Pricing Options
he Black-Scholes-Merton Approach to Pricing Options Paul J Atzberger Comments should be sent to: atzberg@mathucsbedu Introduction In this article we shall discuss the Black-Scholes-Merton approach to determining
More informationStochastic Gradient Method: Applications
Stochastic Gradient Method: Applications February 03, 2015 P. Carpentier Master MMMEF Cours MNOS 2014-2015 114 / 267 Lecture Outline 1 Two Elementary Exercices on the Stochastic Gradient Two-Stage Recourse
More informationDisability insurance: estimation and risk aggregation
Disability insurance: estimation and risk aggregation B. Löfdahl Department of Mathematics KTH, Royal Institute of Technology May 2015 Introduction New upcoming regulation for insurance industry: Solvency
More informationNumerical Methods For Image Restoration
Numerical Methods For Image Restoration CIRAM Alessandro Lanza University of Bologna, Italy Faculty of Engineering CIRAM Outline 1. Image Restoration as an inverse problem 2. Image degradation models:
More informationA Stochastic 3MG Algorithm with Application to 2D Filter Identification
A Stochastic 3MG Algorithm with Application to 2D Filter Identification Emilie Chouzenoux 1, Jean-Christophe Pesquet 1, and Anisia Florescu 2 1 Laboratoire d Informatique Gaspard Monge - CNRS Univ. Paris-Est,
More informationOn a comparison result for Markov processes
On a comparison result for Markov processes Ludger Rüschendorf University of Freiburg Abstract A comparison theorem is stated for Markov processes in polish state spaces. We consider a general class of
More informationCHAPTER IV - BROWNIAN MOTION
CHAPTER IV - BROWNIAN MOTION JOSEPH G. CONLON 1. Construction of Brownian Motion There are two ways in which the idea of a Markov chain on a discrete state space can be generalized: (1) The discrete time
More informationWhy do mathematicians make things so complicated?
Why do mathematicians make things so complicated? Zhiqin Lu, The Math Department March 9, 2010 Introduction What is Mathematics? Introduction What is Mathematics? 24,100,000 answers from Google. Introduction
More informationAnalysis of Mean-Square Error and Transient Speed of the LMS Adaptive Algorithm
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 7, JULY 2002 1873 Analysis of Mean-Square Error Transient Speed of the LMS Adaptive Algorithm Onkar Dabeer, Student Member, IEEE, Elias Masry, Fellow,
More informationModern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem
More informationMath 526: Brownian Motion Notes
Math 526: Brownian Motion Notes Definition. Mike Ludkovski, 27, all rights reserved. A stochastic process (X t ) is called Brownian motion if:. The map t X t (ω) is continuous for every ω. 2. (X t X t
More informationNumerical Methods for Differential Equations
Numerical Methods for Differential Equations Course objectives and preliminaries Gustaf Söderlind and Carmen Arévalo Numerical Analysis, Lund University Textbooks: A First Course in the Numerical Analysis
More informationPull versus Push Mechanism in Large Distributed Networks: Closed Form Results
Pull versus Push Mechanism in Large Distributed Networks: Closed Form Results Wouter Minnebo, Benny Van Houdt Dept. Mathematics and Computer Science University of Antwerp - iminds Antwerp, Belgium Wouter
More informationSome Research Problems in Uncertainty Theory
Journal of Uncertain Systems Vol.3, No.1, pp.3-10, 2009 Online at: www.jus.org.uk Some Research Problems in Uncertainty Theory aoding Liu Uncertainty Theory Laboratory, Department of Mathematical Sciences
More informationExponentially small splitting of separatrices for1 1 2 degrees of freedom Hamiltonian Systems close to a resonance. Marcel Guardia
Exponentially small splitting of separatrices for1 1 2 degrees of freedom Hamiltonian Systems close to a resonance Marcel Guardia 1 1 1 2 degrees of freedom Hamiltonian systems We consider close to completely
More informationIn which Financial Markets do Mutual Fund Theorems hold true?
In which Financial Markets do Mutual Fund Theorems hold true? W. Schachermayer M. Sîrbu E. Taflin Abstract The Mutual Fund Theorem (MFT) is considered in a general semimartingale financial market S with
More informationSensitivity analysis of utility based prices and risk-tolerance wealth processes
Sensitivity analysis of utility based prices and risk-tolerance wealth processes Dmitry Kramkov, Carnegie Mellon University Based on a paper with Mihai Sirbu from Columbia University Math Finance Seminar,
More informationTrading activity as driven Poisson process: comparison with empirical data
Trading activity as driven Poisson process: comparison with empirical data V. Gontis, B. Kaulakys, J. Ruseckas Institute of Theoretical Physics and Astronomy of Vilnius University, A. Goštauto 2, LT-008
More informationDiscussion on the paper Hypotheses testing by convex optimization by A. Goldenschluger, A. Juditsky and A. Nemirovski.
Discussion on the paper Hypotheses testing by convex optimization by A. Goldenschluger, A. Juditsky and A. Nemirovski. Fabienne Comte, Celine Duval, Valentine Genon-Catalot To cite this version: Fabienne
More informationIntroduction to the Finite Element Method
Introduction to the Finite Element Method 09.06.2009 Outline Motivation Partial Differential Equations (PDEs) Finite Difference Method (FDM) Finite Element Method (FEM) References Motivation Figure: cross
More informationFunctional Principal Components Analysis with Survey Data
First International Workshop on Functional and Operatorial Statistics. Toulouse, June 19-21, 2008 Functional Principal Components Analysis with Survey Data Hervé CARDOT, Mohamed CHAOUCH ( ), Camelia GOGA
More informationPerron vector Optimization applied to search engines
Perron vector Optimization applied to search engines Olivier Fercoq INRIA Saclay and CMAP Ecole Polytechnique May 18, 2011 Web page ranking The core of search engines Semantic rankings (keywords) Hyperlink
More informationMICROLOCAL ANALYSIS OF THE BOCHNER-MARTINELLI INTEGRAL
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 MICROLOCAL ANALYSIS OF THE BOCHNER-MARTINELLI INTEGRAL NIKOLAI TARKHANOV AND NIKOLAI VASILEVSKI
More information1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
More informationGrey Brownian motion and local times
Grey Brownian motion and local times José Luís da Silva 1,2 (Joint work with: M. Erraoui 3 ) 2 CCM - Centro de Ciências Matemáticas, University of Madeira, Portugal 3 University Cadi Ayyad, Faculty of
More informationThe Quantum Harmonic Oscillator Stephen Webb
The Quantum Harmonic Oscillator Stephen Webb The Importance of the Harmonic Oscillator The quantum harmonic oscillator holds a unique importance in quantum mechanics, as it is both one of the few problems
More informationMath 120 Final Exam Practice Problems, Form: A
Math 120 Final Exam Practice Problems, Form: A Name: While every attempt was made to be complete in the types of problems given below, we make no guarantees about the completeness of the problems. Specifically,
More informationQUADRATIC SYSTEMS WITH A RATIONAL FIRST INTEGRAL OF DEGREE THREE: A COMPLETE CLASSIFICATION IN THE COEFFICIENT SPACE R 12
QUADRATIC SYSTEMS WITH A RATIONAL FIRST INTEGRAL OF DEGREE THREE: A COMPLETE CLASSIFICATION IN THE COEFFICIENT SPACE R 12 JOAN C. ARTÉS1, JAUME LLIBRE 1 AND NICOLAE VULPE 2 Abstract. A quadratic polynomial
More informationSPECTRAL POLYNOMIAL ALGORITHMS FOR COMPUTING BI-DIAGONAL REPRESENTATIONS FOR PHASE TYPE DISTRIBUTIONS AND MATRIX-EXPONENTIAL DISTRIBUTIONS
Stochastic Models, 22:289 317, 2006 Copyright Taylor & Francis Group, LLC ISSN: 1532-6349 print/1532-4214 online DOI: 10.1080/15326340600649045 SPECTRAL POLYNOMIAL ALGORITHMS FOR COMPUTING BI-DIAGONAL
More informationTail inequalities for order statistics of log-concave vectors and applications
Tail inequalities for order statistics of log-concave vectors and applications Rafał Latała Based in part on a joint work with R.Adamczak, A.E.Litvak, A.Pajor and N.Tomczak-Jaegermann Banff, May 2011 Basic
More informationON THE NUMBER OF REAL HYPERSURFACES HYPERTANGENT TO A GIVEN REAL SPACE CURVE
Illinois Journal of Mathematics Volume 46, Number 1, Spring 2002, Pages 145 153 S 0019-2082 ON THE NUMBER OF REAL HYPERSURFACES HYPERTANGENT TO A GIVEN REAL SPACE CURVE J. HUISMAN Abstract. Let C be a
More informationIntroduction to Support Vector Machines. Colin Campbell, Bristol University
Introduction to Support Vector Machines Colin Campbell, Bristol University 1 Outline of talk. Part 1. An Introduction to SVMs 1.1. SVMs for binary classification. 1.2. Soft margins and multi-class classification.
More informationLimits and Continuity
Math 20C Multivariable Calculus Lecture Limits and Continuity Slide Review of Limit. Side limits and squeeze theorem. Continuous functions of 2,3 variables. Review: Limits Slide 2 Definition Given a function
More informationTHE MULTIVARIATE ANALYSIS RESEARCH GROUP. Carles M Cuadras Departament d Estadística Facultat de Biologia Universitat de Barcelona
THE MULTIVARIATE ANALYSIS RESEARCH GROUP Carles M Cuadras Departament d Estadística Facultat de Biologia Universitat de Barcelona The set of statistical methods known as Multivariate Analysis covers a
More informationNotes on metric spaces
Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.
More informationMatrices and Polynomials
APPENDIX 9 Matrices and Polynomials he Multiplication of Polynomials Let α(z) =α 0 +α 1 z+α 2 z 2 + α p z p and y(z) =y 0 +y 1 z+y 2 z 2 + y n z n be two polynomials of degrees p and n respectively. hen,
More informationRate of convergence towards Hartree dynamics
Rate of convergence towards Hartree dynamics Benjamin Schlein, LMU München and University of Cambridge Universitá di Milano Bicocca, October 22, 2007 Joint work with I. Rodnianski 1. Introduction boson
More informationMATH 425, PRACTICE FINAL EXAM SOLUTIONS.
MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator
More informationPATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION
PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION Introduction In the previous chapter, we explored a class of regression models having particularly simple analytical
More informationEECS 556 Image Processing W 09. Interpolation. Interpolation techniques B splines
EECS 556 Image Processing W 09 Interpolation Interpolation techniques B splines What is image processing? Image processing is the application of 2D signal processing methods to images Image representation
More informationSection 6.1 - Inner Products and Norms
Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,
More informationLinear Threshold Units
Linear Threshold Units w x hx (... w n x n w We assume that each feature x j and each weight w j is a real number (we will relax this later) We will study three different algorithms for learning linear
More informationChapter 2: Binomial Methods and the Black-Scholes Formula
Chapter 2: Binomial Methods and the Black-Scholes Formula 2.1 Binomial Trees We consider a financial market consisting of a bond B t = B(t), a stock S t = S(t), and a call-option C t = C(t), where the
More informationIntroduction to Arbitrage-Free Pricing: Fundamental Theorems
Introduction to Arbitrage-Free Pricing: Fundamental Theorems Dmitry Kramkov Carnegie Mellon University Workshop on Interdisciplinary Mathematics, Penn State, May 8-10, 2015 1 / 24 Outline Financial market
More informationComputational Foundations of Cognitive Science
Computational Foundations of Cognitive Science Lecture 15: Convolutions and Kernels Frank Keller School of Informatics University of Edinburgh keller@inf.ed.ac.uk February 23, 2010 Frank Keller Computational
More informationRANDOM INTERVAL HOMEOMORPHISMS. MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis
RANDOM INTERVAL HOMEOMORPHISMS MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis This is a joint work with Lluís Alsedà Motivation: A talk by Yulij Ilyashenko. Two interval maps, applied
More informationDECOMPOSING SL 2 (R)
DECOMPOSING SL 2 R KEITH CONRAD Introduction The group SL 2 R is not easy to visualize: it naturally lies in M 2 R, which is 4- dimensional the entries of a variable 2 2 real matrix are 4 free parameters
More informationMarkov Chain Monte Carlo and Numerical Differential Equations
Markov Chain Monte Carlo and Numerical Differential Equations J.M. Sanz-Serna 1 Introduction This contribution presents a hopefully readable introduction to Markov Chain Monte Carlo methods with particular
More informationTHE CENTRAL LIMIT THEOREM TORONTO
THE CENTRAL LIMIT THEOREM DANIEL RÜDT UNIVERSITY OF TORONTO MARCH, 2010 Contents 1 Introduction 1 2 Mathematical Background 3 3 The Central Limit Theorem 4 4 Examples 4 4.1 Roulette......................................
More informationGenOpt (R) Generic Optimization Program User Manual Version 3.0.0β1
(R) User Manual Environmental Energy Technologies Division Berkeley, CA 94720 http://simulationresearch.lbl.gov Michael Wetter MWetter@lbl.gov February 20, 2009 Notice: This work was supported by the U.S.
More informationIntroduction to Online Learning Theory
Introduction to Online Learning Theory Wojciech Kot lowski Institute of Computing Science, Poznań University of Technology IDSS, 04.06.2013 1 / 53 Outline 1 Example: Online (Stochastic) Gradient Descent
More information. P. 4.3 Basic feasible solutions and vertices of polyhedra. x 1. x 2
4. Basic feasible solutions and vertices of polyhedra Due to the fundamental theorem of Linear Programming, to solve any LP it suffices to consider the vertices (finitely many) of the polyhedron P of the
More informationDiusion processes. Olivier Scaillet. University of Geneva and Swiss Finance Institute
Diusion processes Olivier Scaillet University of Geneva and Swiss Finance Institute Outline 1 Brownian motion 2 Itô integral 3 Diusion processes 4 Black-Scholes 5 Equity linked life insurance 6 Merton
More informationHedging Options In The Incomplete Market With Stochastic Volatility. Rituparna Sen Sunday, Nov 15
Hedging Options In The Incomplete Market With Stochastic Volatility Rituparna Sen Sunday, Nov 15 1. Motivation This is a pure jump model and hence avoids the theoretical drawbacks of continuous path models.
More informationA spot price model feasible for electricity forward pricing Part II
A spot price model feasible for electricity forward pricing Part II Fred Espen Benth Centre of Mathematics for Applications (CMA) University of Oslo, Norway Wolfgang Pauli Institute, Wien January 17-18
More informationMathematical Physics, Lecture 9
Mathematical Physics, Lecture 9 Hoshang Heydari Fysikum April 25, 2012 Hoshang Heydari (Fysikum) Mathematical Physics, Lecture 9 April 25, 2012 1 / 42 Table of contents 1 Differentiable manifolds 2 Differential
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationThe Heat Equation. Lectures INF2320 p. 1/88
The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)
More informationSolutions to Homework 5
Solutions to Homework 5 1. Let z = f(x, y) be a twice continously differentiable function of x and y. Let x = r cos θ and y = r sin θ be the equations which transform polar coordinates into rectangular
More informationA BOUND ON LIBOR FUTURES PRICES FOR HJM YIELD CURVE MODELS
A BOUND ON LIBOR FUTURES PRICES FOR HJM YIELD CURVE MODELS VLADIMIR POZDNYAKOV AND J. MICHAEL STEELE Abstract. We prove that for a large class of widely used term structure models there is a simple theoretical
More informationRenormalization and Effective Field Theory
Renormalization and Effective Field Theory Kevin Costello This is a preliminary version of the book Renormalization and Effective Field Theory published by the American Mathematical Society (AMS). This
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More informationRisk Formulæ for Proportional Betting
Risk Formulæ for Proportional Betting William Chin DePaul University, Chicago, Illinois Marc Ingenoso Conger Asset Management LLC, Chicago, Illinois September 9, 2006 Introduction A canon of the theory
More informationVariational approach to restore point-like and curve-like singularities in imaging
Variational approach to restore point-like and curve-like singularities in imaging Daniele Graziani joint work with Gilles Aubert and Laure Blanc-Féraud Roma 12/06/2012 Daniele Graziani (Roma) 12/06/2012
More informationExample of High Dimensional Contract
Example of High Dimensional Contract An exotic high dimensional option is the ING-Coconote option (Conditional Coupon Note), whose lifetime is 8 years (24-212). The interest rate paid is flexible. In the
More informationWho Should Sell Stocks?
Who Should Sell Stocks? Ren Liu joint work with Paolo Guasoni and Johannes Muhle-Karbe ETH Zürich Imperial-ETH Workshop on Mathematical Finance 2015 1 / 24 Merton s Problem (1969) Frictionless market consisting
More informationUNIVERSITY GRADUATE STUDIES PROGRAM SILLIMAN UNIVERSITY DUMAGUETE CITY. Master of Science in Mathematics
1 UNIVERSITY GRADUATE STUDIES PROGRAM SILLIMAN UNIVERSITY DUMAGUETE CITY Master of Science in Mathematics Introduction The Master of Science in Mathematics (MS Math) program is intended for students who
More informationBig Data - Lecture 1 Optimization reminders
Big Data - Lecture 1 Optimization reminders S. Gadat Toulouse, Octobre 2014 Big Data - Lecture 1 Optimization reminders S. Gadat Toulouse, Octobre 2014 Schedule Introduction Major issues Examples Mathematics
More informationMean Reversion versus Random Walk in Oil and Natural Gas Prices
Mean Reversion versus Random Walk in Oil and Natural Gas Prices Hélyette Geman Birkbeck, University of London, United Kingdom & ESSEC Business School, Cergy-Pontoise, France hgeman@ems.bbk.ac.uk Summary.
More informationCS 688 Pattern Recognition Lecture 4. Linear Models for Classification
CS 688 Pattern Recognition Lecture 4 Linear Models for Classification Probabilistic generative models Probabilistic discriminative models 1 Generative Approach ( x ) p C k p( C k ) Ck p ( ) ( x Ck ) p(
More informationNumerisches Rechnen. (für Informatiker) M. Grepl J. Berger & J.T. Frings. Institut für Geometrie und Praktische Mathematik RWTH Aachen
(für Informatiker) M. Grepl J. Berger & J.T. Frings Institut für Geometrie und Praktische Mathematik RWTH Aachen Wintersemester 2010/11 Problem Statement Unconstrained Optimality Conditions Constrained
More informationMoreover, under the risk neutral measure, it must be the case that (5) r t = µ t.
LECTURE 7: BLACK SCHOLES THEORY 1. Introduction: The Black Scholes Model In 1973 Fisher Black and Myron Scholes ushered in the modern era of derivative securities with a seminal paper 1 on the pricing
More informationDIRICHLET S PROBLEM WITH ENTIRE DATA POSED ON AN ELLIPSOIDAL CYLINDER. 1. Introduction
DIRICHLET S PROBLEM WITH ENTIRE DATA POSED ON AN ELLIPSOIDAL CYLINDER DMITRY KHAVINSON, ERIK LUNDBERG, HERMANN RENDER. Introduction A function u is said to be harmonic if u := n j= 2 u = 0. Given a domain
More informationComputational Statistics for Big Data
Lancaster University Computational Statistics for Big Data Author: 1 Supervisors: Paul Fearnhead 1 Emily Fox 2 1 Lancaster University 2 The University of Washington September 1, 2015 Abstract The amount
More informationPower-law Price-impact Models and Stock Pinning near Option Expiration Dates. Marco Avellaneda Gennady Kasyan Michael D. Lipkin
Power-law Price-impact Models and Stock Pinning near Option Expiration Dates Marco Avellaneda Gennady Kasyan Michael D. Lipkin PDE in Finance, Stockholm, August 7 Summary Empirical evidence of stock pinning
More informationStaffing and Control of Instant Messaging Contact Centers
OPERATIONS RESEARCH Vol. 61, No. 2, March April 213, pp. 328 343 ISSN 3-364X (print) ISSN 1526-5463 (online) http://dx.doi.org/1.1287/opre.112.1151 213 INFORMS Staffing and Control of Instant Messaging
More information