tail bounds
play

Tail Bounds Computer Science Rice University What Is This About? - PowerPoint PPT Presentation

Jan 28, 2023 •15 likes •535 views

COMP 480/580 Probabilistic Algorithms and Data Structures Luay Nakhleh Tail Bounds Computer Science Rice University What Is This About? How large can a random variable get? In other words, how far can a value that the random variable

  1. COMP 480/580 Probabilistic Algorithms and Data Structures Luay Nakhleh Tail Bounds Computer Science Rice University

  2. What Is This About? ❖ How large can a random variable get? ❖ In other words, how far can a value that the random variable takes be from its mean?

  4. mean

  5. mean tails

  6. mean how large? tails

  7. <latexit sha1_base64="kTVjQRU6iUov3VUghL8k1P3M2A8=">AB9XicbVDLSgMxFL1TX7W+qi7dBItQN2VGBF0WRXBZwT6gHUsmzbShmWRIMkoZ+h9uXCji1n9x59+YaWehrQcCh3Pu5Z6cIOZMG9f9dgorq2vrG8XN0tb2zu5ef+gpWiCG0SyaXqBFhTzgRtGmY47cSK4ijgtB2MrzO/UiVZlLcm0lM/QgPBQsZwcZKD2kvwmYUBOhmWu2c9sVt+bOgJaJl5MK5Gj0y1+9gSRJRIUhHGvd9dzY+ClWhFOp6VeomMyRgPadSgSOq/XSWeopOrDJAoVT2CYNm6u+NFEdaT6LATmYh9aKXif953cSEl37KRJwYKsj8UJhwZCTKkADpigxfGIJorZrIiMsMLE2KJKtgRv8cvLpHVW89yad3deqV/ldRThCI6hCh5cQB1uoQFNIKDgGV7hzXlyXpx352M+WnDynUP4A+fzB395kdY=</latexit> <latexit sha1_base64="kTVjQRU6iUov3VUghL8k1P3M2A8=">AB9XicbVDLSgMxFL1TX7W+qi7dBItQN2VGBF0WRXBZwT6gHUsmzbShmWRIMkoZ+h9uXCji1n9x59+YaWehrQcCh3Pu5Z6cIOZMG9f9dgorq2vrG8XN0tb2zu5ef+gpWiCG0SyaXqBFhTzgRtGmY47cSK4ijgtB2MrzO/UiVZlLcm0lM/QgPBQsZwcZKD2kvwmYUBOhmWu2c9sVt+bOgJaJl5MK5Gj0y1+9gSRJRIUhHGvd9dzY+ClWhFOp6VeomMyRgPadSgSOq/XSWeopOrDJAoVT2CYNm6u+NFEdaT6LATmYh9aKXif953cSEl37KRJwYKsj8UJhwZCTKkADpigxfGIJorZrIiMsMLE2KJKtgRv8cvLpHVW89yad3deqV/ldRThCI6hCh5cQB1uoQFNIKDgGV7hzXlyXpx352M+WnDynUP4A+fzB395kdY=</latexit> <latexit sha1_base64="kTVjQRU6iUov3VUghL8k1P3M2A8=">AB9XicbVDLSgMxFL1TX7W+qi7dBItQN2VGBF0WRXBZwT6gHUsmzbShmWRIMkoZ+h9uXCji1n9x59+YaWehrQcCh3Pu5Z6cIOZMG9f9dgorq2vrG8XN0tb2zu5ef+gpWiCG0SyaXqBFhTzgRtGmY47cSK4ijgtB2MrzO/UiVZlLcm0lM/QgPBQsZwcZKD2kvwmYUBOhmWu2c9sVt+bOgJaJl5MK5Gj0y1+9gSRJRIUhHGvd9dzY+ClWhFOp6VeomMyRgPadSgSOq/XSWeopOrDJAoVT2CYNm6u+NFEdaT6LATmYh9aKXif953cSEl37KRJwYKsj8UJhwZCTKkADpigxfGIJorZrIiMsMLE2KJKtgRv8cvLpHVW89yad3deqV/ldRThCI6hCh5cQB1uoQFNIKDgGV7hzXlyXpx352M+WnDynUP4A+fzB395kdY=</latexit> <latexit sha1_base64="kTVjQRU6iUov3VUghL8k1P3M2A8=">AB9XicbVDLSgMxFL1TX7W+qi7dBItQN2VGBF0WRXBZwT6gHUsmzbShmWRIMkoZ+h9uXCji1n9x59+YaWehrQcCh3Pu5Z6cIOZMG9f9dgorq2vrG8XN0tb2zu5ef+gpWiCG0SyaXqBFhTzgRtGmY47cSK4ijgtB2MrzO/UiVZlLcm0lM/QgPBQsZwcZKD2kvwmYUBOhmWu2c9sVt+bOgJaJl5MK5Gj0y1+9gSRJRIUhHGvd9dzY+ClWhFOp6VeomMyRgPadSgSOq/XSWeopOrDJAoVT2CYNm6u+NFEdaT6LATmYh9aKXif953cSEl37KRJwYKsj8UJhwZCTKkADpigxfGIJorZrIiMsMLE2KJKtgRv8cvLpHVW89yad3deqV/ldRThCI6hCh5cQB1uoQFNIKDgGV7hzXlyXpx352M+WnDynUP4A+fzB395kdY=</latexit> <latexit sha1_base64="hf6hOeTjseL13iz+i/MO/ptaY5E=">AB6HicbVBNS8NAEJ3Ur1q/qh69LBbBU0lEqMeiF48t2A9oQ9lsJ+3azSbsboQS+gu8eFDEqz/Jm/GbZuDtj4YeLw3w8y8IBFcG9f9dgobm1vbO8Xd0t7+weFR+fikreNUMWyxWMSqG1CNgktsGW4EdhOFNAoEdoLJ3dzvPKHSPJYPZpqgH9GR5CFn1Fip2R2UK27VXYCsEy8nFcjRGJS/+sOYpRFKwTVue5ifEzqgxnAmelfqoxoWxCR9izVNItZ8tDp2RC6sMSRgrW9KQhfp7IqOR1tMosJ0RNWO96s3F/7xeasIbP+MySQ1KtlwUpoKYmMy/JkOukBkxtYQyxe2thI2poszYbEo2BG/15XSvqp6btVrXlfqt3kcRTiDc7gED2pQh3toQAsYIDzDK7w5j86L8+58LFsLTj5zCn/gfP4AtbmM3A=</latexit> <latexit sha1_base64="hf6hOeTjseL13iz+i/MO/ptaY5E=">AB6HicbVBNS8NAEJ3Ur1q/qh69LBbBU0lEqMeiF48t2A9oQ9lsJ+3azSbsboQS+gu8eFDEqz/Jm/GbZuDtj4YeLw3w8y8IBFcG9f9dgobm1vbO8Xd0t7+weFR+fikreNUMWyxWMSqG1CNgktsGW4EdhOFNAoEdoLJ3dzvPKHSPJYPZpqgH9GR5CFn1Fip2R2UK27VXYCsEy8nFcjRGJS/+sOYpRFKwTVue5ifEzqgxnAmelfqoxoWxCR9izVNItZ8tDp2RC6sMSRgrW9KQhfp7IqOR1tMosJ0RNWO96s3F/7xeasIbP+MySQ1KtlwUpoKYmMy/JkOukBkxtYQyxe2thI2poszYbEo2BG/15XSvqp6btVrXlfqt3kcRTiDc7gED2pQh3toQAsYIDzDK7w5j86L8+58LFsLTj5zCn/gfP4AtbmM3A=</latexit> <latexit sha1_base64="hf6hOeTjseL13iz+i/MO/ptaY5E=">AB6HicbVBNS8NAEJ3Ur1q/qh69LBbBU0lEqMeiF48t2A9oQ9lsJ+3azSbsboQS+gu8eFDEqz/Jm/GbZuDtj4YeLw3w8y8IBFcG9f9dgobm1vbO8Xd0t7+weFR+fikreNUMWyxWMSqG1CNgktsGW4EdhOFNAoEdoLJ3dzvPKHSPJYPZpqgH9GR5CFn1Fip2R2UK27VXYCsEy8nFcjRGJS/+sOYpRFKwTVue5ifEzqgxnAmelfqoxoWxCR9izVNItZ8tDp2RC6sMSRgrW9KQhfp7IqOR1tMosJ0RNWO96s3F/7xeasIbP+MySQ1KtlwUpoKYmMy/JkOukBkxtYQyxe2thI2poszYbEo2BG/15XSvqp6btVrXlfqt3kcRTiDc7gED2pQh3toQAsYIDzDK7w5j86L8+58LFsLTj5zCn/gfP4AtbmM3A=</latexit> <latexit sha1_base64="hf6hOeTjseL13iz+i/MO/ptaY5E=">AB6HicbVBNS8NAEJ3Ur1q/qh69LBbBU0lEqMeiF48t2A9oQ9lsJ+3azSbsboQS+gu8eFDEqz/Jm/GbZuDtj4YeLw3w8y8IBFcG9f9dgobm1vbO8Xd0t7+weFR+fikreNUMWyxWMSqG1CNgktsGW4EdhOFNAoEdoLJ3dzvPKHSPJYPZpqgH9GR5CFn1Fip2R2UK27VXYCsEy8nFcjRGJS/+sOYpRFKwTVue5ifEzqgxnAmelfqoxoWxCR9izVNItZ8tDp2RC6sMSRgrW9KQhfp7IqOR1tMosJ0RNWO96s3F/7xeasIbP+MySQ1KtlwUpoKYmMy/JkOukBkxtYQyxe2thI2poszYbEo2BG/15XSvqp6btVrXlfqt3kcRTiDc7gED2pQh3toQAsYIDzDK7w5j86L8+58LFsLTj5zCn/gfP4AtbmM3A=</latexit> Why Do We Care? ❖ Example: ❖ is the number of steps an algorithm takes. X ❖ is the average-case running-time of the algorithm. E ( X ) ❖ Can the algorithm, on average, take 2n steps, but on some inputs take, say, 500n 2 steps?

  8. Recall ❖ A random variable is a function from the sample space of an experiment/process to the set of real numbers. ❖ A coin is tossed twice. Let X(t) be the random variable that equals the number of heads that appear when t is the outcome. Then X(t) takes on the following values: ❖ X(HH)=2 ❖ X(HT)=X(TH)=1 ❖ X(TT)=0

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

tail bounds tail bounds For a random variable X, the tails of X are the parts of the PMF/density

tail bounds tail bounds For a random variable X, the tails of X are the parts of the PMF/density

tail bounds tail bounds For a random variable X, the tails of X are the parts of the PMF/density that are far from its mean. PMF for X ~ Bin(100,0.5) 0.08 0.06 P(X=k) 0.04 0.02 0.00 30 40 50 60 70 4 k tail bounds

324 views • 21 slides
Scalable Machine Learning 12. Tail bounds and Averages Geoff Gordon and Alex Smola CMU

Scalable Machine Learning 12. Tail bounds and Averages Geoff Gordon and Alex Smola CMU

Scalable Machine Learning 12. Tail bounds and Averages Geoff Gordon and Alex Smola CMU http://alex.smola.org/teaching/10-701x Estimating Probabilities Binomial Distribution Two outcomes (head, tail); (0,1) Data likelihood p ( X ;

747 views • 40 slides
Concentration inequalities and tail bounds John Duchi Prof. John Duchi Outline I Basics and

Concentration inequalities and tail bounds John Duchi Prof. John Duchi Outline I Basics and

Concentration inequalities and tail bounds John Duchi Prof. John Duchi Outline I Basics and motivation 1 Law of large numbers 2 Markov inequality 3 Cherno ff bounds II Sub-Gaussian random variables 1 Definitions 2 Examples 3 Hoe ff ding

698 views • 24 slides
Using Friendly Tail Bounds for Sums of Random Matrices Joel A. Tropp Computing +

Using Friendly Tail Bounds for Sums of Random Matrices Joel A. Tropp Computing +

Using Friendly Tail Bounds for Sums of Random Matrices Joel A. Tropp Computing + Mathematical Sciences California Institute of Technology jtropp@cms.caltech.edu Research supported in part by NSF, DARPA, ONR, and AFOSR 1 . Matrix .

726 views • 26 slides
Introduction to Machine Learning CMU-10701 Stochastic Convergence and Tail Bounds Barnabs

Introduction to Machine Learning CMU-10701 Stochastic Convergence and Tail Bounds Barnabs

Introduction to Machine Learning CMU-10701 Stochastic Convergence and Tail Bounds Barnabs Pczos Basic Estimation Theory 2 Rolling a Dice, Estimation of parameters 1 , 2 ,, 6 12 24 Does the MLE estimation converge to the

928 views • 57 slides
Introduction to Machine Learning CMU-10701 9. Tail Bounds Barnabs Pczos Fourier Transform

Introduction to Machine Learning CMU-10701 9. Tail Bounds Barnabs Pczos Fourier Transform

Introduction to Machine Learning CMU-10701 9. Tail Bounds Barnabs Pczos Fourier Transform and Characteristic Function 2 Fourier Transform Fourier transform unitary transf. Inverse Fourier transform Other conventions: Where to put 2

532 views • 30 slides
Race Condition Shared Data: 4 5 6 1 8 5 6 20 9 ? Synchronization and Deadlocks tail

Race Condition Shared Data: 4 5 6 1 8 5 6 20 9 ? Synchronization and Deadlocks tail

Race Condition Shared Data: 4 5 6 1 8 5 6 20 9 ? Synchronization and Deadlocks tail A[] (or The Dangers of Threading) Enqueue(): A[tail] = 20; A[tail] = 9; Jonathan Misurda tail++; tail++; thread jmisurda@cs.pitt.edu switch

282 views • 3 slides
Lecture #2: Advanced hashing and concentration bounds o Bloom filters o Cuckoo hashing o Load

Lecture #2: Advanced hashing and concentration bounds o Bloom filters o Cuckoo hashing o Load

outline Lecture #2: Advanced hashing and concentration bounds o Bloom filters o Cuckoo hashing o Load balancing o Tail bounds Bloom filters Idea: For the sake of efficiency, sometime we allow our data structure to make mistakes Bloom filter:

712 views • 68 slides
Race Condition Shared Data: 5 6 4 1 8 5 6 20 9 ? InterProcess Communication tail A[]

Race Condition Shared Data: 5 6 4 1 8 5 6 20 9 ? InterProcess Communication tail A[]

Race Condition Shared Data: 5 6 4 1 8 5 6 20 9 ? InterProcess Communication tail A[] Enqueue(): A[tail] = 20; A[tail] = 9; tail++; tail++; process switch Process A Process B Critical Regions Goals No two processes (threads)

265 views • 4 slides
10701 Machine Learning Recitation 7 - Tail bounds and Averages Ahmed Hefny Slides mostly by Alex

10701 Machine Learning Recitation 7 - Tail bounds and Averages Ahmed Hefny Slides mostly by Alex

10701 Machine Learning Recitation 7 - Tail bounds and Averages Ahmed Hefny Slides mostly by Alex Smola Why this stuff ? Can machine learning work ? Why this stuff ? Can machine learning work ? Yes, otherwise: No Google No

850 views • 48 slides
Tales of the Tail Hardware, OS, and Application-level Sources of Tail Latency Jialin Li, Naveen

Tales of the Tail Hardware, OS, and Application-level Sources of Tail Latency Jialin Li, Naveen

Tales of the Tail Hardware, OS, and Application-level Sources of Tail Latency Jialin Li, Naveen Kr. Sharma , Dan R. K. Ports and Steven D. Gribble February 2, 2015 1 Introduction What is Tail Latency? What is Tail Latency? 2 Introduction

1.01k views • 73 slides
Synthesis and characterization of new tail-to-tail dimers of bile acids with different spacers

Synthesis and characterization of new tail-to-tail dimers of bile acids with different spacers

[f007] Synthesis and characterization of new tail-to-tail dimers of bile acids with different spacers lvaro Antelo, Mercedes lvarez Alcalde, Aida Jover, Francisco Meijide, and Jos Vzquez Tato Departamento de Qumica Fsica, Facultad de

374 views • 10 slides
The Long Tail as a Pow g er Curve 120 100 80 60 40 40 20 0 1 1 11 11 21 21 31 31

The Long Tail as a Pow g er Curve 120 100 80 60 40 40 20 0 1 1 11 11 21 21 31 31

The Long Tail as a Pow g er Curve 120 100 80 60 40 40 20 0 1 1 11 11 21 21 31 31 41 41 W here the Long Tail Meets the Sneaky Exponential (Cum ulative V alue of Potential Intearctions) 10000 9000 8000 8000 7000 6000

651 views • 9 slides
TAIL ESTIMATION USING DETERMINISTIC METHODS Maximum Foreseeable Loss (MFL) For Severe Thunder

TAIL ESTIMATION USING DETERMINISTIC METHODS Maximum Foreseeable Loss (MFL) For Severe Thunder

TAIL ESTIMATION USING DETERMINISTIC METHODS Maximum Foreseeable Loss (MFL) For Severe Thunder Storm Tail Loss Estimates Prasad Gunturi Willis Re, Minneapolis Outline Commercial probabilistic models Deterministic methods for tail

322 views • 10 slides
Tail call elimination Michel Schinz Tail calls and their elimination Loops in functional

Tail call elimination Michel Schinz Tail calls and their elimination Loops in functional

Tail call elimination Michel Schinz Tail calls and their elimination Loops in functional languages Several functional programming languages do not have an explicit looping statement. Instead, programmers resort to recursion to loop. For

338 views • 33 slides
Tail Recursion FlashBack goToWall Iteration A tail recursive solution: public void

Tail Recursion FlashBack goToWall Iteration A tail recursive solution: public void

Tail Recursion FlashBack goToWall Iteration A tail recursive solution: public void goToWallRec() { if (!isFacingWall()) { forward(); goToWallRec(); } } P - 1 P - 2 JEM Iteration Object Land WallBuggle Suppose we want to execute a

933 views • 4 slides
Adaptive discontinuous Galerkin method for tsunami modeling and prediction on a global scale Jan

Adaptive discontinuous Galerkin method for tsunami modeling and prediction on a global scale Jan

S Abarbanel Memorial 2018 Adaptive discontinuous Galerkin method for tsunami modeling and prediction on a global scale Jan S Hesthaven EPFL-SB-MATH-MCSS Jan.Hesthaven@epfl.ch B. Bonev (EPFL, CH) F. Giraldo (NPS, US) M. Hajihassanpour

874 views • 40 slides
Aperiodic tilings (tutorial) Boris Solomyak U Washington and Bar-Ilan February 12, 2015, ICERM

Aperiodic tilings (tutorial) Boris Solomyak U Washington and Bar-Ilan February 12, 2015, ICERM

Aperiodic tilings (tutorial) Boris Solomyak U Washington and Bar-Ilan February 12, 2015, ICERM Boris Solomyak (U Washington and Bar-Ilan) Aperiodic tilings February 12, 2015, ICERM 1 / 45 Plan of the talk 1 Introduction. 2 Tiling

813 views • 77 slides
Reconstructing Objects with Sparse Boundaries: Total Variation vs. Discrete Tomography Willem Jan

Reconstructing Objects with Sparse Boundaries: Total Variation vs. Discrete Tomography Willem Jan

Reconstructing Objects with Sparse Boundaries: Total Variation vs. Discrete Tomography Willem Jan Palenstijn iMinds-Vision Lab, Universiteit Antwerpen, Belgium 27 March 2014, Sparse Tomo Days, DTU, Denmark What is Discrete Tomography?

577 views • 28 slides
SaiDeepTetali PatriceGodefroid,AdityaV.Nori,SriramK.Rajamani

SaiDeepTetali PatriceGodefroid,AdityaV.Nori,SriramK.Rajamani

SaiDeepTetali PatriceGodefroid,AdityaV.Nori,SriramK.Rajamani MicrosoftResearch UCLosAngeles Question Doestheassertionholdforallpossibleinputs?

653 views • 28 slides
Are longer verbal expressions really semantically more similar to each other? An investigation of

Are longer verbal expressions really semantically more similar to each other? An investigation of

Are longer verbal expressions really semantically more similar to each other? An investigation of the elaboration-bias in vector-based models of word meaning Boris Forthmann University of Mnster Fritz Gnther University of

605 views • 24 slides
A New Digital Signage with Sensors: Experience and the issues | Sungkwan Jung

A New Digital Signage with Sensors: Experience and the issues | Sungkwan Jung

A New Digital Signage with Sensors: Experience and the issues | Sungkwan Jung (skjung@itc.kaist.ac.kr) | Jinhong Yang, Hyojin Park {sunupnet, gaiaphj} @kaist.ac.kr | JuYoung Youn (juyoung.yun@dartmedia.co.kr) 2015.09.17 Dart Media &amp;

579 views • 8 slides
Quartz Sensors for I Sensors for Improved mproved Quartz Disaster Warning Systems Disaster

Quartz Sensors for I Sensors for Improved mproved Quartz Disaster Warning Systems Disaster

Quartz Sensors for I Sensors for Improved mproved Quartz Disaster Warning Systems Disaster Warning Systems and Geodetic Measurements and Geodetic Measurements Paroscientific and Quartz Seismic Sensors Quartz Crystal Resonators Convert

858 views • 36 slides
Flutter Kasper Lund, Google The best way to build for mobile? We need to talk about

Flutter Kasper Lund, Google The best way to build for mobile? We need to talk about

Flutter Kasper Lund, Google The best way to build for mobile? We need to talk about American politics... The Founding Father Alexander Hamilton's life is now a hip-hop musical... Hamilton! So you have have one really popular show. What

1.93k views • 74 slides

More recommend