Learning differentiable solvers for systems with hard constraints
원문 초록
We introduce a practical method to enforce partial differential equation (PDE) constraints for functions defined by neural networks (NNs), with a high degree of accuracy and up to a desired tolerance. We develop a differentiable PDE-constrained layer that can be incorporated into any NN architecture. Our method leverages differentiable optimization and the implicit function theorem to effectively enforce physical constraints. Inspired by dictionary learning, our model learns a family of functions, each of which defines a mapping from PDE parameters to PDE solutions. At inference time, the model finds an optimal linear combination of the functions in the learned family by solving a PDE-constrained optimization problem. Our method provides continuous solutions over the domain of interest that accurately satisfy desired physical constraints. Our results show that incorporating hard constraints directly into the NN architecture achieves much lower test error when compared to training on an unconstrained objective.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Decomposing MLP Activations into Interpretable Features via Semi-Nonnegative Matrix Factorization
Interpreting Large Text-to-Image Diffusion Models with Dictionary Learning
DB-KSVD: Scalable Alternating Optimization for Disentangling High-Dimensional Embedding Spaces
Modeling Musical Genre Trajectories through Pathlet Learning
Towards Understanding the Nature of Attention with Low-Rank Sparse Decomposition
Topological Dictionary Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.