From Online to Non-i.i.d. Batch Learning
Yufei Tao, Shangqi Lu
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 85c5c560-697a-4819-b521-de1d3d24e693Cited by top-tier papers1
Ask how each one uses itRelated papers
- Optimistic Online-to-Batch Conversions for Accelerated Convergence and UniversalityYu-Hu Yan, Peng Zhao, Zhi-Hua ZhouNeurIPS 2025 · 1 citation
- Online PAC-Bayes LearningMaxime Haddouche, Benjamin GuedjNeurIPS 2022 · 33 citations
- Smoothed Online Classification can be Harder than Batch ClassificationVinod Raman, Unique Subedi, Ambuj TewariNeurIPS 2024 · 2 citations
- Online Agnostic Boosting via Regret MinimizationNataly Brukhim, Xinyi Chen, Elad Hazan, Shay MoranNeurIPS 2020 · 16 citations
- A General Method for Robust Learning from BatchesAyush Jain, Alon OrlitskyNeurIPS 2020 · 17 citations
