AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Optimal Approximation of Random Variables for Estimating the Probability of Meeting a Plan Deadline

Liat Cohen, Tal Grinshpoun, Gera Weiss

AAAI 2018 · Learning theory and algorithms › Combinatorial and search optimization · approach: Decision-focused optimization · 4 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
replace Trim operator with OptApproxdeadline approximation algorithm · Logistics N=34, M=4estimation error: 0.0068 -> 0.0046Improved
replace Trim operator with OptApproxdeadline approximation algorithm · Sequential N=10, M=10estimation error: 0.06 -> 0.028Improved
replace Trim operator with OptApproxdeadline approximation algorithm · DRC-Drive N=47, M=4estimation error: 0.019 -> 0.008Improved
use sampling with s=10^6 instead of OptApproxtask tree deadline estimation · all task treesestimation error: 0.0046 -> 0.0005Mixed
increase approximation support size m from 2 to 50OptApprox · Random variables M=100average error: 0.491 -> 0.013Improved
increase approximation support size m from 50 to 200OptApprox · Random variables M=1000average error: 0.0193 -> 0.0043Improved
use OptApprox instead of Trim at m=2single random variables · Random variables M=100average error: 0.493 -> 0.491Improved
use OptApprox instead of Trim at m=50single random variables · Random variables M=100average error: 0.019 -> 0.013Improved
use OptApprox instead of Trim at m=200single random variables · Random variables M=1000average error: 0.0049 -> 0.0043Improved
increase m (Trim relative error vs OptApprox)Trim · Random variables M=100relative error of Trim: 0.4% -> 45.4%Improved
apply approximation after each convolution instead of exact computationsummation of random variables · run-time N up to 19run-timeImproved

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