Related papers: A constrained-transport magnetohydrodynamics algor…
We propose and analyse a novel, fully discrete numerical algorithm for the approximation of the generalised Stokes system forced by transport noise -- a prototype model for non-Newtonian fluids including turbulence. Utilising the Gradient…
We present a new high-order accurate computational fluid dynamics model based on the incompressible Navier-Stokes equations with a free surface for the accurate simulation of nonlinear and dispersive water waves in the time domain. The…
Gradient compression is of growing interests for solving constrained optimization problems including compressed sensing, noisy recovery and matrix completion under limited communication resources and storage costs. Convergence analysis of…
Neural network pruning is a widely used strategy for reducing model storage and computing requirements. It allows to lower the complexity of the network by introducing sparsity in the weights. Because taking advantage of sparse matrices is…
In this paper, we present a contraction-guided adaptive partitioning algorithm for improving interval-valued robust reachable set estimates in a nonlinear feedback loop with a neural network controller and disturbances. Based on an estimate…
Simulations of quantum transport in coherent conductors have evolved into mature techniques that are used in fields of physics ranging from electrical engineering to quantum nanoelectronics and material science. The most efficient…
Manifold learning is a central task in modern statistics and data science. Many datasets (cells, documents, images, molecules) can be represented as point clouds embedded in a high dimensional ambient space, however the degrees of freedom…
We describe a new algorithm to solve the time dependent, frequency integrated radiation transport (RT) equation implicitly, which is coupled to an explicit solver for equations of magnetohydrodynamics (MHD) using {\sf Athena++}. The…
We present 2D MHD numerical simulations of tearing-unstable current sheets coupled to a population of non-thermal test-particles, in order to address the problem of numerical convergence with respect to grid resolution, numerical method and…
Computing the optimal transport distance between statistical distributions is a fundamental task in machine learning. One remarkable recent advancement is entropic regularization and the Sinkhorn algorithm, which utilizes only matrix…
A high-fidelity finite volume scheme based on the BVD (boundary variation diminishing) concept is proposed in this study to solve the ideal magnetohydrodynamics (MHD) equations. A hybrid spatial reconstruction profile, consisting of a…
We propose an efficient algorithm for the recently published electron/hole-transfer Dynamical-weighted State-averaged Constrained CASSCF (eDSC/hDSC) method studying charge transfer states and D$_1$-D$_0$ crossings for systems with odd…
A novel algorithm is proposed to solve the sample-based optimal transport problem. An adversarial formulation of the push-forward condition uses a test function built as a convolution between an adaptive kernel and an evolving probability…
We introduce an architecture for variational quantum algorithms that can be efficiently trained via parameter updates along exact geodesics on the Riemannian state manifold. This features a parameter-optimal circuit ansatz which supersedes…
Minimizing finite sums of functions is a central problem in optimization, arising in numerous practical applications. Such problems are commonly addressed using first-order optimization methods. However, these procedures cannot be used in…
We study stochastic convex optimization under infinite noise variance. Specifically, when the stochastic gradient is unbiased and has uniformly bounded $(1+\kappa)$-th moment, for some $\kappa \in (0,1]$, we quantify the convergence rate of…
This paper presents a light-weight, high-quality texture synthesis algorithm that easily generalizes to other applications such as style transfer and texture mixing. We represent texture features through the deep neural activation vectors…
Entropic optimal transport (OT) and the Sinkhorn algorithm have made it practical for machine learning practitioners to perform the fundamental task of calculating transport distance between statistical distributions. In this work, we focus…
Many tasks in machine learning and signal processing can be solved by minimizing a convex function of a measure. This includes sparse spikes deconvolution or training a neural network with a single hidden layer. For these problems, we study…
We present a new algorithm for numerical magnetohydrodynamics on staggered meshes preserving $\nabla \cdot B = 0$. Our algorithm is based on the constrained transport method and supports both cell-based adaptive mesh refinement and temporal…