Skip to content
  • enzuazua
  • Events Calendar
  • Jobs
cmc.deusto.eus
  • Home
  • About DeustoCCM
    • About DeustoCCM
    • Head of DeustoCCM
    • Team
    • Contact
    • Past Members
  • Research
    • Publications DeustoCCM
    • Projects
    • ERC CoDeFeL
      • CoDeFeL • WP1
      • CoDeFeL • WP2
      • CoDeFeL • WP3
      • CoDeFeL • WP4
      • CoDeFeL • GitHub
      • CoDeFeL • Blog
      • Industrial & Social Transference
    • DyCMaMod
    • Computational Mathematics Research Group
  • Activities
    • Events calendar
    • Seminars
    • Highlights
    • Our Latest
    • Courses
    • enzuazua
    • Past Events
    • Gallery
  • Partners
    • COST
    • FAU MoD
    • FAU MoD Members
    • FAU DCN-AVH
    • FAU DCN-AvH Team
    • Projects at FAU
    • FAU MoD Lectures
    • FAU MoD Courses / Workshops
    • Teaching
    • Academy
    • FAU Math and Research posts
    • FAU Initiatives
    • Contributors
    • FAU Past members
  • Jobs

Deep Neural Networks: Multi-Classification and Universal Approximation

M. Hernandez, E. Zuazua (2025)Deep Neural Networks: Multi-Classification and Universal Approximation arXiv:2409.06555

Abstract. We demonstrate that a ReLU deep neural network with a width of 2 and a depth of 2N+4M−1 layers can achieve finite sample memorization for any dataset comprising N elements in ℝd, where d≥1, and M classes, thereby ensuring accurate classification. By modeling the neural network as a time-discrete nonlinear dynamical system, we interpret the memorization property as a problem of simultaneous or ensemble controllability. This problem is addressed by constructing the network parameters inductively and explicitly, bypassing the need for training or solving any optimization problem. Additionally, we establish that such a network can achieve universal approximation in Lp(Ω;ℝ+), where Ω is a bounded subset of ℝd and p∈[1,∞), using a ReLU deep neural network with a width of d+1. We also provide depth estimates for approximating W1,p functions and width estimates for approximating Lp(Ω;ℝm) for m≥1. Our proofs are constructive, offering explicit values for the biases and weights involved.

arxiv: 2409.06555

  • IKTrace Seminar: The long and winding road to dementia: Exploring Alzheimer’s disease trajectories through mathematical modelling
  • DeustoCCM Seminar: On the existence of stationary solutions for certain systems of integro-differential equations with the double scale anomalous diffusion
  • DeustoCCM Seminar: Energy spectra for Light-Matter Interactions
  • NUS Colloquium Series: Machine Learning and Learning Systems by E. Zuazua
Copyright 2016 - 2026 DeustoCCM — cmc.deusto.eus. All rights reserved. Chair of Computational Mathematics, University of Deusto
Scroll to Top
  • Aviso Legal
  • Política de Privacidad
  • Política de Cookies
  • Configuración de Cookies
WE USE COOKIES ON THIS SITE TO ENHANCE USER EXPERIENCE. We also use analytics. By navigating any page you are giving your consent for us to set cookies.    more information
Privacidad