Neural Networks Trained by Weight Permutation are Universal Approximators
Gaohang Chen, Zhonghua Qiao, Yongqiang Cai
OpenReview ground truth
Abstract
The universal approximation property is fundamental to the success of neural networks, and has traditionally been achieved by networks without any constraints on their parameters. However, recent experimental research proposed an innovative permutation-based training method, which can achieve desired classification performance without modifying the exact values of the weights. In this paper, we prove that the permutation training method can guide a ReLU network to approximate one-dimensional continuous functions. Our numerical results under more diverse scenarios also validate the effectiveness of the permutation training method in regression tasks. Moreover, the notable observations during weight permutation suggest that permutation training can provide a novel tool for describing network learning behavior.
Author context
Most prolific author: 2 submissions (credibility 1.00).
No mass-submission penalty for this paper (authors within normal submission volume).
Aggregate statistics only — no individual author rankings.
Ranking trajectory
Percentile by tournament round — convergence indicates rating stability.
Battle history — 32 comparisons
Ranked above opponent in 44% of matchups.
- ▲ beat FENNs: A Resource-Efficient, Adaptive, Pri… ×4
- ▼ lost to Graph Neural Networks Provably Benefit fro… ×4
- ▼ lost to Optimal criterion for feature learning of … ×4
- ▲ beat How Neural Networks With Derivative Labels… ×4
- ▲ beat PATHS: Parameter-wise Adaptive Two-Stage T… ×4
Judge assessments
Mean overall score 0.0 ± 0.0 (n = 32)