Mitigating the Impact of Retention Loss on Inference Accuracy in 65 nm Single-Poly Floating-Gate Analog In-Memory Computing

• URL: http://arxiv.org/abs/2607.25058v1
• Date: Mon, 27 Jul 2026 20:41:46 GMT
• Title: Mitigating the Impact of Retention Loss on Inference Accuracy in 65 nm Single-Poly Floating-Gate Analog In-Memory Computing
• Abstract summary: We show that it is possible to successfully mitigate the impact of retention loss on inference accuracy degradation.<n>We show that, after 60 days since programming, combined mitigation techniques enable to recover the baseline inference accuracy within 2-4%.
• Score: 36.94429692322632
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: We show with experiments and system-level simulations that it is possible to successfully mitigate the impact of retention loss on inference accuracy degradation by using both circuit-level compensation techniques and batch normalization recalibration at the algorithmic level. Experiments are performed on a single-poly floating-gate (FG) analog non-volatile memory array for analog in-memory computing fabricated in a standard 65 nm CMOS. We use a model of retention-loss statistics calibrated with experiments to evaluate the system-level impact on neural network models such as VGG-10/CIFAR-10 and WideResNet-28-10/CIFAR-100. We show that, after 60 days since programming, combined mitigation techniques enable to recover the baseline inference accuracy within 2-4%

Related papers

• CAHR-Net: Condition-Adaptive Hysteresis Reconstruction for Compact and Interpretable Magnetic Core Loss Modeling [22.369771770664702]
  This paper proposes CAHR-Net, a condition-adaptive reconstruction network that injects operating conditions where they physically act.<n>It preserves the interpretable chain from flux density waveform to magnetic field reconstruction, loop-area integration, and power loss estimation.<n>A matched large-batch training protocol based on AdamW, cosine scheduling, and a staged reconstruction-to-power-loss objective is also reported.
  arXiv  Detail & Related papers  (2026-09-02T01:54:49Z)
• When Guidance Goes Off-Scale: Recalibrating Diffusion Transformers under Analog Compute-in-Memory Nonidealities [2.005299372367689]
  Diffusion Transformers (DiTs) incur high memory traffic and energy costs because sampling repeatedly evaluates large denoisers.<n>We characterize the impact of analog CIM nonidealities on DiT sampling.<n>We propose a retraining-free, sampler-side recalibration that adjusts only the CFG scale for a given CIM condition.
  arXiv  Detail & Related papers  (2026-08-20T05:21:48Z)
• How Much Capacity Does EEG Denoising Need? Ultra-Compact Networks reveal Benchmark Saturation and Metric-Utility Gap [0.0]
  Deep learning EEG denoising architectures have scaled from tens of thousands to tens of millions of parameters, yet no prior study has isolated model capacity as the experimental variable.<n>We address both gaps by fixing architecture, loss, data split, and training recipe while sweeping only channel width from 1.05K to 40.26K parameters in a minimal depthwiseseparable convolutional U-Net.
  arXiv  Detail & Related papers  (2026-06-07T12:17:25Z)
• Fast Bayesian equipment condition monitoring via simulation based inference: applications to heat exchanger health [39.61652266573024]
  We propose an AI-driven framework powered by amortized neural posterior estimation to diagnose complex failure modes in heat exchangers.<n>We benchmark this framework against an MCMC baseline across various synthetic fouling and leakage scenarios.<n>The amortized nature of the neural network enables near-instantaneous inference, establishing SBI as a highly scalable, real-time alternative.
  arXiv  Detail & Related papers  (2026-04-22T16:21:25Z)
• Variational Inference for Bayesian MIDAS Regression [0.0]
  We develop a Coordinate Ascent Variational Inference (CAVI) algorithm for regression with linear weight parameteri zations.<n>CAVI produces posterior means nearly identical to a block Gibbs sampler benchmark while achieving speedups of 107x to 1,772x.<n>Weight function parameters maintain excellent calibration (coverage above 92%) across all con gurations.
  arXiv  Detail & Related papers  (2026-02-23T08:51:26Z)
• Hybrid Gated Flow (HGF): Stabilizing 1.58-bit LLMs via Selective Low-Rank Correction [0.766310831583367]
  Hybrid Gated Flow (HGF) is a dual-stream architecture that couples a 1.58-bit ternary backbone with a learnable, low-rank FP16 correction path.<n>We show that HGF 5.4 achieves a validation loss of 0.9306 compared to BitNet's 1.0294, recovering approximately 55% of the quality gap between pure ternary quantization and the FP16 baseline.
  arXiv  Detail & Related papers  (2026-02-05T03:47:17Z)
• A Spatio-Temporal Graph Neural Networks Approach for Predicting Silent Data Corruption inducing Circuit-Level Faults [5.2974276480448195]
  Functional testing SDE-related faults is expensive to simulate.<n>We present a unified-temporal graph convolutional network (ST-GCN) for fast, accurate prediction of long-cycle fault impact probabilities.
  arXiv  Detail & Related papers  (2025-09-08T02:23:51Z)
• Data-Free Dynamic Compression of CNNs for Tractable Efficiency [46.498278084317704]
  structured pruning approaches have shown promise in lowering floating-point operations without substantial drops in accuracy.<n>We propose HASTE (Hashing for Tractable Efficiency), a data-free, plug-and-play convolution module that instantly reduces a network's test-time inference cost without training or fine-tuning.<n>We demonstrate our approach on the popular vision benchmarks CIFAR-10 and ImageNet, where we achieve a 46.72% reduction in FLOPs with only a 1.25% loss in accuracy.
  arXiv  Detail & Related papers  (2023-09-29T13:09:40Z)
• TinyAD: Memory-efficient anomaly detection for time series data in Industrial IoT [43.207210990362825]
  We propose a novel framework named Tiny Anomaly Detection (TinyAD) to efficiently facilitate onboard inference of CNNs for real-time anomaly detection. To reduce the peak memory consumption of CNNs, we explore two complementary strategies, in-place, and patch-by-patch memory rescheduling. Our framework can reduce peak memory consumption by 2-5x with negligible overhead.
  arXiv  Detail & Related papers  (2023-03-07T02:56:15Z)
• Quantized Neural Networks for Low-Precision Accumulation with Guaranteed Overflow Avoidance [68.8204255655161]
  We introduce a quantization-aware training algorithm that guarantees avoiding numerical overflow when reducing the precision of accumulators during inference. We evaluate our algorithm across multiple quantized models that we train for different tasks, showing that our approach can reduce the precision of accumulators while maintaining model accuracy with respect to a floating-point baseline.
  arXiv  Detail & Related papers  (2023-01-31T02:46:57Z)
• Fast and Accurate Error Simulation for CNNs against Soft Errors [64.54260986994163]
  We present a framework for the reliability analysis of Conal Neural Networks (CNNs) via an error simulation engine. These error models are defined based on the corruption patterns of the output of the CNN operators induced by faults. We show that our methodology achieves about 99% accuracy of the fault effects w.r.t. SASSIFI, and a speedup ranging from 44x up to 63x w.r.t.FI, that only implements a limited set of error models.
  arXiv  Detail & Related papers  (2022-06-04T19:45:02Z)
• Soft Calibration Objectives for Neural Networks [40.03050811956859]
  We propose differentiable losses to improve calibration based on a soft (continuous) version of the binning operation underlying popular calibration-error estimators. When incorporated into training, these soft calibration losses achieve state-of-the-art single-model ECE across multiple datasets with less than 1% decrease in accuracy.
  arXiv  Detail & Related papers  (2021-07-30T23:30:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.