Cheap orthogonal constraints in neural networks: A simple parametrization of the orthogonal and unitary group
M Lezcano-Casado… - … Conference on Machine …, 2019 - proceedings.mlr.press
We introduce a novel approach to perform first-order optimization with orthogonal and
unitary constraints. This approach is based on a parametrization stemming from Lie group …
unitary constraints. This approach is based on a parametrization stemming from Lie group …
A brief introduction to manifold optimization
Manifold optimization is ubiquitous in computational and applied mathematics, statistics,
engineering, machine learning, physics, chemistry, etc. One of the main challenges usually …
engineering, machine learning, physics, chemistry, etc. One of the main challenges usually …
Proximal gradient method for nonsmooth optimization over the Stiefel manifold
We consider optimization problems over the Stiefel manifold whose objective function is the
summation of a smooth function and a nonsmooth function. Existing methods for solving this …
summation of a smooth function and a nonsmooth function. Existing methods for solving this …
Minimum-distortion embedding
We consider the vector embedding problem. We are given a finite set of items, with the goal
of assigning a representative vector to each one, possibly under some constraints (such as …
of assigning a representative vector to each one, possibly under some constraints (such as …
Transmit MIMO radar beampattern design via optimization on the complex circle manifold
K Alhujaili, V Monga… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
The ability of multiple-input multiple-output (MIMO) radar systems to adapt waveforms across
antennas allows flexibility in the transmit beampattern design. In cognitive radar, a popular …
antennas allows flexibility in the transmit beampattern design. In cognitive radar, a popular …
Efficient riemannian optimization on the stiefel manifold via the cayley transform
Strictly enforcing orthonormality constraints on parameter matrices has been shown
advantageous in deep learning. This amounts to Riemannian optimization on the Stiefel …
advantageous in deep learning. This amounts to Riemannian optimization on the Stiefel …
Gradient-descent quantum process tomography by learning Kraus operators
We perform quantum process tomography (QPT) for both discrete-and continuous-variable
quantum systems by learning a process representation using Kraus operators. The Kraus …
quantum systems by learning a process representation using Kraus operators. The Kraus …
A Riemannian conjugate gradient method for optimization on the Stiefel manifold
X Zhu - Computational optimization and Applications, 2017 - Springer
In this paper we propose a new Riemannian conjugate gradient method for optimization on
the Stiefel manifold. We introduce two novel vector transports associated with the retraction …
the Stiefel manifold. We introduce two novel vector transports associated with the retraction …
An extrinsic look at the Riemannian Hessian
Let f be a real-valued function on a Riemannian submanifold of a Euclidean space, and let
̄f be a local extension of f. We show that the Riemannian Hessian of f can be conveniently …
̄f be a local extension of f. We show that the Riemannian Hessian of f can be conveniently …
Non-normal recurrent neural network (nnrnn): learning long time dependencies while improving expressivity with transient dynamics
G Kerg, K Goyette, M Puelma Touzel… - Advances in neural …, 2019 - proceedings.neurips.cc
A recent strategy to circumvent the exploding and vanishing gradient problem in RNNs, and
to allow the stable propagation of signals over long time scales, is to constrain recurrent …
to allow the stable propagation of signals over long time scales, is to constrain recurrent …