Lower Bounds for Approximation by Nonlinear Manifolds

Cites work

scientific article; zbMATH DE number 3101675 (Why is no real title available?)
Elementary structure of real algebraic varieties
Some negative theorems of approximation theory

Cited in

(97)

On the Bochner-Riesz operator in $\mathbb{R}^3$
Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
Semialgebraic complexity of functions
On the number of order types in integer grids of small size
On the complexity of computing a random Boolean function over the reals
Constructive polynomial partitioning for algebraic curves in $\mathbb{R}^3$ with applications
Error bounds for approximations with deep ReLU networks
An extension of Warren's lower bounds for approximations
Robust regression via mutivariate regression depth
Systems of rational polynomial equations have polynomial size approximate zeros on the average
The degree of approximation of sets in euclidean space using sets with bounded Vapnik-Chervonenkis dimension
Refined bounds on the number of connected components of sign conditions on a variety
Convex hulls of random order types
Density and dimension
Implicit representation conjecture for semi-algebraic graphs
On the number of zero-patterns of a sequence of polynomials
The maximum edit distance from hereditary graph properties
The complexity of point configurations
On the speed of algebraically defined graph classes
Distinct distances in the complex plane
Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
Intersection graphs of L-shapes and segments in the plane
Counting unique-sink orientations
An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions
Bounding the number of connected components of a real algebraic set
Improved bounds for incidences between points and circles
Robust subgaussian estimation with VC-dimension
Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
Moduli spaces of geometric graphs
A combinatorial approach to complexity
scientific article; zbMATH DE number 7559205 (Why is no real title available?)
The geometry of critical and near-critical values of differentiable mappings
Covariance estimation with direction dependence accuracy
Edge intersection graphs of systems of paths on a grid with a bounded number of bends
Approximation of functional compact sets by analytic varieties
VC dimensions of principal component analysis
Weaving patterns of lines and line segments in space
The parallel complexity of function approximation
Matrix and tensor rigidity and L_p-approximation
A logarithmic bound for simultaneous embeddings of planar graphs
Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
Sign rank versus Vapnik-Chervonenkis dimension
Erzeugungsgrad, VC-dimension and neural networks with rational activation function
Uniform approximation by neural networks
Escaping the curse of spatial partitioning: matchings with low crossing numbers and their applications
Discrete geometry. Abstracts from the workshop held January 21--26, 2024
A logarithmic bound for simultaneous embeddings of planar graphs
Crossing patterns of segments
Implicit representation of sparse hereditary families
Inscribable order types
Geometric properties of the ridge function manifold
On best approximation by ridge functions
Polyhedral circuits and their applications
Dynamical recognizers: real-time language recognition by analog computers
Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks
Optimal shooting: Characterizations and applications
Simplices with given 2-face areas
On the Vapnik-Chervonenkis dimension of computer programs which use transcendental elementary operations
On the value of partial information for learning from examples
Space lower bounds for low-stretch greedy embeddings
Some combinatorial-algebraic problems from complexity theory
A canonical tree decomposition for order types, and some applications
Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations
How to find Steiner minimal trees in Euclidean $d$-space
Sign rank vs discrepancy
Irrepresentability of short semilattices by Euclidean subspaces
Study of $D$-decompositions by the methods of computational real-valued algebraic geometry
Generalized sum graphs
Optimal social choice functions: a utilitarian view
Not all graphs are segment $T$-graphs
Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
The number of disk graphs
Optimizing positional scoring rules for rank aggregation
Sharp lower bounds on interpolation by deep ReLU neural networks at irregularly spaced data
On the complexity of computing and learning with multiplicative neural networks
Boundedness questions for Calabi-Yau threefolds
Counting dope matrices
Learning bounds for quantum circuits in the agnostic setting
Turning big data into tiny data: coresets for unsupervised learning problems
An LP-based k-means algorithm for balancing weighted point sets
Pseudo-dimension and entropy of manifolds formed by affine-invariant dictionary
Embeddings of graphs in Euclidean spaces
Counting disk graphs
Incidences between points and lines in ${\mathbb {R}}^4$
Improved enumeration of simple topological graphs
Stage-graph representations
Enumeration of intersection graphs of x-monotone curves
On the approximation of functional classes equipped with a uniform measure using ridge functions
scientific article; zbMATH DE number 7064043 (Why is no real title available?)
A size-depth trade-off for the analog computation of Boolean functions
On Transversality of Bent Hyperplane Arrangements and the Topological Expressiveness of ReLU Neural Networks
On the extension complexity of polytopes separating subsets of the Boolean cube
Eliminating depth cycles among triangles in three dimensions
Broadcast transmission to prioritizing receivers
Many order types on integer grids of polynomial size
On the computation of Boolean functions by analog circuits of bounded fan-in
On the number of sets definable by polynomials

This page was built for publication: Lower Bounds for Approximation by Nonlinear Manifolds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5562739)