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.

169,291 papers · 148 categories

Trend · papers per month

2515037541,005 · Jun 202019922001200920182026
48 results for unitary neural networks

EUNNs improve RNN performance and efficiency.

problem Gradient explosion/vanishing and long-term correlations in RNNs.
method Unitary matrices with tunable representation capacity and O(1)\mathcal{O}(1) computational complexity.
result EUNNs significantly outperform other RNNs and LSTMs in performance and training speed.

GORU combines unitary and gated RNNs for better long-term memory management.

problem Learning to effectively manage long-term memory in neural networks.
method Extending unitary RNNs with a gating mechanism to forget irrelevant information.
result GORU outperforms LSTMs, GRUs, and Unitary RNNs on long-term dependency tasks.

A major challenge in the training of recurrent neural networks is the so-called vanishing or exploding gradient problem. The use of a norm-preserving transition operator can address this issue, but parametrization is challenging. In this work we focus on unitary operators and describe a parametrization using the Lie al…

2016-07-17abs ↗pdf ↗

A new method for optimizing neural networks with orthogonal constraints.

problem Optimizing neural networks with orthogonal constraints.
method Parametrization using the exponential map to transform constrained optimization into unconstrained.
result Faster, more accurate, and stable convergence in RNNs with orthogonal recurrent weights.

Recurrent neural networks (RNNs) are notoriously difficult to train. When the eigenvalues of the hidden to hidden weight matrix deviate from absolute value 1, optimization becomes difficult due to the well studied issue of vanishing and exploding gradients, especially when trying to learn long-term dependencies. To cir…

2015-11-20abs ↗pdf ↗

Quantum neural networks need both data-dependent and trainable unitaries for effective geometric deformation.

problem Quantum neural networks lack the geometric flexibility of classical networks due to limitations in state reachability.
method Viewing quantum states as embedded manifolds, we analyze infinitesimal unitary actions and introduce the CLA maps and aCLS criterion.
result Geometric flexibility in quantum neural networks requires a joint dependence on data and trainable weights.

Quantum neural networks converge to Gaussian processes as they grow.

problem Understanding the convergence of quantum neural networks to Gaussian processes.
method Analyzing Haar random unitary and orthogonal deep QNNs, considering input states, measurement observables, and non-independence of unitary matrix entries.
result Quantum neural networks outputs converge to Gaussian processes in the limit of large Hilbert space dimension.

Guarantees recovery of compressible signals from adversarial noise.

problem Recovering compressible signals from noise and adversarial attacks.
method Extends adversarial defense framework to 0\ell_0, 2\ell_2, and \ell_\infty norms.
result Recovery guarantees for various signal recovery methods under different noise types.

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 ↗

Quantum neural networks approximate periodic functions more efficiently.

problem Approximating periodic functions with quantum neural networks.
method Using Jackson's inequality to construct a QNN that approximates a trigonometric polynomial of the function.
result Quantum neural networks can achieve better approximation results with fewer parameters for smoother functions.

Develops neural networks for reductive Lie groups, enhancing symmetry respect.

problem Symmetry respect in neural networks for reductive Lie groups.
method General equivariant neural network architecture for any reductive Lie Group G.
result Demonstrates generality and performance in top quark decay tagging and shape recognition.

The paper provides theoretical guarantees for optimized sampling in compressed sensing, showing error vanishes with more measurements.

problem Theoretical and practical improvements in compressed sensing with optimized sampling schemes.
method Theoretical analysis and empirical experiments with optimized sampling schemes for subsampled unitary matrices.
result The error caused by measurement noise vanishes with an increasing number of measurements for optimized sampling schemes, assuming Gaussian noise.

Develops a framework for designing quantum neural networks that respect symmetries.

problem Trainability and generalization issues in quantum neural networks.
method Equivariant quantum neural networks (EQNN) for any symmetry group.
result Efficient construction of equivariant layers for EQNNs, including QCNNs.

We formulate the unitary rational orbifold conformal field theories in the algebraic quantum field theory framework. Under general conditions, we show that the orbifold of a given unitary rational conformal field theories generates a unitary modular category. Many new unitary modular categories are obtained. We also sh…

2000-04-24abs ↗pdf ↗

Study on determinants of unitary Brownian motion and their asymptotic laws.

problem Understanding determinants of unitary Brownian motion and their behavior over time.
method Using Stiefel fibration and skew-product decomposition of the Stiefel Brownian motion.
result Prove asymptotic laws for determinants of block entries of unitary Brownian motion.

We construct a new family of toric manifolds generating the unitary bordism ring. Each manifold in the family is the complex projectivisation of the sum of a line bundle and a trivial bundle over a complex projective space. We also construct a family of special unitary quasitoric manifolds which contains polynomial gen…

2014-12-16abs ↗pdf ↗

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.

Neural network implementation of Brenier's polar factorization for vector fields.

problem Implementing Brenier's polar factorization theorem for vector fields using neural networks.
method Parameterizing the convex function uu as an input convex neural network and estimating the measure-preserving map MM.
result Practical neural implementation of Brenier's polar factorization theorem.

Study circle actions on unitary manifolds with discrete fixed points.

problem Understanding circle actions on compact unitary manifolds with discrete fixed points.
method Prove relationships between weights at fixed points and derive results regarding the first equivariant Chern class and Hirzebruch χyχ_y-genus.
result Derive a multigraph encoding fixed point data, leading to new insights into unitary S1S^1-manifolds.

The study shows ergodicity of unitary frame flows on Kähler manifolds with specific curvature conditions.

problem Ergodicity of unitary frame flows on Kähler manifolds with negative holomorphic sectional curvature.
method Analysis of the unitary frame flow on the principal U(m)-bundle of unitary frames.
result For even-dimensional Kähler manifolds with negative λ(m)-pinched holomorphic sectional curvature, the unitary frame flow is ergodic and mixing.

Shared classical randomness improves quantum generative models' output distributions.

problem Improving generative performance of shallow unitary quantum models.
method Introducing stochasticity into unitary quantum models via shared classical randomness.
result Shared classical randomness allows shallow unitary quantum models to represent a strictly larger family of distributions.

Under-parameterized networks can either copy or average teacher weights, leading to universal optimal solutions.

problem Approximating a teacher network with an under-parameterized student network.
method Analyzing shallow neural networks with erf activation function and unitary teacher weights, proving copy-average configurations are critical points and finding the optimal solution.
result The optimal solution for under-parameterized networks has a universal structure, whether copying or averaging teacher neurons.

This paper introduces a submanifold of the moduli space of unitary representations of the fundamental group of a punctured sphere with fixed local monodromy. The submanifold is defined via products of involutions through Lagrangian subspaces. We show that the moduli space of Lagrangian representations is a Lagrangian s…

2005-06-06abs ↗pdf ↗

Defines unitary setting for quantum mechanics, explaining time evolution.

problem Completing quantum theory by defining unitary time evolution.
method Introduces geometric space with north and south poles, defines unitary time evolution as vector field flow.
result Unitary time evolution is explained as Lie group-Lie group algebra correspondence.