相关论文: The VC-Dimension of Similarity Hypotheses Spaces

Let $X$ be a set and ${\mathcal H}$ a collection of functions from $X$ to $\{0,1\}$. We say that ${\mathcal H}$ shatters a finite set $C \subset X$ if the restriction of ${\mathcal H}$ yields every possible function from $C$ to $\{0,1\}$.…

Given a domain $X$ and a collection $\mathcal{H}$ of functions $h:X\to \{0,1\}$, the Vapnik-Chervonenkis (VC) dimension of $\mathcal{H}$ measures its complexity in an appropriate sense. In particular, the fundamental theorem of statistical…

It is shown that each continuous transformation $h$ from Euclidean $m$-space ($m>1$) into Euclidean $n$-space that preserves the equality of distances (that is, fulfils the implication $|x-y|=|z-w|\Rightarrow|h(x)-h(y)|=|h(z)-h(w)|$) is a…

Given a set $X$ and a collection ${\mathcal H}$ of functions from $X$ to $\{0,1\}$, the VC-dimension measures the complexity of the hypothesis class $\mathcal{H}$ in the context of PAC learning. In recent years, this has been connected to…

In this paper we define a new space, $LH(X,Y)$, consisting of functions $f\in X \subset Y$ (with $X,Y$ normed spaces) such that $\| f \|_X \equiv \| f \|_Y$ (where $\| \cdot \|_X$ is any norm on $X$, in general not the norm induced by $\|…

Measuring visual similarity is critical for image understanding. But what makes two images similar? Most existing work on visual similarity assumes that images are similar because they contain the same object instance or category. However,…

Let $G$ be a graph and $U\subset V(G)$ be a set of vertices. For each $v\in U$, let $h_v\colon U\to \{0, 1\}$ be the function defined by \[h_v(u)=\begin{cases} &1 ~\mbox{if}~u\sim v, u\in U\\&0 ~\mbox{if}~u\not\sim v, u\in U\end{cases},\]…

Asymptotic methods for hypothesis testing in high-dimensional data usually require the dimension of the observations to increase to infinity, often with an additional condition on its rate of increase compared to the sample size. On the…

Consider a class $\mH$ of binary functions $h: X\to\{-1, +1\}$ on a finite interval $X=[0, B]\subset \Real$. Define the {\em sample width} of $h$ on a finite subset (a sample) $S\subset X$ as $\w_S(h) \equiv \min_{x\in S} |\w_h(x)|$, where…

There are two definitions of the measurable functional on the topological vector space: as a linear and measurable real-valued function and as a pointwise limit of the sequence of the continious linear functionals. In general case they are…

Hyperdimensional (HD) computing is built upon its unique data type referred to as hypervectors. The dimension of these hypervectors is typically in the range of tens of thousands. Proposed to solve cognitive tasks, HD computing aims at…

Asymptotic methods for hypothesis testing in high-dimensional data usually require the dimension of the observations to increase to infinity, often with an additional relationship between the dimension (say, $p$) and the sample size (say,…

A good measure of similarity between data points is crucial to many tasks in machine learning. Similarity and metric learning methods learn such measures automatically from data, but they do not scale well respect to the dimensionality of…

The focus of this paper is the calculation of similarity between two concepts from an ontology for a Human-Like Interaction system. In order to facilitate this calculation, a similarity function is proposed based on five dimensions (sort,…

Given $s\in(1,2]$, define $$H_s[0,1]=\{f\in C[0,1]:{\dim}_HG_f([0,1])=s\}$$ and $$\overline{B}_s[0,1]=\{f\in C[0,1]:\overline{{\dim}}_BG_f([0,1])=s\}.$$ The main goal of this paper is to study the $(\alpha,\beta)$-lineability/spaceability…

We investigate integral representation of vector-valued function spaces, i.e., of subspaces $H\subset C(K,E)$, where $K$ is a compact space and $E$ is a (real or complex) Banach space. We point out that there are two possible ways of…

Let $\Delta_m$ be the standard $m$-dimensional simplex of non-negative $m+1$ tuples that sum to unity and let $S$ be a nonempty subset of $\Delta_m$. A real valued function $h$ defined on a convex subset of a real vector space is $S$-almost…

The classical ``$H=W$" theorem establishes the identity between two function spaces on an arbitrary nonempty open set in the Euclidean spaces: the space $W$ defined via weak derivatives, and the space $H$ defined as the closure of smooth…

Suppose that $f$ belongs to a suitably defined complete metric space $ {{\cal C}}^{{\alpha}}$ of H\"older $ {\alpha}$-functions defined on $[0,1]$. We are interested in whether one can find large (in the sense of Hausdorff, or lower/upper…

We prove that for all $s\in(0,d)$ and $c\in (0,1)$ there exists a self-similar set $E\subset \mathbb{R}^d$ with Hausdorff dimension $s$ such that $\mathcal{H}^s(E)=c|E|^s$. This answers a question raised by Zhiying Wen[16].