8 papers
Estimating Semantic Alphabet Size for LLM Uncertainty Quantification
Lucas H. McCabe, Rimon Melamed, Thomas Hartvigsen +1
Many black-box techniques for quantifying the uncertainty of large language models (LLMs) rely on repeated LLM sampling, which can be computationally expensive. Therefore, practica…
SAINT: Attention-Based Policies for Discrete Combinatorial Action Spaces
Matthew Landers, Taylor W. Killian, Thomas Hartvigsen +1
The combinatorial structure of many real-world action spaces leads to exponential growth in the number of possible actions, limiting the effectiveness of conventional reinforcement…
Improving and Accelerating Offline RL in Large Discrete Action Spaces with Structured Policy Initialization
Matthew Landers, Taylor W. Killian, Thomas Hartvigsen +1
Reinforcement learning in discrete combinatorial action spaces requires searching over exponentially many joint actions to simultaneously select multiple sub-actions that form cohe…
BraVE: Offline Reinforcement Learning for Discrete Combinatorial Action Spaces
Matthew Landers, Taylor W. Killian, Hugo Barnes +2
Offline reinforcement learning in high-dimensional, discrete action spaces is challenging due to the exponential scaling of the joint action space with the number of sub-actions an…
Composable Interventions for Language Models
Arinbjorn Kolbeinsson, Kyle O'Brien, Tianjin Huang +8
Test-time interventions for language models can enhance factual accuracy, mitigate harmful outputs, and improve model efficiency without costly retraining. But despite a flood of n…
Learning under Temporal Label Noise
Sujay Nagaraj, Walter Gerych, Sana Tonekaboni +3
Many time series classification tasks, where labels vary over time, are affected by label noise that also varies over time. Such noise can cause label quality to improve, worsen, o…