Imagen de Portada

Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Su, Yuexin, Yang, Ziyi, Huang, Peiyuan, Li, Tongyang, Ye, Yinyu
Formato:	Preprint
Publicado:	2025
Materias:	Quantum Physics Data Structures and Algorithms Machine Learning Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
por: Su, Yuexin, et al.
Publicado: (2026)

Quantum Approximate Optimization Algorithms for Maximum Cut on Low-Girth Graphs
por: Li, Tongyang, et al.
Publicado: (2024)

Quantum Algorithms and Lower Bounds for Finite-Sum Optimization
por: Zhang, Yexin, et al.
Publicado: (2024)

Quantum Langevin Dynamics for Optimization
por: Chen, Zherui, et al.
Publicado: (2023)

Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss
por: Wang, Hao, et al.
Publicado: (2024)

Gradient Testing and Estimation by Comparisons
por: Tao, Xiwen, et al.
Publicado: (2024)

Optimal Scalarizations for Sublinear Hypervolume Regret
por: Zhang, Qiuyi
Publicado: (2023)

A Catalyst Framework for the Quantum Linear System Problem via the Proximal Point Algorithm
por: Kim, Junhyung Lyle, et al.
Publicado: (2024)

Solving Linear Programs with Fast Online Learning Algorithms
por: Gao, Wenzhi, et al.
Publicado: (2021)

Combinatorial Sparse PCA Beyond the Spiked Identity Model
por: Kumar, Syamantak, et al.
Publicado: (2026)

Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
por: Tarzanagh, Davoud Ataee, et al.
Publicado: (2022)

Quantum EigenGame for excited state calculation
por: Quiroga, David, et al.
Publicado: (2025)

Exploiting Low-Rank Structure in Max-K-Cut Problems
por: Stevens, Ria, et al.
Publicado: (2026)

Sum-Of-Squares To Approximate Knapsack
por: Kothari, Pravesh K., et al.
Publicado: (2025)

Convergence analysis of wide shallow neural operators within the framework of Neural Tangent Kernel
por: Xu, Xianliang, et al.
Publicado: (2024)

Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion
por: Cai, Yang, et al.
Publicado: (2022)

Importance Sparsification for Sinkhorn Algorithm
por: Li, Mengyu, et al.
Publicado: (2023)

Learning-Augmented Algorithms for the Bahncard Problem
por: Zhao, Hailiang, et al.
Publicado: (2024)

Infrequent Resolving Algorithm for Online Linear Programming
por: Li, Guokai, et al.
Publicado: (2024)

Complexity of Classical Acceleration for $\ell_1$-Regularized PageRank
por: Fountoulakis, Kimon, et al.
Publicado: (2026)

Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
por: Grigorescu, Elena, et al.
Publicado: (2024)

A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives
por: Grigorescu, Elena, et al.
Publicado: (2024)

Generalized Assignment and Knapsack Problems in the Random-Order Model
por: Klimm, Max, et al.
Publicado: (2025)

A Two-Layer Framework for Joint Online Configuration Selection and Admission Control
por: Shen, Owen, et al.
Publicado: (2026)

Cascading-Tree Algorithm for the 0-1 Knapsack Problem (In Memory of Heiner M{ü}ller-Merbach, a Former President of IFORS)
por: Moeini, Mahdi, et al.
Publicado: (2024)

Quantum Optimization Algorithms in Operations Research: Methods, Applications, and Implications
por: Klug, Florian
Publicado: (2023)

Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time
por: Gu, Yuzhou, et al.
Publicado: (2023)

Online Linear Programming with Replenishment
por: Chen, Yuze, et al.
Publicado: (2026)

Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack
por: Schade, Jamico, et al.
Publicado: (2023)

Omnipredicting Single-Index Models with Multi-Index Models
por: Hu, Lunjia, et al.
Publicado: (2024)

Quantum thermodynamics and semi-definite optimization
por: Liu, Nana, et al.
Publicado: (2025)

Deterministic Algorithm for Non-monotone Submodular Maximization under Matroid and Knapsack Constraints
por: Chen, Shengminjie, et al.
Publicado: (2026)

Unifying Formal Explanations: A Complexity-Theoretic Perspective
por: Bassan, Shahaf, et al.
Publicado: (2026)

QCircuitBench: A Large-Scale Dataset for Benchmarking Quantum Algorithm Design
por: Yang, Rui, et al.
Publicado: (2024)

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

Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards
por: Kim, Jung-hun, et al.
Publicado: (2021)

Constrained and Composite Sampling via Proximal Sampler
por: Dang, Thanh, et al.
Publicado: (2026)

Optimal Bounds for Adversarial Constrained Online Convex Optimization
por: Ferreira, Ricardo N., et al.
Publicado: (2025)

Min-Max Optimization Is Strictly Easier Than Variational Inequalities
por: Shugart, Henry, et al.
Publicado: (2025)

Robust Learning of a Group DRO Neuron
por: Cao, Guyang, et al.
Publicado: (2026)