On the complexity of learning from drifting distributions
type: Item
instance of: scholarly article
title: On the complexity of learning from drifting distributions
zbMATH Open document ID: 0887.68093
author: Rakesh D. Barve
author: Philip M. Long
published in: Information and Computation
publication date: 1998-05-25T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1097816
zbMATH Keywords: on-line learning
MaRDI profile type: Publication
full work available at URL: inco.1997.2656
OpenAlex ID: W2092714606
cites work: Q4004178
cites work: The hardness of approximate optima in lattices, codes, and systems of linear equations
cites work: Q4252716
cites work: Learning changing concepts by exploiting the structure of change
cites work: Q4013546
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: Prediction, learning, uniform convergence, and scale-sensitive dimensions
cites work: Present Position and Potential Developments: Some Personal Views: Statistical Theory: The Prequential Approach
cites work: Q4403756
cites work: A general lower bound on the number of examples needed for learning
cites work: Decision theoretic generalizations of the PAC model for neural net and other learning applications
cites work: Tracking drifting concepts by minimizing disagreements
cites work: Predicting \(\{ 0,1\}\)-functions on randomly drawn points
cites work: Tracking the best expert
cites work: The weighted majority algorithm
cites work: Probably Approximate Learning of Sets and Functions
cites work: Convergence of stochastic processes
cites work: Q5731904
cites work: On the density of families of sets
cites work: Sharper bounds for Gaussian and empirical processes
cites work: A theory of the learnable
cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
DOI: 10.1006/INCO.1997.2656
description: scientific article; zbMATH DE number 1097816