conftrace_

combinatorial bandit

37 papers

Explore in graph

Co-occurring keywords

regret bound (1926) multi-armed bandit (1098) combinatorial optimization (1039) contextual bandit (381) thompson sampling (237) online learning (1777) upper confidence bound (197) pure exploration (50) semi-bandit feedback (22) online algorithm (445)

Papers

Neural Combinatorial Clustered Bandits for Recommendation Systems AAAI 2025
Sum-max Submodular Bandits AISTATS 2024
Thompson Sampling For Combinatorial Bandits: Polynomial Regret and Mismatched Sampling Paradox NIPS 2024
Combinatorial categorized bandits with expert rankings UAI 2023
Randomized Greedy Learning for Non-monotone Stochastic Submodular Maximization Under Full-bandit Feedback AISTATS 2023
Interactive Learning with Pricing for Optimal and Stable Allocations in Markets AISTATS 2023
Combinatorial Neural Bandits ICML 2023
Contextual Combinatorial Bandits with Probabilistically Triggered Arms ICML 2023
Nonstochastic Contextual Combinatorial Bandits AISTATS 2023
Additive Causal Bandits with Unknown Graph ICML 2023
Cascading Contextual Assortment Bandits NIPS 2023
Ranked Prioritization of Groups in Combinatorial Bandit Allocation IJCAI 2022
Thompson Sampling for (Combinatorial) Pure Exploration ICML 2022
Incentivizing Combinatorial Bandit Exploration NIPS 2022
Stochastic Top-$K$ Subset Bandits with Linear Space and Non-Linear Feedback ALT 2021
Efficient Pure Exploration for Combinatorial Bandits with Semi-Bandit Feedback ALT 2021
DART: Adaptive Accept Reject Algorithm for Non-Linear Combinatorial Bandits AAAI 2021
Combinatorial Gaussian Process Bandits with Probabilistically Triggered Arms AISTATS 2021
The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle NIPS 2021
Adversarial Combinatorial Bandits with General Non-linear Reward Functions ICML 2021
Diversified Interactive Recommendation with Implicit Feedback AAAI 2020
Tight Lower Bounds for Combinatorial Multi-Armed Bandits COLT 2020
Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits NIPS 2020
An Empirical Process Approach to the Union Bound: Practical Algorithms for Combinatorial and Linear Bandits NIPS 2020
Top-$k$ Combinatorial Bandits with Full-Bandit Feedback ALT 2020