Research map / Learning theory and algorithms / Sample complexity
$\mathcal{O}(\log N)$ Latent Dimension Suffices for Universal Approximation of Permutation-invariant Function
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Polynomial Width is Sufficient for Set Representation with High-dimensional Features (ICLR 2024 · similarity 0.87)
- On the Limitations of Representing Functions on Sets (ICML 2019 · similarity 0.86)
- Minimum Width for Deep, Narrow MLP: A Diffeomorphism Approach (NeurIPS 2025 · similarity 0.86)
- How DNNs break the Curse of Dimensionality: Compositionality and Symmetry Learning (ICLR 2025 · similarity 0.86)
- Characterizing ResNet's Universal Approximation Capability (ICML 2024 · similarity 0.85)
- Parameterized Complexity of Stationarity Testing for Piecewise-Affine Functions and Shallow CNN Losses (NeurIPS 2026 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.