Cover Image

Learning-Augmented Online Bipartite Fractional Matching

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Choo, Davin, Jin, Billy, Shin, Yongho
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Artificial Intelligence Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Online bipartite matching with imperfect advice
by: Choo, Davin, et al.
Published: (2024)

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

Online Allocation with Unknown Shared Supply
by: Neoh, Tzeh Yuan, et al.
Published: (2026)

Subset verification and search algorithms for causal DAGs
by: Choo, Davin, et al.
Published: (2023)

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

Adaptive Frontier Exploration on Graphs with Applications to Network-Based Disease Testing
by: Choo, Davin, et al.
Published: (2025)

Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model
by: Jin, Billy, et al.
Published: (2022)

On Tradeoffs in Learning-Augmented Algorithms
by: Benomar, Ziyad, et al.
Published: (2025)

Learning-Augmented Priority Queues
by: Benomar, Ziyad, et al.
Published: (2024)

Causal Discovery under Off-Target Interventions
by: Choo, Davin, et al.
Published: (2024)

Online Learning with Probing for Sequential User-Centric Selection
by: Xu, Tianyi, et al.
Published: (2025)

Self-Supervised Graph Learning via Spectral Bootstrapping and Laplacian-Based Augmentations
by: Bini, Lorenzo, et al.
Published: (2025)

Optimal Learning-Augmented Algorithm for Online Bidding
by: Lee, Changyeol, et al.
Published: (2026)

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach
by: Lee, Changyeol, et al.
Published: (2025)

Learning multivariate Gaussians with imperfect advice
by: Bhattacharyya, Arnab, et al.
Published: (2024)

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

Adaptive Multi-Round Allocation with Stochastic Arrivals
by: Pan, Yuqi, et al.
Published: (2026)

Optimizing Text Search: A Novel Pattern Matching Algorithm Based on Ukkonen's Approach
by: Guan, Xinyu, et al.
Published: (2025)

Online Rounding for Set Cover under Subset Arrivals
by: Byrka, Jarosław, et al.
Published: (2025)

PAC Learning is just Bipartite Matching (Sort of)
by: Dughmi, Shaddin
Published: (2025)

A Partition Cover Approach to Tokenization
by: Lim, Jia Peng, et al.
Published: (2025)

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

Individual Fairness under Varied Notions of Group Fairness in Bipartite Matching - One Framework to Approximate Them All
by: Panda, Atasi, et al.
Published: (2022)

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

Learning bounded-degree polytrees with known skeleton
by: Choo, Davin, et al.
Published: (2023)

Anytime-Constrained Reinforcement Learning
by: McMahan, Jeremy, et al.
Published: (2023)

Polynomial-Time Approximability of Constrained Reinforcement Learning
by: McMahan, Jeremy
Published: (2025)

Learning-Based Algorithms for Graph Searching Problems
by: DePavia, Adela Frances, et al.
Published: (2024)

Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning
by: Li, Dongyue, et al.
Published: (2025)

TurboQuant: Online Vector Quantization with Near-optimal Distortion Rate
by: Zandieh, Amir, et al.
Published: (2025)

An Algorithm for Learning Smaller Representations of Models With Scarce Data
by: de Wynter, Adrian
Published: (2020)

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

Learning-augmented smooth integer programs with PAC-learnable oracles
by: He, Hao-Yuan, et al.
Published: (2026)

Provably Learning from Modern Language Models via Low Logit Rank
by: Golowich, Noah, et al.
Published: (2025)

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

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

A short note about the learning-augmented secretary problem
by: Choo, Davin, et al.
Published: (2024)

AlgoSelect: Universal Algorithm Selection via the Comb Operator
by: Yao, Jasper
Published: (2025)

Streaming Attention Approximation via Discrepancy Theory
by: Kochetkova, Ekaterina, et al.
Published: (2025)