Nearly Minimax Optimal Regret for Multinomial Logistic Bandit

Oct-10-2025, 16:04:37 GMT–Neural Information Processing Systems

Hence, the following research questions arise: What is the optimal regret lower bound in contextual MNL bandits?

artificial intelligence, inequality hold, machine learning, (19 more...)

Neural Information Processing Systems

Oct-10-2025, 16:04:37 GMT

Conferences PDF

Country:
- Asia > South Korea
  - Seoul > Seoul (0.04)
- Europe > United Kingdom
  - England > Cambridgeshire > Cambridge (0.04)
- North America > United States (0.14)

Genre:
- Research Report
  - Experimental Study > Negative Result (0.34)
  - New Finding (1.00)

Technology:
- Information Technology
  - Artificial Intelligence
    - Machine Learning > Statistical Learning (0.67)
    - Representation & Reasoning
      - Optimization (0.45)
      - Search (0.50)
  - Data Science (0.92)

Duplicate Docs Excel Report

Title
Nearly Minimax Optimal Regret for Multinomial Logistic Bandit

Similar Docs Excel Report more

Title	Similarity	Source
None found