Improved Algorithms for Stochastic Linear Bandits Using Tail Bounds for Martingale Mixtures Hamish Flynn

Mar-27-2025, 11:34:15 GMT–Neural Information Processing Systems

We present improved algorithms with worst-case regret guarantees for the stochastic linear bandit problem. The widely used "optimism in the face of uncertainty"

artificial intelligence, data mining, machine learning, (20 more...)

Neural Information Processing Systems

Mar-27-2025, 11:34:15 GMT

Conferences PDF

Country:
- Europe (0.67)

Industry:
- Education (0.45)

Technology:
- Information Technology
  - Artificial Intelligence
    - Machine Learning
      - Computational Learning Theory (0.46)
      - Statistical Learning (0.67)
    - Representation & Reasoning (1.00)
  - Data Science > Data Mining
    - Big Data (0.48)

Duplicate Docs Excel Report

Title
Improved Algorithms for Stochastic Linear Bandits Using Tail Bounds for Martingale Mixtures

Similar Docs Excel Report more

Title	Similarity	Source
None found