mlsanityData to 14 Oct 2026

asdex: Automatic Sparse Differentiation in JAX

arXiv 2610.12336 ↗First posted 8 Oct 2026cs.MS cs.LG cs.NAcited by 0

Not on the map. Why?

Abstract (arXiv)

Many tasks in scientific computing and machine learning require the Jacobian or Hessian matrix of a function. Automatic differentiation (AD) computes these derivatives to machine precision, but materializing a dense m × n Jacobian requires n forward-mode or m reverse-mode AD passes, one per column or row. For a large class of functions, each output depends on only a few inputs, making the derivative matrix sparse. Automatic sparse differentiation (ASD) exploits this structure in four steps: detection of the input-agnostic sparsity pattern, coloring of a graph to group columns or rows that can share an AD pass, compressed differentiation to compute a compressed derivative matrix with one AD pass per color, and finally decompression into the original sparsity pattern. The number of colors, and hence of AD passes, is often independent of the problem dimension: a banded Jacobian with b contiguous bands, for instance, only ever requires b colors, regardless of its size. asdex offers the first standalone ASD toolkit in the popular JAX ecosystem. With textttasdex.jacobian and textttasdex.hessian, it provides sparse drop-in replacements for textttjax.jacobian and textttjax.hessian.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 1 of its 20 references that are in the map. First posted on arXiv 8 Oct 2026.

Builds on

1 of 20 references.

References · 1

  1. 2024The Elements of Differentiable Programmingcited by 43

Built on by

Not cited yet.