Maximizing Rollout Informativeness under a Fixed Budget: A Submodular View of Tree Search for Tool-Use Agentic Reinforcement Learning

arXiv 2605.05262•0ba6f4bfb93f433437aa38ba73176e32f046518eb9415faff47ae9d8ea8d00bf
arxivbayesiancausal-inferencedeep-learninggaussian-processesgenerative-modelsllm-diagnosticsmachine-learningno_cvereinforcement-learningresearch-collectionscalabilitystochastic-dynamicstheorytime-series

Paper metadata

arXiv ID
2605.05262
Version
Not specified by this published record
Category
Statistics — Machine Learning (stat.ML)

The PDF link points to arxiv.org. Baitaphish does not expose a private stored PDF.

Evidence and limitations

Source ID
arxiv_stat_ml
Record identifier
0ba6f4bfb93f433437aa38ba73176e32f046518eb9415faff47ae9d8ea8d00bf
Enrichment time
2026-05-08T07:24:05Z
AI-assisted enrichment
Yes

This record may overlap with other records. Its enrichment can be incomplete or wrong, and machine assistance was used. Validate consequential decisions against the linked source and your own environment.

Maximizing Rollout Informativeness under a Fixed Budget: A Submodular View of Tree Search for Tool-Use Agentic Reinforcement Learning · Baitaphish