Research map / Learning theory and algorithms / Combinatorial and search optimization
Anytime Anyspace AND/OR Best-First Search for Bounding Marginal MAP
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Anytime Best+Depth-First Search for Bounding Marginal MAP (AAAI 2017 · similarity 0.94)
- Anytime Recursive Best-First Search for Bounding Marginal MAP (AAAI 2019 · similarity 0.94)
- From Exact to Anytime Solutions for Marginal MAP (AAAI 2016 · similarity 0.92)
- Anytime Anyspace AND/OR Search for Bounding the Partition Function (AAAI 2017 · similarity 0.91)
- Minimizing UCB: a Better Local Search Strategy in Local Bayesian Optimization (NeurIPS 2024 · similarity 0.85)
- A Unified Framework for Entropy Search and Expected Improvement in Bayesian Optimization (ICML 2025 · similarity 0.85)
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.