mlsanityData to 14 Oct 2026

Source-to-Source Automatic Differentiation of OpenMP Parallel Loops

arXiv 2111.01861 ↗First posted 2 Nov 2021cs.MS cs.LG cs.PFcited by 1

Not on the map. Why?

Abstract (arXiv)

This paper presents our work toward correct and efficient automatic differentiation of OpenMP parallel worksharing loops in forward and reverse mode. Automatic differentiation is a method to obtain gradients of numerical programs, which are crucial in optimization, uncertainty quantification, and machine learning. The computational cost to compute gradients is a common bottleneck in practice. For applications that are parallelized for multicore CPUs or GPUs using OpenMP, one also wishes to compute the gradients in parallel. We propose a framework to reason about the correctness of the generated derivative code, from which we justify our OpenMP extension to the differentiation model. We implement this model in the automatic differentiation tool Tapenade and present test cases that are differentiated following our extended differentiation procedure. Performance of the generated derivative programs in forward and reverse mode is better than sequential, although our reverse mode often scales worse than the input programs.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 1 of its 31 references that are in the map. First posted on arXiv 2 Nov 2021.

Builds on

1 of 31 references.

References · 1

  1. 2019Automatic Differentiation for Adjoint Stencil Loopscited by 1

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.