Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 31 min ago
PreprintCC BY 4.0arXiv

Implicit Target Shift in Online Learning: Characterization and Correction

Abstract

Online learning from a stream of data is a defining feature of intelligence, yet modern machine learning systems often struggle in this setting, especially under distributional shift. To understand its basic properties, we study the relationship between online and offline learning in the context of kernel regression by deriving a closed-form expression for the function learned by online kernel regression. We reveal that online kernel regression is equivalent to offline regression with shifted, inaccurate target outputs. Conversely, we show that by compensating for this implicit target shift in the teaching signal through target correction, online kernel-based learning can provably learn the same predictor as its offline counterpart. We derive both a closed-form expression for this target correction and an iterative form that can be applied sequentially. Applying this framework to continual image classification tasks on domain-incremental Split CIFAR-10 and CORe50, we show that online stochastic gradient descent with iteratively corrected targets outperforms learning with the true targets. This work therefore provides a basic framework for analyzing and improving online learning in non-stationary environments from the perspective of implicit target shift.

Related

  1. Reference-State Bootstrap Correction and Kernel Characterization of Residual-Based Fit Indices in Structural Equation Models
    Eunjeong Song, Sehee Hong
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  2. Estimating Implicit Regularization in Deep Learning
    Joseph H. Rudoler, Kevin Tan, Giles Hooker +1
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  3. Online Packet Scheduling with Deadlines and Learning
    Gianmarco Genalti, Achraf Azize, Vianney Perchet
    HALPreprintLicence not statedGeneral mathematicsHAL
  4. Online tensor learning: Computational and statistical trade-offs, adaptivity and optimal regret
    Jingyang Li, Jian‐Feng Cai, Yang Chen +1
    The Annals of StatisticsPeer-reviewedLicence not statedFull text16 citedNumerical analysis & scientific computingOpenAlex
  5. Meta-LinEXP3: Online-within-Online Learning for Adversarial Linear Contextual Bandits
    Hao Li, Jie Xu, Zheng Xie
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
BibTeX
@misc{li2026implicit,
  title = {{Implicit Target Shift in Online Learning: Characterization and Correction}},
  author = {Ziyan Li and Naoki Hiratani},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2605.07886},
  eprint = {2605.07886},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2605.07886},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Implicit Target Shift in Online Learning: Characterization and Correction
AU  - Ziyan Li
AU  - Naoki Hiratani
PY  - 2026
DA  - 2026/10/02
PB  - arXiv
DO  - 10.48550/arxiv.2605.07886
UR  - https://arxiv.org/abs/2605.07886
AB  - Online learning from a stream of data is a defining feature of intelligence, yet modern machine learning systems often struggle in this setting, especially under distributional shift. To understand its basic properties, we study the relationship between online and offline learning in the context of kernel regression by deriving a closed-form expression for the function learned by online kernel regression. We reveal that online kernel regression is equivalent to offline regression with shifted, inaccurate target outputs. Conversely, we show that by compensating for this implicit target shift in the teaching signal through target correction, online kernel-based learning can provably learn the same predictor as its offline counterpart. We derive both a closed-form expression for this target correction and an iterative form that can be applied sequentially. Applying this framework to continual image classification tasks on domain-incremental Split CIFAR-10 and CORe50, we show that online stochastic gradient descent with iteratively corrected targets outperforms learning with the true targets. This work therefore provides a basic framework for analyzing and improving online learning in non-stationary environments from the perspective of implicit target shift.
ER  -