Differentiable Programming
Overview
Differentiable programming studies how to compute gradients through programs so their parameters, inputs, or even algorithms can be optimized from data or objectives. Common approaches include automatic differentiation, adjoint and implicit differentiation through solvers, and smooth relaxations or custom gradient rules for discrete operations. These techniques are used in scientific simulation, robotics, inverse problems, and learnable optimization, where gradients can support calibration and end-to-end training. A central challenge is balancing useful, accurate gradients with computational cost and memory, especially for iterative solvers, hard constraints, and nonsmooth or discrete decisions.
Latest papers
47 papers2 papers in the last four weeks, down 67% on the four weeks before. 0.0% of all new papers.
KPPax: preprocess differentiable kinetic ODE for machine learning in atmospheric chemistry
diffrax library, so that exact sensitivities are obtained without hand-derived adjoint code. We demonstrate two applications with the POLLU benchmark mechanism. In the first, the Fisher information matrix computed from an automatically differentiated Jacobian predicts, before any fit, which of the 25 rate coefficients a flow-tube-like design can identify, and noisy synthetic estimation confirms the predicted uncertainties of the nine identifiable rate coefficients to within about 30% while revealing clusters of fast reactions of which only ratios are constrained. In the second, a neural-network correction of an emission inventory is trained offline on per-scenario 4D-Var retrievals and then fine-tuned online through the chemical model, which reduces the error of the biogenic correction by a factor of 2.4--5 and recovers information on low-temperature emissions that the individual retrievals lose. KPPax makes KPP mechanisms directly usable for parameter estimation and hybrid physics--machine-learning modelling.