Cover Image

A General Method for Proving Networks Universal Approximation Property

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Wang, Wei
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Artificial Intelligence
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Dynamic Universal Approximation Theory: Foundations for Parallelism in Neural Networks
by: Wang, Wei, et al.
Published: (2024)

An Approximate Ascent Approach To Prove Convergence of PPO
by: Doering, Leif, et al.
Published: (2026)

GAR: Generative Adversarial Reinforcement Learning for Formal Theorem Proving
by: Wang, Ruida, et al.
Published: (2025)

Bourbaki: Self-Generated and Goal-Conditioned MDPs for Theorem Proving
by: Zimmer, Matthieu, et al.
Published: (2025)

Universal Approximation Theorem of Deep Q-Networks
by: Qi, Qian
Published: (2025)

Progressive Approximation in Deep Residual Networks: Theory and Validation
by: Wang, Wei, et al.
Published: (2026)

miniCodeProps: a Minimal Benchmark for Proving Code Properties
by: Lohn, Evan, et al.
Published: (2024)

IDInit: A Universal and Stable Initialization Method for Neural Network Training
by: Pan, Yu, et al.
Published: (2025)

GRExplainer: A Universal Explanation Method for Temporal Graph Neural Networks
by: Li, Xuyan, et al.
Published: (2025)

Projection Methods for Operator Learning and Universal Approximation
by: Zappala, Emanuele
Published: (2024)

Learning to Reason with Insight for Informal Theorem Proving
by: Li, Yunhe, et al.
Published: (2026)

HardNet: Hard-Constrained Neural Networks with Universal Approximation Guarantees
by: Min, Youngjae, et al.
Published: (2024)

Universal Approximation with Softmax Attention
by: Hu, Jerry Yao-Chieh, et al.
Published: (2025)

Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited
by: He, Mingguo, et al.
Published: (2022)

How Does the Smoothness Approximation Method Facilitate Generalization for Federated Adversarial Learning?
by: Ding, Wenjun, et al.
Published: (2024)

Advancing Constrained Monotonic Neural Networks: Achieving Universal Approximation Beyond Bounded Activations
by: Sartor, Davide, et al.
Published: (2025)

Goedel-Prover: A Frontier Model for Open-Source Automated Theorem Proving
by: Lin, Yong, et al.
Published: (2025)

On the Mathematical Impossibility of Safe Universal Approximators
by: Yao, Jasper
Published: (2025)

Dynamic Universal Approximation Theory: The Basic Theory for Transformer-based Large Language Models
by: Wang, Wei, et al.
Published: (2024)

Enhancing Neural Theorem Proving through Data Augmentation and Dynamic Sampling Method
by: Vishwakarma, Rahul, et al.
Published: (2023)

Steering LLMs for Formal Theorem Proving
by: Kirtania, Shashank, et al.
Published: (2025)

CuDIP: Enhancing Theorem Proving in LLMs via Curriculum Learning-based Direct Preference Optimization
by: Shi, Shuming, et al.
Published: (2025)

Generative modeling of Sparse Approximate Inverse Preconditioners
by: Li, Mou, et al.
Published: (2024)

Universal Approximation Theorem for a Single-Layer Transformer
by: Gumaan, Esmail
Published: (2025)

Attention Mechanism, Max-Affine Partition, and Universal Approximation
by: Liu, Hude, et al.
Published: (2025)

GNNInterpreter: A Probabilistic Generative Model-Level Explanation for Graph Neural Networks
by: Wang, Xiaoqi, et al.
Published: (2022)

OptProver: Bridging Olympiad and Optimization through Continual Training in Formal Theorem Proving
by: Li, Chenyi, et al.
Published: (2026)

Proving that Cryptic Crossword Clue Answers are Correct
by: Andrews, Martin, et al.
Published: (2024)

Principled Approximation Methods for Efficient and Scalable Deep Learning
by: Savarese, Pedro
Published: (2025)

Matrix Low-Rank Approximation For Policy Gradient Methods
by: Rozada, Sergio, et al.
Published: (2024)

Algebraic Priors for Approximately Equivariant Networks
by: Ali, Riccardo, et al.
Published: (2025)

BrokenMath: A Benchmark for Sycophancy in Theorem Proving with LLMs
by: Petrov, Ivo, et al.
Published: (2025)

ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis
by: Liu, Haoxiong, et al.
Published: (2025)

Stacked Universal Successor Feature Approximators for Safety in Reinforcement Learning
by: Cannon, Ian, et al.
Published: (2024)

Gradient Flow Drifting: Generative Modeling via Wasserstein Gradient Flows of KDE-Approximated Divergences
by: Cao, Jiarui, et al.
Published: (2026)

On the Spatiotemporal Dynamics of Generalization in Neural Networks
by: Wei, Zichao
Published: (2026)

Subspace-based Approximate Hessian Method for Zeroth-Order Optimization
by: Kim, Dongyoon, et al.
Published: (2025)

The ODE Method for Stochastic Approximation and Reinforcement Learning with Markovian Noise
by: Liu, Shuze Daniel, et al.
Published: (2024)

miniCTX: Neural Theorem Proving with (Long-)Contexts
by: Hu, Jiewen, et al.
Published: (2024)

Rethinking Langevin Thompson Sampling from A Stochastic Approximation Perspective
by: Wang, Weixin, et al.
Published: (2025)