Imagen de Portada

Online Learning with Sublinear Best-Action Queries

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Russo, Matteo, Celli, Andrea, Baldeschi, Riccardo Colini, Fusco, Federico, Haimovich, Daniel, Karamshuk, Dima, Leonardi, Stefano, Tax, Niek
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Online Learning in the Random Order Model
por: Bernasconi, Martino, et al.
Publicado: (2025)

Multicalibration yields better matchings
por: Baldeschi, Riccardo Colini, et al.
Publicado: (2025)

On the Convergence of Loss and Uncertainty-based Active Learning Algorithms
por: Haimovich, Daniel, et al.
Publicado: (2023)

MCGrad: Multicalibration at Web Scale
por: Tax, Niek, et al.
Publicado: (2025)

On the Convergence of Multicalibration Gradient Boosting
por: Haimovich, Daniel, et al.
Publicado: (2026)

Contextual Online Bilateral Trade
por: Cosson, Romain, et al.
Publicado: (2026)

Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints
por: Bernasconi, Martino, et al.
Publicado: (2024)

No-Regret Learning in Bilateral Trade via Global Budget Balance
por: Bernasconi, Martino, et al.
Publicado: (2023)

Measuring multi-calibration
por: Guy, Ido, et al.
Publicado: (2025)

Online Learning under Budget and ROI Constraints via Weak Adaptivity
por: Castiglioni, Matteo, et al.
Publicado: (2023)

Optimal Type-Dependent Liquid Welfare Guarantees for Autobidding Agents with Budgets
por: Colini-Baldeschi, Riccardo, et al.
Publicado: (2025)

Multi-Armed Bandits With Best-Action Queries
por: Bacchiocchi, Francesco, et al.
Publicado: (2026)

Active learning with biased non-response to label requests
por: Robinson, Thomas, et al.
Publicado: (2023)

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

A Regret Analysis of Bilateral Trade
por: Cesa-Bianchi, Nicolò, et al.
Publicado: (2021)

Non-Asymptotic Analysis of (Sticky) Track-and-Stop
por: Poiani, Riccardo, et al.
Publicado: (2025)

Pure Exploration with Infinite Answers
por: Poiani, Riccardo, et al.
Publicado: (2025)

To Trust or Not to Trust: Assignment Mechanisms with Predictions in the Private Graph Model
por: Colini-Baldeschi, Riccardo, et al.
Publicado: (2024)

No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization
por: Bernasconi, Martino, et al.
Publicado: (2024)

Min-Max Optimization Requires Exponentially Many Queries
por: Bernasconi, Martino, et al.
Publicado: (2026)

Repeated Bilateral Trade Against a Smoothed Adversary
por: Cesa-Bianchi, Nicolò, et al.
Publicado: (2023)

The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations
por: Cesa-Bianchi, Nicolò, et al.
Publicado: (2023)

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

Nonparametric Contextual Online Bilateral Trade
por: Coccia, Emanuele, et al.
Publicado: (2026)

Beyond Bandit Feedback in Online Multiclass Classification
por: van der Hoeven, Dirk, et al.
Publicado: (2021)

Learning on the Edge: Online Learning with Stochastic Feedback Graphs
por: Esposito, Emmanuel, et al.
Publicado: (2022)

Reinforcement Learning for Online Testing of Autonomous Driving Systems: a Replication and Extension Study
por: Giamattei, Luca, et al.
Publicado: (2024)

Optimizing Adaptive Experiments: A Unified Approach to Regret Minimization and Best-Arm Identification
por: Qin, Chao, et al.
Publicado: (2024)

Optimal Rates for Feasible Payoff Set Estimation in Games
por: Barbara, Annalisa, et al.
Publicado: (2026)

Unbiased Prevalence Estimation with Multicalibrated LLMs
por: Linder, Fridolin, et al.
Publicado: (2026)

Contract Design Beyond Hidden-Actions
por: Ezra, Tomer, et al.
Publicado: (2024)

Sublinear Time Algorithm for Online Weighted Bipartite Matching
por: Hu, Hang, et al.
Publicado: (2022)

Fair Best Arm Identification with Fixed Confidence
por: Russo, Alessio, et al.
Publicado: (2024)

Better Regret Rates in Bilateral Trade via Sublinear Budget Violation
por: Lunghi, Anna, et al.
Publicado: (2025)

Matroid Semi-Bandits in Sublinear Time
por: Tzeng, Ruo-Chun, et al.
Publicado: (2024)

Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information
por: Balcan, Maria-Florina, et al.
Publicado: (2025)

On the Statistical Benefits of Temporal Difference Learning
por: Cheikhi, David, et al.
Publicado: (2023)

CogFormer: Learn All Your Models Once
por: Huang, Jerry M., et al.
Publicado: (2026)

Inductive Conformal Prediction under Data Scarcity: Exploring the Impacts of Nonconformity Measures
por: Kato, Yuko, et al.
Publicado: (2024)

Cooperative Online Learning with Feedback Graphs
por: Cesa-Bianchi, Nicolò, et al.
Publicado: (2021)