Search arXiv⌕ Search

arXiv · 2610.26429

Parameter-efficient neural computing with programmable photonic meshes

Abstract

Memory capacity and bandwidth are becoming major constraints in neural-network computing, motivating parameter-efficient representations that reduce model storage and data movement. Tensor-network methods already enable substantial compression of neural networks, but their structured operations are often poorly matched to conventional processors optimized for dense linear algebra. Such representations can be implemented in photonic hardware, although this typically requires optical architectures tailored to a particular factorization. Here we propose a different approach based on programmable photonic meshes. Compact electronic parameters determine the interferometer phases, while optical interference produces a dense, generally high-rank transformation. Since the parameterization remains electronic, its dimensionality and structure can be changed without modifying the optical circuit. Numerical experiments in end-to-end training demonstrate that the proposed photonic layers match or outperform strongly compressed tensor-train and brickwork layers, often with fewer trainable parameters. Experiments in parameter-efficient fine-tuning of a language model also show advantages over established digital adapters. The reduced trainable state lowers persistent memory requirements and offers the potential to reduce data movement and bandwidth demands.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Artem Popov, Stanislav Straupe, Mikhail Saygin. 2026-10-19. Parameter-efficient neural computing with programmable photonic meshes. https://arxiv.org/abs/2610.26429

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Scaling Limits of Multichannel Spectral Routers for Snapshot Imaging

Inverse-designed spectral routers can enable compact snapshot spectral imaging by directing different wavelengths to designated detector sub-pixels without mechanical scanning or absorptive filters. Here, we examine how routing performance varies as the number of spectral channels increases while the visible bandwidth remains fixed. A delay-bandwidth analysis relates channel count, worst-channel efficiency, and device thickness, explaining the growing optical capacity required to generate many spatially distinct spectral outputs. We then use adjoint-based topology optimization and three-dimensional finite-difference time-domain simulations to design TiO2/SiO2 routers with 9, 16, 25, and 36 channels under matched material, bandwidth, and thickness conditions. The average routing efficiency increases with sub-pixel size and approaches a plateau, while the maximum near-plateau efficiency decreases monotonically from 97.0% for 9 channels to 82.3% for 36 channels. At a fixed channel count, compressing the wavelength spacing to 8 nm or rearranging the wavelength-to-sub-pixel assignment changes the efficiency by less than one percentage point. These results indicate that the observed efficiency penalty is governed mainly by the number of wavelength-dependent routing constraints rather than by wavelength spacing or local wavelength arrangement. The findings quantify the trade-off between spectral sampling and optical throughput in compact snapshot spectral imagers.

physics.optics↗

Ising-machine-like Driving Condition Restrictions in SSBM and Additional Pseudo-annealing- Driving Method for SSBM that Achieves Best Cut Value Search -

In our previous work, we proposed and experimentally demonstrated a physics-based simulator for combinatorial optimization problems (SSBM), which exploits a distinctive spontaneous symmetry breaking (SSB) phenomenon identified in a dissipative system exhibiting robust causality described by an iterative equation. We further conducted numerical simulations in which initial fluctuations of distinct patterns were applied to large-scale benchmark problems, and reported that the SSBM exhibits a unique behavior absent in conventional Ising machines: under specific conditions, pseudo-spin patterns progressively converge during the solution-search process and ultimately coalesce into a single pattern, with the cut value of the converged solution reaching 99.7% of the best-known cut value. In the present paper, we elucidate the conditions under which the SSBM can be configured to emulate the behavior of a continuous-variable Ising machine. We further demonstrate that by additionally incorporating an effect analogous to physical annealing into these conditions, the SSBM becomes capable of identifying the best-known cut value for the K_2000 benchmark instance.

physics.optics↗

A unified sensitivity kernel for coherent wave tomography in radar, seismic, ultrasound, and optical imaging

Imaging an inhomogeneous medium with waves rests on the response of a boundary measurement to a change of the medium inside, formally the sensitivity kernel of the inverse problem. Here we show that the kernels of radar, seismology, medical ultrasound, and diffuse optics all reduce to just two classes. Every kernel is the product of a forward and an adjoint field, and a real measurement retains one quadrature of that product. These quadratures are the two classes, selected either by a component of the material parameter or by the misfit, the structure that persists for the coherent-wave kernel in both the ballistic and the diffusive regime. We place these areas on one diagram of scattering strength and transport depth, exposing a shared computational limit set by wavefield storage, and propose a broadband on-shell compression that can relax that limit.

physics.optics↗