Cover Image

Beyond the Node: Clade-level Selection for Efficient MCTS in Automatic Heuristic Design

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lai, Kezhao, Lai, Yutao, Liu, Hai-Lin
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Beyond Task Vectors: Selective Task Arithmetic Based on Importance Metrics
by: Bowen, Tian, et al.
Published: (2024)

Deep Symbolic Optimization for Combinatorial Optimization: Accelerating Node Selection by Discovering Potential Heuristics
by: Liu, Hongyu, et al.
Published: (2024)

Mitigating Spurious Background Bias in Multimedia Recognition with Disentangled Concept Bottlenecks
by: Huang, Gaoxiang, et al.
Published: (2025)

Wolf2Pack: The AutoFusion Framework for Dynamic Parameter Fusion
by: Tian, Bowen, et al.
Published: (2024)

Beyond the Heatmap: A Rigorous Evaluation of Component Impact in MCTS-Based TSP Solvers
by: Pan, Xuanhao, et al.
Published: (2024)

Rethinking KL Regularization in RLHF: From Value Estimation to Gradient Optimization
by: Liu, Kezhao, et al.
Published: (2025)

Efficient Node Selection in Private Personalized Decentralized Learning
by: Zec, Edvin Listo, et al.
Published: (2023)

RedAHD: Reduction-Based End-to-End Automatic Heuristic Design with Large Language Models
by: Thach, Nguyen, et al.
Published: (2025)

Graph-based Semi-supervised Local Clustering with Few Labeled Nodes
by: Shen, Zhaiming, et al.
Published: (2022)

Automatic Cross-Domain Transfer Learning for Linear Regression
by: Liu, Xinshun, et al.
Published: (2020)

Rethinking Semi-Supervised Node Classification with Self-Supervised Graph Clustering
by: Wang, Songbo, et al.
Published: (2025)

PathFinder: MCTS and LLM Feedback-based Path Selection for Multi-Hop Question Answering
by: Maram, Durga Prasad, et al.
Published: (2025)

A Client-level Assessment of Collaborative Backdoor Poisoning in Non-IID Federated Learning
by: Lai, Phung, et al.
Published: (2025)

Towards a Statistical Understanding of Neural Networks: Beyond the Neural Tangent Kernel Theories
by: Zhang, Haobo, et al.
Published: (2024)

Beyond Tsybakov: Model Margin Noise and $\mathcal{H}$-Consistency Bounds
by: Mohri, Mehryar, et al.
Published: (2025)

Efficient Topology-aware Data Augmentation for High-Degree Graph Neural Networks
by: Lai, Yurui, et al.
Published: (2024)

Text2Weight: Bridging Natural Language and Neural Network Weight Spaces
by: Tian, Bowen, et al.
Published: (2025)

ACDZero: MCTS Agent for Mastering Automated Cyber Defense
by: Li, Yu, et al.
Published: (2026)

Automatic Reward Shaping from Multi-Objective Human Heuristics
by: Xie, Yuqing, et al.
Published: (2025)

Scalable and Effective Arithmetic Tree Generation for Adder and Multiplier Designs
by: Lai, Yao, et al.
Published: (2024)

Efficient Privacy-Preserving KAN Inference Using Homomorphic Encryption
by: Lai, Zhizheng, et al.
Published: (2024)

Beyond Heuristics: Globally Optimal Configuration of Implicit Neural Representations
by: Chen, Sipeng, et al.
Published: (2025)

Pure Node Selection for Imbalanced Graph Node Classification
by: Zeng, Fanlong, et al.
Published: (2025)

Beyond Augmented-Action Surrogates for Multi-Expert Learning-to-Defer
by: Montreuil, Yannis, et al.
Published: (2026)

Multi-order Graph Clustering with Adaptive Node-level Weight Learning
by: Liu, Ye, et al.
Published: (2024)

Reinforcement Learning for Node Selection in Branch-and-Bound
by: Mattick, Alexander, et al.
Published: (2023)

Rethinking Caching for LLM Serving Systems: Beyond Traditional Heuristics
by: Kim, Jungwoo, et al.
Published: (2025)

From Heuristic Selection to Automated Algorithm Design: LLMs Benefit from Strong Priors
by: Huang, Qi, et al.
Published: (2026)

Leveraging Large Language Models for Effective Label-free Node Classification in Text-Attributed Graphs
by: Zhang, Taiyan, et al.
Published: (2024)

Exploring Adaptive MCTS with TD Learning in miniXCOM
by: Saadat, Kimiya, et al.
Published: (2022)

Beyond the Prompt in Large Language Models: Comprehension, In-Context Learning, and Chain-of-Thought
by: Jiao, Yuling, et al.
Published: (2026)

Beyond What to Select: A Plug-and-play Oscillatory Data-Volume Scheduling for Efficient Model Training
by: Yang, Suorong, et al.
Published: (2026)

Lai Loss: A Novel Loss for Gradient Control
by: Lai, YuFei
Published: (2024)

Conformal Anomaly Detection in Python: Moving Beyond Heuristic Thresholds with 'nonconform'
by: Hennhöfer, Oliver, et al.
Published: (2026)

Adaptive Node Feature Selection For Graph Neural Networks
by: Navarro, Madeline, et al.
Published: (2025)

Checkmating One, by Using Many: Combining Mixture of Experts with MCTS to Improve in Chess
by: Helfenstein, Felix, et al.
Published: (2024)

Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning
by: Luo, Yuankai, et al.
Published: (2024)

Going Beyond Heuristics by Imposing Policy Improvement as a Constraint
by: Lee, Chi-Chang, et al.
Published: (2025)

C-MCTS: Safe Planning with Monte Carlo Tree Search
by: Parthasarathy, Dinesh, et al.
Published: (2023)

tLoRA: Efficient Multi-LoRA Training with Elastic Shared Super-Models
by: Li, Kevin, et al.
Published: (2026)