"Hey, that's not an ODE": Faster ODE Adjoints via Seminorms
Neural differential equations may be trained by backpropagating gradients via the adjoint method, which is another differential equation typically solved using an adaptive-step-size numerical differential equation solver. A proposed step is accepted if its error, \emph{relative to some norm}, is sufficiently small; else it is rejected, the step is shrunk, and the process is repeated. Here, we demonstrate that the particular structure of the adjoint equations makes the usual choices of norm (such as $L^2$) unnecessarily stringent. By replacing it with a more appropriate (semi)norm, fewer steps are unnecessarily rejected and the backpropagation is made faster. This requires only minor code modifications. Experiments on a wide range of tasks -- including time series, generative modeling, and physical control -- demonstrate a median improvement of 40% fewer function evaluations. On some problems we see as much as 62% fewer function evaluations, so that the overall training time is roughly halved.
Code (3)
Tasks
Time SeriesTime Series AnalysisSimilar Papers 제목 키워드 기반
Consensus Seminorms and their Applications
Consensus is a well-studied problem in distributed sensing, computation and control, yet deriving useful and easily computable bounds on the rate of convergence to consensus remains a challenge. We study the applications…
"Hey, that's not an ODE'": Faster ODE Adjoints with 12 Lines of Code
Neural differential equations may be trained by backpropagating gradients via the adjoint method, which is another differential equation typically solved using an adaptive-step-size numerical differential equation solver…
Time SeriesTime Series AnalysisG\'en\'erer une grammaire d'arbres adjoints pour l'arabe \`a partir d'une m\'eta-grammaire (Generate a tree adjoining grammar for arabic from a meta-grammar)
La raret{\'e} des ressources num{\'e}riques pour la langue arabe, telles que les grammaires et corpus, rend son traitement plus difficile que les autres langues naturelles. A ce jour il n{'}existe pas une grammaire forme…
Interface syntaxe-s\'emantique au moyen d'une grammaire d'arbres adjoints pour l'\'etiquetage s\'emantique de l'arabe (Syntax-semantic interface using Tree-adjoining grammar for Arabic semantic labeling)
Dans une grammaire formelle, le lien entre l{'}information s{\'e}mantique et sa structure syntaxique correspondante peut {\^e}tre {\'e}tabli en utilisant une interface syntaxe/s{\'e}mantique qui permettra la construction…
Combinatory Adjoints and Differentiation
We develop a compositional approach for automatic and symbolic differentiation based on categorical constructions in functional analysis where derivatives are linear functions on abstract vectors rather than being limite…