paper-with-me

Papers

Subspace Decomposition based DNN algorithm for elliptic-type multi-scale PDEs

2021-12-10 · Xi-An Li, Zhi-Qin John Xu, Lei Zhang

While deep learning algorithms demonstrate a great potential in scientific computing, its application to multi-scale problems remains to be a big challenge. This is manifested by the "frequency principle" that neural networks tend to learn low frequency components first. Novel architectures such as multi-scale deep neural network (MscaleDNN) were proposed to alleviate this problem to some extent. In this paper, we construct a subspace decomposition based DNN (dubbed SD$^2$NN) architecture for a class of multi-scale problems by combining traditional numerical analysis ideas and MscaleDNN algorithms. The proposed architecture includes one low frequency normal DNN submodule, and one (or a few) high frequency MscaleDNN submodule(s), which are designed to capture the smooth part and the oscillatory part of the multi-scale solutions, respectively. In addition, a novel trigonometric activation function is incorporated in the SD$^2$NN model. We demonstrate the performance of the SD$^2$NN architecture through several benchmark multi-scale problems in regular or irregular geometric domains. Numerical results show that the SD$^2$NN model is superior to existing models such as MscaleDNN.

📄 PDF Abstract BibTeX arXiv:2112.06660

Code (1)

Blue-Giant/SubspaceDNN_tf1 tf

Tasks

Vocal Bursts Type Prediction

Similar Papers 제목 키워드 기반

CUR Decompositions, Similarity Matrices, and Subspace Clustering

2017-11-11 · Akram Aldroubi, Keaton Hamm, Ahmet Bugra Koku, Ali Sekmen

A general framework for solving the subspace clustering problem using the CUR decomposition is presented. The CUR decomposition provides a natural way to construct similarity matrices for data that come from a union of u…

ClusteringMotion Segmentation

Learning Koopman Eigenfunctions and Invariant Subspaces from Data: Symmetric Subspace Decomposition

2020-02-22

This paper develops data-driven methods to identify eigenfunctions of the Koopman operator associated to a dynamical system and subspaces that are invariant under the operator. We build on Extended Dynamic Mode Decomposi…

A low-rank ensemble Kalman filter for elliptic observations

2022-03-10 · Mathieu Le Provost, Ricardo Baptista, Youssef Marzouk, Jeff D. Eldredge

We propose a regularization method for ensemble Kalman filtering (EnKF) with elliptic observation operators. Commonly used EnKF regularization methods suppress state correlations at long distances. For observations descr…

Computing linear sections of varieties: quantum entanglement, tensor decompositions and beyond

2022-12-07 · Nathaniel Johnston, Benjamin Lovitz, Aravindan Vijayaraghavan

We study the problem of finding elements in the intersection of an arbitrary conic variety in $\mathbb{F}^n$ with a given linear subspace (where $\mathbb{F}$ can be the real or complex field). This problem captures a ric…

Fast online low-rank tensor subspace tracking by CP decomposition using recursive least squares from incomplete observations

2017-09-29 · Hiroyuki Kasai

We consider the problem of online subspace tracking of a partially observed high-dimensional data stream corrupted by noise, where we assume that the data lie in a low-dimensional linear subspace. This problem is cast as…