families of mass destruction
play

Families of Mass Destruction Shagnik Das 1 aros 1 Tam as M esz 1 - PowerPoint PPT Presentation

Families of Mass Destruction Shagnik Das 1 aros 1 Tam as M esz 1 Freie Universit at Berlin Symposium Diskrete Mathematik, Berlin 15th July 2016 Introducing the problem Some initial bounds An exact solution Concluding remarks


  1. Families of Mass Destruction Shagnik Das 1 aros 1 Tam´ as M´ esz´ 1 Freie Universit¨ at Berlin Symposium Diskrete Mathematik, Berlin 15th July 2016

  2. Introducing the problem Some initial bounds An exact solution Concluding remarks Shattering sets Definition (Shattering) A family F shatters a set A if its members intersect A in every possible way: { F ∩ A : F ∈ F} = 2 A . Given a family F , Sh( F ) denotes the collection of sets it shatters. Definition (Families) A (small) example Ground set: [ n ] = { 1 , 2 , . . . , n } . Let F be the family {{ 1 } , { 1 , 2 } , { 2 , 3 } , { 2 , 4 } , Family F a collection of { 1 , 2 , 5 } , { 1 , 3 , 4 } , { 2 , 4 , 5 } , subsets: F ⊆ 2 [ n ] . { 3 , 4 , 5 } , { 1 , 3 , 4 , 5 }} . k-uniform if all members have � [ n ] � size k : F ⊆ . Then { 1 , 4 , 5 } is shattered. k S. Das FU Berlin

  3. Introducing the problem Some initial bounds An exact solution Concluding remarks Shattering sets Definition (Shattering) A family F shatters a set A if its members intersect A in every possible way: { F ∩ A : F ∈ F} = 2 A . Given a family F , Sh( F ) denotes the collection of sets it shatters. Definition (Families) A (small) example Ground set: [ n ] = { 1 , 2 , . . . , n } . Let F be the family {{ 1 } , { 1 , 2 } , { 2 , 3 } , { 2 , 4 } , Family F a collection of { 1 , 2 , 5 } , { 1 , 3 , 4 } , { 2 , 4 , 5 } , subsets: F ⊆ 2 [ n ] . { 3 , 4 , 5 } , { 1 , 3 , 4 , 5 }} . k-uniform if all members have � [ n ] � size k : F ⊆ . Then { 1 , 4 , 5 } is shattered. k S. Das FU Berlin

  4. Introducing the problem Some initial bounds An exact solution Concluding remarks Shattering sets Definition (Shattering) A family F shatters a set A if its members intersect A in every possible way: { F ∩ A : F ∈ F} = 2 A . Given a family F , Sh( F ) denotes the collection of sets it shatters. Definition (Families) A (small) example Ground set: [ n ] = { 1 , 2 , . . . , n } . Let F be the family {{ 1 } , { 1 , 2 } , { 2 , 3 } , { 2 , 4 } , Family F a collection of { 1 , 2 , 5 } , { 1 , 3 , 4 } , { 2 , 4 , 5 } , subsets: F ⊆ 2 [ n ] . { 3 , 4 , 5 } , { 1 , 3 , 4 , 5 }} . k-uniform if all members have � [ n ] � size k : F ⊆ . Then { 1 , 4 , 5 } is shattered. k S. Das FU Berlin

  5. Introducing the problem Some initial bounds An exact solution Concluding remarks Shattering sets Definition (Shattering) A family F shatters a set A if its members intersect A in every possible way: { F ∩ A : F ∈ F} = 2 A . Given a family F , Sh( F ) denotes the collection of sets it shatters. Definition (Families) A (small) example Ground set: [ n ] = { 1 , 2 , . . . , n } . Let F be the family {{ 1 } , { 1 , 2 } , { 2 , 3 } , { 2 , 4 } , Family F a collection of { 1 , 2 , 5 } , { 1 , 3 , 4 } , { 2 , 4 , 5 } , subsets: F ⊆ 2 [ n ] . { 3 , 4 , 5 } , { 1 , 3 , 4 , 5 }} . k-uniform if all members have � [ n ] � size k : F ⊆ . Then { 1 , 4 , 5 } is shattered. k S. Das FU Berlin

  6. Introducing the problem Some initial bounds An exact solution Concluding remarks Shattering sets Definition (Shattering) A family F shatters a set A if its members intersect A in every possible way: { F ∩ A : F ∈ F} = 2 A . Given a family F , Sh( F ) denotes the collection of sets it shatters. Definition (Families) A (small) example Ground set: [ n ] = { 1 , 2 , . . . , n } . Let F be the family {{ 1 } , { 1 , 2 } , { 2 , 3 } , { 2 , 4 } , Family F a collection of { 1 , 2 , 5 } , { 1 , 3 , 4 } , { 2 , 4 , 5 } , subsets: F ⊆ 2 [ n ] . { 3 , 4 , 5 } , { 1 , 3 , 4 , 5 }} . k-uniform if all members have � [ n ] � size k : F ⊆ . Then { 1 , 2 , 3 } is not shattered. k S. Das FU Berlin

  7. Introducing the problem Some initial bounds An exact solution Concluding remarks Shattering sets Definition (Shattering) A family F shatters a set A if its members intersect A in every possible way: { F ∩ A : F ∈ F} = 2 A . Given a family F , Sh( F ) denotes the collection of sets it shatters. Definition (Families) A (small) example Ground set: [ n ] = { 1 , 2 , . . . , n } . Let F be the family {{ 1 } , { 1 , 2 } , { 2 , 3 } , { 2 , 4 } , Family F a collection of { 1 , 2 , 5 } , { 1 , 3 , 4 } , { 2 , 4 , 5 } , subsets: F ⊆ 2 [ n ] . { 3 , 4 , 5 } , { 1 , 3 , 4 , 5 }} . k-uniform if all members have � [ n ] � size k : F ⊆ . Then { 1 , 2 , 3 } is not shattered. k S. Das FU Berlin

  8. Introducing the problem Some initial bounds An exact solution Concluding remarks VC dimension and the Sauer–Shelah Lemma Definition (VC dimension) The VC dimension of a family F , denoted dim VC ( F ), is the size of the largest set it shatters: dim VC ( F ) = max {| A | : A ∈ Sh( F ) } . Corollary Lemma (Sauer, Shelah (1972)) For any set family F ⊆ 2 [ n ] , If dim VC ( F ) < k, then k − 1 | Sh ( F ) | ≥ |F| , � n � � |F| ≤ . i and the bound is best possible. i =0 Many applications: computational geometry, machine learning, ... S. Das FU Berlin

  9. Introducing the problem Some initial bounds An exact solution Concluding remarks VC dimension and the Sauer–Shelah Lemma Definition (VC dimension) The VC dimension of a family F , denoted dim VC ( F ), is the size of the largest set it shatters: dim VC ( F ) = max {| A | : A ∈ Sh( F ) } . Corollary Lemma (Sauer, Shelah (1972)) For any set family F ⊆ 2 [ n ] , If dim VC ( F ) < k, then k − 1 | Sh ( F ) | ≥ |F| , � n � � |F| ≤ . i and the bound is best possible. i =0 Many applications: computational geometry, machine learning, ... S. Das FU Berlin

  10. Introducing the problem Some initial bounds An exact solution Concluding remarks VC dimension and the Sauer–Shelah Lemma Definition (VC dimension) The VC dimension of a family F , denoted dim VC ( F ), is the size of the largest set it shatters: dim VC ( F ) = max {| A | : A ∈ Sh( F ) } . Corollary Lemma (Sauer, Shelah (1972)) For any set family F ⊆ 2 [ n ] , If dim VC ( F ) < k, then k − 1 | Sh ( F ) | ≥ |F| , � n � � |F| ≤ . i and the bound is best possible. i =0 Many applications: computational geometry, machine learning, ... S. Das FU Berlin

  11. Introducing the problem Some initial bounds An exact solution Concluding remarks VC dimension and the Sauer–Shelah Lemma Definition (VC dimension) The VC dimension of a family F , denoted dim VC ( F ), is the size of the largest set it shatters: dim VC ( F ) = max {| A | : A ∈ Sh( F ) } . Corollary Lemma (Sauer, Shelah (1972)) For any set family F ⊆ 2 [ n ] , If dim VC ( F ) < k, then k − 1 | Sh ( F ) | ≥ |F| , � n � � |F| ≤ . i and the bound is best possible. i =0 Many applications: computational geometry, machine learning, ... S. Das FU Berlin

  12. Introducing the problem Some initial bounds An exact solution Concluding remarks Maximising the number of shattered sets Question Which families of m sets maximise the number of shattered sets? Why maximise? 1. Machines are dangerously smart 2. An old problem with a lot of history 3. Quite a bit of fun S. Das FU Berlin

  13. Introducing the problem Some initial bounds An exact solution Concluding remarks Maximising the number of shattered sets Question Which families of m sets maximise the number of shattered sets? Why maximise? 1. Machines are dangerously smart 2. An old problem with a lot of history 3. Quite a bit of fun S. Das FU Berlin

  14. Introducing the problem Some initial bounds An exact solution Concluding remarks Maximising the number of shattered sets Question Which families of m sets maximise the number of shattered sets? Why maximise? 1. Machines are dangerously smart 2. An old problem with a lot of history 3. Quite a bit of fun S. Das FU Berlin

  15. Introducing the problem Some initial bounds An exact solution Concluding remarks Maximising the number of shattered sets Question Which families of m sets maximise the number of shattered sets? Why maximise? A rose by any other name... 1. Machines are ◮ Universal sets, dangerously smart k -independent sets, covering arrays, k -faulty systems 2. An old problem with ◮ Used for software testing, a lot of history derandomisation 3. Quite a bit of fun S. Das FU Berlin

  16. Introducing the problem Some initial bounds An exact solution Concluding remarks Maximising the number of shattered sets Question Which families of m sets maximise the number of shattered sets? Why maximise? A rose by any other name... 1. Machines are ◮ Universal sets, dangerously smart k -independent sets, covering arrays, k -faulty systems 2. An old problem with ◮ Used for software testing, a lot of history derandomisation 3. Quite a bit of fun S. Das FU Berlin

  17. Introducing the problem Some initial bounds An exact solution Concluding remarks Maximally destructive animals A bull in a china shop S. Das FU Berlin

  18. Introducing the problem Some initial bounds An exact solution Concluding remarks Maximally destructive animals Ein Elefant im Porzellanladen S. Das FU Berlin

  19. Introducing the problem Some initial bounds An exact solution Concluding remarks Maximally destructive animals Ein Elefant im Porzellanladen S. Das FU Berlin

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


More recommend