Related papers: A New Selection Operator for the Discrete Empirica…
Modern machine learning systems based on neural networks have shown great success in learning complex data patterns while being able to make good predictions on unseen data points. However, the limited interpretability of these systems…
Quantum Approximate Optimization Algorithm (QAOA) is a promising quantum heuristic with empirical evidence of speedup over classical state-of-the-art for some problems. QAOA uses a parameterized circuit with $p$ layers, where higher $p$…
We present a multigrid iterative algorithm for solving a system of coupled free boundary problems for pricing American put options with regime-switching. The algorithm is based on our recently developed compact finite difference scheme…
Discrete diffusion language models improve generation efficiency through parallel token prediction, but standard $X_0$ prediction methods introduce factorization errors by approximating the clean token posterior with independent token-wise…
Only a few numerical methods can treat boundary value problems on polygonal and polyhedral meshes. The BEM-based Finite Element Method is one of the new discretization strategies, which make use of and benefits from the flexibility of these…
In this paper, we present an approach to enhance interpolation and approximation error estimates. Based on a previously derived first-order Taylor-like formula, we demonstrate its applicability in improving the $P_1$-interpolation error…
We consider a family of linear systems $A_\mu \alpha=C$ with system matrix $A_\mu$ depending on a parameter $\mu$ and for simplicity parameter-independent right-hand side $C$. These linear systems typically result from the…
This work proposes a hyper-reduction method for nonlinear parametric dynamical systems characterized by gradient fields such as Hamiltonian systems and gradient flows. The gradient structure is associated with conservation of invariants or…
We propose UPOQA, a derivative-free optimization algorithm for partially separable unconstrained problems, leveraging quadratic interpolation and a structured trust-region framework. By decomposing the objective into element functions,…
Common model selection criteria, such as $AIC$ and its variants, are based on in-sample prediction error estimators. However, in many applications involving predicting at interpolation and extrapolation points, in-sample error cannot be…
The calculation of potential energy surfaces for quantum dynamics can be a time consuming task -- especially when a high level of theory for the electronic structure calculation is required. We propose an adaptive interpolation algorithm…
This paper introduces the hierarchical interpolative factorization for elliptic partial differential equations (HIF-DE) in two (2D) and three dimensions (3D). This factorization takes the form of an approximate generalized LU/LDL…
The primary objective of this study is to develop novel interpolation operators that interpolate the boundary values of a function defined on a triangle. This is accomplished by constructing New Generalized Boolean sum neural network…
In this paper, we consider signal interpolation of discrete-time signals which are decimated nonuniformly. A conventional interpolation method is based on the sampling theorem, and the resulting system consists of an ideal filter with…
Iterative refinement -- start with a random guess, then iteratively improve the guess -- is a useful paradigm for representation learning because it offers a way to break symmetries among equally plausible explanations for the data. This…
In this note we present an alternative way to obtain optimal interpolation operators for two-grid methods applied to Hermitian positive definite linear systems. Falgout and Vassilevski in [SIAM J. Numer. Anal, 42 (2004), pp. 1669-1693] and…
High-throughput approximations of quantum mechanics calculations and combinatorial experiments have been traditionally used to reduce the search space of possible molecules, drugs and materials. However, the interplay of structural and…
We present a new and general framework for convolutional neural network operations on spherical (or omnidirectional) images. Our approach represents the surface as a graph of connected points that doesn't rely on a particular sampling…
In this paper, a new algebraic soft-decision decoding algorithm for Reed-Solomon code is presented. It is based on rational interpolation and the interpolation points are constructed by Berlekamp-Messay algorithm. Unlike the traditional…
This paper is focused on the double-grid integration with interpolation-projection (DoGIP), which is a novel matrix-free discretisation method of variational formulations introduced for Fourier--Galerkin approximation. Here, it is described…