loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Joaquim Marques de Sá 1 ; Fernando Sereno 2 and Luís Alexandre 3

Affiliations: 1 INEB – Instituto de Engenharia Biomédica; Faculdade de Engenharia da Universidade do Porto/DEEC, Portugal ; 2 Escola Superior de Educação, Portugal ; 3 Universidade da Beira Interior, Portugal

Abstract: Several authors have theoretically determined distribution-free bounds on sample complexity. Formulas based on several learning paradigms have been presented. However, little is known on how these formulas perform and compare with each other in practice. To our knowledge, controlled experimental results using these formulas, and comparing of their behavior, have not so far been presented. The present paper represents a contribution to filling up this gap, providing experimentally controlled results on how simple perceptrons trained by gradient descent or by the support vector approach comply with these bounds in practice.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.231.55.243

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Marques de Sá, J.; Sereno, F. and Alexandre, L. (2004). Neural Network Learning: Testing Bounds on Sample Complexity. In Proceedings of the 4th International Workshop on Pattern Recognition in Information Systems (ICEIS 2004) - PRIS; ISBN 972-8865-01-5, SciTePress, pages 196-201. DOI: 10.5220/0002653301960201

@conference{pris04,
author={Joaquim {Marques de Sá}. and Fernando Sereno. and Luís Alexandre.},
title={Neural Network Learning: Testing Bounds on Sample Complexity},
booktitle={Proceedings of the 4th International Workshop on Pattern Recognition in Information Systems (ICEIS 2004) - PRIS},
year={2004},
pages={196-201},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002653301960201},
isbn={972-8865-01-5},
}

TY - CONF

JO - Proceedings of the 4th International Workshop on Pattern Recognition in Information Systems (ICEIS 2004) - PRIS
TI - Neural Network Learning: Testing Bounds on Sample Complexity
SN - 972-8865-01-5
AU - Marques de Sá, J.
AU - Sereno, F.
AU - Alexandre, L.
PY - 2004
SP - 196
EP - 201
DO - 10.5220/0002653301960201
PB - SciTePress