相关论文: A general learning algorithm for functions between…

It is often useful to perform integration over learned functions represented by neural networks. However, this integration is usually performed numerically, as analytical integration over learned functions (especially neural networks) is…

We present a deep learning approach for learning the joint semantic embeddings of images and captions in a Euclidean space, such that the semantic similarity is approximated by the L2 distances in the embedding space. For that, we introduce…

In this paper, we introduce a new class of implicit function to prove common fixed point theorems in fuzzy metric space. Moreover we define a new altering distance in terms of integral and utilize the same to deduce integral type…

The approximation of a general $d$-variate function $f$ by the shifts $\phi(\cdot-\xi)$, $\xi\in\Xi\subset \Rd$, of a fixed function $\phi$ occurs in many applications such as data fitting, neural networks, and learning theory. When…

Many applications, such as system identification, classification of time series, direct and inverse problems in partial differential equations, and uncertainty quantification lead to the question of approximation of a non-linear operator…

An algorithm for the systematic analytical approximation of multi-scale Feynman integrals is presented. The algorithm produces algebraic expressions as functions of the kinematical parameters and mass scales appearing in the Feynman…

We show how a metric space induces a linear functional (a "mean") on real-valued functions with domains in that metric space. This immediately induces a "relative" measure on a collection of subsets of the underlying set.

Motivated by the developing mathematics of deep learning, we build universal functions approximators of continuous maps between arbitrary Polish metric spaces $\mathcal{X}$ and $\mathcal{Y}$ using elementary functions between Euclidean…

Generic approximation of entire functions by their Pad\'{e} approximants has been achieved in the past (\cite{3}). In the present article we obtain generic approximation of holomorphic functions on arbitrary open sets by sequences of their…

Learning embedding functions, which map semantically related inputs to nearby locations in a feature space supports a variety of classification and information retrieval tasks. In this work, we propose a novel, generalizable and fast method…

Given functions $f,g: [n] \rightarrow [n]$ do there exist $n$ points $A_1,A_2\ldots A_n$ in some metric space such that $A_{f(i)},A_{g(i)}$ are the points closest and farthest from point $A_i$? In this paper we characterize precisely which…

We study feedforward neural networks with inputs from a topological space (TFNNs). We prove a universal approximation theorem for shallow TFNNs, which demonstrates their capacity to approximate any continuous function defined on this…

The function space of deep-learning machines is investigated by studying growth in the entropy of functions of a given error with respect to a reference function, realized by a deep-learning machine. Using physics-inspired methods we study…

Permutation resemblance measures the distance of a function from being a permutation. Here we show how to determine the permutation resemblance through linear integer programming techniques. We also present an algorithm for constructing…

In this paper we develop proximal methods for statistical learning. Proximal point algorithms are useful in statistics and machine learning for obtaining optimization solutions for composite functions. Our approach exploits closed-form…

We propose an efficient algorithm for learning mappings between two metric spaces, $\X$ and $\Y$. Our procedure is strongly Bayes-consistent whenever $\X$ and $\Y$ are topologically separable and $\Y$ is "bounded in expectation" (our term;…

One of the most fundamental problems in machine learning is to compare examples: Given a pair of objects we want to return a value which indicates degree of (dis)similarity. Similarity is often task specific, and pre-defined distances can…

Bregman divergences generalize measures such as the squared Euclidean distance and the KL divergence, and arise throughout many areas of machine learning. In this paper, we focus on the problem of approximating an arbitrary Bregman…

The aim of this paper is to to show the admissibility of some class of Frechet spaces (see Definition 2.3). In particular, this generalizes the main results of [3]. As an application, we show the admissibility of a large class modular…

In this paper, we present a novel two-stage metric learning algorithm. We first map each learning instance to a probability distribution by computing its similarities to a set of fixed anchor points. Then, we define the distance in the…