mlsanityData to 14 Oct 2026

Transductive and Learning-Augmented Online Regression

arXiv 2510.03917 ↗First posted 4 Oct 2025cs.LG cs.DScited by 0

Not on the map. Why?

Abstract (arXiv)

Motivated by the predictable nature of real-life in data streams, we study online regression when the learner has access to predictions about future examples. In the extreme case, called transductive online learning, the sequence of examples is revealed to the learner before the game begins. For this setting, we fully characterize the minimax expected regret in terms of the fat-shattering dimension, establishing a separation between transductive online regression and (adversarial) online regression. Then, we generalize this setting by allowing for noisy or imperfect predictions about future examples. Using our results for the transductive online setting, we develop an online learner whose minimax expected regret matches the worst-case regret, improves smoothly with prediction quality, and significantly outperforms the worst-case regret when future example predictions are precise, achieving performance similar to the transductive online learner. This enables learnability for previously unlearnable classes under predictable examples, aligning with the broader learning-augmented model paradigm.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 45 of its 79 references that are in the map. First posted on arXiv 4 Oct 2025.

Builds on

45 of 79 references.

References · 45

  1. 2013Intriguing properties of neural networkscited by 5,155
  2. 2018Competitive caching with machine learned advicecited by 195
  3. 2020Algorithms with Predictionscited by 153
  4. 2020The Primal-Dual method for Learning Augmented Algorithmscited by 80
  5. 2020Online metric algorithms with untrusted predictionscited by 75
  6. 2020Secretary and Online Matching Problems with Machine Learned Advicecited by 71
  7. 2024Improving Online Algorithms via ML Predictionscited by 66
  8. 2019A Model for Learned Bloom Filters, and Optimizing by Sandwichingcited by 64
  9. 2020Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online Algorithmscited by 64
  10. 2021Faster Matchings via Learned Dualscited by 56
  11. 2022Smoothed Online Learning is as Easy as Statistical Learningcited by 52
  12. 2020Smoothed Analysis of Online and Differentially Private Learningcited by 47
33 more
  1. 2017Learning Linear Dynamical Systems via Spectral Filteringcited by 46
  2. 2022Faster Fundamental Graph Algorithms via Learned Predictionscited by 42
  3. 2019Learning-Based Low-Rank Approximationscited by 41
  4. 2022Learning Augmented Binary Search Treescited by 31
  5. 2021Learning-Augmented k-means Clusteringcited by 26
  6. 2021Online Graph Algorithms with Predictionscited by 25
  7. 2022Learning Predictions for Algorithms with Predictionscited by 25
  8. 2022Online Algorithms with Multiple Predictionscited by 22
  9. 2022Customizing ML Predictions for Online Algorithmscited by 21
  10. 2020Learning the Positions in CountSketchcited by 20
  11. 2022Triangle and Four Cycle Counting with Predictions in Graph Streamscited by 20
  12. 2023Predictive Flows for Faster Ford-Fulkersoncited by 20
  13. 2023Multiclass Online Learning and Uniform Convergencecited by 19
  14. 2021Majorizing Measures, Sequential Complexities, and Online Learningcited by 17
  15. 2023Improved Learning-Augmented Algorithms for the Multi-Option Ski Rental Problem via Best-Possible Competitive Analysiscited by 16
  16. 2021Online Facility Location with Predictionscited by 14
  17. 2023A Trichotomy for Transductive Online Learningcited by 14
  18. 2021Uniform Bounds for Scheduling with Job Size Estimatescited by 12
  19. 2022A Regression Approach to Learning-Augmented Online Algorithmscited by 12
  20. 2021(Optimal) Online Bipartite Matching with Degree Informationcited by 11
  21. 2022Learning-Augmented Algorithms for Online Linear and Semidefinite Programmingcited by 11
  22. 2013Efficient Classification for Metric Datacited by 10
  23. 2022Improved Learning-augmented Algorithms for k-means and k-medians Clusteringcited by 10
  24. 2024Learning-Augmented Algorithms with Explicit Predictorscited by 8
  25. 2024Multiclass Transductive Online Learningcited by 8
  26. 2025Learning-Augmented Hierarchical Clusteringcited by 6
  27. 2021Fat-Shattering Dimension of k-fold Aggregationscited by 5
  28. 2022Learning-Augmented Private Algorithms for Multiple Quantile Releasecited by 5
  29. 2024Online Classification with Predictionscited by 5
  30. 2022Streaming Algorithms for Support-Aware Histogramscited by 4
  31. 2024Learning-Augmented Search Data Structurescited by 4
  32. 2025Distributionally-Constrained Adversaries in Online Learningcited by 3
  33. 2024On Approximability of ℓ22 Min-Sum Clusteringcited by 1

Built on by

Not cited yet.