ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1802.03488
  4. Cited By
Generalization of an Upper Bound on the Number of Nodes Needed to
  Achieve Linear Separability

Generalization of an Upper Bound on the Number of Nodes Needed to Achieve Linear Separability

10 February 2018
Marjolein Troost
K. Seeliger
Marcel van Gerven
ArXivPDFHTML

Papers citing "Generalization of an Upper Bound on the Number of Nodes Needed to Achieve Linear Separability"

1 / 1 papers shown
Title
Neural Network with Unbounded Activation Functions is Universal
  Approximator
Neural Network with Unbounded Activation Functions is Universal Approximator
Sho Sonoda
Noboru Murata
67
336
0
14 May 2015
1