![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Thursday 16 January 2020, 11:00-12:00
A Near-Optimal Adaptive Algorithm for Estimating Binary Mixtures of Unknown Coins
- 👤 Speaker: Jasper Lee (Brown University)
- 📅 Date & Time: Thursday 16 January 2020, 11:00 - 12:00
- 📍 Venue: Computer Laboratory, Room FW09
Abstract
Given a mixture between two populations of coins: “positive” coins that have (unknown and potentially different) probabilities of heads at least 1/2+Δ and “negative” coins with probabilities at most 1/2-Δ, we consider the task of estimating the fraction ρ of coins of each type to within additive error ε, with a constant probability of success.
In this talk, we will focus on the construction of an algorithm with sample complexity O((ρ/ε²Δ²)(1+ρ log 1/ε)), which matches the fully-adaptive lower bound of Ω(ρ/ε²Δ²) shown in our paper, except for the regime where ρ = ω(1/log 1/ε).
The fine-grained adaptive flavour of both our algorithm and lower bound contrasts with much previous work in distributional testing and learning.
Joint work with Paul Valiant, available on arXiv at https://arxiv.org/abs/1904.09228
Series This talk is part of the Cambridge Algorithms talks series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge Algorithms talks
- Cambridge talks
- Computer Laboratory, Room FW09
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- School of Technology
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.