Learning from Snapshots of Discrete and Continuous Data Streams
Not on the map. Why?
Abstract (arXiv)
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 textitupdate-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.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 7 of its 16 references that are in the map. First posted on arXiv 8 Dec 2024.
Builds on
7 of 16 references.
References · 7
- 2015Online Learning with Feedback Graphs: Beyond Banditscited by 80
- 2019An Information-Theoretic Approach to Minimax Regret in Partial Monitoringcited by 42
- 2013An efficient algorithm for learning with semi-bandit feedbackcited by 21
- 2015Efficient and Parsimonious Agnostic Active Learningcited by 17
- 2023List Online Classificationcited by 16
- 2022Minimax Regret for Partial Monitoring: Infinite Outcomes and Rustichini's Regretcited by 14
- 2024The Dimension of Self-Directed Learningcited by 4
Built on by
Citing papers per year: 2026: 2.
2 papers.