:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Chen, Peng, Zhao, Hailiang, Tang, Xueyan, Wang, Yixuan, Deng, Shuiguang
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Machine Learning
Online Access:	https://arxiv.org/abs/2606.01342
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Robust Learning-Augmented Dictionaries
by: Zeynali, Ali, et al.
Published: (2024)

Robust Learning with Optimal Error
by: Blanc, Guy
Published: (2026)

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

Learning-Augmented Hierarchical Clustering
by: Braverman, Vladimir, et al.
Published: (2025)

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

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

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

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

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

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

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

Learning-Augmented Frequent Directions
by: Aamand, Anders, et al.
Published: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Towards Efficient Contrastive PAC Learning
by: Shen, Jie
Published: (2025)

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

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

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

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