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
45 papers3 papers in the last four weeks, down 50% on the four weeks before. 0.0% of all new papers.