paper-with-me

홈 › Papers

Kronecker-Factored Approximate Curvature for Physics-Informed Neural Networks

2024-05-24 · Felix Dangel, Johannes Müller, Marius Zeinhofer

Physics-informed neural networks (PINNs) are infamous for being hard to train. Recently, second-order methods based on natural gradient and Gauss-Newton methods have shown promising performance, improving the accuracy achieved by first-order methods by several orders of magnitude. While promising, the proposed methods only scale to networks with a few thousand parameters due to the high computational cost to evaluate, store, and invert the curvature matrix. We propose Kronecker-factored approximate curvature (KFAC) for PINN losses that greatly reduces the computational cost and allows scaling to much larger networks. Our approach goes beyond the established KFAC for traditional deep learning problems as it captures contributions from a PDE's differential operator that are crucial for optimization. To establish KFAC for such losses, we use Taylor-mode automatic differentiation to describe the differential operator's computation graph as a forward network with shared weights. This allows us to apply KFAC thanks to a recently-developed general formulation for networks with weight sharing. Empirically, we find that our KFAC-based optimizers are competitive with expensive second-order methods on small problems, scale more favorably to higher-dimensional neural networks and PDEs, and consistently outperform first-order methods and LBFGS.

📄 PDF Abstract BibTeX arXiv:2405.15603

Code (0)

등록된 구현이 없습니다.

Tasks

Second-order methods

Similar Papers 제목 키워드 기반

A Trace-restricted Kronecker-Factored Approximation to Natural Gradient

2020-11-21 · Kai-Xin Gao, Xiao-Lei Liu, Zheng-Hai Huang, Min Wang 외

Second-order optimization methods have the ability to accelerate convergence by modifying the gradient through the curvature matrix. There have been many attempts to use second-order optimization methods for training dee…

A Kronecker-factored approximate Fisher matrix for convolution layers

2016-02-03 · Roger Grosse, James Martens

Second-order optimization methods such as natural gradient descent have the potential to speed up training of neural networks by correcting for the curvature of the loss function. Unfortunately, the exact natural gradien…

Stochastic Optimization

SKFAC:Training Neural Networks with Faster Kronecker-Factored Approximate Curvature

2021-06-01 · Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition 2021 6 · Zedong Tang, Fenlong Jiang, Maoguo Gong, Hao Li 외

The bottleneck of computation burden limits the widespread use of the 2nd order optimization algorithms for training deep neural networks. In this paper, we present a computationally efficient approximation for natural g…

Dimensionality Reduction

Scalable trust-region method for deep reinforcement learning using Kronecker-factored approximation

2017-08-17 · NeurIPS 2017 12 · Yuhuai Wu, Elman Mansimov, Shun Liao, Roger Grosse 외

In this work, we propose to apply trust region optimization to deep reinforcement learning using a recently proposed Kronecker-factored approximation to the curvature. We extend the framework of natural policy gradient a…

Atari Gamescontinuous-controlContinuous ControlDeep Reinforcement Learning+4

SKFAC: Training Neural Networks With Faster Kronecker-Factored Approximate Curvature

2021-06-19 · CVPR 2021 1 · Zedong Tang, Fenlong Jiang, Maoguo Gong, Hao Li 외

The bottleneck of computation burden limits the widespread use of the 2nd order optimization algorithms for training deep neural networks. In this paper, we present a computationally efficient approximation for natur…

Dimensionality Reduction