Co-occurring keywords · papers mentioning both
Papers
DyFo: A Training-Free Dynamic Focus Visual Search for Enhancing LMMs in Fine-Grained Visual Understanding
CVPR 2025
Efficient Prompt Optimisation for Legal Text Classification with Proxy Prompt Evaluator
EMNLP 2025
Enhancing Decision-Making for LLM Agents via Step-Level Q-Value Models
AAAI 2025
Enhancing Retrieval-Augmented Generation via Evidence Tree Search
ACL 2025
Ensembling Large Language Models with Process Reward-Guided Tree Search for Better Complex Reasoning
NAACL 2025
Epistemic Monte Carlo Tree Search
ICLR 2025
Evaluating Multimodal Large Language Models on Video Captioning via Monte Carlo Tree Search
ACL 2025
FastMCTS: A Simple Sampling Strategy for Data Synthesis
ACL 2025
From Objectives to Questions: A Planning-based Framework for Educational Mathematical Question Generation
ACL 2025
Grammar Reinforcement Learning: path and cycle counting in graphs with a Context-Free Grammar and Transformer approach
ICLR 2025
GRAT: Guiding Retrieval-Augmented Reasoning through Process Rewards Tree Search
ACL 2025
Growing Through Experience: Scaling Episodic Grounding in Language Models
ACL 2025
HAVER: Instance-Dependent Error Bounds for Maximum Mean Estimation and Applications to Q-Learning and Monte Carlo Tree Search
AISTATS 2025
Human-Aligned Chess With a Bit of Search
ICLR 2025
Implicit Search via Discrete Diffusion: A Study on Chess
ICLR 2025
IRIS: Interactive Research Ideation System for Accelerating Scientific Discovery
ACL 2025
Iterative Monte Carlo Tree Search for Neural Architecture Search
AutoML 2025
iTool: Reinforced Fine-Tuning with Dynamic Deficiency Calibration for Advanced Tool Use
EMNLP 2025
Joint Enhancement of Relational Reasoning for Long-Context LLMs
EMNLP 2025
KBQA-o1: Agentic Knowledge Base Question Answering with Monte Carlo Tree Search
ICML 2025
KinFormer: Generalizable Dynamical Symbolic Regression for Catalytic Organic Reaction Kinetics
ICLR 2025
Learning Evolving Tools for Large Language Models
ICLR 2025
Learning Feasible Transitions for Efficient Contact Planning
L4DC 2025
LiteSearch: Efficient Tree Search with Dynamic Exploration Budget for Math Reasoning
AAAI 2025
LLaMA-Berry: Pairwise Optimization for Olympiad-level Mathematical Reasoning via O1-like Monte Carlo Tree Search
NAACL 2025