Poster "learning-augmented algorithms" Papers
16 papers found
Conference
A Learning-Augmented Dynamic Programming Approach for Orienteering Problem with Time Windows
Guansheng Peng, Lining Xing, Fuyan Ma et al.
NEURIPS 2025
Combinatorial Ski Rental Problem: Robust and Learning-Augmented Algorithms
Ziwei Li, Bo Sun, Zhiqiu Zhang et al.
NEURIPS 2025
Learning-Augmented Algorithms for $k$-median via Online Learning
Anish Hebbar, Rong Ge, Amit Kumar et al.
NEURIPS 2025
Learning-Augmented Online Bidding in Stochastic Settings
Spyros Angelopoulos, Bertrand Simon
NEURIPS 2025arXiv:2510.25582
Learning-Augmented Online Bipartite Fractional Matching
XianJun, Davin Choo, Billy Jin, Yongho Shin
NEURIPS 2025arXiv:2505.19252
Learning-Augmented Search Data Structures
Chunkai Fu, Brandon G. Nguyen, Jung Seo et al.
ICLR 2025arXiv:2402.10457
6
citations
Learning-Augmented Streaming Algorithms for Correlation Clustering
Yinhao Dong, Shan Jiang, Shi Li et al.
NEURIPS 2025arXiv:2510.10705
Minimalistic Predictions for Online Class Constraint Scheduling
Dorian Guyot, Alexandra Lassota
ICLR 2025
New Algorithms for the Learning-Augmented k-means Problem
Junyu Huang, Qilong Feng, Ziyun Huang et al.
ICLR 2025
1
citations
Online Multi-Class Selection with Group Fairness Guarantee
Faraz Zargari, Hossein Jazi, Lyndon Hallett et al.
NEURIPS 2025arXiv:2510.21055
Online Portfolio Selection with ML Predictions
Ziliang Zhang, Tianming Zhao, Albert Zomaya
NEURIPS 2025
Robustifying Learning-Augmented Caching Efficiently without Compromising 1-Consistency
Peng Chen, Hailiang Zhao, Jiaji Zhang et al.
NEURIPS 2025arXiv:2507.16242
Chasing Convex Functions with Long-term Constraints
Adam Lechowicz, Nicolas Christianson, Bo Sun et al.
ICML 2024arXiv:2402.14012
5
citations
Non-clairvoyant Scheduling with Partial Predictions
Ziyad Benomar, Vianney Perchet
ICML 2024arXiv:2405.01013
10
citations
Online bipartite matching with imperfect advice
Davin Choo, Themis Gouleakis, Chun Kai Ling et al.
ICML 2024arXiv:2405.09784
5
citations
Parsimonious Learning-Augmented Approximations for Dense Instances of $\mathcal{NP}$-hard Problems
Evripidis Bampis, Bruno Escoffier, Michalis Xefteris
ICML 2024arXiv:2402.02062
5
citations