Alexander Lvovsky

Abstract:

Optics is a promising platform in which to help realize the next generation of fast, parallel, and energy-efficient computation. We demonstrate a reconfigurable free-space optical multiplier that is capable of over 3000 computations in parallel, using spatial light modulators with a pixel resolution of only 340×340. This enables vector–matrix multiplication and parallel vector–vector multiplication with vector size of up to 56. Our design is, to the best of our knowledge, the first to simultaneously support optical implementation of reconfigurable, large-sized, and real-valued linear algebraic operations. Such an optical multiplier can serve as a building block of special-purpose optical processors such as optical neural networks and optical Ising machines.

Abstract:

Several spurious effects are known to degrade the performance of phase-only spatial light modulators. We introduce a comprehensive model that takes into account the major ones: curvature of the back panel, pixel crosstalk and the internal Fabry–Perot cavity. To estimate the model parameters with high accuracy, we generate blazed grating patterns and acquire the intensity response curves of the first and second diffraction orders. The quantitative model is used to generate compensating holograms, which can produce optical modes with high fidelity.

Abstract:

Many real-world problems can be reduced to combinatorial optimization on a graph, where the subset or ordering of vertices that maximize some objective function must be found. With such tasks often NP-hard and analytically intractable, reinforcement learning (RL) has shown promise as a framework with which efficient heuristic methods to tackle these problems can be learned. Previous works construct the solution subset incrementally, adding one element at a time, however, the irreversible nature of this approach prevents the agent from revising its earlier decisions, which may be necessary given the complexity of the optimization task. We instead propose that the agent should seek to continuously improve the solution by learning to explore at test time. Our approach of exploratory combinatorial optimization (ECO-DQN) is, in principle, applicable to any combinatorial problem that can be defined on a graph. Experimentally, we show our method to produce state-of-the-art RL performance on the Maximum Cut problem. Moreover, because ECO-DQN can start from any arbitrary configuration, it can be combined with other search methods to further improve performance, which we demonstrate using a simple random search.