Pith. sign in

REVIEW 1 cited by

Differentiable programming and its applications to dynamical systems

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 1912.08168 v2 pith:RLR5XZFN submitted 2019-12-17 math.DS cs.NE

classification math.DScs.NE
keywords differentiabledynamicalprogrammingsystemslearningapplicationsattentiondeep
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Differentiable programming is the combination of classical neural networks modules with algorithmic ones in an end-to-end differentiable model. These new models, that use automatic differentiation to calculate gradients, have new learning capabilities (reasoning, attention and memory). In this tutorial, aimed at researchers in nonlinear systems with prior knowledge of deep learning, we present this new programming paradigm, describe some of its new features such as attention mechanisms, and highlight the benefits they bring. Then, we analyse the uses and limitations of traditional deep learning models in the modeling and prediction of dynamical systems. Here, a dynamical system is meant to be a set of state variables that evolve in time under general internal and external interactions. Finally, we review the advantages and applications of differentiable programming to dynamical systems.

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. What You See is Not What You Get: Neural Partial Differential Equations and The Illusion of Learning

    cs.LG 2024-11 conditional novelty 6.0 of 10

    NeuralPDEs trained on finite-difference simulation data inherit the discretization's Taylor-series truncation error, so generalization depends on matching numerical schemes between the solver and the model.

Pith tools