AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Efficient Optimal Approximation of Discrete Random Variables for Estimation of Probabilities of Missing Deadlines

Liat Cohen, Gera Weiss

AAAI 2019 · Learning theory and algorithms › Sample complexity · approach: Distributed estimation under communication limits · 2 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use linApprox instead of OptTrimrepeated support-size reduction · Task trees (Logistics, DRC-Drive, Sequential)estimated error: 0.0046 -> 0.0024Improved
use linApprox instead of Trimrepeated support-size reduction · Task trees (Logistics, DRC-Drive, Sequential)estimated error: 0.0068 -> 0.0024Improved
use linApprox instead of sampling with s=10^4repeated reduction · Logistics, DRC-Drive, Sequential, M=4estimated error: 0.0063 -> 0.0093Mixed
use linApprox instead of sampling with s=10^6repeated reduction · Task treesestimated error: 0.0016 -> 0.008Hurt
use linApprox instead of OptTrim and Trimsingle-step reduction · random variables n=100, varying mKolmogorov errorImproved
increase support size mlinApprox, OptTrim, Trim · random variables n=100Kolmogorov errorImproved
use linApprox instead of LP optimal algorithmoptimal Kolmogorov approximation · n=10, m=5run-time: 850 seconds -> less than a secondImproved
use linApprox instead of LP optimal algorithmoptimal Kolmogorov approximation · n=100, m=5run-time: more than a day -> 0.14 secondsImproved
trim after each convolution with linApprox instead of exact computationsummation of random variables · 6 to 19 variables, m=10run-timeImproved
use linApprox (O(n log n)) instead of binsApprox (O(n^2 log n))optimal m-approximation · summation, 6 to 19 variablesrun-timeImproved
use linApprox instead of faster Trimsummation of random variables · 6 to 19 variablesrun-timeHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy