Pith. sign in

REVIEW 1 cited by

Learning Unitary Operators with Help From u(n)

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1607.04903 v3 pith:PND3L2AO submitted 2016-07-17 stat.ML cs.LG

classification stat.MLcs.LG
keywords unitaryparametrizationoperatorsalgebraarbitrarycoefficientsgradientlearning
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

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 algebra $\mathfrak{u}(n)$ associated with the Lie group $U(n)$ of $n \times n$ unitary matrices. The exponential map provides a correspondence between these spaces, and allows us to define a unitary matrix using $n^2$ real coefficients relative to a basis of the Lie algebra. The parametrization is closed under additive updates of these coefficients, and thus provides a simple space in which to do gradient descent. We demonstrate the effectiveness of this parametrization on the problem of learning arbitrary unitary operators, comparing to several baselines and outperforming a recently-proposed lower-dimensional parametrization. We additionally use our parametrization to generalize a recently-proposed unitary recurrent neural network to arbitrary unitary matrices, using it to solve standard long-memory tasks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Training Optimization for Gate-Model Quantum Neural Networks

    quant-ph 2019-09 reject novelty 3.0 of 10

    The paper maps gate-model quantum neural networks into a constraint-machine framework and declares supervised learning and backpropagation optimal, but the proofs rely on textbook results and do not validate the propo...

Pith tools