Learning from Snapshots of Discrete and Continuous Data Streams
Pramith Devulapalli, Steve Hanneke
Abstract
Imagine a smart camera trap selectively clicking pictures to understand animal movement patterns within a particular habitat. These"snapshots", or pieces of data captured from a data stream at adaptively chosen times, provide a glimpse of different animal movements unfolding through time. Learning a continuous-time process through snapshots, such as smart camera traps, is a central theme governing a wide array of online learning situations. In this paper, we adopt a learning-theoretic perspective in understanding the fundamental nature of learning different classes of functions from both discrete data streams and continuous data streams. In our first framework, the update-and-deploy setting, a learning algorithm discretely queries from a process to update a predictor designed to make predictions given as input the data stream. We construct a uniform sampling algorithm that can learn with bounded error any concept class with finite Littlestone dimension. Our second framework, known as the blind-prediction setting, consists of a learning algorithm generating predictions independently of observing the process, only engaging with the process when it chooses to make queries. Interestingly, we show a stark contrast in learnability where non-trivial concept classes are unlearnable. However, we show that adaptive learning algorithms are necessary to learn sets of time-dependent and data-dependent functions, called pattern classes, in either framework. Finally, we develop a theory of pattern classes under discrete data streams for the blind-prediction setting.
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 0a5ff1b6-df45-4a99-bf24-57a1c4cdc303Cited by top-tier papers2
- Agnostic Continuous-Time Online LearningPramith Devulapalli, Changlong Wu, Ananth Grama, Wojciech SzpankowskiNeurIPS 2025 · 2 citations
- AdaKoop: Efficient Modeling of Nonlinear Dynamics from Nonstationary Data Streams with Koopman Operator RegressionNaoki Chihara, Ren Fujiwara, Yasuko Matsubara, Yasushi SakuraiKDD 2026
Related papers
- Private Online Learning against an Adaptive Adversary: Realizable and Agnostic SettingsBo Li, Wei Wang, Peng YeNeurIPS 2025 · 2 citations
- Adversarial laws of large numbers and optimal regret in online classificationNoga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran et al.STOC 2021 · 23 citations
- Tradeoffs between Mistakes and ERM Oracle Calls in Online and Transductive Online LearningIdan Attias, Steve Hanneke, Arvind RamaswamiNeurIPS 2025 · 1 citation
- Online Learning in the Random-Order ModelMartino Bernasconi, Andrea Celli, Riccardo Colini-Baldeschi, Federico Fusco et al.ICML 2025
- Optimal Mistake Bounds for Transductive Online LearningZachary Chase, Steve Hanneke, Shay Moran, Jonathan ShaferNeurIPS 2025 · 3 citations
