Research
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

2515037541,005 · Jun 202019922001200920172026
48 results for Complex-Valued Neural Networks

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.

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.

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 R\mathbb{R}-affine.

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.

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 mk/(2n)m^{-k/(2n)}.

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…

2018-01-02abs ↗pdf ↗

This work improves interpretability and calibration of complex-valued neural networks using Newton-Puiseux analysis.

problem Insufficient interpretability and probability calibration of complex-valued neural networks.
method Newton-Puiseux framework to examine local decision geometry, fitting a polynomial surrogate and factorizing it using Newton-Puiseux expansions.
result Enhanced Expected Calibration Error in ECG and wireless modulation datasets compared to uncalibrated softmax and standard post-hoc baselines.

A fast method for learning MZI parameters in optical neural networks.

problem Time-consuming learning of MZI parameters in optical neural networks.
method Customized complex-valued derivatives and a chain rule for Wirtinger derivatives, incorporated into a function module.
result 20 times faster learning compared to conventional AD in MNIST task.

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.

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…

2015-03-11abs ↗pdf ↗

Previous studies have found that an adversary attacker can often infer unintended input information from intermediate-layer features. We study the possibility of preventing such adversarial inference, yet without too much accuracy degradation. We propose a generic method to revise the neural network to boost the challe…

2019-01-28abs ↗pdf ↗

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…

2015-02-17abs ↗pdf ↗

A "wireless fingerprint" which exploits hardware imperfections unique to each device is a potentially powerful tool for wireless security. Such a fingerprint should be able to distinguish between devices sending the same message, and should be robust against standard spoofing techniques. Since the information in wirele…

2019-05-19abs ↗pdf ↗

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.

IGT learns graph representations without supervision.

problem Building deep unsupervised graph representations.
method Generic complex-valued spectral graph architecture from Fourier transform generalization, greedy concave objective for discriminative and invariant features.
result IGT learns both discriminative and invariant features from graph topology.

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.

2019-09-04abs ↗pdf ↗

Recurrent Neural Networks (RNNs) are designed to handle sequential data but suffer from vanishing or exploding gradients. Recent work on Unitary Recurrent Neural Networks (uRNNs) have been used to address this issue and in some cases, exceed the capabilities of Long Short-Term Memory networks (LSTMs). We propose a simp…

2017-07-29abs ↗pdf ↗

Deep learning has recently led to great successes in tasks such as image recognition (e.g Krizhevsky et al., 2012). However, deep networks are still outmatched by the power and versatility of the brain, perhaps in part due to the richer neuronal computations available to cortical circuits. The challenge is to identify …

2013-12-20abs ↗pdf ↗

We introduce general scattering transforms as mathematical models of deep neural networks with l2 pooling. Scattering networks iteratively apply complex valued unitary operators, and the pooling is performed by a complex modulus. An expected scattering defines a contractive representation of a high-dimensional probabil…

2013-06-24abs ↗pdf ↗

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.

Complex numbers have long been favoured for digital signal processing, yet complex representations rarely appear in deep learning architectures. RNNs, widely used to process time series and sequence information, could greatly benefit from complex representations. We present a novel complex gated recurrent cell, which i…

2018-06-21abs ↗pdf ↗

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. …

2006-04-22abs ↗pdf ↗

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…

2016-11-30abs ↗pdf ↗

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…

2014-02-20abs ↗pdf ↗

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 …

2019-10-22abs ↗pdf ↗

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…

2016-10-31abs ↗pdf ↗

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.

FreDN separates trends and periodicities in non-stationary time series forecasts.

problem Spectral entanglement and computational burden in frequency-domain methods for non-stationary time series.
method FreDN introduces a learnable Frequency Disentangler module to separate trend and periodic components directly in the frequency domain, and uses a ReIm Block to reduce complexity.
result FreDN outperforms state-of-the-art methods by up to 10% on long-term forecasting benchmarks.

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…

2019-02-22abs ↗pdf ↗

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.

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 …

2003-06-27abs ↗pdf ↗

This paper explores the use of ambient radio frequency (RF) signals for human presence detection through deep learning. Using WiFi signal as an example, we demonstrate that the channel state information (CSI) obtained at the receiver contains rich information about the propagation environment. Through judicious pre-pro…

2020-02-13abs ↗pdf ↗

Sharp bounds for approximating Sobolev functions by ridge functions and networks.

problem Approximating Sobolev functions with multivariate ridge functions and networks.
method Proving sharp upper and lower bounds for approximation order.
result Order of approximation asymptotically behaves as nr/(d)n^{-r/(d-\ell)}.