From Online to Non-i.i.d. Batch Learning
Yufei Tao, Shangqi Lu
摘要
This paper initializes the study of online-to-batch conversion when the samples in batch learning are not i.i.d. Our motivation originated from two facts. First, sample sets in reality are seldom i.i.d., thus preventing the application of the existing conversions. Second, the online model of learning permits an adversarial stream of samples that almost for sure violates the i.i.d. assumption, raising the possibility of adapting an online algorithm effectively to learn from a non-i.i.d. sample set. We present a set of techniques to utilize an online algorithm as a black box to perform batch learning in the absence of the i.i.d. assumption. Our techniques are generic, and are applicable to virtually any online algorithms on classification. This provides strong evidence that the great variety of known algorithms in the online-learning literature can indeed be harnessed to learn from sufficiently-representative non-i.i.d. samples.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它相关 Paper
- Optimistic Online-to-Batch Conversions for Accelerated Convergence and UniversalityYu-Hu Yan, Peng Zhao, Zhi-Hua ZhouNeurIPS 2025 · 被引用 1 次
- Online PAC-Bayes LearningMaxime Haddouche, Benjamin GuedjNeurIPS 2022 · 被引用 33 次
- Smoothed Online Classification can be Harder than Batch ClassificationVinod Raman, Unique Subedi, Ambuj TewariNeurIPS 2024 · 被引用 2 次
- Online Agnostic Boosting via Regret MinimizationNataly Brukhim, Xinyi Chen, Elad Hazan, Shay MoranNeurIPS 2020 · 被引用 16 次
- A General Method for Robust Learning from BatchesAyush Jain, Alon OrlitskyNeurIPS 2020 · 被引用 17 次
