Bellman-sufficient Information Complexity
cs.LG, cond-mat.stat-mech, cs.IT, math.IT, math.OC, math.ST, stat.TH
Submitted: 2026-06-09
Updated: 2026-08-31
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability
- The Statistical Complexity of Interactive Decision Making
- Tight Guarantees for Interactive Decision Making with the Decision-Estimation Coefficient
- Research Program: Theory of Learning in Dynamical Systems
- Pointwise Generalization in Deep Neural Networks
- Finite-Time Queue Peak Laws in Stochastic Networks: Logarithmic Scaling After Geometric Thresholds
- Finite-Time Minimax Bounds and an Optimal Lyapunov Policy in Queueing Control
- Optimal Hidden-Target Learning for Online Inventory Optimization on General Convex Sets
- On the Suboptimality of GP-UCB under Polynomial Effective Optimism
- Pointwise Complexity for Gaussian Fields: Upper Envelopes, Algorithmic Lower Bounds, and Separation
- Online Control via Counterfactual Tracking
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: Local-Consistency Optimisation for Bayesian Neural Networks
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks