Complex-valued neural networks are not a new concept, however, the use of real-valued models has often been favoured over complex-valued models due to difficulties in training and performance. When comparing real-valued versus complex-valued neural networks, existing literature often ignores the number of parameters, r…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,657 papers · 148 categories
Trend · papers per month
48 results for “complex-valued models”
New method creates minimal submanifolds using complex-valued eigenfunctions.
problem Creating minimal submanifolds in compact Riemannian manifolds.
method Employing complex-valued eigenfunctions.
result Manufactured minimal submanifolds in compact Riemannian manifolds.
Complex-valued neural networks avoid spurious local minima.
problem Finding spurious local minima in neural networks.
method Proved no spurious local minima for shallow complex neural networks with quadratic activations.
result Complex-valued weights eliminate spurious local minima in neural networks.
A complex-valued convolutional network (convnet) implements the repeated application of the following composition of three operations, recursively applying the composition to an input vector of nonnegative real numbers: (1) convolution with complex-valued vectors followed by (2) taking the absolute value of every entry…
The construction of synthetic complex-valued signals from real-valued observations is an important step in many time series analysis techniques. The most widely used approach is based on the Hilbert transform, which maps the real-valued signal into its quadrature component. In this paper, we define a probabilistic gene…
Complex-valued (p,q)-harmonic morphisms defined and studied.
problem Defining and studying (p,q)-harmonic morphisms between Riemannian manifolds.
method Introducing and characterizing complex-valued (p,q)-harmonic morphisms.
result Characterization and new non-trivial examples of complex-valued (p,q)-harmonic morphisms.
C-SURE improves complex-valued deep learning models by shrinking estimates, outperforming MLE and SurReal.
problem Improving accuracy and robustness of complex-valued deep learning models.
method Proposes a Stein's unbiased risk estimate (SURE) for complex-valued data and integrates it into a prototype CNN classifier.
result C-SURE outperforms SurReal and MLE in accuracy and robustness on complex-valued datasets.
Complex-Valued Restricted Boltzmann Machine for Direct Speech Parameterization from Complex Spectraeess.AS
This paper describes a novel energy-based probabilistic distribution that represents complex-valued data and explains how to apply it to direct feature extraction from complex-valued spectra. The proposed model, the complex-valued restricted Boltzmann machine (CRBM), is designed to deal with complex-valued visible unit…
The paper uses complex-valued functions to simplify plane differential geometry and kinematics.
problem Simplifying complex problems in plane differential geometry and kinematics.
method Consistent use of complex-valued functions of a real variable.
result Derives results in a particularly simple, uniform, and transparent way.
In the spirit of Ray and Singer we define a complex valued analytic torsion using non-selfadjoint Laplacians. We establish an anomaly formula which permits to turn this into a topological invariant. Conjecturally this analytically defined invariant computes the complex valued Reidemeister torsion, including its phase. …
PolarBM models complex-valued audio signals in polar coordinates, improving over conventional methods.
problem Discarding structural information in complex-valued problems simplifies models but loses important amplitude-phase relationships.
method Proposes PolarBM, a novel Boltzmann machine for complex-valued variables in polar coordinates, and LogPolarBM for logarithmic amplitude.
result PolarBM and LogPolarBM achieve superior modeling accuracy compared to conventional models, including deep neural networks.
CAP-BM learns complex-valued data's amplitude and phase distributions.
problem Learning from complex-valued data with amplitude variation.
method Complex Amplitude-Phase Boltzmann machine (CAP-BM) with Gibbs sampling.
result Necessity of amplitude-amplitude coupling term in CAP-BM.
Bayesian sparsification improves complex-valued neural networks by 50-100x with minimal performance loss.
problem Efficiently compressing complex-valued neural networks for embedded systems.
method Extending Sparse Variational Dropout to complex-valued networks and conducting a numerical study.
result Achieved state-of-the-art performance on MusicNet with 50-100x compression.
There are three equivalent ways of representing two jointly observed real-valued signals: as a bivariate vector signal, as a single complex-valued signal, or as two analytic signals known as the rotary components. Each representation has unique advantages depending on the system of interest and the application goals. I…
CVNN outperforms RVNN on non-circular data.
problem Classifying complex-valued data with statistical dependence.
method Comparison of CVNN and RVNN on non-circular data.
result CVNN outperforms RVNN in accuracy and generalization.
Latent-space metrics for Complex-Valued VAE out-of-distribution detection under radar cluttereess.SP
Study complex-valued VAEs for radar OOD detection.
problem Detecting out-of-distribution signals in complex radar environments.
method Proposed and compared several detection metrics for CVAE.
result CVAE-MSE and latent-based scores outperform ANMF-Tyler.
We study the curvature of a manifold on which there can be defined a complex-valued submersive harmonic morphism with either, totally geodesic fibers or that is holomorphic with respect to a complex structure which is compatible with the second fundamental form. We also give a necessary curvature condition for the exis…
Usually, complex-valued RKHS are presented as an straightforward application of the real-valued case. In this paper we prove that this procedure yields a limited solution for regression. We show that another kernel, here denoted as pseudo kernel, is needed to learn any function in complex-valued fields. Accordingly, we…
Unified framework for complex-valued eigenfunctions on Riemannian symmetric spaces.
problem Finding a unified scheme for complex-valued eigenfunctions on Riemannian symmetric spaces.
method Employing the Cartan embedding for classical compact Riemannian symmetric spaces and quaternionic Grassmannians.
result Construction of new eigenfunctions on quaternionic Grassmannians.
Complex-valued signals are used in the modeling of many systems in engineering and science, hence being of fundamental interest. Often, random complex-valued signals are considered to be proper. A proper complex random variable or process is uncorrelated with its complex conjugate. This assumption is a good model of th…
Survey of complex-valued neural networks for improved performance.
problem Lack of complex-valued neural networks in machine learning frameworks.
method Literature review of CVNNs.
result Advantages of CVNNs over real-valued neural networks.
Over the last decade, both the neural network and kernel adaptive filter have successfully been used for nonlinear signal processing. However, they suffer from high computational cost caused by their complex/growing network structures. In this paper, we propose two random Euler filters for complex-valued nonlinear filt…
This paper proves a generalization bound for complex-valued neural networks scaling with spectral complexity.
problem Ensuring the performance of complex-valued neural networks on unseen data.
method Theoretical derivation using Maurey Sparsification Lemma and Dudley Entropy Integral, empirical validation on various datasets.
result The spectral complexity of weight matrices is a significant factor in the generalization ability of complex-valued neural networks.
This research explores complex-valued neural networks and their implementation.
problem The challenges of implementing complex-valued neural networks and their potential for non-complex data.
method Detailed theory and implementation of CVNN, including Wirtinger calculus, complex backpropagation, and modules like complex layers and activation functions. Python implementation using cvnn toolbox.
result Demonstrates the potential of CVNN for non-complex data through simulations.
We propose a novel adaptive kernel based regression method for complex-valued signals: the generalized complex-valued kernel least-mean-square (gCKLMS). We borrow from the new results on widely linear reproducing kernel Hilbert space (WL-RKHS) for nonlinear regression and complex-valued signals, recently proposed by th…
New submersion proves complex-valued harmonic map existence.
problem Existence of non-constant harmonic morphisms.
method Constructing harmonic Riemannian submersions from symmetric spaces.
result Existence of non-constant, globally defined complex-valued harmonic morphism.
We extend the complex-valued analytic torsion, introduced by Burghelea and Haller on closed manifolds, to compact Riemannian bordisms. We do so by considering a flat complex vector bundle over a compact Riemannian manifold, endowed with a fiberwise nondegenerate symmetric bilinear form. The Riemmanian metric and the bi…
CVNNs improve performance in tasks with complex-valued inputs.
problem Improving performance in tasks with complex-valued inputs.
method Analyze the approximation properties of complex-valued neural networks (CVNNs).
result Quantitative approximation bounds for CVNNs, showing error scales as .
In this note, we report the back propagation formula for complex valued singular value decompositions (SVD). This formula is an important ingredient for a complete automatic differentiation(AD) infrastructure in terms of complex numbers, and it is also the key to understand and utilize AD in tensor networks.
Complex valued analytic torsion and dynamical zeta function studied on locally symmetric spaces.
problem Analyzing the Ruelle dynamical zeta function on locally symmetric spaces with flat vector bundles.
method Meromorphic extension and regularisation of the dynamical zeta function, relating it to the complex valued analytic torsion.
result The leading term of the dynamical zeta function at zero is related to the regularised determinant of the flat Laplacian.
Proposes a new complex Gaussian distribution for better modeling of complex-valued signals.
problem Limited ability of Gaussian distribution to represent diverse amplitude characteristics.
method Introduces a power-weighted noncentral complex Gaussian distribution on the complex plane.
result Consistently outperforms conventional distributions in log-likelihood for speech power spectra.
While deep learning has received a surge of interest in a variety of fields in recent years, major deep learning models barely use complex numbers. However, speech, signal and audio data are naturally complex-valued after Fourier Transform, and studies have shown a potentially richer representation of complex nets. In …
We describe the relationship between complex-valued harmonic morphisms from Minkowski 4-space} and the shear-free ray congruences of mathematical physics. Then we show how a horizontally conformal submersion on a domain of Euclidean 3-space gives the boundary values at infinity of a complex-valued harmonic morphism on …
Complex embeddings handle non-metric proximity data better than traditional methods.
problem Proximities not always metric or inner product-based, causing convergence issues.
method Proposes complex-valued embeddings for non-vectorial data.
result Complex embeddings outperform traditional techniques on benchmarks.
Complex-valued neural networks can approximate any continuous function with bounded widths and depths.
problem Approximating continuous functions with complex-valued neural networks of bounded widths and depths.
method Analyzing activation functions and proving universality for complex-valued networks.
result Deep narrow complex-valued networks are universal if and only if their activation function is neither holomorphic, nor antiholomorphic, nor -affine.
Sparse Bayesian learning improves rational approximations for complex-valued models.
problem Efficiently approximate complex-valued models with high non-linearity.
method Sparse Bayesian learning applied to rational approximation of complex-valued models.
result Sparse Bayesian learning reduces computational cost while maintaining accuracy.
Risk diversification is one of the dominant concerns for portfolio managers. Various portfolio constructions have been proposed to minimize the risk of the portfolio under some constrains including expected returns. We propose a portfolio construction method that incorporates the complex valued principal component anal…
Most deep learning-based models for speech enhancement have mainly focused on estimating the magnitude of spectrogram while reusing the phase from noisy speech for reconstruction. This is due to the difficulty of estimating the phase of clean speech. To improve speech enhancement performance, we tackle the phase estima…
We construct new complex-valued harmonic morphisms from Euclidean spaces from functions which are holomorphic with respect to Hermitian structures. In particular, we give the first global examples of complex-valued harmonic morphisms from for each which do not arise from a Kähler structure; it is know…
Let S be a closed topological surface. Haupt's theorem provides necessary and sufficient conditions for a complex-valued character of the first integer homology group of S to be realized by integration against a complex-valued 1-form that is holomorphic with respect to some complex structure on S. We prove a refinement…
The paper studies geometric representations of submanifolds using complex-valued functions.
problem Exploring the geometry of codimension-2 submanifolds.
method Implicitly representing submanifolds by complex-valued functions and showing a prequantum bundle structure.
result The space of implicit representations admits a prequantum bundle structure over the space of submanifolds.
In this paper, we generalize Huber's criterion to multichannel sparse recovery problem of complex-valued measurements where the objective is to find good recovery of jointly sparse unknown signal vectors from the given multiple measurement vectors which are different linear combinations of the same known elementary vec…
New complex-valued maps found on complex geometries.
problem Finding new maps on complex geometries.
method Solving non-linear PDEs based on manifold geometry.
result Constructed new proper biharmonic and (2,1)-harmonic maps.
In this paper we give a positive answer to the open existence problem for complex-valued harmonic morphisms from the non-compact irreducible Riemannian symmetric spaces , and their compact duals and . Furthermore we prove the existence of globally defined, com…
New p-harmonic and harmonic morphisms found on Lie groups.
problem Constructing explicit p-harmonic and harmonic morphisms on Lie groups.
method Using the method of eigenfamilies to construct explicit complex-valued p-harmonic functions and harmonic morphisms.
result Explicit complex-valued p-harmonic functions and harmonic morphisms constructed on non-compact classical Lie groups.
In this paper we extend Witten-Helffer-Sjöstrand theory from selfadjoint Laplacians based on fiber wise Hermitian structures, to non-selfadjoint Laplacians based on fiber wise non-degenerate symmetric bilinear forms. As an application we verify, up to sign, the conjecture about the comparison of the Milnor-Turaev torsi…
SyncRank recovers global ranking from noisy comparisons with theoretical guarantees.
problem Recovering a global ranking from noisy pairwise comparisons.
method Complex-valued data model and SDP relaxation for exact ranking recovery.
result SyncRank achieves exact ranking recovery with high probability above a critical noise threshold of O(sqrt(n / log n)).
Complex-valued neural networks can approximate any continuous function.
problem Generalizing the universal approximation theorem to complex-valued networks.
method Characterizing activation functions for complex networks to approximate any continuous function.
result Different activation functions are required for deep vs shallow complex networks to achieve universal approximation.