REVIEW 4 cited by
Continuous-in-Depth Neural Networks
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
read the original abstract
Recent work has attempted to interpret residual networks (ResNets) as one step of a forward Euler discretization of an ordinary differential equation, focusing mainly on syntactic algebraic similarities between the two systems. Discrete dynamical integrators of continuous dynamical systems, however, have a much richer structure. We first show that ResNets fail to be meaningful dynamical integrators in this richer sense. We then demonstrate that neural network models can learn to represent continuous dynamical systems, with this richer structure and properties, by embedding them into higher-order numerical integration schemes, such as the Runge Kutta schemes. Based on these insights, we introduce ContinuousNet as a continuous-in-depth generalization of ResNet architectures. ContinuousNets exhibit an invariance to the particular computational graph manifestation. That is, the continuous-in-depth model can be evaluated with different discrete time step sizes, which changes the number of layers, and different numerical integration schemes, which changes the graph connectivity. We show that this can be used to develop an incremental-in-depth training scheme that improves model quality, while significantly decreasing training time. We also show that, once trained, the number of units in the computational graph can even be decreased, for faster inference with little-to-no accuracy drop.
Forward citations
Cited by 4 Pith papers
-
Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimization
Two noise-tolerant, bound-constrained AdaGrad variants for multilevel and domain-decomposition problems are proved to find an epsilon-approximate critical point in O(epsilon^-2) iterations with high probability.
-
From Layers to States: A State Space Model Perspective to Deep Neural Network Layer Dynamics
S6LA adds a selective state space recurrence across the layers of CNNs and vision transformers, giving consistent accuracy gains on ImageNet classification and COCO detection and segmentation.
-
A manifold-aware Neural ODE surrogate model for stochastic induction heating with anisotropic electrical conductivity
A manifold-aware neural ODE surrogate reproduces Monte Carlo temperature statistics of stochastic induction heating, with conductivity scaling uncertainty dominating and Neural ODE integrators improving run-to-run rep...
-
Deep Learning with Self-Attention and Enhanced Preprocessing for Precise Diagnosis of Acute Lymphoblastic Leukemia from Bone Marrow Smears in Hemato-Oncology
A VGG19 network with added multi-head self-attention and focal loss reaches 99.25% accuracy for acute lymphoblastic leukemia diagnosis from bone marrow smears.
Discussion (0). Continue with ORCID to comment.