Lower Bounds for Approximation by Nonlinear Manifolds
From MaRDI portal
Publication:5562739
DOI10.2307/1994937zbMath0174.35403OpenAlexW4253804812MaRDI QIDQ5562739
Publication date: 1968
Full work available at URL: https://doi.org/10.2307/1994937
Related Items
Intersection graphs of L-shapes and segments in the plane, Irrepresentability of short semilattices by Euclidean subspaces, Weaving patterns of lines and line segments in space, Some combinatorial-algebraic problems from complexity theory, On the Vapnik-Chervonenkis dimension of computer programs which use transcendental elementary operations, Matrix and tensor rigidity and \(L_p\)-approximation, Geometric properties of the ridge function manifold, Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers, Stage-graph representations, Study of \(D\)-decompositions by the methods of computational real-valued algebraic geometry, On Transversality of Bent Hyperplane Arrangements and the Topological Expressiveness of ReLU Neural Networks, VC dimensions of principal component analysis, Improved enumeration of simple topological graphs, Approximation of functional compact sets by analytic varieties, On the value of partial information for learning from examples, Dynamical recognizers: real-time language recognition by analog computers, Broadcast Transmission to Prioritizing Receivers, Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location, Space lower bounds for low-stretch greedy embeddings, Refined bounds on the number of connected components of sign conditions on a variety, On the Bochner-Riesz operator in \(\mathbb{R}^3\), Optimal social choice functions: a utilitarian view, An LP-based \(k\)-means algorithm for balancing weighted point sets, Counting dope matrices, Learning bounds for quantum circuits in the agnostic setting, On the extension complexity of polytopes separating subsets of the Boolean cube, Improved Bounds for Incidences Between Points and Circles, Counting unique-sink orientations, Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations, Eliminating depth cycles among triangles in three dimensions, Sign rank versus Vapnik-Chervonenkis dimension, Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications, Bounding the number of connected components of a real algebraic set, On the number of zero-patterns of a sequence of polynomials, The complexity of point configurations, On the speed of algebraically defined graph classes, The maximum edit distance from hereditary graph properties, The parallel complexity of function approximation, Implicit representation conjecture for semi-algebraic graphs, Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering, How to find Steiner minimal trees in Euclidean \(d\)-space, A size-depth trade-off for the analog computation of Boolean functions, Generalized sum graphs, On the number of order types in integer grids of small size, Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks, On the computation of Boolean functions by analog circuits of bounded fan-in, Optimal shooting: Characterizations and applications, A combinatorial approach to complexity, An extension of Warren's lower bounds for approximations, Incidences between points and lines in \({\mathbb {R}}^4\), Edge intersection graphs of systems of paths on a grid with a bounded number of bends, Semialgebraic complexity of functions, Unnamed Item, On the Complexity of Computing and Learning with Multiplicative Neural Networks, Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique, Unnamed Item, An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions, Crossing patterns of segments, Pseudo-dimension and entropy of manifolds formed by affine-invariant dictionary, The number of disk graphs, Polyhedral circuits and their applications, Error bounds for approximations with deep ReLU networks, Robust regression via mutivariate regression depth, The degree of approximation of sets in euclidean space using sets with bounded Vapnik-Chervonenkis dimension, Embeddings of graphs in Euclidean spaces, Not all graphs are segment \(T\)-graphs, Unnamed Item, Simplices with given 2-face areas, Uniform approximation by neural networks, Sign rank vs discrepancy, On the number of sets definable by polynomials, Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications, Optimizing positional scoring rules for rank aggregation, Unnamed Item, Density and dimension, The geometry of critical and near-critical values of differentiable mappings, On best approximation by ridge functions, On the approximation of functional classes equipped with a uniform measure using ridge functions, Distinct distances in the complex plane, Many order types on integer grids of polynomial size, Boundedness questions for Calabi–Yau threefolds, Systems of rational polynomial equations have polynomial size approximate zeros on the average
Cites Work
