SearcharxivSearch

arXiv subjects

Jan Vybíral

Publications and source records attributed to Jan Vybíral.

At least 19 recordsLinked to original sources

Higher-order derivatives of radially symmetric functions

We prove a surprisingly simple pointwise formula for the Frobenius norm of the tensor of $n$-th order partial derivatives of a radially symmetric function $f(x)=g(r(x))$. Using the iterations of the differential operator $\mathcal{D} g(r)=g'(r)/r$, we avoid technical difficulties usually caused by higher-order radial derivatives. As a consequence, we obtain a complete characterization of the subspace of radially symmetric functions in both inhomogeneous and homogeneous Sobolev spaces of arbitrarily high order and all integrability parameters $p\in [1,\infty).$ Furthermore, the pointwise nature of our approach allows us to obtain similar results also for Sobolev-type spaces built upon more general Banach lattices.

math.FA

Bases of Lebesgue spaces formed by neural networks

The seminal work of Daubechies, DeVore, Foucart, Hanin, and Petrova introduced in 2022 a sequence of univariate piece-wise linear functions, which resemble the classical Fourier basis and which, at the same time, can be easily reproduced by artificial neural networks with ReLU activation function. We give an alternative way how to calculate the inner products of functions from this system and discuss the spectral properties of the Gram matrix generated by this system. The univariate system was later generalized to the multivariate setting by two of the authors of this work. Instead of the usual tensor product construction, this generalization relied on the inner products inside of the argument of the univariate sequence. It turned out that such a system forms a Riesz basis of $L_2(0,1)^n$ for every $n\ge 1$ with Riesz constants independent of $n$. In this work, we investigate the properties of these new sequences of functions in $L_q(0,1)^n$ for $q\not =2.$ First, we show that the univariate system is a Schauder basis in $L_q(0,1)$ for every $1<q<\infty$. By a general argument, it follows that the tensor products of this system also form a Schauder basis in $L_q(0,1)^n$ for every $n\ge 2$ and $1<q<\infty.$ The same fact can also be shown by measuring the distance of the tensor product system to the classical multivariate Fourier basis, but - surprisingly - this argument only works for $n\le 3$. If, on the other hand, we replace the outer tensor products by inner products directly in the argument of the univariate system, the same approach is applicable for an arbitrary dimension $n\in{\mathbb N}.$

math.FA

Lower bounds on the minimal dispersion of point sets via cover-free families

We elaborate on the intimate connection between the largest volume of an empty axis-parallel box in a set of $n$ points from $[0,1]^d$ and cover-free families from the extremal set theory. This connection was discovered in a recent paper of the authors. In this work, we apply a very recent result of Michel and Scott to obtain a whole range of new lower bounds on the number of points needed so that the largest volume of such a box is bounded by a given $\varepsilon$. Surprisingly, it turns out that for each of the new bounds, there is a choice of the parameters $d$ and $\varepsilon$ such that the bound outperforms the others.

math.CO

Entropy numbers of finite-dimensional Lorentz space embeddings

The sequence of entropy numbers quantifies the degree of compactness of a linear operator acting between quasi-Banach spaces. We determine the asymptotic behavior of entropy numbers in the case of natural embeddings between finite-dimensional Lorentz spaces $\ell_{p,q}^n$ in all regimes; our results are sharp up to constants. This generalizes classical results obtained by Schütt (in the case of Banach spaces) and Edmunds and Triebel, Kühn, as well as Guédon and Litvak (in the case of quasi-Banach spaces) for entropy numbers of identities between finte-dimensional Lebesgue sequence spaces $\ell_p^n$. We employ techniques such as interpolation, volume comparison as well as techniques from sparse approximation and combinatorial arguments. Further, we characterize entropy numbers of embeddings between finite-dimensional symmetric quasi-Banach spaces in terms of best $s$-term approximation numbers.

math.FA

A tight lower bound on the minimal dispersion

We give a new lower bound for the minimal dispersion of a point set in the unit cube and its inverse function in the high dimension regime. This is done by considering only a very small class of test boxes, which allows us to reduce bounding the dispersion to a problem in extremal set theory. Specifically, we translate a lower bound on the size of $r$-cover-free families to a lower bound on the inverse of the minimal dispersion of a point set. The lower bound we obtain matches the recently obtained upper bound on the minimal dispersion up to logarithmic terms.

math.NA

A multivariate Riesz basis of ReLU neural networks

We consider the trigonometric-like system of piecewise linear functions introduced recently by Daubechies, DeVore, Foucart, Hanin, and Petrova. We provide an alternative proof that this system forms a Riesz basis of $L_2([0,1])$ based on the Gershgorin theorem. We also generalize this system to higher dimensions $d>1$ by a construction, which avoids using (tensor) products. As a consequence, the functions from the new Riesz basis of $L_2([0,1]^d)$ can be easily represented by neural networks. Moreover, the Riesz constants of this system are independent of $d$, making it an attractive building block regarding future multivariate analysis of neural networks.

cs.IT

Robust and Resource Efficient Identification of Shallow Neural Networks by Fewest Samples

We address the structure identification and the uniform approximation of sums of ridge functions $f(x)=\sum_{i=1}^m g_i(a_i\cdot x)$ on ${\mathbb R}^d$, representing a general form of a shallow feed-forward neural network, from a small number of query samples. Higher order differentiation, as used in our constructive approximations, of sums of ridge functions or of their compositions, as in deeper neural network, yields a natural connection between neural network weight identification and tensor product decomposition identification. In the case of the shallowest feed-forward neural network, second order differentiation and tensors of order two (i.e., matrices) suffice as we prove in this paper. We use two sampling schemes to perform approximate differentiation - active sampling, where the sampling points are universal, actively, and randomly designed, and passive sampling, where sampling points were preselected at random from a distribution with known density. Based on multiple gathered approximated first and second order differentials, our general approximation strategy is developed as a sequence of algorithms to perform individual sub-tasks. We first perform an active subspace search by approximating the span of the weight vectors $a_1,\dots,a_m$. Then we use a straightforward substitution, which reduces the dimensionality of the problem from $d$ to $m$. The core of the construction is then the stable and efficient approximation of weights expressed in terms of rank-$1$ matrices $a_i \otimes a_i$, realized by formulating their individual identification as a suitable nonlinear program. We prove the successful identification by this program of weight vectors being close to orthonormal and we also show how we can costructively reduce to this case by a whitening procedure, without loss of any generality.

stat.ML

Lower Bounds for the Error of Quadrature Formulas for Hilbert Spaces

We prove lower bounds for the worst case error of quadrature formulas that use given sample points $\X_n = \{ x_1, \dots , x_n \}$. We are mainly interested in optimal point sets $\X_n$, but also prove lower bounds that hold with high probability for sets of independently and uniformly distributed points. As a tool, we use a recent result (and extensions thereof) of Vybíral on the positive semi-definiteness of certain matrices related to the product theorem of Schur. The new technique also works for spaces of analytic functions where known methods based on decomposable kernels cannot be applied.

math.NA

Gelfand numbers of embeddings of Schatten classes

Let $0<p,q\leq \infty$ and denote by $\mathcal{S}_p^N$ and $\mathcal{S}_q^N$ the corresponding Schatten classes of real $N\times N$ matrices. We study the Gelfand numbers of natural identities $\mathcal{S}_p^N\hookrightarrow \mathcal{S}_q^N$ between Schatten classes and prove asymptotically sharp bounds up to constants only depending on $p$ and $q$. This extends classical results for finite-dimensional $\ell_p$ sequence spaces by E. Gluskin to the non-commutative setting and complements bounds previously obtained by B. Carl and A. Defant, A. Hinrichs and C. Michels, and J. Chávez-Domínguez and D. Kutzarova.

math.FA

A variant of Schur's product theorem and its applications

We show the following version of the Schur's product theorem. If $M=(M_{j,k})_{j,k=1}^n\in{\mathbb R}^{n\times n}$ is a positive semidefinite matrix with all entries on the diagonal equal to one, then the matrix $N=(N_{j,k})_{j,k=1}^n$ with the entries $N_{j,k}=M_{j,k}^2-\frac{1}{n}$ is positive semidefinite. As a corollary of this result, we prove the conjecture of E. Novak on intractability of numerical integration on a space of trigonometric polynomials of degree at most one in each variable. Finally, we discuss also some consequences for Bochner's theorem, covariance matrices of $χ^2$-variables, and mean absolute values of trigonometric polynomials. -- Please, have a look into page 6 of the preprint "Lower Bounds for the Error of Quadrature Formulas for Hilbert Spaces" for a discussion of the relation of Theorem 1 and Corollary 2 to Gegenbauer polynomials (pointed out by Dmitriy Bilyk (University of Minnesota)). --

math.NA

On the volume of unit balls of finite-dimensional Lorentz spaces

We study the volume of unit balls $B^n_{p,q}$ of finite-dimensional Lorentz sequence spaces $\ell_{p,q}^n.$ We give an iterative formula for ${\rm vol}(B^n_{p,q})$ for the weak Lebesgue spaces with $q=\infty$ and explicit formulas for $q=1$ and $q=\infty.$ We derive asymptotic results for the $n$-th root of ${\rm vol}(B^n_{p,q})$ and show that $[{\rm vol}(B^n_{p,q})]^{1/n}\approx n^{-1/p}$ for all $0<p<\infty$ and $0<q\le\infty.$ We study further the ratio between the volume of unit balls of weak Lebesgue spaces and the volume of unit balls of classical Lebesgue spaces. We conclude with an application of the volume estimates and characterize the decay of the entropy numbers of the embedding of the weak Lebesgue space $\ell_{1,\infty}^n$ into $\ell_1^n.$

math.FA

Deterministic constructions of high-dimensional sets with small dispersion

The dispersion of a point set $P\subset[0,1]^d$ is the volume of the largest box with sides parallel to the coordinate axes, which does not intersect $P$. Here, we show a construction of low-dispersion point sets, which can be deduced from solutions of certain $k$-restriction problems, which are well-known in coding theory. It was observed only recently that, for any $\varepsilon>0$, certain randomized constructions provide point sets with dispersion smaller than $\varepsilon$ and number of elements growing only logarithmically in $d$. Based on deep results from coding theory, we present explicit, deterministic algorithms to construct such point sets in time that is only polynomial in $d$. Note that, however, the running-time will be super-exponential in $\varepsilon^{-1}$.

cs.CC

Entropy numbers of finite-dimensional embeddings

Entropy numbers and covering numbers of sets and operators are well known geometric notions, which found many applications in various fields of mathematics, statistics, and computer science. Their values for finite-dimensional embeddings $id:\ell_p^n\to \ell_q^n$, $0<p,q\le\infty$, are known (up to multiplicative constants) since the pioneering work of Schütt in 1984, with later improvements by Edmunds and Triebel, Kühn and Guédon and Litvak. The aim of this survey is to give a self-contained presentation of the result and an overview of the different techniques used in its proof.

math.FA

An upper bound on the minimal dispersion

For $\varepsilon\in(0,1/2)$ and a natural number $d\ge 2$, let $N$ be a natural number with \[ N \,\ge\, 2^9\,\log_2(d)\, \left(\frac{\log_2(1/\varepsilon)}{\varepsilon}\right)^2. \] We prove that there is a set of $N$ points in the unit cube $[0,1]^d$, which intersects all axis-parallel boxes with volume $\varepsilon$. That is, the dispersion of this point set is bounded from above by $\varepsilon$.

math.CA

Franke-Jawerth embeddings for Besov and Triebel-Lizorkin spaces with variable exponents

The classical Jawerth and Franke embeddings $$ F^{s_0}_{p_0,q}({\mathbb R}^n)\hookrightarrow B^{s_1}_{p_1,p_0}({\mathbb R}^n) \quad \mbox{and} \quad B^{s_0}_{p_0,p_1}({\mathbb R}^n)\hookrightarrow F^{s_1}_{p_1,q}({\mathbb R}^n) $$ are versions of Sobolev embedding between the scales of Besov and Triebel-Lizorkin function spaces for $s_0>s_1$ and $$ s_0-\frac{n}{p_0} = s_1-\frac{n}{p_1}.$$ We prove Jawerth and Franke embeddings for the scales of Besov and Triebel-Lizorkin spaces with all exponents variable $$ F^{s_0(\cdot)}_{p_0(\cdot),q(\cdot)}\hookrightarrow B^{s_1(\cdot)}_{p_1(\cdot),p_0(\cdot)} \quad \mbox{and} \quad B^{s_0(\cdot)}_{p_0(\cdot),p_1(\cdot)}\hookrightarrow F^{s_1(\cdot)}_{p_1(\cdot),q(\cdot)}, $$ respectively, if $\inf_{x\in\mathbb{R}^n}(s_0(x)-s_1(x))>0$ and $$ s_0(x) -\frac{n}{p_0(x)} = s_1(x) -\frac{n}{p_1(x)}, \quad x \in {\mathbb R}^n. $$ We work exclusively with the associated sequence spaces $b^{s(\cdot)}_{p(\cdot),q(\cdot)}$ and $f^{s(\cdot)}_{p(\cdot),q(\cdot)}$, which is justified by well known decomposition techniques. We give also a different proof of the Franke embedding in the constant exponent case which avoids duality arguments and interpolation. Our results hold also for 2-microlocal function spaces $B^{\mathbf{w}}_{p(\cdot),q(\cdot)}({\mathbb R}^n)$ and $F^{\mathbf{w}}_{p(\cdot),q(\cdot)}({\mathbb R}^n)$ which unify the smoothness scales of spaces of variable smoothness and generalized smoothness spaces.

math.FA

Non-asymptotic Analysis of $\ell_1$-norm Support Vector Machines

Support Vector Machines (SVM) with $\ell_1$ penalty became a standard tool in analysis of highdimensional classification problems with sparsity constraints in many applications including bioinformatics and signal processing. Although SVM have been studied intensively in the literature, this paper has to our knowledge first non-asymptotic results on the performance of $\ell_1$-SVM in identification of sparse classifiers. We show that a $d$-dimensional $s$-sparse classification vector can be (with high probability) well approximated from only $O(s\log(d))$ Gaussian trials. The methods used in the proof include concentration of measure and probability in Banach spaces.

cs.IT

Volumes of unit balls of mixed sequence spaces

The volume of the unit ball of the Lebesgue sequence space $\ell_p^m$ is very well known since the times of Dirichlet. We calculate the volume of the unit ball in the mixed norm $\ell^n_q(\ell_p^m)$, whose special cases are nowadays popular in machine learning under the name of group lasso. We consider the real as well as the complex case. The result is given by a closed formula involving the gamma function, only slightly more complicated than the one of Dirichlet. We close by an overview of open problems.

math.FA

Lorentz spaces with variable exponents

We introduce Lorentz spaces $L_{p(\cdot),q}(\R^n)$ and $L_{p(\cdot),q(\cdot)}(\R^n)$ with variable exponents. We prove several basic properties of these spaces including embeddings and the identity $L_{p(\cdot),p(\cdot)}(\R^n)=L_{p(\cdot)}(\R^n)$. We also show that these spaces arise through real interpolation between $L_{\p}(\R^n)$ and $L_\infty(\R^n)$. Furthermore, we answer in a negative way the question posed in Diening, Hästö, and Nekvinda (2004) whether the Marcinkiewicz interpolation theorem holds in the frame of Lebesgue spaces with variable integrability.

math.FA