~/talk

On Learning Graph Binomial Distributions and Powers of Poisson Binomial Distributions

Talkat Real-Time Decision Making 2018 · 2018-04-30..05-04· [machine-learning]
links:none on file
slides:none on file

Presents concrete results: learn a Poisson binomial distribution up to total variation ε with sample complexity ~O((log(1/δ))/ε^2) by estimate mean and variance in the high-variance (Gaussian) case and by finding an effective support interval and histogram in the low-variance case; proves that exact parameter recovery needs exp(1/ε) samples so approximating the distribution is strictly easier. Extends to learning all powered distributions by choosing a power L where P^L flattens, shows Newton identities plus noise cause exponential error amplification, and shows the graph-induced-edge-count distribution can be multimodal and is often hard to characterize.

AI-written summary · about

  1. 0:00Intro
  2. 3:42Distribution Learning (Small) Sample of Previous Work
  3. 7:10Warm-up: Learning a Binomial Distribution Binn,p
  4. 8:27Poisson Binomial Distributions (PBDs)
  5. 13:16Learning Poisson Binomial Distributions
  6. 20:27Powers of Poisson Binomial Distribution
  7. 24:39Learning the powers of Binp
  8. 26:48Sampling from the Right Power
  9. 29:05Lower Bound on PBD Power Learning
  10. 30:12Parameter Learning through Newton Identities
  11. 34:04Graph Binomial Distributions
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.