Research map / Learning theory and algorithms / Sample complexity
Improving Set Function Approximation with Quasi-Arithmetic Neural Networks
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.84)
- Enhancing Neural Subset Selection: Integrating Background Information into Set Representations (ICLR 2024 · similarity 0.84)
- Monotone and Separable Set Functions: Characterizations and Neural Models (NeurIPS 2025 · similarity 0.84)
- Position: The No Free Lunch Theorem, Kolmogorov Complexity, and the Role of Inductive Biases in Machine Learning (ICML 2024 · similarity 0.84)
- Explainable Neural Networks with Guarantee: A Sparse Estimation Approach (AAAI 2025 · similarity 0.84)
- Learning Set Functions with Implicit Differentiation (AAAI 2025 · similarity 0.84)
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.