Rademacher learning rates for iterated random functions

Most supervised learning methods assume training data is drawn from an i.i.d. sample. However, real-world problems often exhibit temporal dependence and strong correlations between marginals of the data-generating process, rendering the i.i.d. assumption unrealistic. Such cases naturally involve tim...

Full description

Bibliographic Details

Published in:	Journal of Complexity Vol. 91; p. 101971
Main Author:	Sandrić, Nikola
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.12.2025
Subjects:	Approximate empirical risk minimization algorithm Iterated random function Rademacher complexity Wasserstein distance Approximate empirical risk minimization algorithm 68W40 68T10 Rademacher complexity Wasserstein distance 60J05 Iterated random function
ISSN:	0885-064X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!