Search

Diversity is supposed to create better groups and societies but sometimes fails. It is explained why the power of diversity may not create better groups in the current diversity prediction theory. Diversity may hurt civic life and introduce distrust. This is because the current diversity prediction theory is based on real numbers that ignore individual abilities. Its diversity prediction theory maximizes performance with infinite population size. Contrary to this, collective intelligence or swarm intelligence is not maximized by infinite population size, but by population size. The extended diversity prediction theory using the complex number allows us to express individual abilities or qualities. The diversity of complex numbers always produces better groups and societies. The wisdom of crowds, collective intelligence, swarm intelligence or nature-inspired intelligence is implemented in the current machine learning or artificial intelligence, called Random Forest. The problem of the current diversity prediction theory is detailed in this paper. • Diversity is supposed to create better groups and societies but sometimes fails. • Diversity in real numbers ignores individual abilities. • Diversity of population size plays a key role in collective intelligence. • Diversity in complex numbers allows us to express individual abilities. • Diversity in complex numbers always produces better groups and societies. [ABSTRACT FROM AUTHOR]

• The impact of loss functions on complex MRI reconstruction with CNNs was analyzed. • The mean squared loss is biased towards magnitude underestimations with phase error. • A newly-proposed unbiased loss function called ⊥ -loss yields improved performance. • ⊥ -loss can be applied to any high-dimensional problem defined in R 2. • ⊥ -loss was applied to image registration tasks, showing superior performance. Convolutional neural networks (CNNs) are increasingly adopted in medical imaging, e.g., to reconstruct high-quality images from undersampled magnetic resonance imaging (MRI) acquisitions or estimate subject motion during an examination. MRI is naturally acquired in the complex domain C , obtaining magnitude and phase information in k-space. However, CNNs in complex regression tasks are almost exclusively trained to minimize the L2 loss or maximizing the magnitude structural similarity (SSIM), which are possibly not optimal as they do not take full advantage of the magnitude and phase information present in the complex domain. This work identifies that minimizing the L2 loss in the complex field has an asymmetry in the magnitude/phase loss landscape and is biased, underestimating the reconstructed magnitude. To resolve this, we propose a new loss function for regression in the complex domain called ⊥ -loss, which adds a novel phase term to established magnitude loss functions, e.g., L2 or SSIM. We show ⊥ -loss is symmetric in the magnitude/phase domain and has favourable properties when applied to regression in the complex domain. Specifically, we evaluate the ⊥ + ℓ 2 -loss and ⊥ +SSIM-loss for complex undersampled MR image reconstruction tasks and MR image registration tasks. We show that training a model to minimize the ⊥ + ℓ 2 -loss outperforms models trained to minimize the L2 loss and results in similar performance compared to models trained to maximize the magnitude SSIM while offering high-quality phase reconstruction. Moreover, ⊥ -loss is defined in R n , and we apply the loss function to the R 2 domain by learning 2D deformation vector fields for image registration. We show that a model trained to minimize the ⊥ + ℓ 2 -loss outperforms models trained to minimize the end-point error loss. [ABSTRACT FROM AUTHOR]

Abstract: Most of local minima caused by the hierarchical structure can be resolved by extending the real-valued neural network to complex numbers. It was proved in 2000 that a critical point of the real-valued neural network with hidden neurons always gives many critical points of the real-valued neural network with hidden neurons. These critical points consist of many lines in the parameter space which could be local minima or saddle points. Local minima cause plateaus which have a strong negative influence on learning. However, most of the critical points of complex-valued neural network are saddle points unlike those of the real-valued neural network. This is a prominent property of the complex-valued neural network. [Copyright &y& Elsevier]

This paper will prove the uniqueness theorem for 3-layered complex-valued neural networks where the threshold parameters of the hidden neurons can take non-zeros. That is, if a 3-layered complex-valued neural network is irreducible, the 3-layered complex-valued neural network that approximates a given complex-valued function is uniquely determined up to a finite group on the transformations of the learnable parameters of the complex-valued neural network. [ABSTRACT FROM AUTHOR]

A complex neural network is obtained from an ordinary network by extending the (real-valued) parameters, such as the weights and the thresholds, to complex values. Applications to problems involving complex numbers, such as communications systems, are expected. This paper presents the following uniqueness theorem. When a complex function is given, the three-layered neural network that approximates the function is uniquely determined by a certain finite group, if it is irreducible. The above finite group specifies the redundancy of the parameters in the complex neural network, but has a structure which is different from that of the real-valued neural network. The order of the finite group is examined, and it is shown that the redundancy of the complex-valued neural network is an exponent multiple of the redundancy of the real-valued neural network. Analysis of the redundancy is important in the theoretical investigation of the basic characteristics of complex-valued neural networks, such as the local minimum property. A sufficient condition is derived for the given three-layered complex-valued neural network to be minimal. The above results are shown, in essence, by extending the approach of Sussmann for real-valued neural networks. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(14): 54–62, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10363 [ABSTRACT FROM AUTHOR]