scientific article
From MaRDI portal
Publication:3952642
zbMath0491.46017MaRDI QIDQ3952642
Publication date: 1981
Full work available at URL: http://www.numdam.org/item?id=SAF_1980-1981____A5_0
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Geometry and structure of normed linear spaces (46B20) Classical Banach spaces in the general theory (46B25)
Related Items
Bounding the generalization error of convex combinations of classifiers: Balancing the dimensionality and the margins., A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves, Uniform approximation rates and metric entropy of shallow neural networks, Best subset selection, persistence in high-dimensional statistical learning and optimization under \(l_1\) constraint, Entropy of convex hulls -- some Lorentz norm results, Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem, Kuelbs-Li inequalities and metric entropy of convex hulls, Nonlinear approximation in finite-dimensional spaces, The convex geometry of linear inverse problems, Characterization of the variation spaces corresponding to shallow neural networks, Restricted isometries for partial random circulant matrices, Approximate real symmetric tensor rank, Spectral complexity-scaled generalisation bound of complex-valued neural networks, Convergence rates for shallow neural networks learned by gradient descent, \( \varepsilon \)-isometric dimension reduction for incompressible subsets of \(\ell_p\), Complexity estimates based on integral transforms induced by computational units, Theorems of Carathéodory, Helly, and Tverberg without dimension, Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm, Polylog Dimensional Subspaces of $$\ell _\infty ^N$$, Empirical risk minimization is optimal for the convex aggregation problem, Unnamed Item, Greedy training algorithms for neural networks and applications to PDEs, General nonexact oracle inequalities for classes with a subexponential envelope, Can dictionary-based computational models outperform the best linear ones?, Aggregation of affine estimators, Random matrices and subexponential operator spaces, Entropy of \(C(K)\)-valued operators, Learning semidefinite regularizers, Almost Euclidean Quotient Spaces of Subspaces of a Finite-Dimensional Normed Space, On a quantitative reversal of Alexandrov’s inequality, Learning unions of \(\omega(1)\)-dimensional rectangles, Metric entropy of convex hulls in type $p$ spaces—The critical case, Some comparisons of complexity in dictionary-based and linear computational models, Learning with generalization capability by kernel methods of bounded complexity, Unnamed Item, Geometric Rates of Approximation by Neural Networks, Entropy numbers of convex hulls in Banach spaces and applications, Complexity of Gaussian-radial-basis networks approximating smooth functions, On the entropy of the convex hull of finite sets, Approximate Carathéodory's theorem in uniformly smooth Banach spaces, Entropy numbers of operators factoring through general diagonal operators, Uniform approximation by neural networks, Unnamed Item, Localized Gaussian width of \(M\)-convex hulls with applications to Lasso and convex aggregation, On a characterization of operators from \(l_ q \)into a Banach space of type p with some applications to eigenvalue problems, On simultaneous approximations by radial basis function neural networks, No‐dimension Tverberg's theorem and its corollaries in Banach spaces of type p, Functional aggregation for nonparametric regression., Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces, Some estimates on entropy numbers, Complexities of convex combinations and bounding the generalization error in classification, The computational complexity of densest region detection, High-order approximation rates for shallow neural networks with cosine and \(\mathrm{ReLU}^k\) activation functions
