Research map / Learning theory and algorithms / Combinatorial and search optimization
Soft and Cost MDD Propagators
Guillaume Perez, Jean-Charles Régin
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 |
|---|---|---|---|
| use cost-MDD4R instead of ev-mdd | soft MDD constraint · Markov size 20 | time (s): 361,9 -> 86,5 | Improved |
| use cost-MDD4R instead of ev-mdd | soft MDD constraint · Plagiarism size 22 | time (s): 78,0 -> 67,9 | Improved |
| use intersection with MDD sum instead of cost-MDD4R | soft MDD constraint · Plagiarism size 22 | time (s): 67,9 -> 9,3 | Improved |
| use intersection instead of cost-MDD4R | soft MDD constraint · Markov size 22 | time (s): 94,9 -> 111,7 | Hurt |
| use intersection instead of cost-MDD4R | soft MDD constraint · Markov size 18 | time (s): 5,3 -> 5,5 | No clear effect |
| intersect MDD with MDD sum | MDD size · Plagiarism | nodes: 261 -> 783 | Hurt |
| intersect MDD with MDD sum | MDD size · Markov | nodes: 73 -> 147 | Hurt |
| use intersection instead of cost-MDD4R | random instances · 50 tuples | time (s): 35,89 -> 2,55 | Improved |
| use intersection instead of cost-MDD4R | random instances · 50k tuples | time (s): 201,94 -> 150,316 | Improved |
| use intersection instead of cost-MDD4R when MDD hits memory limit | random instances · 100k tuples | time (s): 478,296 -> 1668,508 | Hurt |
| use cost-MDD4R instead of ev-mdd | random instances · 100k tuples | time (s): 755,570 -> 478,296 | Improved |
Closest papers by meaning
- Sharp Gap-Dependent Variance-Aware Regret Bounds for Tabular MDPs (NeurIPS 2025 · similarity 0.81)
- Deep Learning for Computing Convergence Rates of Markov Chains (NeurIPS 2024 · similarity 0.81)
- Generating from Discrete Distributions Using Diffusions: Insights from Random Constraint Satisfaction Problems (NeurIPS 2026 · similarity 0.80)
- Soft Robust MDPs and Risk-Sensitive MDPs: Equivalence, Policy Gradient, and Sample Complexity (ICLR 2024 · similarity 0.80)
- Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs (NeurIPS 2024 · similarity 0.80)
- BayeSQP: Bayesian Optimization through Sequential Quadratic Programming (NeurIPS 2025 · 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.
