Pith. sign in

REVIEW 2 cited by

Forward Stability of ResNet and Its Variants

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 1811.09885 v1 pith:DW6MUH3E submitted 2018-11-24 cs.CV math.DS

classification cs.CVmath.DS
keywords resnetstabilityvariantsboundsnetworkresultsaccuracyarchitecture
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The residual neural network (ResNet) is a popular deep network architecture which has the ability to obtain high-accuracy results on several image processing problems. In order to analyze the behavior and structure of ResNet, recent work has been on establishing connections between ResNets and continuous-time optimal control problems. In this work, we show that the post-activation ResNet is related to an optimal control problem with differential inclusions, and provide continuous-time stability results for the differential inclusion associated with ResNet. Motivated by the stability conditions, we show that alterations of either the architecture or the optimization problem can generate variants of ResNet which improve the theoretical stability bounds. In addition, we establish stability bounds for the full (discrete) network associated with two variants of ResNet, in particular, bounds on the growth of the features and a measure of the sensitivity of the features with respect to perturbations. These results also help to show the relationship between the depth, regularization, and stability of the feature space. Computational experiments on the proposed variants show that the accuracy of ResNet is preserved and that the accuracy seems to be monotone with respect to the depth and various corruptions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. NeuPDE: Neural Network Based Ordinary and Partial Differential Equations for Modeling Time-Dependent Data

    cs.LG 2019-08 conditional novelty 6.0 of 10

    NeuPDE learns ODE/PDE models from data by parameterizing the differential equation's right-hand side with a neural network over monomial and derivative features.

  2. Understand the Effectiveness of Shortcuts through the Lens of DCA

    cs.LG 2024-12 reject novelty 5.0 of 10

    The paper claims that DCA, when applied to a vanilla network, yields residual-network-like updates, and introduces a new architecture NegNet as evidence.

Pith tools