一种用于加速大规模反问题的自编码器压缩方法
An autoencoder compression approach for accelerating large-scale inverse problems
AI总结:
本文提出一种基于自编码器的可扩展压缩方法,用于替代PDE约束反问题中的检查点和大内存存储,在地震反问题上验证了梯度和Hessian-向量积的接近理想加速,并成功扩展DIAS方法至大规模问题。
摘要:
PDE约束反问题是当今计算科学中最具挑战性和计算量最大的问题之一。为准确计算PDE解所需的精细网格会引入大量参数,并需要大规模计算资源,如更多的处理器和内存,才能在合理时间内求解此类系统。对于受时间相关PDE约束的反问题,通常用于高效计算梯度和高阶导数的伴随方法需要求解一个时间反演的所谓伴随PDE,该伴随PDE依赖于每个时间步的正向PDE解。这需要在每个时间步存储高维正向解向量。这一过程会迅速耗尽可用内存资源。为了缓解内存瓶颈,已有若干方法被提出,这些方法以额外计算换取更小的内存占用,包括检查点策略和压缩策略。在本工作中,我们提出一种接近理想的、可扩展的压缩方法,利用自编码器消除对检查点和大量内存存储的需求,从而同时减少求解时间和内存需求。我们将该方法与检查点策略以及一种现成的压缩方法在地球尺度的病态地震反问题上进行了比较。结果验证了使用所提出的自编码器压缩方法时,梯度和Hessian-向量积均获得了预期的接近理想加速。为突出所提方法的实用性,我们将自编码器压缩与数据驱动的主动子空间(DIAS)先验相结合,展示了DIAS方法如何能够以可负担的方式扩展到大规模问题,而无需检查点和大量内存。
英文摘要:
PDE-constrained inverse problems are some of the most challenging and computationally demanding problems in computational science today. Fine meshes that are required to accurately compute the PDE solution introduce an enormous number of parameters and require large scale computing resources such as more processors and more memory to solve such systems in a reasonable time. For inverse problems constrained by time dependent PDEs, the adjoint method that is often employed to efficiently compute gradients and higher order derivatives requires solving a time-reversed, so-called adjoint PDE that depends on the forward PDE solution at each timestep. This necessitates the storage of a high dimensional forward solution vector at every timestep. Such a procedure quickly exhausts the available memory resources. Several approaches that trade additional computation for reduced memory footprint have been proposed to mitigate the memory bottleneck, including checkpointing and compression strategies. In this work, we propose a close-to-ideal scalable compression approach using autoencoders to eliminate the need for checkpointing and substantial memory storage, thereby reducing both the time-to-solution and memory requirements. We compare our approach with checkpointing and an off-the-shelf compression approach on an earth-scale ill-posed seismic inverse problem. The results verify the expected close-to-ideal speedup for both the gradient and Hessian-vector product using the proposed autoencoder compression approach. To highlight the usefulness of the proposed approach, we combine the autoencoder compression with the data-informed active subspace (DIAS) prior to show how the DIAS method can be affordably extended to large scale problems without the need of checkpointing and large memory.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。