Research map / Learning theory and algorithms / Combinatorial and search optimization
Learning MAX-SAT from Contextual Examples for Combinatorial Optimisation
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| increase number of hard constraints in target model (ablation) | HASSLE · synthetic MAX-SAT | precision | Hurt |
| increase number of training contexts from 2 to 10 (ablation) | HASSLE · synthetic MAX-SAT | precision: +4% | Helped |
| increase number of positive and negative examples (ablation) | HASSLE · synthetic MAX-SAT (n=10) | precision and regret | Helped |
Closest papers by meaning
- Ordered Objectives in Maximum Satisfiability (AAAI 2026 · similarity 0.89)
- CO-Bench: Benchmarking Language Model Agents in Algorithm Search for Combinatorial Optimization (AAAI 2026 · similarity 0.87)
- ConRep4CO: Contrastive Representation Learning of Combinatorial Optimization Instances across Types (ICLR 2026 · similarity 0.87)
- Learning-Augmented Approximation Algorithms for Maximum Cut and Related Problems (NeurIPS 2024 · similarity 0.86)
- Extending Test-Time Augmentation with Metamorphic Relations for Combinatorial Problems (ICML 2024 · similarity 0.86)
- GOAL: A Generalist Combinatorial Optimization Agent Learner (ICLR 2025 · similarity 0.86)
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.