← Search

Antonios Antoniadis

7 accepted papers

2026

A Switching Framework for Online Interval Scheduling with Predictions

AAAI 2026technical

We study online interval scheduling in the irrevocable setting, where each interval must be immediately accepted or rejected upon arrival. The objective is to maximize the total length of accepted intervals while ensuring that no two accepted intervals overlap. We consider this problem in a learning

Cited by 0SourcePDFScholar
2025

Approximation algorithms for combinatorial optimization with predictions

ICLR 2025spotlight

We initiate a systematic study of utilizing predictions to improve over approximation guarantees of classic algorithms, without increasing the running time. We propose a generic method for a wide class of optimization problems that ask to select a feasible subset of input items of minimal (or maxima…

2023

Mixing Predictions for Online Metric Algorithms

ICML 2023poster

A major technique in learning-augmented online algorithms is combining multiple algorithms or predictors. Since the performance of each predictor may vary over time, it is desirable to use not the single best predictor as a benchmark, but rather a dynamic combination which follows different predicto…

Cited by 13SourcePDFScholar
2023

Paging with Succinct Predictions

ICML 2023poster

Paging is a prototypical problem in the area of online algorithms. It has also played a central role in the development of learning-augmented algorithms. Previous work on learning-augmented paging has investigated predictions on (i) when the current page will be requested again (reoccurrence predict…

Cited by 22SourcePDFScholar
2021

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds

NeurIPS 2021poster

We study the online problem of minimizing power consumption in systems with multiple power-saving states. During idle periods of unknown lengths, an algorithm has to choose between power-saving states of different energy consumption and wake-up costs. We develop a learning-augmented online algorithm…

2020

Online metric algorithms with untrusted predictions

ICML 2020poster

Machine-learned predictors, although achieving very good results for inputs resembling training data, cannot possibly provide perfect predictions in all situations. Still, decision-making systems that are based on such predictors need not only to benefit from good predictions but also to achieve a d…

2020

Secretary and Online Matching Problems with Machine Learned Advice

NeurIPS 2020poster

The classical analysis of online algorithms, due to its worst-case nature, can be quite pessimistic when the input instance at hand is far from worst-case. Often this is not an issue with machine learning approaches, which shine in exploiting patterns in past inputs in order to predict the future. H…

Cited by 136SourcePDFScholar