Cover Image

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Coşa, Matei Gabriel, Eliáš, Marek
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Data Structures and Algorithms 68W40 (Primary), 68T05 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
by: Hommelsheim, Felix
Published: (2025)

Convergence of the QuickVal Residual
by: Fill, James Allen, et al.
Published: (2024)

A $4/3$ Approximation for $2$-Vertex-Connectivity
by: Bosch-Calvo, Miguel, et al.
Published: (2023)

A $5/4$-Approximation for Two-Edge Connectivity
by: Bosch-Calvo, Miguel, et al.
Published: (2024)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
by: Friggstad, Zachary, et al.
Published: (2018)

Fundamentals of Partial Rejection Sampling
by: Jerrum, Mark
Published: (2021)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
by: Buchbinder, Niv, et al.
Published: (2024)

Building a Nest by an Automaton
by: Czyzowicz, Jurek, et al.
Published: (2019)

On the on-line coloring of unit interval graphs with proper interval representation
by: Curbelo, Israel R., et al.
Published: (2024)

Online Trading as a Secretary Problem Variant
by: Chen, Xujin, et al.
Published: (2026)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
by: Mundhra, S.
Published: (2025)

Shortest Paths without a Map, but with an Entropic Regularizer
by: Bubeck, Sébastien, et al.
Published: (2022)

A scalable clustering algorithm to approximate graph cuts
by: Suchan, Leo, et al.
Published: (2023)

The Distributional Tail of Worst-Case Quickselect
by: Płecha, Witold
Published: (2026)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
by: Grobben, Kobe, et al.
Published: (2025)

Exact Algorithms for MaxCut on Split Graphs
by: Lalovic, Marko
Published: (2024)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
by: Buchbinder, Niv, et al.
Published: (2024)

An Analysis of Optimizer Choice on Energy Efficiency and Performance in Neural Network Training
by: Almog, Tom
Published: (2025)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
by: Sopp, Braeden, et al.
Published: (2026)

A simple Path-based LP Relaxation for Directed Steiner Tree
by: Pashkovich, Kanstantsin, et al.
Published: (2026)

The Exchange Problem
by: Garg, Mohit, et al.
Published: (2024)

Improved Regret Guarantees for Online Mirror Descent using a Portfolio of Mirror Maps
by: Gupta, Swati, et al.
Published: (2026)

Credal Bayesian Deep Learning
by: Caprio, Michele, et al.
Published: (2023)

How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)

Strengths and Limitations of Greedy in Cup Games
by: Jasińska, Kalina, et al.
Published: (2026)

Incremental-Decremental Maximization
by: Disser, Yann, et al.
Published: (2025)

Fast FPT Algorithms for Grundy Number on Dense Graphs
by: Nezhad, Sina Ghasemi, et al.
Published: (2024)

On the Average-Case Performance of Greedy for Maximum Coverage
by: Balkanski, Eric, et al.
Published: (2026)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
by: Hougardy, Stefan, et al.
Published: (2025)

Strongly Sublinear Algorithms for Testing Pattern Freeness
by: Newman, Ilan, et al.
Published: (2021)

Zero-free regions of partition functions with applications to algorithms and graph limits
by: Regts, Guus
Published: (2015)

Algorithms Transcending the SAT-Symmetry Interface
by: Anders, Markus, et al.
Published: (2023)

On the near-tightness of $χ\leq 2r$: a general $σ$-ary construction and a binary case via LFSRs
by: Date, Vinicius T. V., et al.
Published: (2025)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
by: Chen, Zongchen, et al.
Published: (2022)

Structured Decompositions: Structural and Algorithmic Compositionality
by: Bumpus, Benjamin Merlin, et al.
Published: (2022)

Improved Approximation Algorithms for the Expanding Search Problem
by: Griesbach, Svenja M., et al.
Published: (2023)

Residual Prophet Inequalities
by: Correa, Jose, et al.
Published: (2025)

Naively Sorting Evolving Data is Optimal and Robust
by: Giakkoupis, George, et al.
Published: (2024)

Resident fitness computation in linear time and other algorithmic aspects of interacting trajectories
by: Friedl, Katalin, et al.
Published: (2025)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
by: Michel, Stefan
Published: (2025)