Concentration function and other stuff
|
|
- William Owens
- 6 years ago
- Views:
Transcription
1 Concentration function and other stuff Sabrina Sixta Tuesday, June 16, 2014 Sabrina Sixta () Concentration function and other stuff Tuesday, June 16, / 13
2 Table of Contents Outline 1 Chernoff Bound and Law of Large Numbers 2 Concentration Phenomenon 3 Blowing-up Lemma 4 Concentration function 5 Calculate value of concentration function for Hamming cube 6 Improvement on Chernoff Bounds 7 Hoeffding Inequality Sabrina Sixta () Concentration function and other stuff Tuesday, June 16, / 13
3 Chernoff Bound and Law of Large Numbers Warming up to Chernoff Bound Let Ω = {A, B} be a two-element partition of a finite metric space X = (X, d) such that (1) d(a, B) = 1 and (2) there exists a bijection i : A B where d(a, i(a)) = 1 for all a A. Let f : X R be a 1-Lipschitz function. Then the function E[f Ω] : X R is 1-Lipschitz too. Or more relevent to us, E[f Ω](a) E[f Ω](b) 1. Sabrina Sixta () Concentration function and other stuff Tuesday, June 16, / 13
4 Chernoff Bound and Law of Large Numbers Warming up to Chernoff Bound Let Ω = {A, B} be a two-element partition of a finite metric space X = (X, d) such that (1) d(a, B) = 1 and (2) there exists a bijection i : A B where d(a, i(a)) = 1 for all a A. Let f : X R be a 1-Lipschitz function. Then the function E[f Ω] : X R is 1-Lipschitz too. Or more relevent to us, E[f Ω](a) E[f Ω](b) 1. Let f : {0, 1} n R be a 1-Lipschitz function relative to the Hamming distance, d and let f 1, f 2,..., f n be a corresponding martingale with respect to the standard refining partition. Then for every i 1, 2,... n, d i 1 2. Sabrina Sixta () Concentration function and other stuff Tuesday, June 16, / 13
5 Chernoff Bound and Law of Large Numbers Chernoff Bound and Law of Large Numbers Chernoff Bound Let f : {0, 1} n R be a 1-Lipschitz function relative to the normalized Hamming distance, d. Then for every ɛ > 0, µ # {x {0, 1} n : f (x) E[f ] ɛ} 2e 2nɛ2. Sabrina Sixta () Concentration function and other stuff Tuesday, June 16, / 13
6 Chernoff Bound and Law of Large Numbers Chernoff Bound and Law of Large Numbers Chernoff Bound Let f : {0, 1} n R be a 1-Lipschitz function relative to the normalized Hamming distance, d. Then for every ɛ > 0, µ # {x {0, 1} n : f (x) E[f ] ɛ} 2e 2nɛ2. Law of Large Numbers Applying the normalized weight function, w, to the Chernoff bound, we get for ɛ > 0, µ # {x {0, 1} n : w 1 2 ɛ} 2e 2nɛ2. Sabrina Sixta () Concentration function and other stuff Tuesday, June 16, / 13
7 Chernoff Bound and Law of Large Numbers Chernoff Bound and Law of Large Numbers cont. Figure: Actual concentration values for the Hamming Cube, {0, 1} 10 vs. the Chernoff Bound. µ # {x {0, 1} n : w 1 2 n 2k 2n } = 2 2 n k i=0 ( ) n. i Sabrina Sixta () Concentration function and other stuff Tuesday, June 16, / 13
8 Concentration Phenomenon Concentration Phenomenon Azuma s inequality and the Chernoff bounds are both part of a larger group of inequalities that manifest the phenomenon of concentration of measure on structures of high dimension. That is, on a typical mathematical structure of high dimension (like the Hamming cube, {0, 1} n ) every nice function (1-Lipschitz functions) concentrates near one value. Bounds like Chernoff s are called concentration inequalities. Sabrina Sixta () Concentration function and other stuff Tuesday, June 16, / 13
9 Concentration Phenomenon Concentration Phenomenon Cont. Figure: Orthogonal projection of 1000 random points on a unit Euclidean d-cube (clockwise, d=3,10,100,1000). Sabrina Sixta () Concentration function and other stuff Tuesday, June 16, / 13
10 Blowing-up Lemma Warming up to Blowing-up Lemma ɛ-neighbourhood Let A X, where (X, d) is a metric space and let ɛ > 0. The ɛ-neighbourhood of A in X is, A ɛ = {x X : there exists a A, d(x, a) < ɛ}. Extended Chernoff inequality Let f : {0, 1} n R be a 1-Lipschitz function relative to the normalized Hamming distance. Then for every ɛ > 0 µ # {x {0, 1} n : f (x) E[f ] ɛ} e 2nɛ2 and µ # {x {0, 1} n : f (x) E[f ] ɛ} e 2nɛ2. Sabrina Sixta () Concentration function and other stuff Tuesday, June 16, / 13
11 Blowing-up Lemma Blowing-up Lemma Blowing-up lemma Let A {0, 1} n be a set of n-bit strings such that µ # (A) 1 2, then for ɛ > 0, the ɛ-neighbourhood for A, with respect to the normalized Hamming distance, satisfies the following inequality, µ # (A ɛ ) 1 e ɛ2 n/2. Sabrina Sixta () Concentration function and other stuff Tuesday, June 16, / 13
12 Concentration function Concentration function The concentration function of the Hamming cube {0, 1} n, denoted α(n, ɛ) or α({0, 1} n, ɛ) on R +, is { 1 α(ɛ) = 2 if ɛ = 0 1 min{µ # (B ɛ ) : B {0, 1} n, µ # (B) 1 2 } if ɛ > 0. (1) Some properties of the concentration function on the Hamming cube, {0, 1} n : non-increasing, left-continuous, not right-continuous. The concentration function of the Hamming cube {0, 1} n satisfies α({0, 1} n, ɛ) e ɛ2 n/2. Sabrina Sixta () Concentration function and other stuff Tuesday, June 16, / 13
13 Calculate value of concentration function for Hamming cube Calculate value of concentration function for Hamming cube Hamming ball A set B {0, 1} n is called a Hamming ball if for σ {0, 1} n and k = 1, 2,..., n, B k (σ) B B k+1 (σ). Harper isopetrimetric theorem For every A in the metric space ({0, 1} n, d) and each k = 1, 2,..., n there is a Hamming ball B with #(B) = #(A) and #(B k ) #(A k ). For a Hamming cube of odd dimension, {0, 1} 2m+1 equipped with the normalized distance d, the value of the concentration function for ɛ > 0 is where n = 2m + 1. m+nɛ α(ɛ) = 1 2 n k=0 ( n k ) n m nɛ = 2 n k=0 ( ) n k Sabrina Sixta () Concentration function and other stuff Tuesday, June 16, / 13
14 Improvement on Chernoff Bounds Improvement on Chernoff Bounds The concentration function of the Hamming cube, {0, 1} n, satisfies the following inequality α({0, 1} n, ɛ) e 2ne2. Sabrina Sixta () Concentration function and other stuff Tuesday, June 16, / 13
15 Hoeffding Inequality Hoeffding Inequality Rademach s Cube: { 1, 1} n = {σ 1, σ 2,..., σ n : σ i { 1, 1} for i 1, 0,..., n} Hoeffding Inequality This inequality is another modification of Azuma s inequality for the Rademach s Cube. Let a = (a 1, a 2,..., a n ) R n then for c > 0, µ # {η { 1, 1} n : n i=1 ( η i a i > c} < 2exp c 2 a 2 2 ). Sabrina Sixta () Concentration function and other stuff Tuesday, June 16, / 13
Hamming Cube and Other Stuff
Hamming Cube and Other Stuff Sabrina Sixta Tuesday, May 27, 2014 Sabrina Sixta () Hamming Cube and Other Stuff Tuesday, May 27, 2014 1 / 12 Table of Contents Outline 1 Definition of a Hamming cube 2 Properties
More informationRandomized Algorithms
Randomized Algorithms 南京大学 尹一通 Martingales Definition: A sequence of random variables X 0, X 1,... is a martingale if for all i > 0, E[X i X 0,...,X i1 ] = X i1 x 0, x 1,...,x i1, E[X i X 0 = x 0, X 1
More informationOutline. Martingales. Piotr Wojciechowski 1. 1 Lane Department of Computer Science and Electrical Engineering West Virginia University.
Outline Piotr 1 1 Lane Department of Computer Science and Electrical Engineering West Virginia University 8 April, 01 Outline Outline 1 Tail Inequalities Outline Outline 1 Tail Inequalities General Outline
More informationLecture 5: Probabilistic tools and Applications II
T-79.7003: Graphs and Networks Fall 2013 Lecture 5: Probabilistic tools and Applications II Lecturer: Charalampos E. Tsourakakis Oct. 11, 2013 5.1 Overview In the first part of today s lecture we will
More informationProblem Set 1: Solutions Math 201A: Fall Problem 1. Let (X, d) be a metric space. (a) Prove the reverse triangle inequality: for every x, y, z X
Problem Set 1: s Math 201A: Fall 2016 Problem 1. Let (X, d) be a metric space. (a) Prove the reverse triangle inequality: for every x, y, z X d(x, y) d(x, z) d(z, y). (b) Prove that if x n x and y n y
More informationEcon Lecture 3. Outline. 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n
Econ 204 2011 Lecture 3 Outline 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n 1 Metric Spaces and Metrics Generalize distance and length notions
More informationMarch 1, Florida State University. Concentration Inequalities: Martingale. Approach and Entropy Method. Lizhe Sun and Boning Yang.
Florida State University March 1, 2018 Framework 1. (Lizhe) Basic inequalities Chernoff bounding Review for STA 6448 2. (Lizhe) Discrete-time martingales inequalities via martingale approach 3. (Boning)
More informationOn the Concentration of the Crest Factor for OFDM Signals
On the Concentration of the Crest Factor for OFDM Signals Igal Sason Department of Electrical Engineering Technion - Israel Institute of Technology Haifa 32000, Israel The 2011 IEEE International Symposium
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationLinear Analysis Lecture 5
Linear Analysis Lecture 5 Inner Products and V Let dim V < with inner product,. Choose a basis B and let v, w V have coordinates in F n given by x 1. x n and y 1. y n, respectively. Let A F n n be the
More informationAn Algorithmist s Toolkit Nov. 10, Lecture 17
8.409 An Algorithmist s Toolkit Nov. 0, 009 Lecturer: Jonathan Kelner Lecture 7 Johnson-Lindenstrauss Theorem. Recap We first recap a theorem (isoperimetric inequality) and a lemma (concentration) from
More informationLecture 1 Measure concentration
CSE 29: Learning Theory Fall 2006 Lecture Measure concentration Lecturer: Sanjoy Dasgupta Scribe: Nakul Verma, Aaron Arvey, and Paul Ruvolo. Concentration of measure: examples We start with some examples
More informationAN INEQUALITY FOR TAIL PROBABILITIES OF MARTINGALES WITH BOUNDED DIFFERENCES
Lithuanian Mathematical Journal, Vol. 4, No. 3, 00 AN INEQUALITY FOR TAIL PROBABILITIES OF MARTINGALES WITH BOUNDED DIFFERENCES V. Bentkus Vilnius Institute of Mathematics and Informatics, Akademijos 4,
More informationInequalities for Sums of Random Variables: a combinatorial perspective
Inequalities for Sums of Random Variables: a combinatorial perspective Doctoral thesis Matas Šileikis Department of Mathematics and Computer Science, Adam Mickiewicz University, Poznań April 2012 Acknowledgements
More informationLecture I: Asymptotics for large GUE random matrices
Lecture I: Asymptotics for large GUE random matrices Steen Thorbjørnsen, University of Aarhus andom Matrices Definition. Let (Ω, F, P) be a probability space and let n be a positive integer. Then a random
More informationGeneralization Bounds and Stability
Generalization Bounds and Stability Lorenzo Rosasco Tomaso Poggio 9.520 Class 9 2009 About this class Goal To recall the notion of generalization bounds and show how they can be derived from a stability
More informationPolynomial Representations of Threshold Functions and Algorithmic Applications. Joint with Josh Alman (Stanford) and Timothy M.
Polynomial Representations of Threshold Functions and Algorithmic Applications Ryan Williams Stanford Joint with Josh Alman (Stanford) and Timothy M. Chan (Waterloo) Outline The Context: Polynomial Representations,
More informationA glimpse into convex geometry. A glimpse into convex geometry
A glimpse into convex geometry 5 \ þ ÏŒÆ Two basis reference: 1. Keith Ball, An elementary introduction to modern convex geometry 2. Chuanming Zong, What is known about unit cubes Convex geometry lies
More informationDistance-Divergence Inequalities
Distance-Divergence Inequalities Katalin Marton Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences Motivation To find a simple proof of the Blowing-up Lemma, proved by Ahlswede,
More informationEmbeddings of finite metric spaces in Euclidean space: a probabilistic view
Embeddings of finite metric spaces in Euclidean space: a probabilistic view Yuval Peres May 11, 2006 Talk based on work joint with: Assaf Naor, Oded Schramm and Scott Sheffield Definition: An invertible
More information= (, ) V λ (1) λ λ ( + + ) P = [ ( ), (1)] ( ) ( ) = ( ) ( ) ( 0 ) ( 0 ) = ( 0 ) ( 0 ) 0 ( 0 ) ( ( 0 )) ( ( 0 )) = ( ( 0 )) ( ( 0 )) ( + ( 0 )) ( + ( 0 )) = ( + ( 0 )) ( ( 0 )) P V V V V V P V P V V V
More informationDefinition 6.1. A metric space (X, d) is complete if every Cauchy sequence tends to a limit in X.
Chapter 6 Completeness Lecture 18 Recall from Definition 2.22 that a Cauchy sequence in (X, d) is a sequence whose terms get closer and closer together, without any limit being specified. In the Euclidean
More informationGeneralization Bounds in Machine Learning. Presented by: Afshin Rostamizadeh
Generalization Bounds in Machine Learning Presented by: Afshin Rostamizadeh Outline Introduction to generalization bounds. Examples: VC-bounds Covering Number bounds Rademacher bounds Stability bounds
More informationEntropy and Ergodic Theory Lecture 15: A first look at concentration
Entropy and Ergodic Theory Lecture 15: A first look at concentration 1 Introduction to concentration Let X 1, X 2,... be i.i.d. R-valued RVs with common distribution µ, and suppose for simplicity that
More informationl 1 -Regularized Linear Regression: Persistence and Oracle Inequalities
l -Regularized Linear Regression: Persistence and Oracle Inequalities Peter Bartlett EECS and Statistics UC Berkeley slides at http://www.stat.berkeley.edu/ bartlett Joint work with Shahar Mendelson and
More informationModelling self-organizing networks
Paweł Department of Mathematics, Ryerson University, Toronto, ON Cargese Fall School on Random Graphs (September 2015) Outline 1 Introduction 2 Spatial Preferred Attachment (SPA) Model 3 Future work Multidisciplinary
More informationDefinable Extension Theorems in O-minimal Structures. Matthias Aschenbrenner University of California, Los Angeles
Definable Extension Theorems in O-minimal Structures Matthias Aschenbrenner University of California, Los Angeles 1 O-minimality Basic definitions and examples Geometry of definable sets Why o-minimal
More informationProblem Set 2: Solutions Math 201A: Fall 2016
Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that
More informationA new approach to quantum metrics. Nik Weaver. (joint work with Greg Kuperberg, in progress)
A new approach to quantum metrics Nik Weaver (joint work with Greg Kuperberg, in progress) Definition. A dual operator system is a linear subspace V of B(H) such that I V A V implies A V V is weak*-closed.
More informationTHE SZEMERÉDI REGULARITY LEMMA AND ITS APPLICATION
THE SZEMERÉDI REGULARITY LEMMA AND ITS APPLICATION YAQIAO LI In this note we will prove Szemerédi s regularity lemma, and its application in proving the triangle removal lemma and the Roth s theorem on
More informationConsistency of the maximum likelihood estimator for general hidden Markov models
Consistency of the maximum likelihood estimator for general hidden Markov models Jimmy Olsson Centre for Mathematical Sciences Lund University Nordstat 2012 Umeå, Sweden Collaborators Hidden Markov models
More informationRademacher functions
Rademacher functions Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto July 6, 4 Binary expansions Define S : {, } N [, ] by Sσ σ k k, σ {, }N. For example, for σ and σ,
More informationSDS : Theoretical Statistics
SDS 384 11: Theoretical Statistics Lecture 1: Introduction Purnamrita Sarkar Department of Statistics and Data Science The University of Texas at Austin https://psarkar.github.io/teaching Manegerial Stuff
More information1 Dimension Reduction in Euclidean Space
CSIS0351/8601: Randomized Algorithms Lecture 6: Johnson-Lindenstrauss Lemma: Dimension Reduction Lecturer: Hubert Chan Date: 10 Oct 011 hese lecture notes are supplementary materials for the lectures.
More informationIntroduction to Empirical Processes and Semiparametric Inference Lecture 12: Glivenko-Cantelli and Donsker Results
Introduction to Empirical Processes and Semiparametric Inference Lecture 12: Glivenko-Cantelli and Donsker Results Michael R. Kosorok, Ph.D. Professor and Chair of Biostatistics Professor of Statistics
More informationMathematical Foundation for Compressed Sensing
Mathematical Foundation for Compressed Sensing Jan-Olov Strömberg Royal Institute of Technology, Stockholm, Sweden Lecture 7, March 19, 2012 An outline for today Last time we stated: An outline for today
More informationMATH 31BH Homework 1 Solutions
MATH 3BH Homework Solutions January 0, 04 Problem.5. (a) (x, y)-plane in R 3 is closed and not open. To see that this plane is not open, notice that any ball around the origin (0, 0, 0) will contain points
More informationSTAT 200C: High-dimensional Statistics
STAT 200C: High-dimensional Statistics Arash A. Amini May 30, 2018 1 / 59 Classical case: n d. Asymptotic assumption: d is fixed and n. Basic tools: LLN and CLT. High-dimensional setting: n d, e.g. n/d
More informationSliding Windows with Limited Storage
Electronic Colloquium on Computational Complexity, Report No. 178 (2012) Sliding Windows with Limited Storage Paul Beame Computer Science and Engineering University of Washington Seattle, WA 98195-2350
More informationMATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:
MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is
More informationTrace Reconstruction Revisited
Trace Reconstruction Revisited Andrew McGregor 1, Eric Price 2, Sofya Vorotnikova 1 1 University of Massachusetts Amherst 2 IBM Almaden Research Center Problem Description Take original string x of length
More informationNotions such as convergent sequence and Cauchy sequence make sense for any metric space. Convergent Sequences are Cauchy
Banach Spaces These notes provide an introduction to Banach spaces, which are complete normed vector spaces. For the purposes of these notes, all vector spaces are assumed to be over the real numbers.
More information16 Embeddings of the Euclidean metric
16 Embeddings of the Euclidean metric In today s lecture, we will consider how well we can embed n points in the Euclidean metric (l 2 ) into other l p metrics. More formally, we ask the following question.
More informationReminder Notes for the Course on Measures on Topological Spaces
Reminder Notes for the Course on Measures on Topological Spaces T. C. Dorlas Dublin Institute for Advanced Studies School of Theoretical Physics 10 Burlington Road, Dublin 4, Ireland. Email: dorlas@stp.dias.ie
More informationLecture 3. Econ August 12
Lecture 3 Econ 2001 2015 August 12 Lecture 3 Outline 1 Metric and Metric Spaces 2 Norm and Normed Spaces 3 Sequences and Subsequences 4 Convergence 5 Monotone and Bounded Sequences Announcements: - Friday
More informationClass 2 & 3 Overfitting & Regularization
Class 2 & 3 Overfitting & Regularization Carlo Ciliberto Department of Computer Science, UCL October 18, 2017 Last Class The goal of Statistical Learning Theory is to find a good estimator f n : X Y, approximating
More informationCMPSCI 711: More Advanced Algorithms
CMPSCI 711: More Advanced Algorithms Section 1-1: Sampling Andrew McGregor Last Compiled: April 29, 2012 1/14 Concentration Bounds Theorem (Markov) Let X be a non-negative random variable with expectation
More informationMath 4317 : Real Analysis I Mid-Term Exam 1 25 September 2012
Instructions: Answer all of the problems. Math 4317 : Real Analysis I Mid-Term Exam 1 25 September 2012 Definitions (2 points each) 1. State the definition of a metric space. A metric space (X, d) is set
More informationError Detection and Correction: Small Applications of Exclusive-Or
Error Detection and Correction: Small Applications of Exclusive-Or Greg Plaxton Theory in Programming Practice, Fall 2005 Department of Computer Science University of Texas at Austin Exclusive-Or (XOR,
More informationOn the Uniqueness of Weak Solutions to the 2D Euler Equations
On the Uniqueness of Weak Solutions to the 2D Euler Equations (properties of the flow) 2009 SIAM Conference on Analysis of PDEs University of California, Riverside 9 December 2009 Bounded vorticity and
More informationBased on the Appendix to B. Hasselblatt and A. Katok, A First Course in Dynamics, Cambridge University press,
NOTE ON ABSTRACT RIEMANN INTEGRAL Based on the Appendix to B. Hasselblatt and A. Katok, A First Course in Dynamics, Cambridge University press, 2003. a. Definitions. 1. Metric spaces DEFINITION 1.1. If
More informationA sequential hypothesis test based on a generalized Azuma inequality 1
A sequential hypothesis test based on a generalized Azuma inequality 1 Daniël Reijsbergen a,2, Werner Scheinhardt b, Pieter-Tjerk de Boer b a Laboratory for Foundations of Computer Science, University
More informationSome Useful Background for Talk on the Fast Johnson-Lindenstrauss Transform
Some Useful Background for Talk on the Fast Johnson-Lindenstrauss Transform Nir Ailon May 22, 2007 This writeup includes very basic background material for the talk on the Fast Johnson Lindenstrauss Transform
More informationFUNCTIONAL ANALYSIS-NORMED SPACE
MAT641- MSC Mathematics, MNIT Jaipur FUNCTIONAL ANALYSIS-NORMED SPACE DR. RITU AGARWAL MALAVIYA NATIONAL INSTITUTE OF TECHNOLOGY JAIPUR 1. Normed space Norm generalizes the concept of length in an arbitrary
More informationIntroduction to Statistical Learning Theory
Introduction to Statistical Learning Theory Definition Reminder: We are given m samples {(x i, y i )} m i=1 Dm and a hypothesis space H and we wish to return h H minimizing L D (h) = E[l(h(x), y)]. Problem
More informationMath 320-2: Midterm 2 Practice Solutions Northwestern University, Winter 2015
Math 30-: Midterm Practice Solutions Northwestern University, Winter 015 1. Give an example of each of the following. No justification is needed. (a) A metric on R with respect to which R is bounded. (b)
More informationAN EXPLORATION OF THE METRIZABILITY OF TOPOLOGICAL SPACES
AN EXPLORATION OF THE METRIZABILITY OF TOPOLOGICAL SPACES DUSTIN HEDMARK Abstract. A study of the conditions under which a topological space is metrizable, concluding with a proof of the Nagata Smirnov
More informationThe Moment Method; Convex Duality; and Large/Medium/Small Deviations
Stat 928: Statistical Learning Theory Lecture: 5 The Moment Method; Convex Duality; and Large/Medium/Small Deviations Instructor: Sham Kakade The Exponential Inequality and Convex Duality The exponential
More informationMeasures. 1 Introduction. These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland.
Measures These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland. 1 Introduction Our motivation for studying measure theory is to lay a foundation
More informationTHE SUBGAUSSIAN CONSTANT AND CONCENTRATION INEQUALITIES
THE SUBGAUSSIAN CONSTANT AND CONCENTRATION INEQUALITIES S.G. Bobkov, C. Houdré, P. Tetali Abstract We study concentration inequalities for Lipschitz functions on graphs by estimating the optimal constant
More informationRecent results in game theoretic mathematical finance
Recent results in game theoretic mathematical finance Nicolas Perkowski Humboldt Universität zu Berlin May 31st, 2017 Thera Stochastics In Honor of Ioannis Karatzas s 65th Birthday Based on joint work
More informationTalagrand's Inequality
Talagrand's Inequality Aukosh Jagannath October 2, 2013 Abstract Notes on Talagrand's inequality. This material is a mixture from Talagrand's two famous papers and Ledoux. 1 Introduction The goal of this
More informationfunctions as above. There is a unique non-empty compact set, i=1
1 Iterated function systems Many of the well known examples of fractals, including the middle third Cantor sets, the Siepiński gasket and certain Julia sets, can be defined as attractors of iterated function
More informationMetric spaces and metrizability
1 Motivation Metric spaces and metrizability By this point in the course, this section should not need much in the way of motivation. From the very beginning, we have talked about R n usual and how relatively
More informationAsymptotic Geometric Analysis, Fall 2006
Asymptotic Geometric Analysis, Fall 006 Gideon Schechtman January, 007 1 Introduction The course will deal with convex symmetric bodies in R n. In the first few lectures we will formulate and prove Dvoretzky
More informationReminder Notes for the Course on Distribution Theory
Reminder Notes for the Course on Distribution Theory T. C. Dorlas Dublin Institute for Advanced Studies School of Theoretical Physics 10 Burlington Road, Dublin 4, Ireland. Email: dorlas@stp.dias.ie March
More informationMultichannel liar games with a fixed number of lies
Multichannel liar games with a fixed number of lies Robert Ellis 1 Kathryn Nyman 2 1 Illinois Institute of Technology 2 Loyola University SIAM Discrete Mathematics 2006 Ellis, Nyman (June 27, 2006) Multichannel
More informationFinite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
More information2. Metric Spaces. 2.1 Definitions etc.
2. Metric Spaces 2.1 Definitions etc. The procedure in Section for regarding R as a topological space may be generalized to many other sets in which there is some kind of distance (formally, sets with
More informationUniform convergence of N-dimensional Walsh Fourier series
STUDIA MATHEMATICA 68 2005 Uniform convergence of N-dimensional Walsh Fourier series by U. Goginava Tbilisi Abstract. We establish conditions on the partial moduli of continuity which guarantee uniform
More informationLecture 3: AC 0, the switching lemma
Lecture 3: AC 0, the switching lemma Topics in Complexity Theory and Pseudorandomness (Spring 2013) Rutgers University Swastik Kopparty Scribes: Meng Li, Abdul Basit 1 Pseudorandom sets We start by proving
More informationAssignment 2 : Probabilistic Methods
Assignment 2 : Probabilistic Methods jverstra@math Question 1. Let d N, c R +, and let G n be an n-vertex d-regular graph. Suppose that vertices of G n are selected independently with probability p, where
More informationExistence and Comparisons for BSDEs in general spaces
Existence and Comparisons for BSDEs in general spaces Samuel N. Cohen and Robert J. Elliott University of Adelaide and University of Calgary BFS 2010 S.N. Cohen, R.J. Elliott (Adelaide, Calgary) BSDEs
More informationLecture 10 Planck Distribution
Lecture 0 Planck Distribution We will now consider some nice applications using our canonical picture. Specifically, we will derive the so-called Planck Distribution and demonstrate that it describes two
More informationIrredundant Families of Subcubes
Irredundant Families of Subcubes David Ellis January 2010 Abstract We consider the problem of finding the maximum possible size of a family of -dimensional subcubes of the n-cube {0, 1} n, none of which
More informationExtended dynamic programming: technical details
A Extended dynamic programming: technical details The extended dynamic programming algorithm is given by Algorithm 2. Algorithm 2 Extended dynamic programming for finding an optimistic policy transition
More informationDraft. Advanced Probability Theory (Fall 2017) J.P.Kim Dept. of Statistics. Finally modified at November 28, 2017
Fall 207 Dept. of Statistics Finally modified at November 28, 207 Preface & Disclaimer This note is a summary of the lecture Advanced Probability Theory 326.729A held at Seoul National University, Fall
More informationABSTRACT INTEGRATION CHAPTER ONE
CHAPTER ONE ABSTRACT INTEGRATION Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any form or by any means. Suggestions and errors are invited and can be mailed
More informationOn the Concentration of the Crest Factor for OFDM Signals
On the Concentration of the Crest Factor for OFDM Signals Igal Sason Department of Electrical Engineering Technion - Israel Institute of Technology, Haifa 3, Israel E-mail: sason@eetechnionacil Abstract
More informationMachine Learning Theory (CS 6783)
Machine Learning Theory (CS 6783) Tu-Th 1:25 to 2:40 PM Kimball, B-11 Instructor : Karthik Sridharan ABOUT THE COURSE No exams! 5 assignments that count towards your grades (55%) One term project (40%)
More informationChapter 9: Basic of Hypercontractivity
Analysis of Boolean Functions Prof. Ryan O Donnell Chapter 9: Basic of Hypercontractivity Date: May 6, 2017 Student: Chi-Ning Chou Index Problem Progress 1 Exercise 9.3 (Tightness of Bonami Lemma) 2/2
More informationSome new estimates on the Liouville heat kernel
Some new estimates on the Liouville heat kernel Vincent Vargas 1 2 ENS Paris 1 first part in collaboration with: Maillard, Rhodes, Zeitouni 2 second part in collaboration with: David, Kupiainen, Rhodes
More informationEmpirical Risk Minimization
Empirical Risk Minimization Fabrice Rossi SAMM Université Paris 1 Panthéon Sorbonne 2018 Outline Introduction PAC learning ERM in practice 2 General setting Data X the input space and Y the output space
More informationTHE GREEN FUNCTION. Contents
THE GREEN FUNCTION CRISTIAN E. GUTIÉRREZ NOVEMBER 5, 203 Contents. Third Green s formula 2. The Green function 2.. Estimates of the Green function near the pole 2 2.2. Symmetry of the Green function 3
More informationB490 Mining the Big Data
B490 Mining the Big Data 1 Finding Similar Items Qin Zhang 1-1 Motivations Finding similar documents/webpages/images (Approximate) mirror sites. Application: Don t want to show both when Google. 2-1 Motivations
More informationMaths 212: Homework Solutions
Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then
More informationOptimal compression of approximate Euclidean distances
Optimal compression of approximate Euclidean distances Noga Alon 1 Bo az Klartag 2 Abstract Let X be a set of n points of norm at most 1 in the Euclidean space R k, and suppose ε > 0. An ε-distance sketch
More informationLecture 6 Proof for JL Lemma and Linear Dimensionality Reduction
COMS 4995: Unsupervised Learning (Summer 18) June 7, 018 Lecture 6 Proof for JL Lemma and Linear imensionality Reduction Instructor: Nakul Verma Scribes: Ziyuan Zhong, Kirsten Blancato This lecture gives
More informationOXPORD UNIVERSITY PRESS
Concentration Inequalities A Nonasymptotic Theory of Independence STEPHANE BOUCHERON GABOR LUGOSI PASCAL MASS ART OXPORD UNIVERSITY PRESS CONTENTS 1 Introduction 1 1.1 Sums of Independent Random Variables
More informationDynkin (λ-) and π-systems; monotone classes of sets, and of functions with some examples of application (mainly of a probabilistic flavor)
Dynkin (λ-) and π-systems; monotone classes of sets, and of functions with some examples of application (mainly of a probabilistic flavor) Matija Vidmar February 7, 2018 1 Dynkin and π-systems Some basic
More informationDensely defined non-closable curl on topologically one-dimensional Dirichlet metric measure spaces
Densely defined non-closable curl on topologically one-dimensional Dirichlet metric measure spaces Kansai Probability Seminar, Kyoto March 11, 2016 Universität Bielefeld joint with Alexander Teplyaev (University
More informationConcentration Inequalities for Dependent Random Variables via the Martingale Method
Concentration Inequalities for Dependent Random Variables via the Martingale Method Leonid Kontorovich, and Kavita Ramanan Carnegie Mellon University L. Kontorovich School of Computer Science Carnegie
More informationSTAT 200C: High-dimensional Statistics
STAT 200C: High-dimensional Statistics Arash A. Amini April 27, 2018 1 / 80 Classical case: n d. Asymptotic assumption: d is fixed and n. Basic tools: LLN and CLT. High-dimensional setting: n d, e.g. n/d
More informationAn exponential separation between quantum and classical one-way communication complexity
An exponential separation between quantum and classical one-way communication complexity Ashley Montanaro Centre for Quantum Information and Foundations, Department of Applied Mathematics and Theoretical
More informationThe Completion of a Metric Space
The Completion of a Metric Space Let (X, d) be a metric space. The goal of these notes is to construct a complete metric space which contains X as a subspace and which is the smallest space with respect
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationConsistency of Modularity Clustering on Random Geometric Graphs
Consistency of Modularity Clustering on Random Geometric Graphs Erik Davis The University of Arizona May 10, 2016 Outline Introduction to Modularity Clustering Pointwise Convergence Convergence of Optimal
More informationLecture 18: March 15
CS71 Randomness & Computation Spring 018 Instructor: Alistair Sinclair Lecture 18: March 15 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They may
More informationDECOMPOSING DIFFEOMORPHISMS OF THE SPHERE. inf{d Y (f(x), f(y)) : d X (x, y) r} H
DECOMPOSING DIFFEOMORPHISMS OF THE SPHERE ALASTAIR FLETCHER, VLADIMIR MARKOVIC 1. Introduction 1.1. Background. A bi-lipschitz homeomorphism f : X Y between metric spaces is a mapping f such that f and
More informationg 2 (x) (1/3)M 1 = (1/3)(2/3)M.
COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is
More information