Constructive lower bounds on model complexity of shallow perceptron networks
Crossref DOI link: https://doi.org/10.1007/s00521-017-2965-0
Published Online: 2017-04-26
Published Print: 2018-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Kůrková, Věra http://orcid.org/0000-0002-8181-2128
Funding for this research was provided by:
Grantová Agentura České Republiky (GA15-18108S)
License valid from 2017-04-26