Learning from Snapshots of Discrete and Continuous Data Streams
Pramith Devulapalli, Steve Hanneke
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- Agnostic Continuous-Time Online LearningPramith Devulapalli, Changlong Wu, Ananth Grama, Wojciech SzpankowskiNeurIPS 2025 · 被引用 2 次
- AdaKoop: Efficient Modeling of Nonlinear Dynamics from Nonstationary Data Streams with Koopman Operator RegressionNaoki Chihara, Ren Fujiwara, Yasuko Matsubara, Yasushi SakuraiKDD 2026
相关 Paper
- Private Online Learning against an Adaptive Adversary: Realizable and Agnostic SettingsBo Li, Wei Wang, Peng YeNeurIPS 2025 · 被引用 2 次
- Adversarial laws of large numbers and optimal regret in online classificationNoga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran 等STOC 2021 · 被引用 23 次
- Tradeoffs between Mistakes and ERM Oracle Calls in Online and Transductive Online LearningIdan Attias, Steve Hanneke, Arvind RamaswamiNeurIPS 2025 · 被引用 1 次
- Online Learning in the Random-Order ModelMartino Bernasconi, Andrea Celli, Riccardo Colini-Baldeschi, Federico Fusco 等ICML 2025
- Optimal Mistake Bounds for Transductive Online LearningZachary Chase, Steve Hanneke, Shay Moran, Jonathan ShaferNeurIPS 2025 · 被引用 3 次
