Copertina

MNL-Bandit with Knapsacks: a near-optimal algorithm

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Aznag, Abdellah, Goyal, Vineet, Perivier, Noemie
Natura:	Preprint
Pubblicazione:	2021
Soggetti:	Machine Learning Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Energy-Efficient Scheduling with Predictions
di: Balkanski, Eric, et al.
Pubblicazione: (2024)

High-dimensional Linear Bandits with Knapsacks
di: Ma, Wanteng, et al.
Pubblicazione: (2023)

The Power of Greedy for Online Minimum Cost Matching on the Line
di: Balkanski, Eric, et al.
Pubblicazione: (2022)

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
di: Amanatidis, Georgios, et al.
Pubblicazione: (2021)

Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities
di: Su, Yuexin, et al.
Pubblicazione: (2025)

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
di: Amanatidis, Georgios, et al.
Pubblicazione: (2020)

Stochastic $k$-Submodular Bandits with Full Bandit Feedback
di: Nie, Guanyu, et al.
Pubblicazione: (2024)

Rate-optimal community detection near the KS threshold via node-robust algorithms
di: Ding, Jingqiu, et al.
Pubblicazione: (2025)

The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits
di: Assadi, Sepehr, et al.
Pubblicazione: (2023)

Time Fairness in Online Knapsack Problems
di: Lechowicz, Adam, et al.
Pubblicazione: (2023)

An efficient, provably optimal algorithm for the 0-1 loss linear classification problem
di: He, Xi, et al.
Pubblicazione: (2023)

Linear Submodular Maximization with Bandit Feedback
di: Chen, Wenjing, et al.
Pubblicazione: (2024)

Stochastic Bandits with ReLU Neural Networks
di: Xu, Kan, et al.
Pubblicazione: (2024)

Adversarial Attacks on Combinatorial Multi-Armed Bandits
di: Balasubramanian, Rishab, et al.
Pubblicazione: (2023)

Semi-Bandit Learning for Monotone Stochastic Optimization
di: Agarwal, Arpit, et al.
Pubblicazione: (2023)

Unlearning Offline Stochastic Multi-Armed Bandits
di: Ye, Zichun, et al.
Pubblicazione: (2026)

Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
di: Ye, Zichun, et al.
Pubblicazione: (2025)

Nearly-tight Approximation Guarantees for the Improving Multi-Armed Bandits Problem
di: Blum, Avrim, et al.
Pubblicazione: (2024)

Stochastic Multi-Objective Multi-Armed Bandits: Regret Definition and Algorithm
di: Davoodi, Mansoor, et al.
Pubblicazione: (2025)

Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits
di: He, Yuchen, et al.
Pubblicazione: (2024)

Greedy Algorithm for Structured Bandits: A Sharp Characterization of Asymptotic Success / Failure
di: Slivkins, Aleksandrs, et al.
Pubblicazione: (2025)

Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap
di: Karpov, Nikolai, et al.
Pubblicazione: (2025)

Phase transition of the Sinkhorn-Knopp algorithm
di: He, Kun
Pubblicazione: (2025)

Dynamic algorithms for k-center on graphs
di: Cruciani, Emilio, et al.
Pubblicazione: (2023)

Tight Gap-Dependent Memory-Regret Trade-Off for Single-Pass Streaming Stochastic Multi-Armed Bandits
di: Ye, Zichun, et al.
Pubblicazione: (2025)

No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting
di: Oki, Taihei, et al.
Pubblicazione: (2024)

Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
di: Pedramfar, Mohammad, et al.
Pubblicazione: (2023)

Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources
di: Goyal, Vineet, et al.
Pubblicazione: (2020)

Subset verification and search algorithms for causal DAGs
di: Choo, Davin, et al.
Pubblicazione: (2023)

Competitive strategies to use "warm start" algorithms with predictions
di: Srinivas, Vaidehi, et al.
Pubblicazione: (2024)

Distributionally Robust Newsvendor on a Metric
di: Foussoul, Ayoub, et al.
Pubblicazione: (2024)

Approximation Algorithms for D-optimal Design
di: Singh, Mohit, et al.
Pubblicazione: (2018)

Outlier-robust Mean Estimation near the Breakdown Point via Sum-of-Squares
di: Chen, Hongjie, et al.
Pubblicazione: (2024)

Efficient Sample-optimal Learning of Gaussian Tree Models via Sample-optimal Testing of Gaussian Mutual Information
di: Gayen, Sutanu, et al.
Pubblicazione: (2024)

OPTWIN: Drift identification with optimal sub-windows
di: Tosi, Mauro Dalle Lucca, et al.
Pubblicazione: (2023)

Introduction to Multi-Armed Bandits
di: Slivkins, Aleksandrs
Pubblicazione: (2019)

Accelerating ERM for data-driven algorithm design using output-sensitive techniques
di: Balcan, Maria-Florina, et al.
Pubblicazione: (2022)

The merged-staircase property: a necessary and nearly sufficient condition for SGD learning of sparse functions on two-layer neural networks
di: Abbe, Emmanuel, et al.
Pubblicazione: (2022)

Near-optimal Swap Regret Minimization for Convex Losses
di: Hu, Lunjia, et al.
Pubblicazione: (2026)

Near-optimal Active Regression of Single-Index Models
di: Li, Yi, et al.
Pubblicazione: (2025)