Related papers: Positive constrained approximation via RBF-based p…

Semi-lagrangian schemes for discretization of the dynamic programming principle are based on a time discretization projected on a state-space grid. The use of a structured grid makes this approach not feasible for high-dimensional problems…

The determination of exponentially stable equilibria and their basin of attraction for a dynamical system given by a general autonomous ordinary differential equation can be achieved by means of a contraction metric. A contraction metric is…

We derive stability estimates for three commonly used radial basis function (RBF) methods to solve hyperbolic time-dependent PDEs: the RBF generated finite difference (RBF-FD) method, the RBF partition of unity method (RBF-PUM) and Kansa's…

Kernel-based classification methods, particularly the support vector machine (SVM), are among the most common algorithms for hyperspectral data classification. The Radial Basis function (RBF) kernel has earned great popularity in…

Radial basis function generated finite-difference (RBF-FD) methods have recently gained popularity due to their flexibility with irregular node distributions. However, the convergence theories in the literature, when applied to nonuniform…

We present a generalization of the RBF-FD method that computes RBF-FD weights in finite-sized neighborhoods around the centers of RBF-FD stencils by introducing an overlap parameter $\delta \in [0,1]$ such that $\delta=1$ recovers the…

We study the problem of selecting the shape parameter in Radial Basis function (RBF) interpolation using leave-one-out-cross-validation (LOOCV). Since the classical LOOCV formula requires repeated solves with a dense $N \times N$ kernel…

In this paper two common collocation approaches based on radial basis functions have been considered; one be computed through the integration process (IRBF) and one be computed through the differentiation process (DRBF). We investigated the…

We study the problem of maximizing a monotone submodular function subject to a cardinality constraint $k$, with the added twist that a number of items $\tau$ from the returned set may be removed. We focus on the worst-case setting…

We present three new semi-Lagrangian methods based on radial basis function (RBF) interpolation for numerically simulating transport on a sphere. The methods are mesh-free and are formulated entirely in Cartesian coordinates, thus avoiding…

Radial Basis Function Networks (RBFNs) are used primarily to solve curve-fitting problems and for non-linear system modeling. Several algorithms are known for the approximation of a non-linear curve from a sparse data set by means of RBFNs.…

This study is motivated by the recent development in the fractional calculus and its applications. During last few years, several different techniques are proposed to localize the nonlocal fractional diffusion operator. They are based on…

Binary quadratic programming problems have attracted much attention in the last few decades due to their potential applications. This type of problems are NP-hard in general, and still considered a challenge in the design of efficient…

We propose an algorithm inspired by optical coherent Ising machines to solve the problem of polynomial unconstrained binary optimization (PUBO). We benchmark the proposed algorithm against existing PUBO algorithms on the extended…

The choice of the shape parameter highly effects the behaviour of radial basis function (RBF) approximations, as it needs to be selected to balance between ill-condition of the interpolation matrix and high accuracy. In this paper, we…

In this paper we relate the partition function to the max-statistics of random variables. In particular, we provide a novel framework for approximating and bounding the partition function using MAP inference on randomly perturbed models. As…

Our previously-developed calculational method (the partial wave cutoff method) is employed to evaluate explicitly scalar one-loop effective actions in a class of radially symmetric background gauge fields. Our method proves to be…

Conventionally, piecewise polynomials have been used in the boundary elements method (BEM) to approximate unknown boundary values. Since infinitely smooth radial basis functions (RBFs) are more stable and accurate than the polynomials for…

Approximation/interpolation from spaces of positive definite or conditionally positive definite kernels is an increasingly popular tool for the analysis and synthesis of scattered data, and is central to many meshless methods. For a set of…

Supervised fine-tuning (SFT) of foundation models often leads to poor generalization, where prior capabilities deteriorate after tuning on new tasks or domains. Inspired by trust-region policy optimization (TRPO) and proximal policy…