Imagen de Portada

Towards Optimal Robustness in Learning-Augmented Paging

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chen, Peng, Zhao, Hailiang, Tang, Xueyan, Wang, Yixuan, Deng, Shuiguang
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Robustifying Learning-Augmented Caching Efficiently without Compromising 1-Consistency
por: Chen, Peng, et al.
Publicado: (2025)

Learning-Augmented Algorithms for the Bahncard Problem
por: Zhao, Hailiang, et al.
Publicado: (2024)

Robust Learning-Augmented Dictionaries
por: Zeynali, Ali, et al.
Publicado: (2024)

Robust Learning with Optimal Error
por: Blanc, Guy
Publicado: (2026)

Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms
por: Angelopoulos, Spyros, et al.
Publicado: (2024)

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

Learning-Augmented Hierarchical Clustering
por: Braverman, Vladimir, et al.
Publicado: (2025)

Asymptotically Robust Learning-Augmented Algorithms for Preemptive FIFO Buffer Management
por: Hsieh, Wen-Han, et al.
Publicado: (2026)

Learning-Augmented Streaming Algorithms for Correlation Clustering
por: Dong, Yinhao, et al.
Publicado: (2025)

Optimal Algorithms for Augmented Testing of Discrete Distributions
por: Aliakbarpour, Maryam, et al.
Publicado: (2024)

Online Weighted Paging with Unknown Weights
por: Levy, Orin, et al.
Publicado: (2024)

On the Power of Learning-Augmented Search Trees
por: Chen, Jingbang, et al.
Publicado: (2022)

Optimal Prediction-Augmented Algorithms for Testing Independence of Distributions
por: Aliakbarpour, Maryam, et al.
Publicado: (2026)

Learning-Augmented Frequent Directions
por: Aamand, Anders, et al.
Publicado: (2025)

Learning-Augmented Moment Estimation on Time-Decay Models
por: Nagawanshi, Soham, et al.
Publicado: (2026)

Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust
por: Chen, Hongjie, et al.
Publicado: (2024)

Improved Robust Estimation for Erdős-Rényi Graphs: The Sparse Regime and Optimal Breakdown Point
por: Chen, Hongjie, et al.
Publicado: (2025)

Towards Optimal Differentially Private Regret Bounds in Linear MDPs
por: Sahu, Sharan
Publicado: (2025)

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

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

Learning-Augmented Algorithms with Explicit Predictors
por: Elias, Marek, et al.
Publicado: (2024)

Learning-Augmented Search Data Structures
por: Fu, Chunkai, et al.
Publicado: (2024)

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

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

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

Learning-Augmented Frequency Estimation in Sliding Windows
por: Shahout, Rana, et al.
Publicado: (2024)

Prediction-Specific Design of Learning-Augmented Algorithms
por: Li, Sizhe, et al.
Publicado: (2025)

Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap
por: Karpov, Nikolai, et al.
Publicado: (2025)

Decision-Theoretic Approaches for Improved Learning-Augmented Algorithms
por: Angelopoulos, Spyros, et al.
Publicado: (2025)

The Many Faces of Optimal Weak-to-Strong Learning
por: Høgsgaard, Mikael Møller, et al.
Publicado: (2024)

Collaborative Learning with Different Labeling Functions
por: Deng, Yuyang, et al.
Publicado: (2024)

Optimal Approximate Matrix Multiplication over Sliding Windows
por: Yao, Ziqi, et al.
Publicado: (2025)

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

Learning-Augmented Ski Rental with Discrete Distributions: A Bayesian Approach
por: Kang, Bosun, et al.
Publicado: (2025)

Towards Efficient Contrastive PAC Learning
por: Shen, Jie
Publicado: (2025)

Better Learning-Augmented Spanning Tree Algorithms via Metric Forest Completion
por: Veldt, Nate, et al.
Publicado: (2026)

Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High dimensions
por: Cheng, Kangke, et al.
Publicado: (2026)

Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
por: Braverman, Vladimir, et al.
Publicado: (2024)

Robust Mixture Learning when Outliers Overwhelm Small Groups
por: Dmitriev, Daniil, et al.
Publicado: (2024)

Differential Private Stochastic Optimization with Heavy-tailed Data: Towards Optimal Rates
por: Zhao, Puning, et al.
Publicado: (2024)