paper-with-me

Papers

Approximating smooth functions by deep neural networks with sigmoid activation function

2020-10-08 · Sophie Langer

We study the power of deep neural networks (DNNs) with sigmoid activation function. Recently, it was shown that DNNs approximate any $d$-dimensional, smooth function on a compact set with a rate of order $W^{-p/d}$, where $W$ is the number of nonzero weights in the network and $p$ is the smoothness of the function. Unfortunately, these rates only hold for a special class of sparsely connected DNNs. We ask ourselves if we can show the same approximation rate for a simpler and more general class, i.e., DNNs which are only defined by its width and depth. In this article we show that DNNs with fixed depth and a width of order $M^d$ achieve an approximation rate of $M^{-2p}$. As a conclusion we quantitatively characterize the approximation power of DNNs in terms of the overall weights $W_0$ in the network and show an approximation rate of $W_0^{-p/d}$. This more general result finally helps us to understand which network topology guarantees a special target accuracy.

📄 PDF Abstract BibTeX arXiv:2010.04596

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Sigmoid Activation 설명 없음

Similar Papers 제목 키워드 기반

Feature Qualification by Deep Nets: A Constructive Approach

2025-03-24 · Feilong Cao, Shao-Bo Lin

The great success of deep learning has stimulated avid research activities in verifying the power of depth in theory, a common consensus of which is that deep net are versatile in approximating and learning numerous func…

Hybrid activation functions for deep neural networks: S3 and S4 -- a novel approach to gradient flow optimization

2025-07-29 · Sergii Kavun arxiv

Activation functions are critical components in deep neural networks, directly influencing gradient flow, training stability, and model performance. Traditional functions like ReLU suffer from dead neuron problems, while…

Multi-class ClassificationBinary Classification

Achieving the Tightest Relaxation of Sigmoids for Formal Verification

2024-08-20 · Samuel Chevalier, Duncan Starkenburg, Krishnamurthy Dvijotham

In the field of formal verification, Neural Networks (NNs) are typically reformulated into equivalent mathematical programs which are optimized over. To overcome the inherent non-convexity of these reformulations, convex…

Smooth function approximation by deep neural networks with general activation functions

2019-06-17 · Ilsang Ohn, Yongdai Kim

There has been a growing interest in expressivity of deep neural networks. However, most of the existing work about this topic focuses only on the specific activation function such as ReLU or sigmoid. In this paper, we i…

General Classification

On ADMM in Deep Learning: Convergence and Saturation-Avoidance

2019-02-06 · Jinshan Zeng, Shao-Bo Lin, Yuan YAO, Ding-Xuan Zhou

In this paper, we develop an alternating direction method of multipliers (ADMM) for deep neural networks training with sigmoid-type activation functions (called \textit{sigmoid-ADMM pair}), mainly motivated by the gradie…

Deep Learning