Excess Risk Bound for Deep Learning Under Weak Dependence

ABSTRACT This paper considers deep neural networks for learning weakly dependent processes in a general framework that includes, for instance, regression estimation, time series prediction, time series classification. The ‐weak dependence structure considered is quite large and covers other conditions such as mixing, association, and so on. Firstly, the approximation of smooth functions by deep neural networks with a broad class of activation functions is considered. We derive the required depth, width and sparsity of a deep neural network to approximate any Hölder smooth function, defined on any compact set . Secondly, we establish a bound of the excess risk for the learning of weakly dependent observations by deep neural networks. When the target function is sufficiently smooth, this bound is close to the usual .

Authors

Institutions

Publication Details

Journal
Mathematical Methods in the Applied Sciences
Published
2025-01-16
DOI
https://doi.org/10.1002/mma.10719
Citations
2
Primary Topic
Adversarial Robustness in Machine Learning
Type
article
Field-Weighted Citation Impact
4.96
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Excess Risk Bound for Deep Learning Under Weak Dependence

William Kengne
2 citations
Mathematical Methods in the Applied Sciences
Adversarial Robustness in Machine Learning
4.96
article

Excess Risk Bound for Deep Learning Under Weak Dependence

William Kengne
article en
2 citations

Abstract

ABSTRACT This paper considers deep neural networks for learning weakly dependent processes in a general framework that includes, for instance, regression estimation, time series prediction, time series classification. The ‐weak dependence structure considered is quite large and covers other conditions such as mixing, association, and so on. Firstly, the approximation of smooth functions by deep neural networks with a broad class of activation functions is considered. We derive the required depth, width and sparsity of a deep neural network to approximate any Hölder smooth function, defined on any compact set . Secondly, we establish a bound of the excess risk for the learning of weakly dependent observations by deep neural networks. When the target function is sufficiently smooth, this bound is close to the usual .

Mathematical Methods in the Applied SciencesVol. 48(6)
Université Claude Bernard Lyon 1 (FR), École Centrale de Lyon (FR), Centre National de la Recherche Scientifique (FR), Institut Camille Jordan (FR), Institut National des Sciences Appliquées de Lyon (FR), Université Jean Monnet (FR)
Openalex Percentile: Top 6%
Adversarial Robustness in Machine Learning
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.