Search arXivSearch

arXiv · 2601.09903

Forward-only learning in memristor arrays with month-scale stability

Abstract

Turning memristor arrays from efficient inference engines into systems capable of on-chip learning has proved difficult. Weight updates have a high energy cost and cause device wear, analog states drift, and backpropagation requires a backward pass with reversed signal flow. Here we experimentally demonstrate learning on standard filamentary HfOx/Ti arrays that addresses these challenges with two design choices. First, we rely on forward-only training algorithms in the Forward-Forward family that use only inference-style operations. Second, we use sub-1 V reset-only, single-pulse updates that cut energy and yield stable analog states. We first validate fully in-hardware single-layer learning, where both analog MAC operations and sub-1 V programming updates are performed on chip. We then train two-layer classifiers on an ImageNet-resolution four-class task using a hardware-in-the-loop protocol on arrays up to 8,064 devices: all conductance reads and programming updates are physical, and multilayer MACs are emulated in software from the measured conductances. Two forward-only variants, two-pass supervised Forward-Forward and a single-pass competitive rule, achieve test accuracies of 89.5% and 89.6%, respectively; a reference experiment using backpropagation reaches 90.0%. Across five independent runs per method, these accuracies are indistinguishable within statistical uncertainty. Trained models retain accuracy for at least one month under ambient conditions and remain stable under an aggressive 25 h read-disturb protocol, whereas a matched set-based Write&Verify baseline loses nearly three percentage points of test accuracy. At the array level, sub-1 V reset updates use 460 times less energy than conventional program-and-verify programming and require just 46% more energy than inference-only operation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Adrien Renaudineau, Mamadou Hawa Diallo, Théo Dupuis, Bastien Imbert, Mohammed Akib Iftakher, Kamel-Eddine Harabi, Clément Turck, Tifenn Hirtzlin, Djohan Bonnet, Franck Melul, Jorge-Daniel Aguirre-Morales, Elisa Vianello, Marc Bocquet, Jean-Michel Portal, Damien Querlioz. 2026-09-05. Forward-only learning in memristor arrays with month-scale stability. https://arxiv.org/abs/2601.09903

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

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

ASTRA: Toward Agentic AI for Intelligent Device-Network-Cloud Synergy in Next-Generation Mobile Communication

The evolution toward next-generation mobile communication systems demands intelligence-native networks capable of autonomously adapting to user intent, yet the prevailing 3GPP protocol-driven device-network-cloud (DNC) architecture imposes three structural bottlenecks: protocol-constrained decision spaces confining optimization to predefined parameter subsets, cascaded information asymmetry from lossy interface compression that strips semantic context and causes intent miscalibration, and inherently reactive coordination mechanisms that trigger actions only after performance degradation. This paper proposes an autonomous agentic AI paradigm named Agentic Synergy for Telecommunication Resource Autonomy (ASTRA), which introduces a three-tier agent layer, including device agent, network agent, and cloud agent, decoupling network intelligence from the underlying hardware infrastructure. These agents collaborate through bidirectional semantic channels, including semantic intent messages, capability abstraction messages, global directives, and peer coordination, executing a six-phase cycle of perceive, reason and predict, communicate, decide, act, and learn that transforms reactive protocol-driven operations into proactive, intent-calibrated optimization over the full decision space. Validated through system-level simulations in two representative scenarios, ASTRA achieves a 13.1\% average throughput gain in dense-crowd cell selection by redistributing UEs from congested cells via semantic load exchange, and an 18.2\% passive handover reduction in high-speed mobility through predictive trajectory-aware coordination, providing initial evidence that the proposed agentic framework accesses solution regions structurally inaccessible under protocol-constrained architectures.

cs.ET

A Closed-Form Molecule-Release Rule for Diffusion-Based Molecular Communications with Ligand Receptors

The number of molecules released per bit is a fundamental design variable of diffusion-based molecular communication (MC), and ligand-receptor reception breaks the more-is-better intuition. Too few molecules leave the bound-receptor observations buried in binding noise, while too many amplify the accumulated intersymbol interference and saturate the finite receptor population, again making the observations indistinguishable. Reliability therefore peaks in an interior operating region whose location seems to require an exhaustive search over the channel dynamics. In this paper, we show that this search can be obviated for a biologically plausible receiver that compares consecutive bound-receptor counts without channel state information or a decision threshold. We derive a closed-form transmission rule, which sets the number of molecules released per bit such that the receptor dissociation constant equals the geometric mean of the two bit-conditioned received concentration levels, prove that it exactly minimizes the bit error probability of a memoryless binomial receptor model, and express it in the physical channel parameters through an Euler--Maclaurin evaluation of the interference. Time-domain Monte Carlo sweeps of the channel and receptor parameters, corroborated by particle-based simulations, show that the empirically optimal release count coincides with the prediction or lies above it by a small factor.

cs.ET

Composability rather than computation sets the cost of an analog EML hardware fabric

The operator eml(x, y) = exp(x) - ln(y) with the constant 1 generates the elementary functions, a continuous counterpart to NAND. Whether it yields a useful fabric had not been asked of hardware. We ask in network models, circuit simulation and SkyWater 130 nm layout. Four bipolar junctions evaluate the operator for 13 fJ, beating a width-matched digital datapath by 4-134x. The fabric assembled from them is not cheap: it loses to resource-matched baselines, and over the reals its grammar excludes trigonometry. Amplifiers holding those junctions' operating points take 74.5% of a cell's current, so a cell costs 3000 times what they spend. Extracted non-idealities cost 2.6x when a cell must hold a value and nothing when it need only be repeatable. Sharing them across cells recovers two of the three orders. The premise was that a universal primitive licenses a uniform machine. It survives in the primitive and fails in the machine.

cs.ET