Image de couverture de livre

MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hayderi, Alexandre, Saberi, Amin, Vitercik, Ellen, Wikum, Anders
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Algorithms with Calibrated Machine Learning Predictions
par: Shen, Judy Hanwen, et autres
Publié: (2025)

Optimal Rounding for Two-Stage Bipartite Matching
par: Pollner, Tristan, et autres
Publié: (2025)

Smoothed Analysis of Online Metric Matching with a Single Sample: Beyond Metric Distortion
par: Li, Yingxi, et autres
Publié: (2025)

The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem
par: Blanc, Guy, et autres
Publié: (2024)

Sublinear Time Algorithm for Online Weighted Bipartite Matching
par: Hu, Hang, et autres
Publié: (2022)

Approximating Optimum Online for Capacitated Resource Allocation
par: Braun, Alexander, et autres
Publié: (2024)

New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling
par: Braverman, Mark, et autres
Publié: (2024)

Improving Online Algorithms via ML Predictions
par: Kumar, Ravi, et autres
Publié: (2024)

Learning-Augmented Algorithms for $k$-median via Online Learning
par: Hebbar, Anish, et autres
Publié: (2026)

Parsimonious Learning-Augmented Online Metric Matching
par: Shin, Yongho, et autres
Publié: (2026)

Sublinear Algorithms for TSP via Path Covers
par: Behnezhad, Soheil, et autres
Publié: (2023)

Approximation Algorithms for Combinatorial Optimization with Predictions
par: Antoniadis, Antonios, et autres
Publié: (2024)

Approximation Algorithms for D-optimal Design
par: Singh, Mohit, et autres
Publié: (2018)

An Approximation Algorithm for Graph Label Selection
par: John, Josia, et autres
Publié: (2026)

Near-Optimal Bayesian Online Assortment of Reusable Resources
par: Feng, Yiding, et autres
Publié: (2025)

Fast and Efficient Matching Algorithm with Deadline Instances
par: Song, Zhao, et autres
Publié: (2023)

Online Algorithms with Limited Data Retention
par: Immorlica, Nicole, et autres
Publié: (2024)

Online Algorithms with Uncertainty-Quantified Predictions
par: Sun, Bo, et autres
Publié: (2023)

Improved Approximations for Hard Graph Problems using Predictions
par: Aamand, Anders, et autres
Publié: (2025)

A Simple Approximation Algorithm for Optimal Decision Tree
par: Zhuo, Zhengjia, et autres
Publié: (2025)

Learning-Augmented Online Bipartite Matching in the Random Arrival Order Model
par: Burathep, Kunanon, et autres
Publié: (2025)

A Tight Lower Bound for the Approximation Guarantee of Higher-Order Singular Value Decomposition
par: Fahrbach, Matthew, et autres
Publié: (2025)

Online Conversion with Switching Costs: Robust and Learning-Augmented Algorithms
par: Lechowicz, Adam, et autres
Publié: (2023)

Stochastic Matching via Local Sparsification
par: Ahmadian, Sara, et autres
Publié: (2026)

Learning-augmented Online Algorithm for Two-level Ski-rental Problem
par: Zhang, Keyuan, et autres
Publié: (2024)

Online Algorithms for Repeated Optimal Stopping: Balancing Baseline Guarantees and Regret
par: Harada, Tsubasa, et autres
Publié: (2025)

Online Search with Predictions: Pareto-optimal Algorithm and its Applications in Energy Markets
par: Lee, Russell, et autres
Publié: (2022)

Knowing When to Stop Matters: A Unified Algorithm for Online Conversion under Horizon Uncertainty
par: Wang, Yanzhao, et autres
Publié: (2025)

On Language Generation in the Limit with Bounded Memory
par: Kleinberg, Jon, et autres
Publié: (2026)

Learning-Augmented Online Bipartite Fractional Matching
par: Choo, Davin, et autres
Publié: (2025)

Faster Low-Rank Approximation and Kernel Ridge Regression via the Block-Nyström Method
par: Garg, Sachin, et autres
Publié: (2025)

Exact and Approximate Algorithms for Polytree Learning
par: Harviainen, Juha, et autres
Publié: (2026)

Sublinear Time Quantum Algorithm for Attention Approximation
par: Song, Zhao, et autres
Publié: (2026)

The Space Complexity of Approximating Logistic Loss
par: Dexter, Gregory, et autres
Publié: (2024)

Guessing Efficiently for Constrained Subspace Approximation
par: Bhaskara, Aditya, et autres
Publié: (2025)

Better Learning-Augmented Spanning Tree Algorithms via Metric Forest Completion
par: Veldt, Nate, et autres
Publié: (2026)

Online Classification with Predictions
par: Raman, Vinod, et autres
Publié: (2024)

Sharper Bounds for Chebyshev Moment Matching, with Applications
par: Musco, Cameron, et autres
Publié: (2024)

Finite Sample Bounds for Learning with Score Matching
par: Smedira, Devin, et autres
Publié: (2026)

Tradeoffs between Mistakes and ERM Oracle Calls in Online and Transductive Online Learning
par: Attias, Idan, et autres
Publié: (2025)