arXiv subjects

Arvind R. Venkatakrishnan

Publications and source records attributed to Arvind R. Venkatakrishnan.

4 recordsLinked to original sources

arXiv2026

Mean-Field Oscillator Ising Machines: Gradient Flows and Classification of Limit Solutions

Oscillator Ising Machines (OIMs) have emerged as promising computational architectures for approximating solutions to combinatorial optimization problems. We derive and analyze the mean-field limit of an OIM model and show that it inherits the gradient-flow structure of the finite-dimensional dynamics. We identify conditions under which this mean-field evolution admits an Eulerian formulation as a gradient flow on the Wasserstein space of probability measures, and contrast this with a Lagrangian formulation which is always available. The gradient-flow structure strongly constrains the long-time dynamics and enables a complete classification of limit solutions and their stability in the symmetric case. In particular, all limit solutions are fixed points whose phases cluster into at most four groups, and for almost all parameter values, only binarized fixed points -- those with clusters at $0$ and/or $π$ -- can be stable. Since binarized states are exactly those for which a feasible solution to the original problem can be read out, this shows that feasible solutions can almost always be recovered. We provide tight bounds on the parameter thresholds for which fixed points in this binarized family are stable, thereby identifying the threshold for binarization in this model. We also present numerical evidence that the mean-field model correctly predicts behavioral regimes in large random networks, including Erdős-Rényi networks.

math.OC↗

arXiv2026

Mind the Gap: Where Analog Ising Machines Cease to Minimize the Ising Hamiltonian

The design of nonlinear dynamical systems whose gradient flows minimize the Ising Hamiltonian has emerged as a compelling paradigm for realizing Ising machines, forming the foundation of architectures including coherent Ising machines, simulated bifurcation machines, oscillator-based Ising machines, and dynamical Ising machines. Here, we identify a fundamental structural feature shared by these systems a functional parameter gap defined by the separation between the destabilization of the trivial state and the stabilization of Ising-encoded states. We demonstrate that this separation creates a finite parameter interval in which convergence to an Ising-encoded solution is no longer functionally guaranteed, and the resulting evolution is dictated by the spectral structure of the Jacobian at bifurcation. Subsequently, by introducing a hybrid dynamical framework that reshapes the bifurcation topology, we establish a principled pathway for modulating this parameter gap. The parameter gap thus emerges as a unifying structural principle for the analysis, design and optimization of analog Ising machines.

physics.comp-ph↗

arXiv2026

Oscillator-Based Associative Memory with Exponential Capacity: Theory, Algorithms, and Hardware Implementation

Associative memory systems enable content-addressable storage and retrieval of patterns, a capability central to biological neural computation and artificial intelligence. Classical implementations such as Hopfield networks face fundamental limitations in memory capacity, scaling at most linearly with network size. We present an associative memory architecture based on Kuramoto oscillator networks with honeycomb topology in which memories are encoded as stable phase-locked configurations. The honeycomb network consists of multiple cycles that share nodes in a chain-like arrangement, creating a one-dimensional lattice of chained+loops. We prove that this architecture achieves exponential memory capacity: a network of $N$ oscillators can store $(2\lceil n_c/4 \rceil - 1)^m$ distinct patterns, where $m$ honeycomb cycles each contain $n_c$ oscillators. Moreover, we fully characterize all stable configurations and prove that each memory's basin of attraction maintains a guaranteed minimum size independent of network scale. Simulations using charge-density-wave (CDW) oscillators validate predicted phase-locking behavior, demonstrating practical realizability in neuromorphic hardware.

cs.NE↗

arXiv2025

Oscillatory Associative Memory with Exponential Capacity

The slowing of Moore's law and the increasing energy demands of machine learning present critical challenges for both the hardware and machine learning communities, and drive the development of novel computing paradigms. Of particular interest is the challenge of incorporating memory efficiently into the learning process. Inspired by how human brains store and retrieve information, associative memory mechanisms provide a class of computational methods that can store and retrieve patterns in a robust, energy-efficient manner. Existing associative memory architectures, such as the celebrated Hopfield model and oscillatory associative memory networks, store patterns as stable equilibria of network dynamics. However, the capacity (i.e. the number of patterns that a network can memorize normalized by their number of nodes) of existing oscillatory models have been shown to decrease with the size of the network, making them impractical for large-scale, real-world applications. In this paper, we propose a novel associative memory architecture based on Kuramoto oscillators. We show that the capacity of our associative memory network increases exponentially with network size and features no spurious memories. In addition, we present algorithms and numerical experiments to support these theoretical findings, providing guidelines for the hardware implementation of the proposed associative memory networks.

eess.SY↗