ASCT: Attentive Search over Counterfactual Trees for Credit Assignment in Agentic Reinforcement Learning

arXiv:2609.35215 · cs.AI · Submitted 2026-09-28 · Read on arXiv

cs.AI

Submitted: 2026-09-28

Updated: 2026-09-28

Terminology

• Credit assignment — 1× in this paper · explained in 3 episodes
• Reinforcement Learning — 1× in this paper · explained in 4 episodes

Sources

• ATPO: Adaptive Tree Policy Optimization for Multi-Turn Medical Dialogue
• Counterfactual Multi-Agent Policy Gradients
• Branching Policy Optimization: Sandbox-Native Language Agent Reinforcement Learning
• LoRA: Low-Rank Adaptation of Large Language Models
• Tree Search for LLM Agent Reinforcement Learning
• Tree Search for Language Model Agents
• Agent-UCT: Upper Confidence Bounds Applied to Trees for Cost-Aware Agentic Workflow Optimization
• Proximal Policy Optimization Algorithms
• Text Embeddings by Weakly-Supervised Contrastive Pre-training
• TreePS-RAG: Tree-based Process Supervision for Reinforcement Learning in Agentic RAG
• Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Models
• Language Agent Tree Search Unifies Reasoning Acting and Planning in Language Models

Related papers

• MAVEN-T: Reinforced Heterogeneous Distillation for Real-Time Multi-Agent Trajectory Prediction
• Model Discovery Agent: LLM-assisted Bayesian experiment design for data-efficient discovery of mechanistic world models
• Agents' Last Exam
• The Clinician's Veto: Navigating Trust, Liability, and Uncertainty in Autonomous AI Prescribing
• MindHelper: Closed-Loop Embodied Mental-State Reasoning for Precision Intervention
• Incumbent Advantage: Brand Bias and Cognitive Manipulation Dynamics in LLM Recommendation Systems