Вход на сайт

Просмотр новости

Найдите то, что Вас интересует

Reparameterized Complex-valued Neurons Can Efficiently Learn More than Real-valued Neurons via Gradient Descent

Дата публикации: 17-08-2026 20:26:00


Complex-valued neural networks potentially possess better representations and performance than real-valued counterparts when dealing with some complicated tasks such as acoustic analysis, radar image classification, etc. Despite empirical successes, it remains unknown theoretically when and to what extent complex-valued neural networks outperform real-valued ones. We take one step in this direction by comparing the learnability of real-valued neurons and complex-valued neurons via gradient descent. We theoretically show that a complex-valued neuron can learn functions expressed by any one real-valued neuron and any one complex-valued neuron with convergence rates $O(t^{-3})$ and $O(t^{-1})$ where $t$ is the iteration index of gradient descent, respectively, whereas a two-layer real-valued neural network with finite width cannot learn a single non-degenerate complex-valued neuron. We prove that a complex-valued neuron learns a real-valued neuron with rate $\Omega (t^{-3})$, exponentially slower than the linear convergence rate of learning one real-valued neuron using a real-valued neuron. We then reparameterize the phase parameter of the complex-valued neuron and prove that a reparameterized complex-valued neuron can efficiently learn a real-valued neuron with a linear convergence rate. We further verify and extend these results via simulation experiments in more general settings.

Схожие новости

#Наименование новостиТональностьИнформативностьДата публикации
1 A Functional-Space Mean-Field Theory of Partially-Trained Three-Layer Neural Networks 010.9717-08-2026
2 Optimization and Generalization of Gradient Descent for Shallow ReLU Networks with Minimal Width 03.8417-08-2026
3 High-Dimensional Analysis of Gradient Flow for Extensive-Width Quadratic Neural Networks 08.717-08-2026
4 Statistical Learning Theory for Neural Operators 010.2117-08-2026
5 Flavors of Margin: Implicit Bias of Steepest Descent in Homogeneous Neural Networks 0517-08-2026
6 A Mean-Field Analysis of Neural Stochastic Gradient Descent-Ascent for Functional Minimax Optimization 09.8217-08-2026
7 Beyond Unconstrained Features: Neural Collapse for Shallow Neural Networks with General Data 04.3617-08-2026
8 Minimax Optimal Convergence of Gradient Descent in Logistic Regression via Large and Adaptive Stepsizes 07.5217-08-2026
9 A Natural Primal-Dual Hybrid Gradient Method for Adversarial Neural Network Training on Solving Partial Differential Equation 07.9417-08-2026
10 Convergence of Decentralized Stochastic Subgradient-based Methods for Nonsmooth Nonconvex Optimization 08.7817-08-2026

Классификация: . Схожих патентов: 0. Схожих новостей: 10. Тональность: 0. Информативность: 11.86. Источник: jmlr.org.