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 →

Order Matters: Unveiling the Hidden Impact of Macro Placement Sequences via Proxy-Guided LLM Evolution
Jun 8, 2026Shibing Mo, Jing Liu, Jianchu Xu +1Chip Design Order Matters
When Video Misreads: Closed-Loop Distillation of Reading Heuristics for Exploratory Manipulation Trace QA
Jun 7, 2026Haizhou Ge, Yufei Jia, Yue Li +5Perception-Action Loop Robot Systems
Segment-level Tree Search for Long Meeting Document Summarization
Jun 7, 2026Sangwon Ryu, Heejin Do, Jun Seo +4Summarization Longbench
VATS: Exploiting Implicit Authority in Error-Path Injection via Systematic Mutation
Jun 6, 2026Harshil Patel, Kunal PaiNovel Dual-Branch Identity Injection Mechanism Vulnerability Detection & Repair
ROSUM-MCTS: Monte Carlo Tree Search-Inspired HDL Code Summarization with Structural Rewards
Jun 6, 2026Prashanth Vijayaraghavan, Charles Mackin, Luyao Shi +6Vhdl Hardware Description Languages
Partially Performative Prediction
Jun 5, 2026Jaewook Lee, Tijana ZrnicDistribution Shifts Distributional Learning
Bridging Multi-Valued Heuristics and Dimensionality Reduction in Multi-Objective Search
Jun 5, 2026Maya Wolff, Ariel Felner, Oren SalzmanShortest Paths Heuristics
$α$ -PFN: Fast Entropy Search via In-Context Learning
Jun 5, 2026Herilalaina Rakotoarison, Steven Adriaensen, Tom Viering +4Bayesian Optimization Search Algorithms
Front-to-Attractors: Modifying the Front-to-Front Heuristic in Bidirectional Search
Jun 5, 2026Alvin Zou, Muhammad Suhail Saleem, Maxim LikhachevHeuristic Search Heuristics
Neuro-Symbolic Learning for Long-Horizon Task Planning Under Complex Logical Constraints
Jun 5, 2026Qiwei Du, Zitong Zhan, Shaoshu Su +7Classical Planning Neuro-Symbolic Framework
ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition
Jun 4, 2026Jungmin Seo, Jaesik ParkDiffusion Planning Planning Methods
TOKI: A Bitemporal Operator Algebra for Contradiction Resolution in LLM-Agent Persistent Memory
Jun 4, 2026Ziming WangLong-Term Conversational Memory Deterministic
Hub-Aware Hybrid Search: Accelerating the Locally Aligned Ant Technique
Jun 4, 2026Simone Vilardi, Reynier Peletier, Felipe Contreras +1Farthest Point Sampling Cluster Structure
Global-Local Monte Carlo Tree Search in Vision-Language Models for Text-to-3D Indoor Scene Generation
Jun 4, 2026Mengshi Qi, Wei Deng, Xianlin Zhang +13D Scenes Indoor Scene Generation
Bidirectional Search for Longest Paths: Case for Front-to-Front Heuristics
Jun 4, 2026Tzur Shubi, Ariel Felner, Solomon Eyal Shimony +1Heuristic Search Shortest Paths
Automated Proving of Shannon-Type Entropy Inequalities via Fine-Tuned Language Models and Guided Tree Search
Jun 4, 2026Shing Yin Wong, Shaocheng Liu, Linqi Song +2Theorem Small Language Models
Human oversight of agentic systems in practice: Examining the oversight work, challenges, and heuristics of developers using software agents
Jun 3, 2026Shipi Dhanorkar, Samir Passi, Mihaela VorvoreanuScalable Oversight Coding Agents
Learning Empirically Admissible Neural Heuristics for Combinatorial Search
Jun 3, 2026Siddharth SahayHeuristics Search Algorithms
Learning Admissible Heuristics via Cost Partitioning
Jun 3, 2026Hugo Barral, Quentin Cappart, Marie-José Huguet +1Heuristics Classical Planning
ANN Search: Recall What Matters
Jun 3, 2026Dimitris Dimitropoulos, Nikos MamoulisApproximate Nearest-Neighbor Search Search Algorithms
Differentiable Efficient Operator Search
Jun 3, 2026Xiaohuan Pei, Jiyuan Zhang, Yuanfan Guo +4Multimodal Foundation Model Visual Token Pruning
Language Models Compare Quantities Using Number-specific and Unit-specific Heuristics
Jun 2, 2026Mutsumi Sasaki, Go kamoda, Ryosuke Takahashi +4Quantifying Heuristics
Direct Informed Sampling on Riemannian Manifolds via Loewner Order Lower Bounds
Jun 1, 2026Phone Thiha Kyaw, Jonathan KellyRiemannian Manifolds Heuristics
Don't Gamble, GAMBLe: An Analytical Framework for AI-Driven Research Systems
Jun 1, 2026Marquita Ellis, Paul CastroAutoresearch Search Algorithms
LLM-Evolved Pattern Generators for Optimal Classical Planning
Jun 1, 2026Windy Phung, Dominik Drexler, Arnaud Lequen +1Heuristics Classical Planning
S3TS: Stochastic Scenario-Structured Tree Search for Advanced Planning Under Uncertainty
Jun 1, 2026Fabio Pavirani, Bert Claessens, Pierre Pinson +1Demand Response Power Systems
Graph Edit Distance Formulation for the Vehicle Routing Problem: Theory and Analysis
Jun 1, 2026Adel DabahVehicle Routing Problem Maximum Independent Set
Evaluation of Baseline Methods for IDD-based SSD External Memory Search
Jun 1, 2026Yuki Suzuki, Alex FukunagaSearch Algorithms Cache
Two-Fidelity Best-Action Identification for Stochastic Minimax Tree
Jun 1, 2026Peter Chen, Xi ChenMonte Carlo Tree Search Tree Search
CRePE: Convolution-aware Relative Importance in Post-training Pruning with Efficient Search
Jun 1, 2026Cheonjun ParkHeterogeneous Pruning Scores Large Language Model Post-Training
STEM: Semantic Target Search and Exploration using MAVs in Cluttered Environments
May 30, 2026Nikhil Sethi, Max Lodel, Laura Ferranti +2Social Robot Navigation Classical Planning
LinTree: Improving LLM Reasoning with Explicitly Structured Search Histories
May 29, 2026Liwei Kang, Yee Whye Teh, Wee Sun LeeLarge Language Model Reasoning Heuristic Search
Agentic Transformers Provably Learn to Search via Reinforcement Learning
May 29, 2026Tong Yang, Yu Huang, Yingbin Liang +1Agentic Reinforcement-Learning Framework Tree Search
Learning to Solve and Optimize by Evolving Code
May 29, 2026Veronika Semmelrock, Benedetta Strizzolo, Francesco Zuccato +3Evolutionary Search Heuristics
COMPASS: Cognitive MCTS-Guided Process Alignment for Safe Search Agents
May 29, 2026Wenkai Shen, Pengyang Zhou, Jiahe Xu +5Safety Alignment Search Agents
Structure-Induced Information for Rerooting Levin Tree Search
May 28, 2026Jake Tuero, Michael Buro, Laurent Orseau +1Tree Search Context-Aware Sub-Goal Generation
Bidirectional Incremental Generalized Hybrid A*
May 28, 2026Sidharth Talia, Oren Salzman, Siddhartha SrinivasaHeuristic Search Hybrid
TriSearch: Learning to Optimize Triangulations via Bistellar Flips
May 28, 2026Yiran Wang, Guido MontúfarTriangulations Polytopes
Distributionally Robust Set Representation Learning Under Inference-Time Element Corruption
May 28, 2026Yankai Chen, Hanrong Zhang, Bowei He +2Robust Optimization Corrupted Observations
RAISE: RAG Design as an Architecture Search Problem
May 28, 2026Zhen Chen, Yibing Liu, Weihao Xie +3Search Algorithms Hyperparameter Optimization
Selection Hyper-heuristics Can Automatically Adjust the Learning Period to Optimally Solve Pseudo-Boolean Problems
May 28, 2026Benjamin Doerr, Pietro S. Oliveto, John Alasdair WarwickerHyperparameter Optimization Heuristics
LLM-Evolved Domain-Independent Heuristics for Symbolic AI Planning
May 28, 2026Elliot Gestrin, Jendrik SeippLarge Language Model Planning Heuristics
Optimality of Sequential Filtering Under Independent Cost and Selectivity Models
May 28, 2026Hrishikesh Paranjape, Abhishek Mandal, Xian SunOrder Matters Sequential Decision Making
Human-in-the-Loop Swarms: A Bionic Swarm Approach to Real-World Soil Mapping
May 27, 2026Petras Swissler, Mohammadali Rashidioun, Nicholas Sahu +3Swarms Agricultural Robots
AlphaTransit: Learning to Design City-scale Transit Routes
May 27, 2026Bibek Poudel, Sai Swaminathan, Weizi LiTransit Network Design Monte Carlo Tree Search
Tree of Thoughts as a Classical Heuristic Search Problem: Formal Foundations and Design Patterns
May 27, 2026Guni SharonTree-Of-Thoughts Large Language Model Reasoning
Automating Formal Verification with Agent-Guided Tree Search
May 26, 2026Leo YaoFormal Verification Verifier
CART Random Forests as Sequential Allocation over Random Opportunity Sets: A Stochastic-Control Theory of Ensemble Risk
May 26, 2026Tianxing Mei, Yingying Fan, Mingming Leng +1Random Forest Stochastic Optimal Control
MechRL: Reinforcement Learning Agents Perform Circuit Discovery for Mechanistic Interpretability
May 25, 2026Barsat KhadkaMechanistic Interpretability Circuits
The Montparnasse Algorithm for RNA Design
May 25, 2026Tristan CazenaveMessenger Rna Molecular Optimization
Learning to Search and Searching to Learn for Generalization in Planning
May 25, 2026Michael Aichmüller, Yannik Hesse, Hector GeffnerClassical Planning Deep Reinforcement Learning
Keep the Proof State Live: Snapshotting for Efficient Tactic Search in Lean 4
May 25, 2026Austin Shen, Yunong ShiTheorem Search Algorithms
MAPLE: Multi-State Aggregated Policy Evaluation for AlphaZero in Imperfect-Information Games
May 22, 2026Qian-Rong Li, Hung Guei, I-Chen Wu +1Imperfect-Information Games Monte Carlo Tree Search
Verified SHAP: Provable Bounds for Exact Shapley Values of Neural Networks
May 22, 2026David Boetius, Shahaf Bassan, Guy Katz +2Shapley Value Neural Network Verification
Scalable Multi-robot Motion Planning via Hierarchical Subproblem Expansion and Workspace Decomposition Refinement
May 19, 2026Isaac Ngui, Courtney McBeth, James D. Motes +2Multi-Robot Motion Planning Planning Methods
Real-Time Parallel Counterfactual Regret Minimization
May 19, 2026Boning Li, Longbo HuangParallel Monte Carlo Tree Search
Transforming Constraint Programs to Input for Local Search
May 19, 2026Jo Devriendt, Patrick De Causmaecker, Marc DeneckerParallel Continuous Local Search Constraint Satisfaction
Beyond Fixed Budgets: Characterizing the Inelasticity and Limitations of Tree-of-Thought Reasoning Strategies
May 19, 2026Atkia Mahila, Avinash Maurya, M. Mustafa Rafique +1Monte Carlo Tree Search
Protein Thoughts: Interpretable Reasoning with Tree of Thoughts and Embedding-Space Flow Matching for Protein-Protein Interaction Discovery
May 19, 2026Kingsley Yeon, Xuefeng Liu, Promit GhosalProtein Tree Search
Structuring Open-Ended NAS: Semi-Automated Design Knowledge Structuring with LLMs for Efficient Neural Architecture Search
May 19, 2026Yuiko Sakuma, Masakazu Yoshimura, Marcel Gröpl +4Neural Architecture Search Neural Architectures

Jun 8, 2026 · cs.AIJ/K move · Enter open · S save

Order Matters: Unveiling the Hidden Impact of Macro Placement Sequences via Proxy-Guided LLM Evolution

Shibing Mo, Jing Liu, Jianchu Xu, Ruilin Wu

Macro placement is a fundamental step in modern chip physical design, playing a crucial role in determining the solution quality of high-dimensional combinatorial optimization problems. Despite recent advancements in machine learning for spatial coordinate determination, the temporal dimension of placement sequencing remains largely governed by static heuristics. In this work, we demonstrate that the placement sequence is not merely a preprocessing step but a decisive factor in optimization, where suboptimal early decisions trigger irreversible domino effects that constrain the solution space. To harness this unexplored dimension, we propose \textbf{OrderPlace}, a proxy-guided LLM evolution framework for automatically discovering macro placement order strategies. Instead of relying on manually crafted heuristics such as area- or connectivity-based ordering, OrderPlace explores a broader space of code-level policies, ranging from static scoring metrics to dynamic physics-inspired mechanisms. To mitigate the prohibitive cost of evaluating sequences, we introduce a lightweight proxy evaluation mechanism that efficiently filters candidates using a deterministic greedy probe. Experimental results on the standard ISPD 2005 benchmarks demonstrate that OrderPlace discovers novel ordering strategies. Compared with WireMask-EA and the state-of-the-art method EGPlace, OrderPlace reduces wirelength by 34.04% and 14.08%, respectively.

Chip Design Order Matters Layouts Llm-Based Optimization Modeling Combinatorial Optimization Heuristics

Open paper Ask about it PDF