3 papers
cs.DS2026
Fast and Optimal Differentially Private Frequent-Substring Mining
Peaker Guo, Rayne Holland, Hao Wu
Given a dataset of user-contributed strings, each of length at most , a key problem is how to identify all frequent substrings while preserving each user's privacy. Recen…
cs.LG2025
Improved Approximations for Hard Graph Problems using Predictions
Anders Aamand, Justin Y. Chen, Siddharth Gollapudi +2
We design improved approximation algorithms for NP-hard graph problems by incorporating predictions (e.g., learned from past data). Our prediction model builds upon and extends the…
cs.LG2025
Learning-Augmented Frequent Directions
Anders Aamand, Justin Y. Chen, Siddharth Gollapudi +2
An influential paper of Hsu et al. (ICLR'19) introduced the study of learning-augmented streaming algorithms in the context of frequency estimation. A fundamental problem in the st…