Related papers: A multiresolution algorithm to approximate the Hut…
In this paper, we present a novel approach to approximate the gain function of the feedback particle filter (FPF). The exact gain function is the solution of a Poisson equation involving a probability-weighted Laplacian. The numerical…
An infinite iterated function system (IIFS) is a countable collection of contraction maps on a compact metric space. In this paper we study the conditions under which the attractor of a such system admits a parameterization by a continuous…
We investigate whether the Hutchinson operator associated with the iterated function system (IFS) is continuous. It clarifies several partial results scattered across recent literature. While the main example for IFS with strict attractor…
For a multi-attribute decision making (MADM) problem, the information of alternatives under different attributes is given in the form of intuitionistic fuzzy number(IFN). Intuitionistic fuzzy set (IFS) plays an important role in dealing…
In a previous paper, dealing with "Applications in $\mathbb{R}^1$," the authors developed a new approach to the computation of the Hausdorff dimension of the invariant set of an iterated function system or IFS and studied some applications…
We propose a nonparametric density estimator based on the Gaussian process (GP) and derive three novel closed form learning algorithms based on Fisher divergence (FD) score matching. The density estimator is formed by multiplying a base…
We provide physics-inspired derivations of a number of algorithms for computing the permanent of a matrix. In particular we formulate the computation of the permanent as a Grassmann integral that may be viewed as an interacting many-fermion…
Iterated function systems (IFSs) are one of the most important tools for building examples of fractal sets exhibiting some kind of `approximate self-similarity'. Examples include self-similar sets, self-affine sets etc. A beautiful variant…
Approximate inference in probability models is a fundamental task in machine learning. Approximate inference provides powerful tools to Bayesian reasoning, decision making, and Bayesian deep learning. The main goal is to estimate the…
We propose and analyze an algorithm to approximate distribution functions and densities of perpetuities. Our algorithm refines an earlier approach based on iterating discretized versions of the fixed point equation that defines the…
We present low-scaling algorithms for $GW$ and constrained random phase approximation based on a symmetry-adapted interpolative separable density fitting (ISDF) procedure that incorporates the space-group symmetries of crystalline systems.…
Iterative Proportional Fitting (IPF), combined with EM, is commonly used as an algorithm for likelihood maximization in undirected graphical models. In this paper, we present two iterative algorithms that generalize upon IPF. The first one…
Feature selection is an important tool to deal with high dimensional data. In unsupervised case, many popular algorithms aim at maintaining the structure of the original data. In this paper, we propose a simple and effective feature…
The Hartree-Fock-Bogoliubov approximation is very useful for treating both long- and short-range correlations in finite quantum fermion systems, but it must be extended in order to describe detailed spectroscopic properties. One problem is…
We study infinite graph-directed iterated function systems (GIFS) whose underlying graph is not strongly connected and has countably many vertices and edges. In addition to a summability condition for the physical potential, we provide…
We study fast approximation of integrals with respect to stationary probability measures associated to iterated functions systems on the unit interval. We provide an algorithm for approximating the integrals under certain conditions on the…
In this paper, we investigate the Hausdorff dimension of the invariant measures of the iterated function system (IFS) $\{\alpha x, \beta x, \gamma x+(1-\gamma)\}$. We provide an "almost every" type result by a direct application of the…
The Jeffreys divergence is a renown symmetrization of the oriented Kullback-Leibler divergence broadly used in information sciences. Since the Jeffreys divergence between Gaussian mixture models is not available in closed-form, various…
We study the concept of a code (or shift) space for a generalized iterated function system (GIFS in short). We prove that relations between GIFSs and their code spaces are analogous to the case of classical IFSs. As an application, we…
Our aim is to find a complex continued fraction algorithm finding all the best Diophantine approximations to a complex number. Using the sequence of minimal vectors in a two dimensional lattice over Gaussian integers, we obtain an algorithm…