Pith. sign in

REVIEW 1 cited by

SAGIPS: A Scalable Asynchronous Generative Inverse Problem Solver

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 2407.00051 v1 pith:STW573RK submitted 2024-06-11 cs.DC

classification cs.DC
keywords underlineinverseproblemsagipssolvingalgorithmsapproachasynchronous
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Large scale, inverse problem solving deep learning algorithms have become an essential part of modern research and industrial applications. The complexity of the underlying inverse problem often poses challenges to the algorithm and requires the proper utilization of high-performance computing systems. Most deep learning algorithms require, due to their design, custom parallelization techniques in order to be resource efficient while showing a reasonable convergence. In this paper we introduces a \underline{S}calable \underline{A}synchronous \underline{G}enerative workflow for solving \underline{I}nverse \underline{P}roblems \underline{S}olver (SAGIPS) on high-performance computing systems. We present a workflow that utilizes a parallelization approach where the gradients of the generator network are updated in an asynchronous ring-all-reduce fashion. Experiments with a scientific proxy application demonstrate that SAGIPS shows near linear weak scaling, together with a convergence quality that is comparable to traditional methods. The approach presented here allows leveraging GANs across multiple GPUs, promising advancements in solving complex inverse problems at scale.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Toward an event-level analysis of hadron structure using differential programming

    hep-ph 2025-07 conditional novelty 4.0 of 10

    LOITS is a differentiable sampling method, demonstrated in a GAN closure test, that maps sampled events back to the parameters of a target density for event-level inference.

Pith tools