Related papers: Definitions of distance function in radial basis f…
The distance geometry problem asks to find a realization of a given simple edge-weighted graph in a Euclidean space of given dimension K, where the edges are realized as straight segments of lengths equal (or as close as possible) to the…
In many robotics applications, it is necessary to compute not only the distance between the robot and the environment, but also its derivative - for example, when using control barrier functions. However, since the traditional Euclidean…
Signed distance functions (SDFs) is an attractive framework that has recently shown promising results for 3D shape reconstruction from images. SDFs seamlessly generalize to different shape resolutions and topologies but lack explicit…
A generalized fractional derivative (GFD) definition is proposed in this work. For a differentiable function that can be expanded by Taylor series, we show that D^Elafa*D^Beta f(t)=D^(Elafa+Beta)f(t). GFD is applied for some functions in…
Runge--Kutta (RK) methods are widely used techniques for solving a class of initial value problems. In this article, we introduce an adaptive multiquadratic (MQ) radial basis function (RBF)-based method to develop enhanced explicit RK…
One of the most popular methods employed in computational electromagnetics is the Finite Difference Time Domain (FDTD) method. We generalise it to a meshless setting using the Radial Basis Function generated Finite Difference (RBF-FD)…
The aim of this paper is to design the explicit radial basis function (RBF) Runge-Kutta methods for the initial value problem. We construct the two-, three- and four-stage RBF Runge-Kutta methods based on the Gaussian RBF Euler method with…
The purpose of this paper is to give a survey on the notions of distance between subsets either of a metric space or of a measure space, including definitions, a classification, and a discussion of the best-known distance functions, which…
Ridge functions have recently emerged as a powerful set of ideas for subspace-based dimension reduction. In this paper we begin by drawing parallels between ridge subspaces, sufficient dimension reduction and active subspaces, contrasting…
Image analysis frequently deals with shape estimation and image reconstruction. The ob jects of interest in these problems may be thought of as random sets, and one is interested in finding a representative, or expected, set. We consider a…
In this paper, we present a meshless hybrid method combining the Generalized Finite Difference (GFD) and Finite Difference based Radial Basis Function (RBF-FD) approaches to solve non-homogeneous partial differential equations (PDEs)…
We study a new class of distances between Radon measures similar to those studied in a recent paper of Dolbeault-Nazaret-Savar\'e [DNS]. These distances (more correctly pseudo-distances because can assume the value $+\infty$) are defined…
We propose a differential radial basis function (RBF) network termed RBF-DiffNet -- whose hidden layer blocks are partial differential equations (PDEs) linear in terms of the RBF -- to make the baseline RBF network robust to noise in…
In this paper, we show several bounds for the numerical radius of a Hilbert space operator in terms of the Euclidean operator norm. The obtained forms will enable us to find interesting refinements of celebrated results in the literature.…
Many statistical and machine learning approaches rely on pairwise distances between data points. The choice of distance metric has a fundamental impact on performance of these procedures, raising questions about how to appropriately…
Diffusion probabilistic models (DPMs) are widely adopted for their outstanding generative fidelity, yet their sampling is computationally demanding. Polynomial-based multistep samplers mitigate this cost by accelerating inference; however,…
The Euclidean distance geometry problem arises in a wide variety of applications, from determining molecular conformations in computational chemistry to localization in sensor networks. When the distance information is incomplete, the…
We consider the problem of estimating the distance, or range, between two locations by measuring the phase of a sinusoidal signal transmitted between the locations. This method is only capable of unambiguously measuring range within an…
This paper explores a novel connection between two areas: shape analysis of surfaces and unbalanced optimal transport. Specifically, we characterize the square root normal field (SRNF) shape distance as the pullback of the…
We introduce a notion of distance between supervised learning problems, which we call the Risk distance. This distance, inspired by optimal transport, facilitates stability results; one can quantify how seriously issues like sampling bias,…