POETS: Uncertainty-Aware LLM Optimization via Compute-Efficient Policy Ensembles

arXiv:2605.07775 · cs.LG, cs.AI, stat.ML · Submitted 2026-05-08 · Read on arXiv

cs.LG, cs.AI, stat.ML

Submitted: 2026-05-08

Updated: 2026-10-23

Terminology

• Reward Function — 2× in this paper · explained in 4 episodes
• Core — 1× in this paper · explained in 2 episodes
• Epistemic Uncertainty — 1× in this paper · explained in 12 episodes
• Language Models (LLMs) — 1× in this paper · explained in 2 episodes
• Large Language Models (LLMs) — 1× in this paper · explained in 9 episodes
• Low-Rank Adaptation (LoRA) — 1× in this paper · explained in 17 episodes
• Regret — 1× in this paper · explained in 4 episodes
• Regret Bound — 1× in this paper · explained in 2 episodes
• Regret Bounds — 1× in this paper · explained in 2 episodes
• Regularization — 1× in this paper · explained in 3 episodes
• Reinforcement Learning — 1× in this paper · explained in 4 episodes
• Sample Efficiency — 1× in this paper · explained in 7 episodes
• Uncertainty Quantification — 1× in this paper · explained in 9 episodes

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks