Pith. sign in

REVIEW 9 cited by

The Elements of Differentiable Programming

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 2403.14606 v4 pith:GD443R52 submitted 2024-03-21 cs.LG cs.AIcs.PL

classification cs.LGcs.AIcs.PL
keywords differentiableprogrammingdifferentiationprogramsoptimizationcomputerincludingmaking
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Artificial intelligence has recently experienced remarkable advances, fueled by large models, vast datasets, accelerated hardware, and, last but not least, the transformative power of differentiable programming. This new programming paradigm enables end-to-end differentiation of complex computer programs (including those with control flows and data structures), making gradient-based optimization of program parameters possible. As an emerging paradigm, differentiable programming builds upon several areas of computer science and applied mathematics, including automatic differentiation, graphical models, optimization and statistics. This book presents a comprehensive review of the fundamental concepts useful for differentiable programming. We adopt two main perspectives, that of optimization and that of probability, with clear analogies between the two. Differentiable programming is not merely the differentiation of programs, but also the thoughtful design of programs intended for differentiation. By making programs differentiable, we inherently introduce probability distributions over their execution, providing a means to quantify the uncertainty associated with program outputs.

Discussion (0). Sign in to comment.

Forward citations

Cited by 9 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Co-design of ground-based gravitational wave detector networks

    astro-ph.IM 2026-07 conditional novelty 6.0 of 10

    A proof-of-concept ML pipeline co-designs two-site gravitational-wave detector networks, producing three example configurations with 15–44 km arms and BNS ranges up to 1160 Mpc.

  2. Alleviating prior dependencies for DESI DR1 clustering fits through reparameterization

    astro-ph.CO 2026-07 unverdicted novelty 6.0 of 10

    Jeffreys prior over EFTofLSS coefficients mitigates projection effects in DESI DR1 power spectrum multipole fits, recentering posteriors for late-time expansion parameters.

  3. Wall Shear Stress Reconstruction from Concentration: Differentiable Physics and Physics-Informed Neural Networks

    physics.flu-dyn 2026-06 unverdicted novelty 6.0 of 10

    Differentiable physics recovers accurate wall shear stress from concentration observations across measurement scenarios where PINNs fail.

  4. Autoregressive Language Models are Secretly Energy-Based Models: Insights into the Lookahead Capabilities of Next-Token Prediction

    cs.LG 2025-12 unverdicted novelty 6.0 of 10

    Under the chain rule of probability, autoregressive models and energy-based models are in exact bijection in function space, making the global optimum of teacher forcing equivalent to an energy-based model with implic...

  5. Learning long range dependencies through time reversal symmetry breaking

    cs.LG 2025-06 conditional novelty 6.0 of 10

    RHEL computes backpropagation-equivalent gradients for Hamiltonian recurrent networks using finite differences of time-reversed, nudged trajectories, and matches BPTT accuracy on sequence tasks up to 50k steps.

  6. Controlled Periodic Synchronization for Efficient Data-Parallel Training

    cs.DC 2026-07 conditional novelty 4.0 of 10

    Periodic gradient+parameter synchronization with SlowMo beats DDP by 2.44 pp (K=4) on a WAN while cutting average wall-clock time by 13.8%, but only under a fixed LR=0.1 protocol.

  7. ADSEQ: A delay-aware autograd-compatible framework for spike-event delivery in SNNs

    cs.NE 2025-12 reject novelty 4.0 of 10

    Delay-aware gradient-enabled spike-event queues are built in JAX and benchmarked on four accelerator platforms, showing queue choice strongly affects simulation and training performance.

  8. Learned iterative networks: An operator learning perspective

    eess.IV 2025-12 conditional novelty 3.0 of 10

    Learned iterative reconstruction networks can be uniformly described as operator learning: the unrolled architecture fixes how to compute while the loss and data fix what to compute; for nonlinear inverse problems the...

  9. Learning to Optimize by Differentiable Programming

    cs.MS 2026-01 unverdicted novelty 2.0 of 10

    A tutorial survey of differentiable-programming-based first-order optimization, with dual-based PyTorch case studies and no new results.

Pith tools