14 papers
EpiSEM-Bench: Evaluating Safety and Evidence Recovery in LLM Agents under Missing Evidence
Qijin Zhang, Hanzhen Wang, Yuehan Zhao +4
Tool-using language model agents rely on environmental facts to decide whether an action is permitted. When a tool response omits a safety-relevant fact, an agent may carry out a p…
Bridging Exploration and Persona: Information-Directed Dueling for Test-Time Agent Personalization
Jie Mao, Pingchen Lu, Xiangyi Wang +4
Effective test-time personalization requires LLM agents to adapt to query-dependent user preferences from lightweight interaction. We study persona selection with binary comparison…
When More Objectives Make Identification Easier: The Role of Preferences and Feedback
Bo Xue, Ji Cheng, Yuanyu Wan +1
Best-arm identification (BAI) aims to identify the optimal arm using as few samples as possible. While most existing work focuses on a single objective, many real-world application…
Few-for-Many Best-Arm Identification in Multi-Objective Bandits
Bo Xue, Yilu Liu, Haodong Jing +3
Real-world systems often serve many objectives but can deploy only a few options, whose performance must be learned from noisy feedback. Modeling each option as an arm in a multi-o…
CB-Orchestrator: Adaptive Workflow Optimization for LLM Agents via Contextual Bandits
Jiahang Sun, Zhiwei Shang, Zhipiao Liu +4
Large Language Model (LLM) agents have demonstrated remarkable capabilities in tackling complex tasks through agentic workflows. However, manually designing these workflows is labo…
Test-Time Scaling via Budgeted Multi-Attribute Verification
Bo Xue, Ji Cheng, Shen-Huan Lyu +2
Verifying LLM-generated answers under a shared computational budget requires jointly deciding which candidates to inspect and which verification attributes to evaluate. We formulat…
SPOT: Sparse Probing and Outcome Calibration for On-Policy Distillation
Zikun Qu, Min Zhang, Mingze Kong +5
On-policy distillation (OPD) provides dense teacher supervision on student-generated trajectories, but standard reverse-KL training can assign insufficient probability to other pla…
Cost-Aware Multi-Objective Bandits: Theory and Application to Budgeted LLM Configuration Evaluation
Bo Xue, Zhi Hong, Jiayi Li +3
Large language model (LLM) configuration evaluation is challenging due to limited evaluation budgets, varying costs, and multiple competing objectives. In this paper, we formulate…
Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits
Bo Xue, Ji Cheng, Haodong Jing +2
This paper studies generalized low-rank matrix bandits with multiple prioritized objectives. At each round, the learner selects a matrix-valued arm and observes a vector-valued rew…
DemoPSD: Disagreement-Modulated Policy Self-Distillation
Yunhe Li, Hao Shi, Wenhao Liu +5
On-policy self-distillation (OPSD) has emerged as a practical method for training large language models (LLMs) to reason, where a single model acts as both the teacher and the stud…
Learning to Reason with Insight for Informal Theorem Proving
Yunhe Li, Hao Shi, Bowen Deng +8
Although most of the automated theorem-proving approaches depend on formal proof systems, informal theorem proving can align better with large language models' (LLMs) strength in n…
Self-Reflective Generation at Test Time
Jian Mu, Qixin Zhang, Zhiyong Wang +5
Large language models (LLMs) increasingly solve complex reasoning tasks via long chain-of-thought, but their forward-only autoregressive generation process is fragile; early token…
FedPOB: Sample-Efficient Federated Prompt Optimization via Bandits
Pingchen Lu, Zhi Hong, Zhiwei Shang +6
The performance of large language models (LLMs) is highly sensitive to the input prompt, making prompt optimization a critical task. However, real-world application is hindered by…
T-POP: Test-Time Personalization with Online Preference Feedback
Zikun Qu, Min Zhang, Mingze Kong +7
Personalizing large language models (LLMs) to individual user preferences is a critical step beyond generating generically helpful responses. However, current personalization metho…