4 articles tagged with #sample-complexity. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
New research formally defines and analyzes pattern matching in large language models, revealing predictable limits in their ability to generalize on compositional tasks. The study provides mathematical boundaries for when pattern matching succeeds or fails, with implications for AI model development and understanding.
Researchers achieved breakthrough sample complexity improvements for offline reinforcement learning algorithms using f-divergence regularization, particularly for contextual bandits. The study demonstrates optimal O(ε⁻¹) sample complexity under single-policy concentrability conditions, significantly improving upon existing bounds.
Researchers propose a new approach for training AI models to generate correct answers from demonstrations, using imitation learning in contextual bandits rather than traditional supervised fine-tuning. The method achieves better sample complexity and works with weaker assumptions about the underlying reward model compared to existing likelihood-maximization approaches.
Researchers achieve the first fast statistical rates (Õ(ε⁻¹)) for offline contextual bandits using forward-KL regularization under single-policy concentrability, matching the performance previously only shown for reverse-KL approaches and establishing rate-optimal lower bounds.
