Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Monotone probability distributions over the Boolean cube can be learned with sublinear samples

Monotone probability distributions over the Boolean cube can be learned with sublinear samples

Thumbnail Image
Download
Name

LIPIcs-ITCS-2020-28.pdf

Description
Published version
Size

668.34 KB

Format

Adobe PDF

Checksum (MD5)

0c5a78151cde76e95330108009a9944e

sword-2021-03-22T16:54:36.original.xml (130 B)
Original SWORD entry document
Author(s)
Rubinfeld, Ronitt
•
Vasilyan, Arsen
Date Issued
2020
Journal
Leibniz International Proceedings in Informatics, LIPIcs
Citation
Rubinfeld, Ronitt and Vasilyan, Arsen. 2020. "Monotone probability distributions over the Boolean cube can be learned with sublinear samples." Leibniz International Proceedings in Informatics, LIPIcs, 151.
Version
Final published version
Abstract
© Ronitt Rubinfeld and Arsen Vasilyan. A probability distribution over the Boolean cube is monotone if flipping the value of a coordinate from zero to one can only increase the probability of an element. Given samples of an unknown monotone distribution over the Boolean cube, we give (to our knowledge) the first algorithm that learns an approximation of the distribution in statistical distance using a number of samples that is sublinear in the domain. To do this, we develop a structural lemma describing monotone probability distributions. The structural lemma has further implications to the sample complexity of basic testing tasks for analyzing monotone probability distributions over the Boolean cube: We use it to give nontrivial upper bounds on the tasks of estimating the distance of a monotone distribution to uniform and of estimating the support size of a monotone distribution. In the setting of monotone probability distributions over the Boolean cube, our algorithms are the first to have sample complexity lower than known lower bounds for the same testing tasks on arbitrary (not necessarily monotone) probability distributions. One further consequence of our learning algorithm is an improved sample complexity for the task of testing whether a distribution on the Boolean cube is monotone.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution 3.0 unported license
https://creativecommons.org/licenses/by/3.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/137442
DOI of Published Version
https://doi.org/10.4230/LIPIcs.ITCS.2020.28
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.