Related papers: Sub-quadratic scalable approximate linear converte…
We study the bit complexity of inverting diagonally dominant matrices, which are associated with random walk quantities such as hitting times and escape probabilities. Such quantities can be exponentially small, even on undirected…
Multiple Constant Multiplication (MCM) over integers is a frequent operation arising in embedded systems that require highly optimized hardware. An efficient way is to replace costly generic multiplication by bit-shifts and additions, i.e.…
We designed and built a new type of spatial mode multiplexer, based on Multi-Plane Light Conversion (MPLC), with very low intrinsic loss and high mode selectivity. In this first demonstration we show that a typical 3-mode multiplexer…
Optics is a promising platform in which to help realise 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…
Photovoltaic (PV) smart inverters can improve the voltage profile of distribution networks. A multi-objective optimization framework for coordination of reactive power injection of smart inverters and tap operations of on-load tap changers…
We develop a new `subspace layered least squares' interior point method (IPM) for solving linear programs. Applied to an $n$-variable linear program in standard form, the iteration complexity of our IPM is up to an $O(n^{1.5} \log n)$…
How can we accurately quantize a pre-trained Vision Transformer model? Quantization algorithms compress Vision Transformers (ViTs) into low-bit formats, reducing memory and computation demands with minimal accuracy degradation. However,…
Linear detectors such as zero forcing (ZF) or minimum mean square error (MMSE) are imperative for large/massive MIMO systems for both the downlink and uplink scenarios. However these linear detectors require matrix inversion which is…
Robust matrix completion aims to recover a low-rank matrix from a subset of noisy entries perturbed by complex noises, where traditional methods for matrix completion may perform poorly due to utilizing $l_2$ error norm in optimization. In…
Programmable optical neural networks (ONNs) can offer high-throughput and energy-efficient solutions for accelerating artificial intelligence (AI) computing. However, existing ONN architectures, typically based on cascaded unitary…
The low multilinear rank approximation, also known as the truncated Tucker decomposition, has been extensively utilized in many applications that involve higher-order tensors. Popular methods for low multilinear rank approximation usually…
We present a new interior-point potential-reduction algorithm for solving monotone linear complementarity problems (LCPs) that have a particular special structure: their matrix $M\in{\mathbb R}^{n\times n}$ can be decomposed as $M=\Phi U +…
We propose advancing photonic in-memory computing through three-dimensional photonic-electronic integrated circuits using phase-change materials (PCM) and AlGaAs-CMOS technology. These circuits offer high precision (greater than 12 bits),…
Neural network (NN) accelerators with multi-chip-module (MCM) architectures enable integration of massive computation capability; however, they face challenges of computing resource underutilization and off-chip communication overheads.…
Universal multiport interferometers (UMIs) have emerged as a key tool for performing arbitrary linear transformations on optical modes, enabling precise control over the state of light in essential applications of classical and quantum…
We propose a new method for low-rank approximation of Moore-Penrose pseudoinverses (MPPs) of large-scale matrices using tensor networks. The computed pseudoinverses can be useful for solving or preconditioning of large-scale overdetermined…
Secure Multi-party Computation (MPC) enables untrusted parties to jointly compute a function without revealing their inputs. Its application to machine learning (ML) has gained significant attention, particularly for secure inference…
This paper presents a computationally efficient decoder for multiple antenna systems. The proposed algorithm can be used for any constellation (QAM or PSK) and any labeling method. The decoder is based on matrix-lifting Semi-Definite…
Trapped-ion quantum computing requires precise optical control for individual qubit manipulation. However, conventional free-space optics face challenges in alignment stability and scalability as the number of qubits increases. Integrated…
The linear transform-based tensor nuclear norm (TNN) methods have recently obtained promising results for tensor completion. The main idea of this type of methods is exploiting the low-rank structure of frontal slices of the targeted tensor…