Excess risk bound for deep learning under weak dependence

William Kengne
2/15/2023
stat.MLcs.LG

No confident code implementation found for this paper.

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,$\ldots$ 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 $\mx$. 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 $\mathcal{O}(n^{-1/2})$.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kengne2023excess,
  title  = {Excess risk bound for deep learning under weak dependence},
  author = {William Kengne},
  year   = {2023},
  eprint = {2302.07503},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.07503v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2302.07503.svg)](https://codeofpaper.com/paper/2302.07503)

Discussion