Research map / Graph learning / Graph algorithms and clustering
Shortest Path Based Decision Making Using Probabilistic Inference
Akshat Kumar
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 |
|---|---|---|---|
| apply entropy-based penalty (rho=0.005) from iteration 1000 | EM for RNDP · RNDP budget 0.04 Bmax | network entropy: 27.4 -> 0.42 | Improved |
| use EM instead of Cplex MIP solver on large grids | RNDP solver · RNDP 15x15 and 20x20 grids | solution cost: as high as 70% | Improved |
| use EM instead of Cplex MIP solver on small grids | RNDP solver · RNDP 5x5 to 10x10 grids | solution cost: < 10% | Hurt |
Closest papers by meaning
- Adaptive Probing Policies for Shortest Path Routing (NeurIPS 2020 · similarity 0.87)
- Bayesian Algorithm Execution: Estimating Computable Properties of Black-box Functions Using Mutual Information (ICML 2021 · similarity 0.86)
- Beyond Trees: Analysis and Convergence of Belief Propagation in Graphs with Multiple Cycles (AAAI 2020 · similarity 0.85)
- Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search (ICML 2024 · similarity 0.85)
- Bayesian Optimization of Functions over Node Subsets in Graphs (NeurIPS 2024 · similarity 0.85)
- Paths, Proofs, and Perfection: Developing a Human-Interpretable Proof System for Constrained Shortest Paths (AAAI 2024 · similarity 0.83)
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.
