Pith. sign in

REVIEW 1 cited by

Deeper or Wider: A Perspective from Optimal Generalization Error with Sobolev Loss

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.00152 v6 pith:JXEAKVLL submitted 2024-01-31 cs.LG cs.NAmath.NAstat.ML

classification cs.LGcs.NAmath.NAstat.ML
keywords neuralnetworksnumberdeeperlossnetworkwiderarchitecture
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Constructing the architecture of a neural network is a challenging pursuit for the machine learning community, and the dilemma of whether to go deeper or wider remains a persistent question. This paper explores a comparison between deeper neural networks (DeNNs) with a flexible number of layers and wider neural networks (WeNNs) with limited hidden layers, focusing on their optimal generalization error in Sobolev losses. Analytical investigations reveal that the architecture of a neural network can be significantly influenced by various factors, including the number of sample points, parameters within the neural networks, and the regularity of the loss function. Specifically, a higher number of parameters tends to favor WeNNs, while an increased number of sample points and greater regularity in the loss function lean towards the adoption of DeNNs. We ultimately apply this theory to address partial differential equations using deep Ritz and physics-informed neural network (PINN) methods, guiding the design of neural networks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Quasilinear Algorithm for Computing Higher-Order Derivatives of Deep Feed-Forward Neural Networks

    cs.LG 2024-12 conditional novelty 4.0 of 10

    A new forward-pass algorithm computes exact n-th derivatives of deep networks in time linear in network size, avoiding repeated autodifferentiation.

Pith tools