All Questions
Tagged with packing-and-covering fa.functional-analysis
8 questions
2
votes
0
answers
292
views
Covering/Bracketing number of monotone functions on $\mathbb{R}$ with uniformly bounded derivatives
I am interested in the $\| \cdot \|_{\infty}$-norm bracketing number or covering number of some collection of distribution functions on $\mathbb{R}$.
Let $\mathcal{F}$ consist of all distribution ...
1
vote
0
answers
448
views
Bound on covering number of Lipschitz functions – missing part in proofs of Kolmogorov et al
Given a metric space $(\mathcal{X},\rho)$ and $\mathcal{A}\subset\mathcal{X}$ totally bounded, i.e. $\mathcal{A}$ has a finite $\varepsilon$-covering for any $\varepsilon>0$. Consider $\...
3
votes
0
answers
171
views
Covering number $C^k$-balls in $C(\mathbb{R}^n)$
Fix a positive integer $n$ and and an non-negative integer $k$. The Arzela-Ascoli theorem guarantees that for a given positive integer $k$ and a given $L>0$ the set
$$
Ball_{C^{k,1}([0,1]^n)}(0,L)
...
13
votes
0
answers
818
views
Covering number estimates for Hölder balls
Let $\alpha \in (0,1]$, $r>0$ and $L>0$, and positive intwgers $n$ and $m$. The Arzela-Ascoli Theorem guarantees that the set $X(\alpha,L,r)$ of $f:[-1,1]^n\rightarrow [-r,r]^m$ with $\alpha$-...
2
votes
0
answers
553
views
$\ell_\infty$-norm covering number of RKHS ball $\{f\in\mathcal{H}: \|f\|_\mathcal{H} \leq R\}$
For any $\epsilon \in (0,1)$, let $N_\infty(\epsilon, \mathcal{H}, R)$ denote the $\epsilon$-covering number of the RKHS norm ball $\{f\in\mathcal{H}: \|f\|_\mathcal{H} \leq R\}$ with respect to the $\...
1
vote
1
answer
428
views
Growth rate of bounded Lipschitz functions on compact finite-dimensional space
Let $\mathcal X$ be a metric space of diameter $D$ and "dimension" (e.g doubling dimension) $d$. Let $L \in [0, \infty]$ and $M \in [0, \infty)$ and consider the class $\mathcal H_{M,L}$ of $L$-...
8
votes
2
answers
1k
views
VC dimension, fat-shattering dimension, and other complexity measures, of a class BV functions
I wish to show that a function which is "essentially constant" (defined shortly) can't be a good classifier (machine learning). For this i need to estimate the "complexity" of such a class of ...
2
votes
1
answer
1k
views
Packing number of Lipschitz functions
For some $L>0$ say ${\cal L}$ is the space of all $L-$Lipschitz functions mapping $(X,\rho) \rightarrow [0,1]$ where $(X,\rho)$ is a metric space.
For any $\alpha >0$ do we know of a ...