Imagen de Portada

Learning on the Edge: Online Learning with Stochastic Feedback Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Esposito, Emmanuel, Fusco, Federico, van der Hoeven, Dirk, Cesa-Bianchi, Nicolò
Formato:	Preprint
Publicado:	2022
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

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)

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

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

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

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

Deletion Robust Submodular Maximization over Matroids
por: Dütting, Paul, et al.
Publicado: (2022)

Deletion Robust Non-Monotone Submodular Maximization over Matroids
por: Dütting, Paul, et al.
Publicado: (2022)

Consistent Submodular Maximization
por: Dütting, Paul, et al.
Publicado: (2024)

Fully Dynamic Submodular Maximization over Matroids
por: Dütting, Paul, et al.
Publicado: (2023)

Learning-Augmented Algorithms for $k$-median via Online Learning
por: Hebbar, Anish, et al.
Publicado: (2026)

The Cost of Consistency: Submodular Maximization with Constant Recourse
por: Dütting, Paul, et al.
Publicado: (2024)

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

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

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

Tradeoffs between Mistakes and ERM Oracle Calls in Online and Transductive Online Learning
por: Attias, Idan, 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)

Handling Delayed Feedback in Distributed Online Optimization : A Projection-Free Approach
por: Nguyen, Tuan-Anh, et al.
Publicado: (2024)

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

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

Learning Augmented Graph $k$-Clustering
por: Fan, Chenglin, et al.
Publicado: (2025)

Online Conversion with Switching Costs: Robust and Learning-Augmented Algorithms
por: Lechowicz, Adam, et al.
Publicado: (2023)

Efficient, Low-Regret, Online Reinforcement Learning for Linear MDPs
por: John, Philips George, et al.
Publicado: (2024)

Improved Regret in Stochastic Decision-Theoretic Online Learning under Differential Privacy
por: Wu, Ruihan, et al.
Publicado: (2025)

Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust
por: Chen, Hongjie, et al.
Publicado: (2024)

Learning-augmented Online Algorithm for Two-level Ski-rental Problem
por: Zhang, Keyuan, et al.
Publicado: (2024)

Learning-Augmented Online Bipartite Matching in the Random Arrival Order Model
por: Burathep, Kunanon, et al.
Publicado: (2025)

GEFL: Extended Filtration Learning for Graph Classification
por: Zhang, Simon, et al.
Publicado: (2024)

Distribution Learning Meets Graph Structure Sampling
por: Bhattacharyya, Arnab, et al.
Publicado: (2024)

Exact Learning of Weighted Graphs Using Composite Queries
por: Goodrich, Michael T., et al.
Publicado: (2025)

An $α$-regret analysis of Adversarial Bilateral Trade
por: Azar, Yossi, et al.
Publicado: (2022)

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

Fairness in Streaming Submodular Maximization over a Matroid Constraint
por: Halabi, Marwa El, et al.
Publicado: (2023)

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

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

Private PAC Learning May be Harder than Online Learning
por: Bun, Mark, et al.
Publicado: (2024)

Online Learning of Halfspaces with Massart Noise
por: Diakonikolas, Ilias, et al.
Publicado: (2024)

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

Stochastic Matching via Local Sparsification
por: Ahmadian, Sara, et al.
Publicado: (2026)