Heuristics

Follow this field Ask about this field

Recent momentum

emerging

0 papers in the last 28 days · 0.0% of indexed attention

Twelve weeks of publication activity for this topic as it is defined today.

Weekly history

Recent digests

What was published in this field, kept on the site without email delivery.

Period ending 2026-09-21

7 new papers

A weekly snapshot of new work published in Heuristics.

Period ending 2026-09-14

5 new papers

A weekly snapshot of new work published in Heuristics.

Period ending 2026-09-07

9 new papers

A weekly snapshot of new work published in Heuristics.

Inside this field

Focused directions

Focused topic

Search Algorithms

Within Heuristics

88 papersExplore

Focused topic

Heuristics

Within Heuristics

82 papersExplore

Focused topic

Monte Carlo Tree Search

Within Heuristics

54 papersExplore

Focused topic

Tree Search

Within Heuristics

46 papersExplore

Focused topic

Heuristic Search

Within Heuristics

17 papersExplore

273 papers

Latest in Heuristics

Browse all topics →

Planner-Admissible Graph-PDE Value Extensions for Sparse Goal-Conditioned Planning
May 18, 2026Shiheng ZhangClassical Planning Planning Methods
A Heuristic Approach for Performance Tuning in RL-based Quadrotor Control via Reward Design and Termination Conditions
May 18, 2026Fausto Mauricio Lagos Suarez, Akshit Saradagi, Vidya Sumathy +1Quadrotor Control Iterative Reinforcement Learning
Surface-Form Neural Sparse Retrieval: Robust Fuzzy Matching for Industrial Music Search
May 18, 2026Paul Greyson, Zhichao Geng, Wei Zhang +1Retrieval Layer Conversational Music Recommendation
Memory-Guided Tree Search with Cross-Branch Knowledge Transfer for LLM Solver Synthesis
May 17, 2026Fatemeh Haji, Javier Delarosa Quiros, Peyman NajafiradFuture Llm-Assisted Solver Development Tree Search
FML-bench: A Controlled Study of AI Research Agent Strategies from the Perspective of Search Dynamics
May 17, 2026Qiran Zou, Hou Hei Lam, Wenhao Zhao +11Agentic Benchmarks Autoresearch
Latent Heuristic Search: Continuous Optimization for Automated Algorithm Design
May 16, 2026Cheikh Ahmed, Mahdi Mostajabdaveh, Zirui ZhouEvolutionary Search Llm-Based Optimization Modeling
Learning How to Cube
May 15, 2026Ferhat Erata, Sam Kouteili, Thanos Typaldos +4Satisfiability Neuro-Symbolic Framework
Toward Template-Free Explainability for Monte Carlo Tree Search
May 15, 2026Siqi Lu, Mirsaleh Bahavarnia, Hiba Baroud +3Monte Carlo Tree Search Explainability
Prospective multi-pathogen disease forecasting using autonomous LLM-guided tree search
May 15, 2026Sarah Martinson, Michael P. Brenner, Martyna Plomecka +3Epidemic Forecasting Clinical Prediction
Optimized Three-Dimensional Photovoltaic Structures with LLM guided Tree Search
May 15, 2026Michael P. Brenner, Lizzie Dorfman, John C. PlattPhotovoltaic Tree Search
Property-Guided LLM Program Synthesis for Planning
May 15, 2026André G. Pereira, Augusto B. Corrêa, Jendrik SeippMock-Interface Synthesis Large Language Model Planning
XSearch: Explainable Code Search via Concept-to-Code Alignment
May 15, 2026Yiming Liu, Ruofan Liu, Yun Lin +7Code Quality Search Algorithms
Petri Net Induced Heuristic Search for Resource Constrained Scheduling
May 15, 2026Ido Lublin, Dor Atzmon, Izack CohenOptimal Scheduling Heuristics
The Impact of AI Search on the Online Content Ecosystem: Evidence from Google and Reddit
May 14, 2026Peibo Zhang, Ruomeng Cui, Dennis J. ZhangReddit Content Moderation
An Amortized Efficiency Threshold for Comparing Neural and Heuristic Solvers in Combinatorial Optimization
May 14, 2026Sohaib AfifiNeural Solvers Combinatorial Optimization
Learning Scenario Reduction for Two-Stage Robust Optimization with Discrete Uncertainty
May 14, 2026Tianjue Lin, Jianan Zhou, Jieyi Bi +4Robust Optimization Heuristics
Heuristic Pathologies and Further Variance Reduction via Uncertainty Propagation in the AIVAT Family of Techniques
May 14, 2026Juho Kim, Tuomas SandholmVariance Reduction Value Functions
WASHH: An Anchor-Aware Whale-Guided Selection Hyper-Heuristic for Continuous Optimization and SVC Configuration
May 13, 2026Yifu Zhao, Xiaofan Zou, Junhao Wei +9Black-Box Optimization Hyperparameter Optimization
Time and Supply Fairness in Electricity Distribution using $k$ -times bin packing
May 12, 2026Dinesh Kumar Baghel, Alex Ravsky, Erel Segal-HaleviKnapsack Constraint Heuristics
From Heuristics to Analytics: Forecasting Effort and Progress in Online Learning
May 12, 2026Eric S. Qiu, Danielle R. Thomas, Boyuan Guo +2Tutors Analytics
$\varepsilon$ -Good Action Identification in Fixed-Budget Monte Carlo Tree Search
May 11, 2026Yinan Li, Tuan Nguyen, Kwang-Sung JunMinimax Monte Carlo Tree Search
Benchmarking LLM-Based Static Analysis for Secure Smart Contract Development: Reliability, Limitations, and Potential Hybrid Solutions
May 11, 2026Stefan-Claudiu Susan, Andrei Arusoaie, Dorel LucanuSmart Contracts Program Analysis
Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling
May 11, 2026Junhao Wei, Yanxiao Li, Yifu Zhao +8Heuristics Autoregressive Rollout
Teacher-Aware Evolution of Heuristic Programs from Learned Optimization Policies
May 11, 2026Minyu Chen, Song Qin, Ling-I Wu +2Heuristics Evolutionary Search
Budget-Efficient Automatic Algorithm Design via Code Graph
May 11, 2026Maxime Bouscary, Manxi Wu, Saurabh AminSearch Algorithms Llm-Based Optimization Modeling
Many Needles in a Haystack: Active Hit Discovery for Perturbation Experiments
May 11, 2026Andrea Rubbi, Arpit Merchant, Samuel Ogden +4Bayesian Experimental Design Bayesian Optimization
LLM-Guided Monte Carlo Tree Search over Knowledge Graphs: Composing Mechanistic Explanations for Drug-Disease Pairs
May 10, 2026Rishabh Jakhar, Michel Dumontier, Remzi CelebiKnowledge Graphs Drug-Drug Interactions
LEAF-SQL: Level-wise Exploration with Adaptive Fine-graining for Text-to-SQL Skeleton Prediction
May 10, 2026Zhao Tan, Xiping Liu, Qing Shu +3Text-To-Sql Sql
Sufficient conditions for a Heuristic Rating Estimation Method application
May 9, 2026Jacek Szybowski, Konrad Kułakowski, Jiri MazurekHeuristics Mean Opinion Scores
PMCTS: Principled Parallelized Inference Time Scaling with Particle Monte Carlo Tree Search
May 9, 2026Yaniv Oren, Viliam Vadocz, Joery A. de Vries +3Monte Carlo Tree Search Monte Carlo
OPT-BENCH: Evaluating the Iterative Self-Optimization of LLM Agents in Large-Scale Search Spaces
May 9, 2026Xiaozhe Li, Jixuan Chen, Xinyu Fang +4Large Language Model Agents Recursive Self-Improvement
Hierarchical Task Network Planning with LLM-Generated Heuristics
May 8, 2026Felipe Meneguzzi, Alexandre Buchweitz, Augusto B. Corrêa +2Large Language Model Planning Heuristics
Finite-Time Analysis of MCTS in Continuous POMDP Planning
May 8, 2026Da Kong, Vadim IndelmanPartially Observable Markov Decision Process Monte Carlo Tree Search
Parallel Lifted Planning via Semi-Naive Datalog Evaluation
May 8, 2026Dominik Drexler, Oliver Joergensen, Jendrik SeippClassical Planning Planning Methods
An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation
May 8, 2026Haoyu Han, Li Ma, Hanbing Wang +9Sequential Recommendation Heuristics
XiYOLO: Energy-Aware Object Detection via Iterative Architecture Search and Scaling
May 7, 2026Tony Tran, Richie R. Suganda, Bin HuYolo26 Heterogeneous Edge Devices
LLMs are not (consistently) Bayesian: Quantifying internal (in)consistencies of LLMs' probabilistic beliefs
May 7, 2026Chacha Chen, Matthew Jörke, Adam Goliński +4Bayesian Doubt
Extracting Search Trees from LLM Reasoning Traces Reveals Myopic Planning
May 7, 2026Sixing Chen, Ji-An Li, Saner Cakir +3Large Language Model Planning Large Language Model Reasoning
CoupleEvo: Evolving Heuristics for Coupled Optimization Problems Using Large Language Models
May 7, 2026Thomas Bömer, Bastian Amberg, Max Disselnmeyer +1Evolutionary Search Multi-Objective Optimization
OBLIQ-Bench: Exposing Overlooked Bottlenecks in Modern Retrievers with Latent and Implicit Queries
May 7, 2026Diane Tchuindjo, Devavrat Shah, Omar KhattabRetrievers Search Algorithms
Back to the Beginning of Heuristic Design: Bridging Code and Knowledge with LLMs
May 7, 2026Nguyen Viet Tuan Kiet, Bui Dinh Pham, Dao Van Tung +2Heuristics Bottom-Up Framework
Guidelines for Designing AI Technologies to Support Adult Learning
May 6, 2026Jennifer M. Reddig, Glen R. Smith, Sanaz Ahmadzadeh Siyahrood +16Education Classrooms
Maximizing Rollout Informativeness under a Fixed Budget: A Submodular View of Tree Search for Tool-Use Agentic Reinforcement Learning
May 6, 2026Yuelin Hu, Zhenbo Yu, Zhengxue Cheng +2Rollout Agentic Reinforcement-Learning Framework
Automated Large-scale CVRP Solver Design via LLM-assisted Flexible MCTS
May 5, 2026Tong Guo, Caishun Chen, Yew Soon OngVehicle Routing Problem Monte Carlo Tree Search
SCPRM: A Schema-aware Cumulative Process Reward Model for Knowledge Graph Question Answering
May 4, 2026Jiujiu Chen, Yazheng Liu, Sihong Xie +1Reliable Medical Process-Level Reward Model Evaluation Framework Knowledge Graphs
Position: LLM Serving Needs Mathematical Optimization and Algorithmic Foundations, Not Just Heuristics
May 2, 2026Zijie ZhouLLM Inference Efficiency Heuristics
New Bounds for Zarankiewicz Numbers via Reinforced LLM Evolutionary Search
May 1, 2026Jay Bhan, Nicole Nobili, Patrick LangerGraph Theory Evolutionary Search
NonZero: Interaction-Guided Exploration for Multi-Agent Monte Carlo Tree Search
May 1, 2026Sizhe Tang, Zuyuan Zhang, Mahdi Imani +1Monte Carlo Tree Search Autonomous Exploration Strategies
Beyond Heuristics: Learnable Density Control for 3D Gaussian Splatting
May 1, 2026Zhenhua Ning, Xin Li, Jun Yu +33D Gaussian Splats Heuristics
Feasible-First Exploration for Constrained ML Deployment Optimization in Crash-Prone Hierarchical Search Spaces
Apr 27, 2026Christian LysenstøenHyperparameter Optimization Efficient Exploration
Fix Initial Programs and Iteratively Refine Repair Instructions Toward Non-Elimination Multi-Turn Program Correction
Apr 27, 2026Yuto Tanaka, Issei SatoIterative Refinement Efficient Inference
CombiMOTS: Combinatorial Multi-Objective Tree Search for Dual-Target Molecule Generation
Apr 25, 2026Thibaud Southiratn, Bonil Koo, Yijingxiu Lu +1Molecular Generation Drug Discovery
ML-Guided Primal Heuristics for Mixed Binary Quadratic Programs
Apr 24, 2026Weimin Huang, Natalie M. Isenberg, Ján Drgoňa +2Mixed-Integer Programming Combinatorial Optimization
Fast Neural-Network Approximation of Active Target Search Under Uncertainty
Apr 24, 2026Bilal Yousuf, Zsofia Lendek, Lucian BusoniuParticle Filters Neural-Network Approximation
Robustness Analysis of POMDP Policies to Observation Perturbations
Apr 23, 2026Benjamin Kraske, Qi Heng Ho, Federico Rossi +2Partially Observable Markov Decision Process Non-Stationarity
Graph Neural Network-Informed Predictive Flows for Faster Ford-Fulkerson and PAC-Learnability
Apr 23, 2026Eleanor Wiesler, Trace BaxleyGraph Neural Network Inference Importance
Efficient Test-Time Inference via Deterministic Exploration of Truncated Decoding Trees
Apr 22, 2026Xueyan Li, Johannes Zenn, Ekaterina Fadeeva +3Efficient Inference Reasoning Traces
Semantic Recall for Vector Search
Apr 22, 2026Leonardo Kuffo, Ioanna Tsakalidou, Roberta De Viti +3Approximate Nearest-Neighbor Search Retrieval Recall
Onyx: Cost-Efficient Disk-Oblivious ANN Search
Apr 22, 2026Deevashwer Rathee, Jean-Luc Watson, Zirui Neil Zhao +2Approximate Nearest-Neighbor Search Search Algorithms
Does Self-Consistency Improve the Recall of Encyclopedic Knowledge?
Apr 21, 2026Sho Hoshino, Ukyo Honda, Peinan ZhangSelf-Consistency Factual Recall

May 18, 2026 · cs.LGJ/K move · Enter open · S save

Planner-Admissible Graph-PDE Value Extensions for Sparse Goal-Conditioned Planning

Shiheng Zhang

Department of Applied Mathematics, University of Washington

Sparse goal-conditioned planning with few cost-to-go labels can be viewed as a graph-PDE Dirichlet extension problem: extend sparse labels on a goal-dependent boundary to unlabelled graph vertices so that greedy rollouts reach the goal. We study which graph value extensions are planner-admissible under the operational argmin-Q planner. Our main result is a local action-gap certificate: if the surrogate value error along the rollout stays below half the true action gap, then the greedy rollout reaches the goal. Absolutely Minimal Lipschitz Extension (AMLE), the p=infinity endpoint of the graph p-Laplacian family, instantiates this certificate through a comparison-principle fill-distance bound. Harmonic extension, by contrast, can mis-rank local actions because its values reflect boundary hitting probabilities rather than shortest-path greedy order. On 120 AntMaze layout-derived graph configurations, harmonic extension achieves 0.584 aggregate rollout success, while AMLE reaches 0.970. Finite high-p methods also enter a high-success regime, with success 0.903 for p=4, 0.973 for p=8, and 0.982 for a fixed-budget p=16 solver, though the p=16 row is not used as a converged endpoint ranking due to incomplete solver certification. Mechanism audits show that many rollout decisions occur in AMLE-compatible but harmonic-incompatible local geometry, and that AMLE corrects most harmonic inversions on the rollout-weighted decision scope.

Classical Planning Planning Methods Shortest Paths Heuristics Graph Representations Rollout Boundaries

Open paper Ask about it PDF