about
Matrix optimization on universal unitary photonic devices (arxiv.org)
1 point by lainon on Aug 3, 2018 | hide | past | pdf | discuss on HN

In plain words: Light-based chips made of tunable beam splitters can be trained to perform any matrix transformation, but starting their settings at random pushes them toward diagonal-heavy matrices and slows learning. Sampling the starting settings from truly random matrices instead makes training converge much faster.

Abstract

Universal unitary photonic devices can apply arbitrary unitary transformations to a vector of input modes and provide a promising hardware platform for fast and energy-efficient machine learning using light. We simulate the gradient-based optimization of random unitary matrices on universal photonic devices composed of imperfect tunable interferometers. If device components are initialized uniform-randomly, the locally-interacting nature of the mesh components biases the optimization search space towards banded unitary matrices, limiting convergence to random unitary matrices. We detail a procedure for initializing the device by sampling from the distribution of random unitary matrices and show that this greatly improves convergence speed. We also explore mesh architecture improvements such as adding extra tunable beamsplitters or permuting waveguide layers to further improve the training speed and scalability of these devices.

Sunil Pai, Ben Bartlett, Olav Solgaard, David A. B. Miller
arXiv:1808.00458 · eess.SP, cs.ET, cs.NE, physics.optics · submitted Aug 2, 2018 · updated May 22, 2019
abstract · pdf · html · 18 pages, 2 tables, 14 figures, 6 videos (videos provided in Appendix via external URL link)

add comment on HN