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
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 changed | Where | Measured | Effect |
|---|---|---|---|
| replace Trim operator with OptApprox | deadline approximation algorithm · Logistics N=34, M=4 | estimation error: 0.0068 -> 0.0046 | Improved |
| replace Trim operator with OptApprox | deadline approximation algorithm · Sequential N=10, M=10 | estimation error: 0.06 -> 0.028 | Improved |
| replace Trim operator with OptApprox | deadline approximation algorithm · DRC-Drive N=47, M=4 | estimation error: 0.019 -> 0.008 | Improved |
| use sampling with s=10^6 instead of OptApprox | task tree deadline estimation · all task trees | estimation error: 0.0046 -> 0.0005 | Mixed |
| increase approximation support size m from 2 to 50 | OptApprox · Random variables M=100 | average error: 0.491 -> 0.013 | Improved |
| increase approximation support size m from 50 to 200 | OptApprox · Random variables M=1000 | average error: 0.0193 -> 0.0043 | Improved |
| use OptApprox instead of Trim at m=2 | single random variables · Random variables M=100 | average error: 0.493 -> 0.491 | Improved |
| use OptApprox instead of Trim at m=50 | single random variables · Random variables M=100 | average error: 0.019 -> 0.013 | Improved |
| use OptApprox instead of Trim at m=200 | single random variables · Random variables M=1000 | average error: 0.0049 -> 0.0043 | Improved |
| increase m (Trim relative error vs OptApprox) | Trim · Random variables M=100 | relative error of Trim: 0.4% -> 45.4% | Improved |
| apply approximation after each convolution instead of exact computation | summation of random variables · run-time N up to 19 | run-time | Improved |
Closest papers by meaning
- Efficient Optimal Approximation of Discrete Random Variables for Estimation of Probabilities of Missing Deadlines (AAAI 2019 · similarity 0.89)
- Finding Options that Minimize Planning Time (ICML 2019 · similarity 0.83)
- Discovering Options That Minimize Average Planning Time (AAAI 2025 · similarity 0.81)
- PDBs Go Numeric: Pattern-Database Heuristics for Simple Numeric Planning (AAAI 2025 · similarity 0.81)
- Automatic Selection of Macro-Events for Heuristic-Search Temporal Planning (AAAI 2025 · similarity 0.80)
- A Bayesian Approach to Online Planning (ICML 2024 · similarity 0.80)
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.
