paper-with-me

홈 › Papers

Proximal Implicit ODE Solvers for Accelerating Learning Neural ODEs

2022-04-19 · Justin Baker, Hedi Xia, Yiwei Wang, Elena Cherkaev, Akil Narayan, Long Chen, Jack Xin, Andrea L. Bertozzi, Stanley J. Osher, Bao Wang

Learning neural ODEs often requires solving very stiff ODE systems, primarily using explicit adaptive step size ODE solvers. These solvers are computationally expensive, requiring the use of tiny step sizes for numerical stability and accuracy guarantees. This paper considers learning neural ODEs using implicit ODE solvers of different orders leveraging proximal operators. The proximal implicit solver consists of inner-outer iterations: the inner iterations approximate each implicit update step using a fast optimization algorithm, and the outer iterations solve the ODE system over time. The proximal implicit ODE solver guarantees superiority over explicit solvers in numerical stability and computational efficiency. We validate the advantages of proximal implicit solvers over existing popular neural ODE solvers on various challenging benchmark tasks, including learning continuous-depth graph neural networks and continuous normalizing flows.

📄 PDF Abstract BibTeX arXiv:2204.08621

Code (0)

등록된 구현이 없습니다.

Tasks

Computational Efficiency

Similar Papers 제목 키워드 기반

Proximal Algorithm Unrolling: Flexible and Efficient Reconstruction Networks for Single-Pixel Imaging

2025-05-29 · CVPR 2025 1 · Ping Wang, Lishun Wang, Gang Qu, Xiaodong Wang 외

Deep-unrolling and plug-and-play (PnP) approaches have become the de-facto standard solvers for single-pixel imaging (SPI) inverse problem. PnP approaches, a class of iterative algorithms where regularization is implicit…

Accelerating Dynamical System Simulations with Contracting and Physics-Projected Neural-Newton Solvers

2021-06-04 · Samuel Chevalier, Jochen Stiasny, Spyros Chatzivasileiadis

Recent advances in deep learning have allowed neural networks (NNs) to successfully replace traditional numerical solvers in many applications, thus enabling impressive computing gains. One such application is time domai…

Screening Rules for Lasso with Non-Convex Sparse Regularizers

2019-02-16 · Alain Rakotomamonjy, Gilles Gasso, Joseph Salmon

Leveraging on the convexity of the Lasso problem , screening rules help in accelerating solvers by discarding irrelevant variables, during the optimization process. However, because they provide better theoretical guaran…

Accelerating Legacy Numerical Solvers by Non-intrusive Gradient-based Meta-solving

2024-05-05 · Sohei Arisaka, Qianxiao Li

Scientific computing is an essential tool for scientific discovery and engineering design, and its computational cost is always a main concern in practice. To accelerate scientific computing, it is a promising approach t…

Meta-Learningscientific discovery

Deep Unfolding with Normalizing Flow Priors for Inverse Problems

2021-07-06 · Xinyi Wei, Hans van Gorp, Lizeth Gonzalez Carabarin, Daniel Freedman 외

Many application domains, spanning from computational photography to medical imaging, require recovery of high-fidelity images from noisy, incomplete or partial/compressed measurements. State of the art methods for solvi…

DeblurringDenoisingImage Denoising