clusters and features from combinatorial stochastic
play

Clusters and features from combinatorial stochastic processes - PowerPoint PPT Presentation

Clusters and features from combinatorial stochastic processes Tamara Broderick, Michael I. Jordan, Jim Pitman UC Berkeley Clustering/Partition 1 Clustering/Partition clusters, classes, blocks (of a partition) 1


  1. Exchangeable probability functions “Exchangeable feature probability function” (EFPF)? Counterexample n = 1 P (row = ) = p 1 2 P (row = ) = p 2 ... P (row = ) = p 3 N P (row = ) = p 4 P ( ) � = P ( ) p 1 p 2 � = p 3 p 4 [Broderick, Jordan, Pitman 2012] 9

  2. Exchangeable probability functions “Exchangeable feature probability function” (EFPF)? Counterexample n = 1 P (row = ) = p 1 2 P (row = ) = p 2 ... P (row = ) = p 3 N P (row = ) = p 4 P ( ) � = P ( ) p 1 p 2 � = p 3 p 4 [Broderick, Jordan, Pitman 2012] 9

  3. Exchangeable probability functions Exchangeable cluster distributions = Cluster distributions with EPPFs Exchangeable feature distributions IBP Two-feature example Feature distributions with EFPFs [Broderick, Jordan, Pitman 2012] 10

  4. Paintboxes Exchangeable partition: Kingman paintbox [Kingman 1978] 11

  5. Paintboxes Exchangeable partition: Kingman paintbox [Kingman 1978] 11

  6. Paintboxes Exchangeable partition: Kingman paintbox [Kingman 1978] 11

  7. Paintboxes Exchangeable partition: Kingman paintbox 1 1 [Kingman 1978] 11

  8. Paintboxes Exchangeable partition: Kingman paintbox 2 1 1 2 [Kingman 1978] 11

  9. Paintboxes Exchangeable partition: Kingman paintbox 3 2 1 1 2 3 [Kingman 1978] 11

  10. Paintboxes Exchangeable partition: Kingman paintbox 3 2 1 4 1 2 3 4 [Kingman 1978] 11

  11. Paintboxes Exchangeable partition: Kingman paintbox 3 5 2 1 4 1 2 3 4 5 [Kingman 1978] 11

  12. Paintboxes Exchangeable partition: Kingman paintbox 3 5 2 6 1 4 1 2 3 4 5 6 [Kingman 1978] 11

  13. Paintboxes Exchangeable partition: Kingman paintbox 3 5 2 6 7 1 4 1 2 3 4 5 6 7 [Kingman 1978] 11

  14. Paintboxes Exchangeable partition: Kingman paintbox 3 5 2 6 7 1 4 ... Cat cluster Dog cluster 1 2 3 4 5 6 7 [Kingman 1978] 11

  15. Paintboxes Exchangeable partition: Kingman paintbox 3 5 2 6 7 1 4 Cat cluster Dog cluster Mouse cluster Lizard cluster 1 Sheep cluster 2 Horse cluster 3 4 5 6 7 [Kingman 1978] 12

  16. Paintboxes Cat feature Dog feature Mouse feature Lizard feature Sheep feature Horse feature [Broderick, Pitman, Jordan (submitted)] 13

  17. Paintboxes Exchangeable feature allocation: feature paintbox Cat feature Dog feature Mouse feature Lizard feature Sheep feature Horse feature [Broderick, Pitman, Jordan (submitted)] 13

  18. Paintboxes Exchangeable feature allocation: feature paintbox 1 Cat feature Dog feature Mouse feature Lizard feature 1 Sheep feature Horse feature [Broderick, Pitman, Jordan (submitted)] 13

  19. Paintboxes Exchangeable feature allocation: feature paintbox 2 1 Cat feature Dog feature Mouse feature Lizard feature 1 Sheep feature 2 Horse feature [Broderick, Pitman, Jordan (submitted)] 13

  20. Paintboxes Exchangeable feature allocation: feature paintbox 3 2 1 Cat feature Dog feature Mouse feature Lizard feature 1 Sheep feature 2 Horse feature 3 [Broderick, Pitman, Jordan (submitted)] 13

  21. Paintboxes Exchangeable feature allocation: feature paintbox 3 2 1 4 Cat feature Dog feature Mouse feature Lizard feature 1 Sheep feature 2 Horse feature 3 4 [Broderick, Pitman, Jordan (submitted)] 13

  22. Paintboxes Exchangeable feature allocation: feature paintbox 3 5 2 1 4 Cat feature Dog feature Mouse feature Lizard feature 1 Sheep feature 2 Horse feature 3 4 5 [Broderick, Pitman, Jordan (submitted)] 13

  23. Paintboxes Exchangeable feature allocation: feature paintbox 3 5 2 6 1 4 Cat feature Dog feature Mouse feature Lizard feature 1 Sheep feature 2 Horse feature 3 4 5 6 [Broderick, Pitman, Jordan (submitted)] 13

  24. Paintboxes Exchangeable feature allocation: feature paintbox 3 5 2 6 7 1 4 Cat feature Dog feature Mouse feature Lizard feature 1 Sheep feature 2 Horse feature 3 4 5 6 7 [Broderick, Pitman, Jordan (submitted)] 13

  25. Paintboxes Exchangeable cluster distributions = Cluster distributions with EPPFs Exchangeable feature distributions IBP Two-feature example Feature distributions with EFPFs [Broderick, Jordan, Pitman 2012] 14

  26. Paintboxes Exchangeable cluster distributions Exchangeable feature distributions = Cluster distributions with EPPFs = Feature paintbox allocations = Kingman paintbox partitions IBP Two-feature example Feature distributions with EFPFs [Broderick, Pitman, Jordan (submitted)] 14

  27. Paintboxes Two feature example Feature 1 Feature 2 p 1 p 2 p 3 p 4 P (row = ) = p 1 P (row = ) = p 2 P (row = ) = p 3 P (row = ) = p 4 15

  28. Paintboxes Indian buffet process: beta feature frequencies [Thibaux, Jordan 2007] 16

  29. Paintboxes Indian buffet process: beta feature frequencies For m = 1, 2, ... � � θ 1. Draw K + γ m = Poisson θ + m − 1 m Set � K + K m = m j =1 2. For k = K m − 1 , . . . , K m Draw an atom mass of size q k ∼ Beta(1 , θ + m − 1) [Thibaux, Jordan 2007] 16

  30. Paintboxes Indian buffet process: beta feature frequencies For m = 1, 2, ... � � θ 1. Draw K + γ m = Poisson θ + m − 1 m Set � K + K m = m j =1 2. For k = K m − 1 , . . . , K m Draw a frequency of size q k ∼ Beta(1 , θ + m − 1) [Thibaux, Jordan 2007] 16

  31. Paintboxes Indian buffet process: beta feature frequencies 1 For m = 1, 2, ... � � θ 1. Draw K + γ m = Poisson θ + m − 1 m Set � K + K m = m j =1 2. For k = K m − 1 , . . . , K m Draw a frequency of size q k ∼ Beta(1 , θ + m − 1) 0 [Thibaux, Jordan 2007] 16

  32. Paintboxes Indian buffet process: beta feature frequencies 1 For m = 1, 2, ... � � θ 1. Draw K + γ m = Poisson q 1 θ + m − 1 m Set � K + K m = m j =1 2. For k = K m − 1 , . . . , K m Draw a frequency of size q 2 q k ∼ Beta(1 , θ + m − 1) 0 [Thibaux, Jordan 2007] 16

  33. Paintboxes Indian buffet process: beta feature frequencies 1 For m = 1, 2, ... � � θ 1. Draw K + γ m = Poisson q 1 θ + m − 1 m Set � K + K m = m j =1 2. For k = K m − 1 , . . . , K m Draw a frequency of size q 2 q 3 q k ∼ Beta(1 , θ + m − 1) 0 [Thibaux, Jordan 2007] 16

  34. Paintboxes Indian buffet process: beta feature frequencies 1 For m = 1, 2, ... � � θ 1. Draw K + γ m = Poisson q 1 θ + m − 1 m Set � K + K m = m j =1 2. For k = K m − 1 , . . . , K m Draw a frequency of size q 2 q 3 q k ∼ Beta(1 , θ + m − 1) q 6 q 4 q 5 0 [Thibaux, Jordan 2007] 16

  35. Paintboxes Indian buffet process: beta feature frequencies 1 For m = 1, 2, ... � � θ 1. Draw K + γ m = Poisson q 1 θ + m − 1 m Set � K + K m = m j =1 2. For k = K m − 1 , . . . , K m Draw a frequency of size q 2 q 3 q k ∼ Beta(1 , θ + m − 1) q 6 ... q 4 q 5 0 [Thibaux, Jordan 2007] 16

  36. Paintboxes Indian buffet process: beta feature frequencies 1 For m = 1, 2, ... � � θ 1. Draw K + γ m = Poisson q 1 θ + m − 1 m Set � K + K m = m j =1 2. For k = K m − 1 , . . . , K m Draw a frequency of size q 2 q 3 q k ∼ Beta(1 , θ + m − 1) q 6 ... q 4 q 5 0 [Thibaux, Jordan 2007] 16

  37. Paintboxes Indian buffet process: beta feature frequencies 1 For m = 1, 2, ... � � θ 1. Draw K + γ m = Poisson q 1 θ + m − 1 m Set � K + K m = m j =1 2. For k = K m − 1 , . . . , K m Draw a frequency of size q 2 q 3 q k ∼ Beta(1 , θ + m − 1) q 6 ... q 4 q 5 0 [Thibaux, Jordan 2007] 16

  38. Paintboxes Indian buffet process: beta feature frequencies 1 For m = 1, 2, ... � � θ 1. Draw K + γ m = Poisson q 1 θ + m − 1 m Set � K + K m = m j =1 2. For k = K m − 1 , . . . , K m Draw a frequency of size q 2 q 3 q k ∼ Beta(1 , θ + m − 1) q 6 ... q 4 q 5 0 [Thibaux, Jordan 2007] 16

  39. Paintboxes Indian buffet process: beta feature frequencies 1 For m = 1, 2, ... � � θ 1. Draw K + γ m = Poisson q 1 θ + m − 1 m Set � K + K m = m j =1 2. For k = K m − 1 , . . . , K m Draw a frequency of size q 2 q 3 q k ∼ Beta(1 , θ + m − 1) q 6 ... q 4 q 5 0 [Thibaux, Jordan 2007] 16

  40. Paintboxes Indian buffet process: beta feature frequencies 1 0 q 1 q 2 q 3 q 4 q 5 q 6 ... 17

  41. Paintboxes Indian buffet process: beta feature frequencies 18

  42. Paintboxes Indian buffet process: beta feature frequencies 18

  43. Paintboxes Indian buffet process: beta feature frequencies 18

  44. Paintboxes Indian buffet process: beta feature frequencies 18

  45. Paintboxes Indian buffet process: beta feature frequencies ... 18

  46. Paintboxes 1 q 1 q 2 q 3 q 6 ... q 4 q 5 0 19

  47. Paintboxes 1 q 1 “Frequency models” q 2 q 3 q 6 ... q 4 q 5 0 19 [Broderick, Pitman, Jordan (submitted)]

  48. Paintboxes Two feature example Feature 1 Feature 2 p 1 p 2 p 3 p 4 P (row = ) = p 1 P (row = ) = p 2 P (row = ) = p 3 P (row = ) = p 4 20

  49. Paintboxes Two feature example Not a frequency model Feature 1 Feature 2 p 1 p 2 p 3 p 4 P (row = ) = p 1 P (row = ) = p 2 P (row = ) = p 3 P (row = ) = p 4 20

  50. Paintboxes Exchangeable cluster distributions Exchangeable feature distributions = Cluster distributions with EPPFs = Feature paintbox allocations = Kingman paintbox partitions IBP Two-feature example Feature distributions with EFPFs [Broderick, Pitman, Jordan (submitted)] 21

  51. Paintboxes Exchangeable cluster distributions Exchangeable feature distributions = Cluster distributions with EPPFs = Feature paintbox allocations = Kingman paintbox partitions IBP Two-feature example Frequency models [Broderick, Pitman, Jordan (submitted)] 21

  52. Frequency models: EFPFs? 1 q 1 q 2 q 3 q 6 ... q 4 q 5 0 22

  53. Frequency models: EFPFs? 1 q 1 q 2 q 3 q 6 ... q 4 q 5 0 22

  54. Frequency models: EFPFs? 1 q 1 q 2 q 3 q 6 ... q 4 q 5 0 22

  55. Frequency models: EFPFs? ... k = 1 2 K 1 n = 1 2 ... q 1 N q 2 q 3 q 6 ... q 4 q 5 0 22

  56. Frequency models: EFPFs? ... k = 1 2 K 1 n = 1 2 ) P ( ... q 1 N q 2 q 3 q 6 ... q 4 q 5 0 22

  57. Frequency models: EFPFs? ... k = 1 2 K 1 n = 1 2 ) P ( ... q 1 N q 2 q 3 q 6 ... q 4 q 5 0 22

  58. Frequency models: EFPFs? ... k = 1 2 K 1 n = 1 2 ) P ( ... q 1 N q S N, 1 (1 − q 1 ) N − S N, 1 q 2 q 3 1 q 6 ... q 4 q 5 0 22

  59. Frequency models: EFPFs? ... k = 1 2 K 1 n = 1 2 ) P ( ... q 1 N q S N,k (1 − q k ) N − S N,k q 2 q 3 k q 6 ... q 4 q 5 0 22

  60. Frequency models: EFPFs? ... k = 1 2 K 1 n = 1 2 ) P ( ... q 1 N q S N,k (1 − q i k ) N − S N,k q 2 q 3 i k q 6 ... q 4 q 5 0 23

  61. Frequency models: EFPFs? ... k = 1 2 K 1 n = 1 2 ) P ( ... q 1 N K q S N,k � (1 − q i k ) N − S N,k q 2 q 3 i k k =1 q 6 ... q 4 q 5 0 23

  62. Frequency models: EFPFs? ... k = 1 2 K 1 n = 1 2 ) P ( ... q 1 N K q S N,k � (1 − q i k ) N − S N,k q 2 q 3 i k k =1 � (1 − q j ) N q 6 · ... q 4 ∈ { i k } K j / q 5 k =1 0 23

  63. Frequency models: EFPFs? ... k = 1 2 K 1 n = 1 2 ) P ( ... q 1 N K 1 q S N,k � � (1 − q i k ) N − S N,k = E [ q 2 q 3 i k K ! distinct i k k =1 � (1 − q j ) N ] q 6 · ... q 4 ∈ { i k } K j / q 5 k =1 0 23

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