An Algebraic and Geometric Perspective on Exponential Families

Size: px
Start display at page:

Download "An Algebraic and Geometric Perspective on Exponential Families"

Transcription

1 An Algebraic and Geometric Perspective on Exponential Families Caroline Uhler (IST Austria) Based on two papers: with Mateusz Micha lek, Bernd Sturmfels, and Piotr Zwiernik, and with Liam Solus and Ruriko Yoshida Current Trends on Gröbner Bases July 10, 2015 Caroline Uhler (IST Austria) Exponential Varieties Osaka, July / 24

2 Gaussian Graphical Models A random vector X R m follows a multivariate Gaussian distribution with concentration matrix θ S m 0 if it has density ( p θ (x) = (2π) m/2 det(θ) 1/2 exp 1 ) 2 x T θx θ ij = 0 if and only if X i X j X {1,...,m}\{i,j} Represent conditional independence relations by undirected graph (a) Gene interactome (Novarino et al., Science 343, 2014) (b) Stock market (Garos & Panos, Physica A 380, 2007) Caroline Uhler (IST Austria) Exponential Varieties Osaka, July / 24

3 Exponential Families An exponential family is a parametric statistical model p θ (x) = exp ( θ, T (x) A(θ) ) with sample space X, base measure ν on X, and sufficient statistics T : X R d (measurable). Theorem A(θ) = log X exp( θ, T (x) ) ν(dx) is the log-partition function The following sets are convex: Space of canonical parameters: C = { θ R d : A(θ) < + } Space of sufficient statistics: K = conv ( T (X ) ) R d Suppose C is open and K spans R d. Then the gradient map F : R d R d, θ A(θ) defines an analytic bijection between C and int(k). Caroline Uhler (IST Austria) Exponential Varieties Osaka, July / 24

4 From Analysis to Algebra Our exponential families satisfy A(θ) = α log(f (θ)), where f (θ) is a homogeneous polynomial and α > 0. The gradient of the log-partition function is the rational function F : R d R d : θ α f (θ) ( f θ 1, f θ 2,..., f θ d ) Algebraic geometers prefer F : CP d 1 CP d 1 : θ ( f θ 1 : f θ 2 : : f ) θ d The partition function f (θ) α = K exp( θ, x ) ν(dx) admits nice integral representation. Which polynomials f (θ), exponents α > 0, and convex sets C, K R d are possible? Caroline Uhler (IST Austria) Exponential Varieties Osaka, July / 24

5 Multivariate Gaussian Distribution The Multivariate Gaussian distribution is the exponential family ( p θ (x) = (2π) m/2 det(θ) 1/2 exp ( = exp θ, 1 2 xx T 1 ) 2 x T θx, ( 1 2 log det(θ) + m )) 2 log(2π) X = R m, ν Lebesgue measure on X d = ( ) m+1 2, A, B = tr (AB) T (x) = 1 2 xx T, A(θ) = 1 2 log det(θ) + m 2 log(2π) C = S m 0, K = Sm 0, F (θ) = 1 2 θ 1 Caroline Uhler (IST Austria) Exponential Varieties Osaka, July / 24

6 Duality of Polytopes Duality of Polytopes Ex: How Example to morph (Howa to cube morph into aancube octahedron? into an octahedron?) [Sturmfels [St-Uhler& 2010, U. 2010, Example Example 3.5] 3.5] Caroline Uhler (IST Austria) Exponential Varieties Osaka, July / 24 6/22

7 Exponential family for cube octahedron Fix the product of linear forms f (θ) = (θ 2 1 θ 2 4)(θ 2 2 θ 2 4)(θ 2 3 θ 2 4) Space of canonical parameters is C = cone over the 3-cube { θ i < 1 : i = 1, 2, 3 } Duality of Polytopes Example (How to morph a cube into an octahedron?) Space of sufficient statistics is [St-Uhler 2010, Example 3.5] K = cone over the octahedron conv{±e 1, ±e 2, ±e 3 } Gradient map f : P 3 P 3 gives bijection between C and int(k). Question: What is (X, ν, T ) in this case? Answer: X = K, T = id, and ν constructed via hypergeometric functions Caroline Uhler (IST Austria) Exponential Varieties Osaka, July / 24

8 Hyperbolic Polynomials A homogeneous polynomial f R[θ 1,..., θ d ] of degree k is hyperbolic if, for some t R d, every line through t intersects the complex hypersurface {f = 0} in k real points. The connected component C of t in R d \{f = 0} is the hyperbolicity cone. It is an open convex cone. Theorem (Scott & Sokal, 2015) Let f be a homogeneous polynomial in R[θ 1,..., θ d ] that is strictly positive on an open convex cone C. If there exists α > 0 and measure ν such that f (θ) α = exp( θ, σ ) ν(dσ) for all θ C, C then f is hyperbolic with respect to each point in C. The resulting statistical models are hyperbolic exponential families. Caroline Uhler (IST Austria) Exponential Varieties Osaka, July / 24

9 Riesz Kernel Theorem (Gårding 1951) Let f R[θ 1,..., θ d ] be hyperbolic with hyperbolicity cone C. If α > d, then the following integral converges for any θ C, is independ of θ, and is supported on K = C : q α (σ) = (2π) d R d f (θ + iη) α exp( θ + iη, σ )dη. The polynomial f can be recovered from the Riesz kernel q α via f (θ) α = K exp( θ, σ ) q α(σ) dσ for all θ C. Given a hyperbolic polynomial, what is the annihilator of the Riesz kernel? f product of linear forms: what is the GKZ-system / D-ideal? f elementary symmetric polynomial? Caroline Uhler (IST Austria) Exponential Varieties Osaka, July / 24

10 Symmetric Determinant f (θ) = det(θ) is a hyperbolic polynomial in d = ( ) m+1 2 unknowns. Hyperbolicity cone C = S m 0 ; its dual is K = C = S m 0. f (θ) has integral representation f (θ) α = exp( θ, σ ) ν(dσ) K for all θ C if and only if α = 0, 1 2,..., m 1 2 or α > m 1 2 Measure ν(dσ) = q α (σ) dσ is given by Wishart density (measure induced on S m 0 by multivariate Gaussian distribution on Rm ) Riesz kernel: q α (σ) = 1 Γ m(α) m+1 det(σ)α 2 Caroline Uhler (IST Austria) Exponential Varieties Osaka, July / 24

11 Hyperbolic Exponential Families: Another Example The space of canonical parameters C is the hyperbolicity cone of f = θ 1 θ 2 θ 3 + θ 1 θ 2 θ 4 + θ 1 θ 3 θ 4 + θ 2 θ 3 θ 4. Caroline Uhler (IST Austria) Exponential Varieties Osaka, July / 24

12 Hyperbolic Exponential Families: Another Example The space of sufficient statistics K = C is defined by the Steiner surface σ 4 i 4 σ 3 i σ j + 6 σ 2 i σ 2 j + 4 σ 2 i σ j σ k 40 σ 1 σ 2 σ 3 σ 4. Caroline Uhler (IST Austria) Exponential Varieties Osaka, July / 24

13 Duality Gradient map f : P 3 P 3 gives a bijection between C and K: Open Problem: What is the Riesz kernel? Caroline Uhler (IST Austria) Exponential Varieties Osaka, July / 24

14 Intersecting with a Subspace Fix exponential family with rational gradient map F : C K. Main case: F = f where f is hyperbolic Consider a linear subspace L R d with C L := L C nonempty: Caroline Uhler (IST Austria) Exponential Varieties Osaka, July / 24

15 Exponential Varieties The exponential variety is the image under the gradient map: L F := F (L) P d 1. Its positive part L F 0 lives in K. Caroline Uhler (IST Austria) Exponential Varieties Osaka, July / 24

16 Convexity and Positivity Theorem (X, ν, T ) exponential family with rational gradient map F : R d R d, and L R d a linear subspace. Restricted gradient map F L is composition C L C F K π L K L. Convex set C L of canonical parameters maps bijectively to positive exponential variety L F 0, and LF 0 maps bijectively to interior of convex set K L of sufficient statistics. Maximum Likelihood Estimation for an exponential variety means inverting these two bijections (by solving polynomial equations). Caroline Uhler (IST Austria) Exponential Varieties Osaka, July / 24

17 Bijections in Pictures Green maps to blue maps to green. Inverting this map is MLE Caroline Uhler (IST Austria) Exponential Varieties 0 5 Osaka, July /

18 Maximum Likelihood Estimation Questions: Algebraic degree of inversion of F L? [MSUZ, 2015] When does the MLE exist? I.e. characterize int(k L ). Study K L and its defining polynomial. [SU, 2010] Study the extremal rays of C L. Study Gaussian graphical models on undirected graph G = ({1,..., m}, E): C G = {θ S m 0 θ ij = 0 for all (i, j) / E} K G = CG V = π G (S m 0) Characterize the ranks of extremal rays of C G. Maximal rank is 1 if and only if G chordal (Agler et al., 1988) All graphs of maximal rank 2 have been characterized (Laurent, 2001) Caroline Uhler (IST Austria) Exponential Varieties Osaka, July / 24

19 Elliptopes and Spectrahedral Shadows Without loss of generality we study the following convex bodies instead of the corresponding convex cones: These convex bodies are dual to each other Elliptope of G: K G = π G ({σ S m 0 diag(σ) = (1,..., 1)}) Spectrahedral shadow of G: C G = π G ({θ S m 0 θ ij = 0 for all (i, j) / E and tr (θ) = 2} Problem: Characterize the ranks of the extremal points of C G Caroline Uhler (IST Austria) Exponential Varieties Osaka, July / 24

20 Example: 4-cycle 1 2 σ 1 K G = σ 2 σ 3 R4 σ 4 4 : u, v s.t. 3 1 σ 1 u σ 4 σ 1 1 σ 2 v u σ 2 1 σ 3 0 σ 4 v σ 3 1 θ 1 a θ 1 0 θ 4 C G = θ 2 θ 3 R4 : a, b, c s.t. θ 1 b θ 2 0 7/7/14 θ 4 0 θ 2 c θ 3 θ 4 0 θ 3 2 a b c 0 Caroline Uhler (IST Austria) Exponential Varieties Osaka, July / 24

21 Cut Polytopes, Elliptopes and Spectrahedral Shadows Consider another convex body, the cut polytope of G: Let U V ; the corresponding cutset is the collection of edges δ(u) E with one endpoint in U and the other endpoint in U c Assign to each cutset δ(u) a (±1)-vector v R E with v e = 1 if and only if e δ(u) convex hull of all such vectors is the cut polytope CUT ±1 (G) Note: CUT ±1 (G) K G Caroline Uhler (IST Austria) Exponential Varieties Osaka, July / 24

22 Example: 3-cycle (a) CUT ±1 (G) (b) K G (c) C G CUT ±1 (G) = conv((1, 1, 1), ( 1, 1, 1), ( 1, 1, 1), (1, 1, 1)) 1 σ 1 σ 3 θ 1 a θ 1 θ 3 K G = σ 1 1 σ 2 0, C G = θ 2 : θ 1 b θ 2 0 σ 3 σ 2 1 θ 3 θ 3 θ 2 2 a b Caroline Uhler (IST Austria) Exponential Varieties Osaka, July / 24

23 Graphs with no K 4 / K 5 minors Theorem Graphs with no K 5 -minor have the facet-ray identification property, i.e. the normal vectors to the facets of CUT ±1 (G) identify extremal points in C G. If v T x = b is a supporting hyperplane of a facet of CUT ±1 (G), then the extremal ray given by the normal vector v has rank b. Theorem For graphs with no K 4 -minor the facets of the cut polytope identify all extremal ranks. The extremal ranks are {1, m 2 C m is an induced cycle of G}. Caroline Uhler (IST Austria) Exponential Varieties Osaka, July / 24

24 "#$%&'()*+*,-.**/#("012$02"'*32#))024)5*)'%06'&040"'*%2"$07* References Micha lek, Sturmfels, U., and Zwiernik: Exponential varieties, -.*3'9%'"$=*9&*%270%#%*(0F'(0G996*')"0%2"094*04*32#))024*;$2:G0 arxiv: (2014). 96'()*>G9:'&#((=*94*"G'*2$H01*<=*!#462=E Solus, U., and Yoshida: Extremal positive semidefinite matrices for weakly bipartite graphs, arxiv: (2015). G246$2)'F2$245*!G2G5*,-*?)=%:"9"08)*9&*%270%#%*(0F'(0G996* )"0%2"094*04*32#))024*8=8(')*>04*:$9;$'))E Sturmfels, and U.: Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry, Ann. Inst. Stat. Math. 62, (2010).!"#$%&'()* Caroline Uhler (IST Austria) Exponential Varieties Osaka, July / 24

Parameter estimation in linear Gaussian covariance models

Parameter estimation in linear Gaussian covariance models Parameter estimation in linear Gaussian covariance models Caroline Uhler (IST Austria) Joint work with Piotr Zwiernik (UC Berkeley) and Donald Richards (Penn State University) Big Data Reunion Workshop

More information

Semidefinite Programming

Semidefinite Programming Semidefinite Programming Notes by Bernd Sturmfels for the lecture on June 26, 208, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra The transition from linear algebra to nonlinear algebra has

More information

The Geometry of Semidefinite Programming. Bernd Sturmfels UC Berkeley

The Geometry of Semidefinite Programming. Bernd Sturmfels UC Berkeley The Geometry of Semidefinite Programming Bernd Sturmfels UC Berkeley Positive Semidefinite Matrices For a real symmetric n n-matrix A the following are equivalent: All n eigenvalues of A are positive real

More information

The Maximum Likelihood Threshold of a Graph

The Maximum Likelihood Threshold of a Graph The Maximum Likelihood Threshold of a Graph Elizabeth Gross and Seth Sullivant San Jose State University, North Carolina State University August 28, 2014 Seth Sullivant (NCSU) Maximum Likelihood Threshold

More information

Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry

Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry Ann Inst Stat Math (2010) 62:603 638 DOI 10.1007/s10463-010-0295-4 Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry Bernd Sturmfels Caroline Uhler Received: 15 June

More information

SPECTRAHEDRA. Bernd Sturmfels UC Berkeley

SPECTRAHEDRA. Bernd Sturmfels UC Berkeley SPECTRAHEDRA Bernd Sturmfels UC Berkeley GAeL Lecture I on Convex Algebraic Geometry Coimbra, Portugal, Monday, June 7, 2010 Positive Semidefinite Matrices For a real symmetric n n-matrix A the following

More information

Unbounded Convex Semialgebraic Sets as Spectrahedral Shadows

Unbounded Convex Semialgebraic Sets as Spectrahedral Shadows Unbounded Convex Semialgebraic Sets as Spectrahedral Shadows Shaowei Lin 9 Dec 2010 Abstract Recently, Helton and Nie [3] showed that a compact convex semialgebraic set S is a spectrahedral shadow if the

More information

Gaussian Graphical Models: An Algebraic and Geometric Perspective

Gaussian Graphical Models: An Algebraic and Geometric Perspective Gaussian Graphical Models: An Algebraic and Geometric Perspective Caroline Uhler arxiv:707.04345v [math.st] 3 Jul 07 Abstract Gaussian graphical models are used throughout the natural sciences, social

More information

QUARTIC SPECTRAHEDRA. Bernd Sturmfels UC Berkeley and MPI Bonn. Joint work with John Christian Ottem, Kristian Ranestad and Cynthia Vinzant

QUARTIC SPECTRAHEDRA. Bernd Sturmfels UC Berkeley and MPI Bonn. Joint work with John Christian Ottem, Kristian Ranestad and Cynthia Vinzant QUARTIC SPECTRAHEDRA Bernd Sturmfels UC Berkeley and MPI Bonn Joint work with John Christian Ottem, Kristian Ranestad and Cynthia Vinzant 1 / 20 Definition A spectrahedron of degree n in R 3 is a convex

More information

SPECTRAHEDRA. Bernd Sturmfels UC Berkeley

SPECTRAHEDRA. Bernd Sturmfels UC Berkeley SPECTRAHEDRA Bernd Sturmfels UC Berkeley Mathematics Colloquium, North Carolina State University February 5, 2010 Positive Semidefinite Matrices For a real symmetric n n-matrix A the following are equivalent:

More information

Likelihood Analysis of Gaussian Graphical Models

Likelihood Analysis of Gaussian Graphical Models Faculty of Science Likelihood Analysis of Gaussian Graphical Models Ste en Lauritzen Department of Mathematical Sciences Minikurs TUM 2016 Lecture 2 Slide 1/43 Overview of lectures Lecture 1 Markov Properties

More information

Geometry of Gaussoids

Geometry of Gaussoids Geometry of Gaussoids Bernd Sturmfels MPI Leipzig and UC Berkeley p 3 p 13 p 23 a 12 3 p 123 a 23 a 13 2 a 23 1 a 13 p 2 p 12 a 12 p p 1 Figure 1: With The vertices Tobias andboege, 2-faces ofalessio the

More information

Combinatorial Types of Tropical Eigenvector

Combinatorial Types of Tropical Eigenvector Combinatorial Types of Tropical Eigenvector arxiv:1105.55504 Ngoc Mai Tran Department of Statistics, UC Berkeley Joint work with Bernd Sturmfels 2 / 13 Tropical eigenvalues and eigenvectors Max-plus: (R,,

More information

CS295: Convex Optimization. Xiaohui Xie Department of Computer Science University of California, Irvine

CS295: Convex Optimization. Xiaohui Xie Department of Computer Science University of California, Irvine CS295: Convex Optimization Xiaohui Xie Department of Computer Science University of California, Irvine Course information Prerequisites: multivariate calculus and linear algebra Textbook: Convex Optimization

More information

Total positivity in Markov structures

Total positivity in Markov structures 1 based on joint work with Shaun Fallat, Kayvan Sadeghi, Caroline Uhler, Nanny Wermuth, and Piotr Zwiernik (arxiv:1510.01290) Faculty of Science Total positivity in Markov structures Steffen Lauritzen

More information

The Algebraic Degree of Semidefinite Programming

The Algebraic Degree of Semidefinite Programming The Algebraic Degree ofsemidefinite Programming p. The Algebraic Degree of Semidefinite Programming BERND STURMFELS UNIVERSITY OF CALIFORNIA, BERKELEY joint work with and Jiawang Nie (IMA Minneapolis)

More information

The Central Curve in Linear Programming

The Central Curve in Linear Programming joint work with Jesús De Loera and Bernd Sturmfels The Central Path of a Linear Program Linear Program: Maximize x R n c x s.t. A x = b and x 0. The Central Path of a Linear Program Linear Program: Maximize

More information

Geometry of Log-Concave Density Estimation

Geometry of Log-Concave Density Estimation Geometry of Log-Concave Density Estimation Elina Robeva, Bernd Sturmfels, and Caroline Uhler arxiv:1704.01910v1 [stat.me] 6 Apr 2017 Abstract Shape-constrained density estimation is an important topic

More information

Algebraic Statistics progress report

Algebraic Statistics progress report Algebraic Statistics progress report Joe Neeman December 11, 2008 1 A model for biochemical reaction networks We consider a model introduced by Craciun, Pantea and Rempala [2] for identifying biochemical

More information

Fall, 2003 CIS 610. Advanced geometric methods. Homework 3. November 11, 2003; Due November 25, beginning of class

Fall, 2003 CIS 610. Advanced geometric methods. Homework 3. November 11, 2003; Due November 25, beginning of class Fall, 2003 CIS 610 Advanced geometric methods Homework 3 November 11, 2003; Due November 25, beginning of class You may work in groups of 2 or 3 Please, write up your solutions as clearly and concisely

More information

Contingency tables from the algebraic statistics view point Gérard Letac, Université Paul Sabatier, Toulouse

Contingency tables from the algebraic statistics view point Gérard Letac, Université Paul Sabatier, Toulouse Contingency tables from the algebraic statistics view point Gérard Letac, Université Paul Sabatier, Toulouse College Park, October 14 th, 2010.. Joint work with Hélène Massam 1 Contingency tables Let I

More information

From the Zonotope Construction to the Minkowski Addition of Convex Polytopes

From the Zonotope Construction to the Minkowski Addition of Convex Polytopes From the Zonotope Construction to the Minkowski Addition of Convex Polytopes Komei Fukuda School of Computer Science, McGill University, Montreal, Canada Abstract A zonotope is the Minkowski addition of

More information

Combinatorics and geometry of E 7

Combinatorics and geometry of E 7 Combinatorics and geometry of E 7 Steven Sam University of California, Berkeley September 19, 2012 1/24 Outline Macdonald representations Vinberg representations Root system Weyl group 7 points in P 2

More information

Complexity of the positive semidefinite matrix completion problem with a rank constraint

Complexity of the positive semidefinite matrix completion problem with a rank constraint Complexity of the positive semidefinite matrix completion problem with a rank constraint M. E.-Nagy 1, M. Laurent 1,2, and A. Varvitsiotis 1 1 Centrum Wiskunde & Informatica (CWI), Amsterdam, The Netherlands.

More information

The partial-fractions method for counting solutions to integral linear systems

The partial-fractions method for counting solutions to integral linear systems The partial-fractions method for counting solutions to integral linear systems Matthias Beck, MSRI www.msri.org/people/members/matthias/ arxiv: math.co/0309332 Vector partition functions A an (m d)-integral

More information

NOTES ON HYPERBOLICITY CONES

NOTES ON HYPERBOLICITY CONES NOTES ON HYPERBOLICITY CONES Petter Brändén (Stockholm) pbranden@math.su.se Berkeley, October 2010 1. Hyperbolic programming A hyperbolic program is an optimization problem of the form minimize c T x such

More information

Affine Geometry and the Discrete Legendre Transfrom

Affine Geometry and the Discrete Legendre Transfrom Affine Geometry and the Discrete Legendre Transfrom Andrey Novoseltsev Department of Mathematics University of Washington April 25, 2008 Andrey Novoseltsev (UW) Affine Geometry April 25, 2008 1 / 24 Outline

More information

Commuting birth-and-death processes

Commuting birth-and-death processes Commuting birth-and-death processes Caroline Uhler Department of Statistics UC Berkeley (joint work with Steven N. Evans and Bernd Sturmfels) MSRI Workshop on Algebraic Statistics December 18, 2008 Birth-and-death

More information

Lecture 5. Theorems of Alternatives and Self-Dual Embedding

Lecture 5. Theorems of Alternatives and Self-Dual Embedding IE 8534 1 Lecture 5. Theorems of Alternatives and Self-Dual Embedding IE 8534 2 A system of linear equations may not have a solution. It is well known that either Ax = c has a solution, or A T y = 0, c

More information

CONVEX ALGEBRAIC GEOMETRY. Bernd Sturmfels UC Berkeley

CONVEX ALGEBRAIC GEOMETRY. Bernd Sturmfels UC Berkeley CONVEX ALGEBRAIC GEOMETRY Bernd Sturmfels UC Berkeley Multifocal Ellipses Given m points (u 1, v 1 ),...,(u m, v m )intheplaner 2,and aradiusd > 0, their m-ellipse is the convex algebraic curve { (x, y)

More information

Maximum likelihood for dual varieties

Maximum likelihood for dual varieties Maximum likelihood for dual varieties Jose Israel Rodriguez University of Notre Dame SIAM AG15 August 4, 2015 A homogeneous formulation Xiaoxian provided an affine square formulation, here is a homog.

More information

ENTANGLED STATES ARISING FROM INDECOMPOSABLE POSITIVE LINEAR MAPS. 1. Introduction

ENTANGLED STATES ARISING FROM INDECOMPOSABLE POSITIVE LINEAR MAPS. 1. Introduction Trends in Mathematics Information Center for Mathematical Sciences Volume 6, Number 2, December, 2003, Pages 83 91 ENTANGLED STATES ARISING FROM INDECOMPOSABLE POSITIVE LINEAR MAPS SEUNG-HYEOK KYE Abstract.

More information

Affine Geometry and Discrete Legendre Transform

Affine Geometry and Discrete Legendre Transform Affine Geometry and Discrete Legendre Transform Andrey Novoseltsev April 24, 2008 Abstract The combinatorial duality used in Gross-Siebert approach to mirror symmetry is the discrete Legendre transform

More information

Algebraic Geometry (Math 6130)

Algebraic Geometry (Math 6130) Algebraic Geometry (Math 6130) Utah/Fall 2016. 2. Projective Varieties. Classically, projective space was obtained by adding points at infinity to n. Here we start with projective space and remove a hyperplane,

More information

ECON 4117/5111 Mathematical Economics

ECON 4117/5111 Mathematical Economics Test 1 September 29, 2006 1. Use a truth table to show the following equivalence statement: (p q) (p q) 2. Consider the statement: A function f : X Y is continuous on X if for every open set V Y, the pre-image

More information

TORIC REDUCTION AND TROPICAL GEOMETRY A.

TORIC REDUCTION AND TROPICAL GEOMETRY A. Mathematisches Institut, Seminars, (Y. Tschinkel, ed.), p. 109 115 Universität Göttingen, 2004-05 TORIC REDUCTION AND TROPICAL GEOMETRY A. Szenes ME Institute of Mathematics, Geometry Department, Egry

More information

DETECTION OF FXM ARBITRAGE AND ITS SENSITIVITY

DETECTION OF FXM ARBITRAGE AND ITS SENSITIVITY DETECTION OF FXM ARBITRAGE AND ITS SENSITIVITY SFI FINANCIAL ALGEBRA PROJECT AT UCC: BH, AM & EO S 1. Definitions and basics In this working paper we have n currencies, labeled 1 through n inclusive and

More information

Exercise Sheet 7 - Solutions

Exercise Sheet 7 - Solutions Algebraic Geometry D-MATH, FS 2016 Prof. Pandharipande Exercise Sheet 7 - Solutions 1. Prove that the Zariski tangent space at the point [S] Gr(r, V ) is canonically isomorphic to S V/S (or equivalently

More information

Integer Programming, Part 1

Integer Programming, Part 1 Integer Programming, Part 1 Rudi Pendavingh Technische Universiteit Eindhoven May 18, 2016 Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, 2016 1 / 37 Linear Inequalities and Polyhedra Farkas

More information

LMI MODELLING 4. CONVEX LMI MODELLING. Didier HENRION. LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ. Universidad de Valladolid, SP March 2009

LMI MODELLING 4. CONVEX LMI MODELLING. Didier HENRION. LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ. Universidad de Valladolid, SP March 2009 LMI MODELLING 4. CONVEX LMI MODELLING Didier HENRION LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ Universidad de Valladolid, SP March 2009 Minors A minor of a matrix F is the determinant of a submatrix

More information

Polynomials, Ideals, and Gröbner Bases

Polynomials, Ideals, and Gröbner Bases Polynomials, Ideals, and Gröbner Bases Notes by Bernd Sturmfels for the lecture on April 10, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra We fix a field K. Some examples of fields

More information

Probabilistic Graphical Models

Probabilistic Graphical Models School of Computer Science Probabilistic Graphical Models Variational Inference II: Mean Field Method and Variational Principle Junming Yin Lecture 15, March 7, 2012 X 1 X 1 X 1 X 1 X 2 X 3 X 2 X 2 X 3

More information

Semidefinite Programming Basics and Applications

Semidefinite Programming Basics and Applications Semidefinite Programming Basics and Applications Ray Pörn, principal lecturer Åbo Akademi University Novia University of Applied Sciences Content What is semidefinite programming (SDP)? How to represent

More information

Problems on Minkowski sums of convex lattice polytopes

Problems on Minkowski sums of convex lattice polytopes arxiv:08121418v1 [mathag] 8 Dec 2008 Problems on Minkowski sums of convex lattice polytopes Tadao Oda odatadao@mathtohokuacjp Abstract submitted at the Oberwolfach Conference Combinatorial Convexity and

More information

Semidefinite representation of convex hulls of rational varieties

Semidefinite representation of convex hulls of rational varieties Semidefinite representation of convex hulls of rational varieties Didier Henrion 1,2 June 1, 2011 Abstract Using elementary duality properties of positive semidefinite moment matrices and polynomial sum-of-squares

More information

Nonlinear Programming Models

Nonlinear Programming Models Nonlinear Programming Models Fabio Schoen 2008 http://gol.dsi.unifi.it/users/schoen Nonlinear Programming Models p. Introduction Nonlinear Programming Models p. NLP problems minf(x) x S R n Standard form:

More information

Lecture 3: Tropicalizations of Cluster Algebras Examples David Speyer

Lecture 3: Tropicalizations of Cluster Algebras Examples David Speyer Lecture 3: Tropicalizations of Cluster Algebras Examples David Speyer Let A be a cluster algebra with B-matrix B. Let X be Spec A with all of the cluster variables inverted, and embed X into a torus by

More information

Math 302 Outcome Statements Winter 2013

Math 302 Outcome Statements Winter 2013 Math 302 Outcome Statements Winter 2013 1 Rectangular Space Coordinates; Vectors in the Three-Dimensional Space (a) Cartesian coordinates of a point (b) sphere (c) symmetry about a point, a line, and a

More information

Extreme Abridgment of Boyd and Vandenberghe s Convex Optimization

Extreme Abridgment of Boyd and Vandenberghe s Convex Optimization Extreme Abridgment of Boyd and Vandenberghe s Convex Optimization Compiled by David Rosenberg Abstract Boyd and Vandenberghe s Convex Optimization book is very well-written and a pleasure to read. The

More information

Convex Optimization & Parsimony of L p-balls representation

Convex Optimization & Parsimony of L p-balls representation Convex Optimization & Parsimony of L p -balls representation LAAS-CNRS and Institute of Mathematics, Toulouse, France IMA, January 2016 Motivation Unit balls associated with nonnegative homogeneous polynomials

More information

On the local stability of semidefinite relaxations

On the local stability of semidefinite relaxations On the local stability of semidefinite relaxations Diego Cifuentes Department of Mathematics Massachusetts Institute of Technology Joint work with Sameer Agarwal (Google), Pablo Parrilo (MIT), Rekha Thomas

More information

MIT Algebraic techniques and semidefinite optimization February 14, Lecture 3

MIT Algebraic techniques and semidefinite optimization February 14, Lecture 3 MI 6.97 Algebraic techniques and semidefinite optimization February 4, 6 Lecture 3 Lecturer: Pablo A. Parrilo Scribe: Pablo A. Parrilo In this lecture, we will discuss one of the most important applications

More information

COUNTING INTEGER POINTS IN POLYHEDRA. Alexander Barvinok

COUNTING INTEGER POINTS IN POLYHEDRA. Alexander Barvinok COUNTING INTEGER POINTS IN POLYHEDRA Alexander Barvinok Papers are available at http://www.math.lsa.umich.edu/ barvinok/papers.html Let P R d be a polytope. We want to compute (exactly or approximately)

More information

MATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix.

MATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix. MATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix. Basis Definition. Let V be a vector space. A linearly independent spanning set for V is called a basis.

More information

Open Problems in Algebraic Statistics

Open Problems in Algebraic Statistics Open Problems inalgebraic Statistics p. Open Problems in Algebraic Statistics BERND STURMFELS UNIVERSITY OF CALIFORNIA, BERKELEY and TECHNISCHE UNIVERSITÄT BERLIN Advertisement Oberwolfach Seminar Algebraic

More information

Decomposable and Directed Graphical Gaussian Models

Decomposable and Directed Graphical Gaussian Models Decomposable Decomposable and Directed Graphical Gaussian Models Graphical Models and Inference, Lecture 13, Michaelmas Term 2009 November 26, 2009 Decomposable Definition Basic properties Wishart density

More information

Inner Product, Length, and Orthogonality

Inner Product, Length, and Orthogonality Inner Product, Length, and Orthogonality Linear Algebra MATH 2076 Linear Algebra,, Chapter 6, Section 1 1 / 13 Algebraic Definition for Dot Product u 1 v 1 u 2 Let u =., v = v 2. be vectors in Rn. The

More information

CSL361 Problem set 4: Basic linear algebra

CSL361 Problem set 4: Basic linear algebra CSL361 Problem set 4: Basic linear algebra February 21, 2017 [Note:] If the numerical matrix computations turn out to be tedious, you may use the function rref in Matlab. 1 Row-reduced echelon matrices

More information

Togliatti systems and artinian ideals failing WLP. Weak Lefschetz Property

Togliatti systems and artinian ideals failing WLP. Weak Lefschetz Property Togliatti systems and artinian ideals failing the Weak Lefschetz Property Dipartimento di Matematica e Geoscienze Università degli Studi di Trieste mezzette@units.it Lefschetz Properties and Artinian Algebras

More information

Hodge theory for combinatorial geometries

Hodge theory for combinatorial geometries Hodge theory for combinatorial geometries June Huh with Karim Adiprasito and Eric Katz June Huh 1 / 48 Three fundamental ideas: June Huh 2 / 48 Three fundamental ideas: The idea of Bernd Sturmfels that

More information

Combinatorial types of tropical eigenvectors

Combinatorial types of tropical eigenvectors Bull. London Math. Soc. 45 (2013) 27 36 C 2012 London Mathematical Society doi:10.1112/blms/bds058 Combinatorial types of tropical eigenvectors Bernd Sturmfels and Ngoc Mai Tran Abstract The map which

More information

LIFTS OF CONVEX SETS AND CONE FACTORIZATIONS JOÃO GOUVEIA, PABLO A. PARRILO, AND REKHA THOMAS

LIFTS OF CONVEX SETS AND CONE FACTORIZATIONS JOÃO GOUVEIA, PABLO A. PARRILO, AND REKHA THOMAS LIFTS OF CONVEX SETS AND CONE FACTORIZATIONS Abstract. In this paper we address the basic geometric question of when a given convex set is the image under a linear map of an affine slice of a given closed

More information

1 Quantum states and von Neumann entropy

1 Quantum states and von Neumann entropy Lecture 9: Quantum entropy maximization CSE 599S: Entropy optimality, Winter 2016 Instructor: James R. Lee Last updated: February 15, 2016 1 Quantum states and von Neumann entropy Recall that S sym n n

More information

Inequality Constraints

Inequality Constraints Chapter 2 Inequality Constraints 2.1 Optimality Conditions Early in multivariate calculus we learn the significance of differentiability in finding minimizers. In this section we begin our study of the

More information

ALGEBRAIC DEGREE OF POLYNOMIAL OPTIMIZATION. 1. Introduction. f 0 (x)

ALGEBRAIC DEGREE OF POLYNOMIAL OPTIMIZATION. 1. Introduction. f 0 (x) ALGEBRAIC DEGREE OF POLYNOMIAL OPTIMIZATION JIAWANG NIE AND KRISTIAN RANESTAD Abstract. Consider the polynomial optimization problem whose objective and constraints are all described by multivariate polynomials.

More information

Chapter 1. Preliminaries

Chapter 1. Preliminaries Introduction This dissertation is a reading of chapter 4 in part I of the book : Integer and Combinatorial Optimization by George L. Nemhauser & Laurence A. Wolsey. The chapter elaborates links between

More information

15. Conic optimization

15. Conic optimization L. Vandenberghe EE236C (Spring 216) 15. Conic optimization conic linear program examples modeling duality 15-1 Generalized (conic) inequalities Conic inequality: a constraint x K where K is a convex cone

More information

Decomposable Graphical Gaussian Models

Decomposable Graphical Gaussian Models CIMPA Summerschool, Hammamet 2011, Tunisia September 12, 2011 Basic algorithm This simple algorithm has complexity O( V + E ): 1. Choose v 0 V arbitrary and let v 0 = 1; 2. When vertices {1, 2,..., j}

More information

Tropical Varieties. Jan Verschelde

Tropical Varieties. Jan Verschelde Tropical Varieties Jan Verschelde University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science http://www.math.uic.edu/ jan jan@math.uic.edu Graduate Computational Algebraic

More information

Introduction to Semidefinite Programming I: Basic properties a

Introduction to Semidefinite Programming I: Basic properties a Introduction to Semidefinite Programming I: Basic properties and variations on the Goemans-Williamson approximation algorithm for max-cut MFO seminar on Semidefinite Programming May 30, 2010 Semidefinite

More information

MATHEMATICS. Course Syllabus. Section A: Linear Algebra. Subject Code: MA. Course Structure. Ordinary Differential Equations

MATHEMATICS. Course Syllabus. Section A: Linear Algebra. Subject Code: MA. Course Structure. Ordinary Differential Equations MATHEMATICS Subject Code: MA Course Structure Sections/Units Section A Section B Section C Linear Algebra Complex Analysis Real Analysis Topics Section D Section E Section F Section G Section H Section

More information

Lakehead University ECON 4117/5111 Mathematical Economics Fall 2003

Lakehead University ECON 4117/5111 Mathematical Economics Fall 2003 Test 1 September 26, 2003 1. Construct a truth table to prove each of the following tautologies (p, q, r are statements and c is a contradiction): (a) [p (q r)] [(p q) r] (b) (p q) [(p q) c] 2. Answer

More information

Contents Real Vector Spaces Linear Equations and Linear Inequalities Polyhedra Linear Programs and the Simplex Method Lagrangian Duality

Contents Real Vector Spaces Linear Equations and Linear Inequalities Polyhedra Linear Programs and the Simplex Method Lagrangian Duality Contents Introduction v Chapter 1. Real Vector Spaces 1 1.1. Linear and Affine Spaces 1 1.2. Maps and Matrices 4 1.3. Inner Products and Norms 7 1.4. Continuous and Differentiable Functions 11 Chapter

More information

Math 3C Lecture 25. John Douglas Moore

Math 3C Lecture 25. John Douglas Moore Math 3C Lecture 25 John Douglas Moore June 1, 2009 Let V be a vector space. A basis for V is a collection of vectors {v 1,..., v k } such that 1. V = Span{v 1,..., v k }, and 2. {v 1,..., v k } are linearly

More information

HYPERBOLIC POLYNOMIALS, INTERLACERS AND SUMS OF SQUARES

HYPERBOLIC POLYNOMIALS, INTERLACERS AND SUMS OF SQUARES HYPERBOLIC POLYNOMIALS, INTERLACERS AND SUMS OF SQUARES DANIEL PLAUMANN Universität Konstanz joint work with Mario Kummer (U. Konstanz) Cynthia Vinzant (U. of Michigan) Out[121]= POLYNOMIAL OPTIMISATION

More information

Tropical Geometry Homework 3

Tropical Geometry Homework 3 Tropical Geometry Homework 3 Melody Chan University of California, Berkeley mtchan@math.berkeley.edu February 9, 2009 The paper arxiv:07083847 by M. Vigeland answers this question. In Theorem 7., the author

More information

Nonlinear Discrete Optimization

Nonlinear Discrete Optimization Nonlinear Discrete Optimization Technion Israel Institute of Technology http://ie.technion.ac.il/~onn Billerafest 2008 - conference in honor of Lou Billera's 65th birthday (Update on Lecture Series given

More information

Weak Separation, Pure Domains and Cluster Distance

Weak Separation, Pure Domains and Cluster Distance Discrete Mathematics and Theoretical Computer Science DMTCS vol (subm, by the authors, 1 1 Weak Separation, Pure Domains and Cluster Distance Miriam Farber 1 and Pavel Galashin 1 1 Department of Mathematics,

More information

HILBERT BASIS OF THE LIPMAN SEMIGROUP

HILBERT BASIS OF THE LIPMAN SEMIGROUP Available at: http://publications.ictp.it IC/2010/061 United Nations Educational, Scientific and Cultural Organization and International Atomic Energy Agency THE ABDUS SALAM INTERNATIONAL CENTRE FOR THEORETICAL

More information

ON THE RANK OF A TROPICAL MATRIX

ON THE RANK OF A TROPICAL MATRIX ON THE RANK OF A TROPICAL MATRIX MIKE DEVELIN, FRANCISCO SANTOS, AND BERND STURMFELS Abstract. This is a foundational paper in tropical linear algebra, which is linear algebra over the min-plus semiring.

More information

1 Maximal Lattice-free Convex Sets

1 Maximal Lattice-free Convex Sets 47-831: Advanced Integer Programming Lecturer: Amitabh Basu Lecture 3 Date: 03/23/2010 In this lecture, we explore the connections between lattices of R n and convex sets in R n. The structures will prove

More information

Polytopes and Algebraic Geometry. Jesús A. De Loera University of California, Davis

Polytopes and Algebraic Geometry. Jesús A. De Loera University of California, Davis Polytopes and Algebraic Geometry Jesús A. De Loera University of California, Davis Outline of the talk 1. Four classic results relating polytopes and algebraic geometry: (A) Toric Geometry (B) Viro s Theorem

More information

MAT-INF4110/MAT-INF9110 Mathematical optimization

MAT-INF4110/MAT-INF9110 Mathematical optimization MAT-INF4110/MAT-INF9110 Mathematical optimization Geir Dahl August 20, 2013 Convexity Part IV Chapter 4 Representation of convex sets different representations of convex sets, boundary polyhedra and polytopes:

More information

ALGORITHMIC COMPUTATION OF POLYNOMIAL AMOEBAS

ALGORITHMIC COMPUTATION OF POLYNOMIAL AMOEBAS ALGORITHMIC COMPUTATION OF POLYNOMIAL AMOEBAS D. V. Bogdanov 1, A. A. Kytmanov 2, and T. M. Sadykov 3 1 Plekhanov Russian University arxiv:1604.03603v1 [cs.cg] 12 Apr 2016 125993 Moscow, Russia bogdv@rambler.ru

More information

WHEN DOES THE POSITIVE SEMIDEFINITENESS CONSTRAINT HELP IN LIFTING PROCEDURES?

WHEN DOES THE POSITIVE SEMIDEFINITENESS CONSTRAINT HELP IN LIFTING PROCEDURES? MATHEMATICS OF OPERATIONS RESEARCH Vol. 6, No. 4, November 00, pp. 796 85 Printed in U.S.A. WHEN DOES THE POSITIVE SEMIDEFINITENESS CONSTRAINT HELP IN LIFTING PROCEDURES? MICHEL X. GOEMANS and LEVENT TUNÇEL

More information

Voronoi Cells of Varieties

Voronoi Cells of Varieties Voronoi Cells of Varieties arxiv:1811.08395v1 [math.ag] 20 Nov 2018 Diego Cifuentes, Kristian Ranestad, Bernd Sturmfels and Madeleine Weinstein Abstract Every real algebraic variety determines a Voronoi

More information

Symmetric matrices, Catalan paths, and correlations

Symmetric matrices, Catalan paths, and correlations FPSAC 2016 Vancouver, Canada DMTCS proc. BC, 2016, 1135 1146 Symmetric matrices, Catalan paths, and correlations Bernd Sturmfels 1, Emmanuel Tsukerman 1, and Lauren Williams 1 1 Department of Mathematics,

More information

ELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications

ELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications ELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications Professor M. Chiang Electrical Engineering Department, Princeton University March

More information

COMBINATORICS OF RANK JUMPS IN SIMPLICIAL HYPERGEOMETRIC SYSTEMS

COMBINATORICS OF RANK JUMPS IN SIMPLICIAL HYPERGEOMETRIC SYSTEMS COMBINATORICS OF RANK JUMPS IN SIMPLICIAL HYPERGEOMETRIC SYSTEMS LAURA FELICIA MATUSEVICH AND EZRA MILLER Abstract. Let A be an integer d n matrix, and assume that the convex hull conv(a) of its columns

More information

HYPERBOLICITY CONES AND IMAGINARY PROJECTIONS

HYPERBOLICITY CONES AND IMAGINARY PROJECTIONS HYPERBOLICITY CONES AND IMAGINARY PROJECTIONS THORSTEN JÖRGENS AND THORSTEN THEOBALD Abstract. Recently, the authors and de Wolff introduced the imaginary projection of a polynomial f C[z] as the projection

More information

Gaussian representation of a class of Riesz probability distributions

Gaussian representation of a class of Riesz probability distributions arxiv:763v [mathpr] 8 Dec 7 Gaussian representation of a class of Riesz probability distributions A Hassairi Sfax University Tunisia Running title: Gaussian representation of a Riesz distribution Abstract

More information

SEMIDEFINITE PROGRAM BASICS. Contents

SEMIDEFINITE PROGRAM BASICS. Contents SEMIDEFINITE PROGRAM BASICS BRIAN AXELROD Abstract. A introduction to the basics of Semidefinite programs. Contents 1. Definitions and Preliminaries 1 1.1. Linear Algebra 1 1.2. Convex Analysis (on R n

More information

COURSE ON LMI PART I.2 GEOMETRY OF LMI SETS. Didier HENRION henrion

COURSE ON LMI PART I.2 GEOMETRY OF LMI SETS. Didier HENRION   henrion COURSE ON LMI PART I.2 GEOMETRY OF LMI SETS Didier HENRION www.laas.fr/ henrion October 2006 Geometry of LMI sets Given symmetric matrices F i we want to characterize the shape in R n of the LMI set F

More information

Probabilistic Graphical Models

Probabilistic Graphical Models Probabilistic Graphical Models Lecture 11 CRFs, Exponential Family CS/CNS/EE 155 Andreas Krause Announcements Homework 2 due today Project milestones due next Monday (Nov 9) About half the work should

More information

Lecture 4: Applications: random trees, determinantal measures and sampling

Lecture 4: Applications: random trees, determinantal measures and sampling Lecture 4: Applications: random trees, determinantal measures and sampling Robin Pemantle University of Pennsylvania pemantle@math.upenn.edu Minerva Lectures at Columbia University 09 November, 2016 Sampling

More information

Geometry of Phylogenetic Inference

Geometry of Phylogenetic Inference Geometry of Phylogenetic Inference Matilde Marcolli CS101: Mathematical and Computational Linguistics Winter 2015 References N. Eriksson, K. Ranestad, B. Sturmfels, S. Sullivant, Phylogenetic algebraic

More information

Toric Varieties in Statistics

Toric Varieties in Statistics Toric Varieties in Statistics Daniel Irving Bernstein and Seth Sullivant North Carolina State University dibernst@ncsu.edu http://www4.ncsu.edu/~dibernst/ http://arxiv.org/abs/50.063 http://arxiv.org/abs/508.0546

More information

An introduction to tropical geometry

An introduction to tropical geometry An introduction to tropical geometry Jan Draisma RWTH Aachen, 8 April 2011 Part I: what you must know Tropical numbers R := R { } the tropical semi-ring a b := min{a, b} a b := a + b b = b 0 b = b b =

More information

ALGEBRA: From Linear to Non-Linear. Bernd Sturmfels University of California at Berkeley

ALGEBRA: From Linear to Non-Linear. Bernd Sturmfels University of California at Berkeley ALGEBRA: From Linear to Non-Linear Bernd Sturmfels University of California at Berkeley John von Neumann Lecture, SIAM Annual Meeting, Pittsburgh, July 13, 2010 Undergraduate Linear Algebra All undergraduate

More information

CPSC 540: Machine Learning

CPSC 540: Machine Learning CPSC 540: Machine Learning Multivariate Gaussians Mark Schmidt University of British Columbia Winter 2019 Last Time: Multivariate Gaussian http://personal.kenyon.edu/hartlaub/mellonproject/bivariate2.html

More information