paper-with-me

홈 › Papers

Monte Carlo Query Search: Active Capability Assessment of AI Agents

2025-12-18 · Daniel Bramblett, Rushang Karia, Adrian Ciotinga, Pulkit Verma, YooJung Choi, Siddharth Srivastava arxiv

Black-box AI (BBAI) systems, including foundation-model agents, are increasingly used for sequential decision making. Safe deployment requires methods for characterizing what such systems can do, when they can do it, and what outcomes may result. We introduce Monte Carlo Query Synthesis (MCQS), an active query-synthesis method for learning symbolic stochastic capability models of BBAIs. MCQS models capabilities as conditional probability distributions over outcomes and formulates capability learning as an active learning problem over policies. Our approach uses Monte Carlo tree search to synthesize queries that induce BBAI execution trajectories with high discriminative value between extremal hypothesis models: the lattice meet and join corresponding to the most pessimistic and optimistic hypotheses consistent with the observations. Executing these queries with the agent yields information-rich state-action trajectories that speed up learning by pruning inconsistent hypotheses. We prove soundness, completeness, and convergence properties under standard realizability and sampling assumptions. Experiments with multiple BBAI systems show that MCQS learns accurate capability models more efficiently than baseline query strategies.

📄 PDF Abstract BibTeX arXiv:2512.16733

Code (0)

등록된 구현이 없습니다.

Tasks

Decision MakingActive Learning

Similar Papers 제목 키워드 기반

Monte Carlo Tree Search for Generating Interactive Data Analysis Interfaces

2020-01-07 · Yiru Chen, Eugene Wu

Interactive tools like user interfaces help democratize data access for end-users by hiding underlying programming details and exposing the necessary widget interface to users. Since customized interfaces are costly to b…

Conditional Inference in Pre-trained Variational Autoencoders via Cross-coding

2018-05-20 · ICLR 2019 5 · Ga Wu, Justin Domke, Scott Sanner

Variational Autoencoders (VAEs) are a popular generative model, but one in which conditional inference can be challenging. If the decomposition into query and evidence variables is fixed, conditional VAEs provide an attr…

SAPIENT: Mastering Multi-turn Conversational Recommendation with Strategic Planning and Monte Carlo Tree Search

2024-10-12 · Hanwen Du, Bo Peng, Xia Ning

Conversational Recommender Systems (CRS) proactively engage users in interactive dialogues to elicit user preferences and provide personalized recommendations. Existing methods train Reinforcement Learning (RL)-based age…

Conversational RecommendationConversational SearchRecommendation SystemsReinforcement Learning (RL)

Monte Carlo Search Algorithms Discovering Monte Carlo Tree Search Exploration Terms

2024-04-14 · Tristan Cazenave

Monte Carlo Tree Search and Monte Carlo Search have good results for many combinatorial problems. In this paper we propose to use Monte Carlo Search to design mathematical expressions that are used as exploration terms f…

Active Reinforcement Learning with Monte-Carlo Tree Search

2018-03-13 · Sebastian Schulze, Owain Evans

Active Reinforcement Learning (ARL) is a twist on RL where the agent observes reward information only if it pays a cost. This subtle change makes exploration substantially more challenging. Powerful principles in RL like…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)Thompson Sampling