Imagen de Portada

Handling Delayed Feedback in Distributed Online Optimization : A Projection-Free Approach

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Nguyen, Tuan-Anh, Thang, Nguyen Kim, Trystram, Denis
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Model-Free Counterfactual Subset Selection at Scale
por: Nguyen, Minh Hieu, et al.
Publicado: (2025)

Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems
por: Kevi, Eniko, et al.
Publicado: (2024)

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

Adaptive Power Iteration Method for Differentially Private PCA
por: Nguyen, Ta Duy, et al.
Publicado: (2026)

Distribution-Free Sequential Prediction with Abstentions
por: Yu, Jialin, et al.
Publicado: (2026)

Efficiency of Proportional Mechanisms in Online Auto-Bidding Advertising
por: Thang, Nguyen Kim
Publicado: (2026)

Sample-efficient Multiclass Calibration under $\ell_{p}$ Error
por: Bairaktari, Konstantina, et al.
Publicado: (2025)

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

Fast and Simple Densest Subgraph with Predictions
por: Bui, Thai, et al.
Publicado: (2025)

Learning-Augmented Ski Rental with Discrete Distributions: A Bayesian Approach
por: Kang, Bosun, et al.
Publicado: (2025)

Capacity Provisioning Motivated Online Non-Convex Optimization Problem with Memory and Switching Cost
por: Vaze, Rahul, et al.
Publicado: (2024)

$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
por: Vaze, Rahul, et al.
Publicado: (2025)

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

Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets
por: Oki, Taihei, et al.
Publicado: (2026)

Efficient algorithms for computing bisimulations for nondeterministic fuzzy transition systems
por: Nguyen, Linh Anh
Publicado: (2024)

Approximate minimization of interpretations in fuzzy description logics under the Gödel semantics
por: Nguyen, Linh Anh
Publicado: (2025)

Language Generation in the Limit: Noise, Loss, and Feedback
por: Bai, Yannan, et al.
Publicado: (2025)

Towards Fair Representation: Clustering and Consensus
por: Chakraborty, Diptarka, et al.
Publicado: (2025)

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

Online Classification with Predictions
por: Raman, Vinod, et al.
Publicado: (2024)

Tradeoffs between Mistakes and ERM Oracle Calls in Online and Transductive Online Learning
por: Attias, Idan, et al.
Publicado: (2025)

Learning-Augmented Search Data Structures
por: Fu, Chunkai, et al.
Publicado: (2024)

Online Prediction with Limited Selectivity
por: Liu, Licheng, et al.
Publicado: (2025)

Online Weighted Paging with Unknown Weights
por: Levy, Orin, et al.
Publicado: (2024)

Online Algorithms with Limited Data Retention
por: Immorlica, Nicole, et al.
Publicado: (2024)

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

Online Two-Stage Submodular Maximization
por: Nikolaou, Iasonas, et al.
Publicado: (2025)

Transductive and Learning-Augmented Online Regression
por: Raman, Vinod, et al.
Publicado: (2025)

Online Algorithms with Uncertainty-Quantified Predictions
por: Sun, Bo, et al.
Publicado: (2023)

Improving LSH via Tensorized Random Projection
por: Verma, Bhisham Dev, et al.
Publicado: (2024)

Improving Online Algorithms via ML Predictions
por: Kumar, Ravi, et al.
Publicado: (2024)

Improved Bounds for Online Facility Location with Predictions
por: Fotakis, Dimitris, et al.
Publicado: (2021)

Online Sparsification of Bipartite-Like Clusters in Graphs
por: Das, Joyentanuj, et al.
Publicado: (2025)

Parsimonious Learning-Augmented Online Metric Matching
por: Shin, Yongho, et al.
Publicado: (2026)

Learning-Augmented Online Scheduling with Parsimonious Preemption
por: Blue, Mugen, et al.
Publicado: (2026)

A Single-Sample Polylogarithmic Regret Bound for Nonstationary Online Linear Programming
por: Xu, Haoran, et al.
Publicado: (2026)

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

Online Learning with Limited Information in the Sliding Window Model
por: Braverman, Vladimir, et al.
Publicado: (2026)

Online Multi-Class Selection with Group Fairness Guarantee
por: Zargari, Faraz, et al.
Publicado: (2025)

Improved and Oracle-Efficient Online $\ell_1$-Multicalibration
por: Ghuge, Rohan, et al.
Publicado: (2025)