Learning When to Update: A Near-Optimal Timing Bandit Approach
cs.LG
Submitted: 2026-09-29
Updated: 2026-09-29
Sources
- Best Arm Identification in Batched Multi-armed Bandit Problems
- Leveraging Side Observations in Stochastic Bandits
- Send Pilot or Data? Leveraging Age of Channel State Information for Throughput Maximization
- An Online Learning Approach to Optimizing Time-Varying Costs of AoI
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