Towards Understanding Theoretical Advantages of Complex-Reaction Networks
Complex-valued neural networks have attracted increasing attention in recent years, while it remains open on the advantages of complex-valued neural networks in comparison with real-valued networks. This work takes one step on this direction by introducing the \emph{complex-reaction network} with fully-connected feed-forward architecture. We prove the universal approximation property for complex-reaction networks, and show that a class of radial functions can be approximated by a complex-reaction network using the polynomial number of parameters, whereas real-valued networks need at least exponential parameters to reach the same approximation level. For empirical risk minimization, our theoretical result shows that the critical point set of complex-reaction networks is a proper subset of that of real-valued networks, which may show some insights on finding the optimal solutions more easily for complex-reaction networks.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Emergent Complexity in Nuclear Reaction Networks: A Study of Stellar Nucleosynthesis through Chemical Organization Theory
We explore the emergence of complex structures within reaction networks, focusing on nuclear reaction networks relevant to stellar nucleosynthesis. The work presents a theoretical framework rooted in Chemical Organizatio…
Input-to-state stability-based chemical reaction networks composition for molecular computations
Molecular computation based on chemical reaction networks (CRNs) has emerged as a promising paradigm for designing programmable biochemical systems. However, the implementation of complex computations still requires exce…
ReacNetGenerator: an Automatic Reaction Network Generator for Reactive Molecular Dynamic Simulations
Reactive molecular dynamics (MD) simulation makes it possible to study the reaction mechanisms of complex reaction systems at the atomic level. However, the analysis of the MD trajectories which contain thousands of spec…
Exact first passage time distribution for second-order reactions in chemical networks
The first passage time (FPT) is a generic measure that quantifies when a random quantity reaches a specific state. We consider the FTP distribution in nonlinear stochastic biochemical networks, where obtaining exact solu…
Computational EfficiencyComplex reaction processes in combustion unraveled by neural network-based molecular dynamics simulation
Combustion is a complex chemical system which involves thousands of chemical reactions and generates hundreds of molecular species and radicals during the process. In this work, a neural network-based molecular dynamics …