New Analysis and Algorithm for Learning with Drifting Distributions

DOI10.1007/978-3-642-34106-9_13zbMath1367.68236arXiv1205.4343OpenAlexW1805361780MaRDI QIDQ3164815

Mehryar Mohri, Andres Muñoz Medina

Publication date: 16 October 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.4343

zbMATH Keywords

generalization bounddomain adaptationdrifting environment

Mathematics Subject Classification ID

Asymptotic properties of nonparametric inference (62G20) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (9)

Generalization bounds for non-stationary mixing processes ⋮ Domain adaptation and sample bias correction theory and algorithm for regression ⋮ Handling concept drift via model reuse ⋮ Learning from Non-iid Data: Fast Rates for the One-vs-All Multiclass Plug-in Classifiers ⋮ Discrepancy-based theory and algorithms for forecasting non-stationary time series ⋮ Detecting virtual concept drift of regressors without ground truth values ⋮ Marginal singularity and the benefits of labels in covariate-shift ⋮ Adaptive transfer learning ⋮ A no-free-lunch theorem for multitask learning

This page was built for publication: New Analysis and Algorithm for Learning with Drifting Distributions