randomized algorithms
play

Randomized Algorithms Lecture 9 September 24, 2013 Sariel (UIUC) - PowerPoint PPT Presentation

Mar 29, 2024 •197 likes •1.05k views

CS 573: Algorithms, Fall 2013 Randomized Algorithms Lecture 9 September 24, 2013 Sariel (UIUC) CS573 1 Fall 2013 1 / 32 Part I . Randomized Algorithms . Sariel (UIUC) CS573 2 Fall 2013 2 / 32 Probability - quick review Definitions

  1. CS 573: Algorithms, Fall 2013 Randomized Algorithms Lecture 9 September 24, 2013 Sariel (UIUC) CS573 1 Fall 2013 1 / 32

  2. Part I . Randomized Algorithms . Sariel (UIUC) CS573 2 Fall 2013 2 / 32

  3. Probability - quick review Definitions . Definition (Informal) . Random variable : a function from probability space to I R . Associates value ∀ atomic events in probability space. . . Definition . The conditional probability of X given Y is [ ] Pr ( X = x ) ∩ ( Y = y ) [ � ] Pr X = x � Y = y = . � [ ] Pr Y = y Equivalent to [ ] [ � ] [ ] Pr ( X = x ) ∩ ( Y = y ) = Pr X = x � Y = y ∗ Pr Y = y . � . Sariel (UIUC) CS573 3 Fall 2013 3 / 32

  4. Probability - quick review Definitions . Definition (Informal) . Random variable : a function from probability space to I R . Associates value ∀ atomic events in probability space. . . Definition . The conditional probability of X given Y is [ ] Pr ( X = x ) ∩ ( Y = y ) [ � ] Pr X = x � Y = y = . � [ ] Pr Y = y Equivalent to [ ] [ � ] [ ] Pr ( X = x ) ∩ ( Y = y ) = Pr X = x � Y = y ∗ Pr Y = y . � . Sariel (UIUC) CS573 3 Fall 2013 3 / 32

  5. Probability - quick review Definitions . Definition (Informal) . Random variable : a function from probability space to I R . Associates value ∀ atomic events in probability space. . . Definition . The conditional probability of X given Y is [ ] Pr ( X = x ) ∩ ( Y = y ) [ � ] Pr X = x � Y = y = . � [ ] Pr Y = y Equivalent to [ ] [ � ] [ ] Pr ( X = x ) ∩ ( Y = y ) = Pr X = x � Y = y ∗ Pr Y = y . � . Sariel (UIUC) CS573 3 Fall 2013 3 / 32

  6. Probability - quick review Even more definitions . Definition . The events X = x and Y = y are independent , if Pr[ X = x ∩ Y = y ] = Pr[ X = x ] · Pr[ Y = y ] . ≡ . . Definition . The expectation of a random variable X its average value: [ ] ∑ = x · Pr[ X = x ] , E X x . Sariel (UIUC) CS573 4 Fall 2013 4 / 32

  7. Probability - quick review Even more definitions . Definition . The events X = x and Y = y are independent , if Pr[ X = x ∩ Y = y ] = Pr[ X = x ] · Pr[ Y = y ] . � [ ] ≡ Pr X = x � Y = y = Pr[ X = x ] . � . . Definition . The expectation of a random variable X its average value: [ ] ∑ = x · Pr[ X = x ] , E X x . Sariel (UIUC) CS573 4 Fall 2013 4 / 32

  8. Linearity of expectations . Lemma (Linearity of expectation.) . [ ] [ ] [ ] ∀ random variables X and Y : E X + Y = E X + E Y . . . Proof. . Use definitions, do the math. See notes for details. . Sariel (UIUC) CS573 5 Fall 2013 5 / 32

  9. Probability - quick review Conditional Expectation . Definition . X , Y : random variables. The conditional expectation of X given Y (i.e., you know Y = y ): [ � ] [ � ] [ � ] ∑ X � Y = E X � Y = y = x ∗ Pr X = x � Y = y . E � � � x . E[ X ] is a number. [ � ] f ( y ) = E � Y = y is a function. X � Sariel (UIUC) CS573 6 Fall 2013 6 / 32

  10. Conditional Expectation . Lemma . [ [ � ]] ∀ X , Y (not necessarily independent): E[ X ] = E . E X � Y � . [ [ � ]] [ [ � ]] = E y � Y = y E E X � Y E X � � . Proof. . Use definitions, and do the math. See class notes. . Sariel (UIUC) CS573 7 Fall 2013 7 / 32

  11. Conditional Expectation . Lemma . [ [ � ]] ∀ X , Y (not necessarily independent): E[ X ] = E . E X � Y � . [ [ � ]] [ [ � ]] = E y � Y = y E E X � Y E X � � . Proof. . Use definitions, and do the math. See class notes. . Sariel (UIUC) CS573 7 Fall 2013 7 / 32

  12. Conditional Expectation . Lemma . [ [ � ]] ∀ X , Y (not necessarily independent): E[ X ] = E . E X � Y � . [ [ � ]] [ [ � ]] = E y � Y = y E E X � Y E X � � . Proof. . Use definitions, and do the math. See class notes. . Sariel (UIUC) CS573 7 Fall 2013 7 / 32

  13. Sorting Nuts & Bolts . Problem ( Sorting Nuts and Bolts ) . . Input: Set n nuts + n bolts. 1 . . Every nut have a matching 2 bolt. . . All diff sizes. 3 . . Task: Match nuts to bolts. 4 (In sorted order). . . Restriction: You can only 5 compare a nut to a bolt. . Q: How to match the n nuts 6 to the n bolts quickly? . Sariel (UIUC) CS573 8 Fall 2013 8 / 32

  14. Sorting Nuts & Bolts . Problem ( Sorting Nuts and Bolts ) . . Input: Set n nuts + n bolts. 1 . . Every nut have a matching 2 bolt. . . All diff sizes. 3 . . Task: Match nuts to bolts. 4 (In sorted order). . Restriction: You can only 5 compare a nut to a bolt. . Q: How to match the n nuts 6 to the n bolts quickly? . Sariel (UIUC) CS573 8 Fall 2013 8 / 32

  15. Sorting Nuts & Bolts . Problem ( Sorting Nuts and Bolts ) . . Input: Set n nuts + n bolts. 1 . . Every nut have a matching 2 bolt. . . All diff sizes. 3 . . Task: Match nuts to bolts. 4 (In sorted order). . . Restriction: You can only 5 compare a nut to a bolt. . . Q: How to match the n nuts 6 to the n bolts quickly? . Sariel (UIUC) CS573 8 Fall 2013 8 / 32

  16. Sorting Nuts & Bolts . Problem ( Sorting Nuts and Bolts ) . . Input: Set n nuts + n bolts. 1 . . Every nut have a matching 2 bolt. . . All diff sizes. 3 . . Task: Match nuts to bolts. 4 (In sorted order). . . Restriction: You can only 5 compare a nut to a bolt. . Q: How to match the n nuts 6 to the n bolts quickly? . Sariel (UIUC) CS573 8 Fall 2013 8 / 32

  17. Sorting Nuts & Bolts . Problem ( Sorting Nuts and Bolts ) . . Input: Set n nuts + n bolts. 1 . . Every nut have a matching 2 bolt. . . All diff sizes. 3 . . Task: Match nuts to bolts. 4 (In sorted order). . . Restriction: You can only 5 compare a nut to a bolt. . Q: How to match the n nuts 6 to the n bolts quickly? . Sariel (UIUC) CS573 8 Fall 2013 8 / 32

  18. Sorting nuts & bolts... Algorithm . . Naive algorithm... 1 . . ...better algorithm? 2 Sariel (UIUC) CS573 9 Fall 2013 9 / 32

  19. Sorting nuts & bolts... Algorithm . . Naive algorithm... 1 . . ...better algorithm? 2 Sariel (UIUC) CS573 9 Fall 2013 9 / 32

  20. Sorting nuts & bolts... MatchNutsAndBolts ( N : nuts, B : bolts) Pick a random nut n pivot from N Find its matching bolt b pivot in B B L ← All bolts in B smaller than n pivot N L ← All nuts in N smaller than b pivot B R ← All bolts in B larger than n pivot N R ← All nuts in N larger than b pivot MatchNutsAndBolts ( N R , B R ) MatchNutsAndBolts ( N L , B L ) QuickSort style... Sariel (UIUC) CS573 10 Fall 2013 10 / 32

  21. Sorting nuts & bolts... MatchNutsAndBolts ( N : nuts, B : bolts) Pick a random nut n pivot from N Find its matching bolt b pivot in B B L ← All bolts in B smaller than n pivot N L ← All nuts in N smaller than b pivot B R ← All bolts in B larger than n pivot N R ← All nuts in N larger than b pivot MatchNutsAndBolts ( N R , B R ) MatchNutsAndBolts ( N L , B L ) QuickSort style... Sariel (UIUC) CS573 10 Fall 2013 10 / 32

  22. What is running time for randomized algorithms? Definitions . Definition . RT ( U ) : random variable – running time of the algorithm on input U . . . Definition . Expected running time E[ RT ( U )] for input U . . . Definition . expected running-time of algorithm for input size n : [ ] T ( n ) = max RT ( U ) . U is an input of size n E . Sariel (UIUC) CS573 11 Fall 2013 11 / 32

  23. What is running time for randomized algorithms? Definitions . Definition . RT ( U ) : random variable – running time of the algorithm on input U . . . Definition . Expected running time E[ RT ( U )] for input U . . . Definition . expected running-time of algorithm for input size n : [ ] T ( n ) = max RT ( U ) . U is an input of size n E . Sariel (UIUC) CS573 11 Fall 2013 11 / 32

  24. What is running time for randomized algorithms? Definitions . Definition . RT ( U ) : random variable – running time of the algorithm on input U . . . Definition . Expected running time E[ RT ( U )] for input U . . . Definition . expected running-time of algorithm for input size n : [ ] T ( n ) = max RT ( U ) . U is an input of size n E . Sariel (UIUC) CS573 11 Fall 2013 11 / 32

  25. What is running time for randomized algorithms? More definitions . Definition . rank( x ) : rank of element x ∈ S = number of elements in S smaller or equal to x . . Sariel (UIUC) CS573 12 Fall 2013 12 / 32

  26. Nuts and bolts running time . Theorem . Expected running time MatchNutsAndBolts ( QuickSort ) is T ( n ) = O ( n log n ) . Worst case is O ( n 2 ) . . . Proof. . Pr[rank( n pivot ) = k ] = 1 n . Thus, [ ] T ( n ) = O ( n ) + T ( k − 1) + T ( n − k ) E k =rank( n pivot ) . Sariel (UIUC) CS573 13 Fall 2013 13 / 32

  27. Nuts and bolts running time . Theorem . Expected running time MatchNutsAndBolts ( QuickSort ) is T ( n ) = O ( n log n ) . Worst case is O ( n 2 ) . . . Proof. . Pr[rank( n pivot ) = k ] = 1 n . Thus, [ ] T ( n ) = O ( n ) + T ( k − 1) + T ( n − k ) E k =rank( n pivot ) = O ( n ) + E k [ T ( k − 1) + T ( n − k )] . Sariel (UIUC) CS573 13 Fall 2013 13 / 32

Recommend

Randomized Algorithms Randomized Algorithms Two Types of Randomized Algorithms Two Types of

Randomized Algorithms Randomized Algorithms Two Types of Randomized Algorithms Two Types of

Randomized Algorithms Randomized Algorithms Two Types of Randomized Algorithms Two Types of Randomized Algorithms and and Some Complexity Classes Some Complexity Classes Speaker: Chuang-Chieh Lin Advisor: Professor Maw-Shang Chang National

910 views • 52 slides
Randomized algorithms Quick-sort Closest pair of points Inge Li Grtz 1 2

Randomized algorithms Quick-sort Closest pair of points Inge Li Grtz 1 2

Randomized algorithms Today What are randomized algorithms? Properties of randomized algorithms Three examples: Median/Select. Randomized algorithms Quick-sort Closest pair of points Inge Li Grtz 1 2

358 views • 10 slides
Randomized Algorithms Randomized Algorithms Markov Chains and Random Walks Markov Chains and

Randomized Algorithms Randomized Algorithms Markov Chains and Random Walks Markov Chains and

Randomized Algorithms Randomized Algorithms Markov Chains and Random Walks Markov Chains and Random Walks Speaker: Chuang-Chieh Lin Advisor: Professor Maw-Shang Chang National Chung Cheng University 2007/4/25 2007/4/25 References

837 views • 79 slides
Probability and Delaunay triangulations 1 Randomized algorithms for Delaunay triangulations

Probability and Delaunay triangulations 1 Randomized algorithms for Delaunay triangulations

Probability and Delaunay triangulations 1 Randomized algorithms for Delaunay triangulations Poisson Delaunay triangulation 2 - 1 Randomized algorithms for Delaunay triangulations Randomized backward analysis of binary trees Randomized

1.99k views • 121 slides
Introduction to Randomized Algorithms: QuickSort Lecture 2 August 27, 2020 Chandra (UIUC)

Introduction to Randomized Algorithms: QuickSort Lecture 2 August 27, 2020 Chandra (UIUC)

CS 498ABD: Algorithms for Big Data Introduction to Randomized Algorithms: QuickSort Lecture 2 August 27, 2020 Chandra (UIUC) CS498ABD 1 Fall 2020 1 / 33 Outline Today Randomized Algorithms Two types Las Vegas Monte Carlo

1.03k views • 71 slides
Randomized algorithms Inge Li Grtz Thank you to Kevin Wayne for inspiration to slides

Randomized algorithms Inge Li Grtz Thank you to Kevin Wayne for inspiration to slides

Randomized algorithms Inge Li Grtz Thank you to Kevin Wayne for inspiration to slides Randomized algorithms Last week Contention resolution Global minimum cut Today Expectation of random variables Guessing cards

517 views • 18 slides
Optimal Randomized Algorithms for Integration Integration on Function Spaces with underlying

Optimal Randomized Algorithms for Integration Integration on Function Spaces with underlying

Randomized Algorithms for Infinite- dimensional Optimal Randomized Algorithms for Integration Integration on Function Spaces with underlying ANOVA decomposition Michael Gnewuch 1 University of Kaiserslautern, Germany October 16, 2013 Based

316 views • 18 slides
Randomized Algorithms, Quicksort and Randomized Selection Carola Wenk Slides courtesy of Charles

Randomized Algorithms, Quicksort and Randomized Selection Carola Wenk Slides courtesy of Charles

CMPS 2200 Fall 2014 Randomized Algorithms, Quicksort and Randomized Selection Carola Wenk Slides courtesy of Charles Leiserson with additions by Carola Wenk CMPS 2200 Intro. to Algorithms 1 Deterministic Algorithms Runtime for

765 views • 54 slides
ADVANCED ALGORITHMS Lecture 14: randomized algorithms 1 ANNOUNCEMENTS HW 3 out; due

ADVANCED ALGORITHMS Lecture 14: randomized algorithms 1 ANNOUNCEMENTS HW 3 out; due

ADVANCED ALGORITHMS Lecture 14: randomized algorithms 1 ANNOUNCEMENTS HW 3 out; due Friday after fall break Look out for project topics! announcement in a little while Groups of 2-3 Give a list of >= 5 topics, top choice

900 views • 23 slides
Randomized algorithms Guessing cards Three examples: Median/Select. Inge Li Grtz

Randomized algorithms Guessing cards Three examples: Median/Select. Inge Li Grtz

Randomized algorithms Last week Contention resolution Global minimum cut Today Expectation of random variables Randomized algorithms Guessing cards Three examples: Median/Select. Inge Li Grtz Quick-sort Thank

626 views • 5 slides
ECS231 Low-rank approximation revisited (Introduction to Randomized Algorithms) May 23, 2019

ECS231 Low-rank approximation revisited (Introduction to Randomized Algorithms) May 23, 2019

ECS231 Low-rank approximation revisited (Introduction to Randomized Algorithms) May 23, 2019 1 / 15 Outline 1. Review: low-rank approximation 2. Prototype randomized SVD algorithm 3. Accelerated randomized SVD algorithms 4. CUR

262 views • 15 slides
Randomized Algorithms Lecture 3: Occupancy, Moments and deviations, Randomized selection

Randomized Algorithms Lecture 3: Occupancy, Moments and deviations, Randomized selection

Randomized Algorithms Lecture 3: Occupancy, Moments and deviations, Randomized selection Sotiris Nikoletseas Associate Professor CEID - ETY Course 2013 - 2014 Sotiris Nikoletseas, Associate Professor Randomized Algorithms - Lecture 3

603 views • 34 slides
8. Average-Case Analysis of Algorithms + Randomized Algorithms 1 outline and goals 1)

8. Average-Case Analysis of Algorithms + Randomized Algorithms 1 outline and goals 1)

CSE 421, Spring 2017, W.L.Ruzzo 8. Average-Case Analysis of Algorithms + Randomized Algorithms 1 outline and goals 1) Probability tools you've seen allow formal definition of "average case" running time of algorithms 2) Coupled

943 views • 19 slides
Chapter 11 Randomized Algorithms III Min Cut CS 573: Algorithms, Fall 2013 October 1, 2013

Chapter 11 Randomized Algorithms III Min Cut CS 573: Algorithms, Fall 2013 October 1, 2013

Chapter 11 Randomized Algorithms III Min Cut CS 573: Algorithms, Fall 2013 October 1, 2013 11.1 Min Cut 11.1.1 Problem Definition 11.2 Min cut 11.2.0.1 Min cut G = ( V, E ): undirected graph, n vertices, m edges. Interested in cuts in

276 views • 9 slides
Approximation and Randomized Algorithms Lecturer: Shi Li Department of Computer Science and

Approximation and Randomized Algorithms Lecturer: Shi Li Department of Computer Science and

CSE 431/531: Analysis of Algorithms Approximation and Randomized Algorithms Lecturer: Shi Li Department of Computer Science and Engineering University at Buffalo Outline Approximation Algorithms 1 Approximation Algorithms for Traveling

1.96k views • 193 slides
Approximation and Randomized Algorithms Lecturer: Shi Li Department of Computer Science and

Approximation and Randomized Algorithms Lecturer: Shi Li Department of Computer Science and

CSE 431/531: Analysis of Algorithms Approximation and Randomized Algorithms Lecturer: Shi Li Department of Computer Science and Engineering University at Buffalo Outline Approximation Algorithms 1 Approximation Algorithms for Traveling

790 views • 58 slides
Randomized Network Algorithms: An Overview and Recent Results Balaji Prabhakar Departments of EE

Randomized Network Algorithms: An Overview and Recent Results Balaji Prabhakar Departments of EE

Randomized Network Algorithms: An Overview and Recent Results Balaji Prabhakar Departments of EE and CS Stanford University Network algorithms Algorithms implemented in networks, e.g. in switches/routers scheduling algorithms

785 views • 50 slides
8. Average-Case Analysis of Algorithms + Randomized Algorithms 1 insertion sort Array

8. Average-Case Analysis of Algorithms + Randomized Algorithms 1 insertion sort Array

CSE 312, Winter 2011, W.L.Ruzzo 8. Average-Case Analysis of Algorithms + Randomized Algorithms 1 insertion sort Array A[1]..A[n] Sorted for i = 1..n-1 { T = A[i] j j = i-1 compare i Unsorted while j >= 0 && T <

285 views • 17 slides
8. Average-Case Analysis of Algorithms + Randomized Algorithms 1 insertion sort Array A[1]

8. Average-Case Analysis of Algorithms + Randomized Algorithms 1 insertion sort Array A[1]

CSE 312, Autumn 2012, W.L.Ruzzo 8. Average-Case Analysis of Algorithms + Randomized Algorithms 1 insertion sort Array A[1] A[n] Sorted for i = 2 n-1 { T = A[i] j j = i-1 compare i Unsorted while j >= 0 && T

638 views • 17 slides
Randomized Algorithms Course Info yitong.yin@gmail.com

Randomized Algorithms Course Info yitong.yin@gmail.com

Randomized Algorithms Course Info yitong.yin@gmail.com yinyt@nju.edu.cn office hour: 804, Thursday 2-4pm course homepage: http://tcs.nju.edu.cn/wiki Textbooks Rajeev Motwani and Prabhakar

438 views • 32 slides
CSC373 Week 11: Randomized Algorithms 373F19 - Nisarg Shah & Karan Singh 1 Randomized

CSC373 Week 11: Randomized Algorithms 373F19 - Nisarg Shah & Karan Singh 1 Randomized

CSC373 Week 11: Randomized Algorithms 373F19 - Nisarg Shah & Karan Singh 1 Randomized Algorithms Input Deterministic Algorithm Output Input Randomized Algorithm Output Randomness 373F19 - Nisarg Shah & Karan Singh 2 Randomized

1.07k views • 57 slides
ECS231 Least-squares problems (Introduction to Randomized Algorithms) May 21, 2019 1 / 12

ECS231 Least-squares problems (Introduction to Randomized Algorithms) May 21, 2019 1 / 12

ECS231 Least-squares problems (Introduction to Randomized Algorithms) May 21, 2019 1 / 12 Outline 1. linear least squares review 2. Solving LS by sampling 3. Solving LS by randomized preconditioning 4. Gradient-based optimization

259 views • 12 slides
Chapter 11 Randomized Algorithms NEW CS 473: Theory II, Fall 2015 October 1, 2015 1 2 11.1

Chapter 11 Randomized Algorithms NEW CS 473: Theory II, Fall 2015 October 1, 2015 1 2 11.1

Chapter 11 Randomized Algorithms NEW CS 473: Theory II, Fall 2015 October 1, 2015 1 2 11.1 Randomized Algorithms 11.2 Some Probability 11.2.1 Probability - quick review 11.2.1.1 With pictures A (A) : Sample

564 views • 14 slides
Randomized Algorithms Randomized Algorithms The Chernoff bound The Chernoff bound Speaker:

Randomized Algorithms Randomized Algorithms The Chernoff bound The Chernoff bound Speaker:

Randomized Algorithms Randomized Algorithms The Chernoff bound The Chernoff bound Speaker: Chuang- -Chieh Lin Chieh Lin Speaker: Chuang Advisor: Professor Maw- -Shang Chang Shang Chang Advisor: Professor Maw National Chung Cheng

719 views • 37 slides

More recommend