Evidence map›Paper›PMID 39971908›Full record

ArticleNature communications2025

The inherent adversarial robustness of analog in-memory computing.

Corey Lammie, Julian Büchel, Athanasios Vasilopoulos, Manuel Le Gallo, Abu Sebastian

Abstract read
In one paragraph

Article in Nature communications, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.

0numbers the graph read from it
0cells of the map it votes in
5citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

5 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Memristive In-Memory Object Detection with 128 Mb C-Doped GeAdvanced science (Weinheim, Baden-Wurttemberg, Germany) · 2025
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Corey LammieIBM Research Europe, Rüschlikon, Switzerland. corey.lammie@ibm.com.ORCID http://orcid.org/0000-0001-5564-1356
Julian BüchelIBM Research Europe, Rüschlikon, Switzerland.ORCID http://orcid.org/0000-0001-9495-7150
Athanasios VasilopoulosIBM Research Europe, Rüschlikon, Switzerland.ORCID http://orcid.org/0009-0001-9081-6139
Manuel Le GalloIBM Research Europe, Rüschlikon, Switzerland.ORCID http://orcid.org/0000-0003-1600-6151
Abu SebastianIBM Research Europe, Rüschlikon, Switzerland. ase@zurich.ibm.com.ORCID http://orcid.org/0000-0001-5603-5243

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

A key challenge for deep neural network algorithms is their vulnerability to adversarial attacks. Inherently non-deterministic compute substrates, such as those based on analog in-memory computing, have been speculated to provide significant adversarial robustness when performing deep neural network inference. In this paper, we experimentally validate this conjecture for the first time on an analog in-memory computing chip based on phase change memory devices. We demonstrate higher adversarial robustness against different types of adversarial attacks when implementing an image classification network. Additional robustness is also observed when performing hardware-in-the-loop attacks, for which the attacker is assumed to have full access to the hardware. A careful study of the various noise sources indicate that a combination of stochastic noise sources (both recurrent and non-recurrent) are responsible for the adversarial robustness and that their type and magnitude disproportionately effects this property. Finally, it is demonstrated, via simulations, that when a much larger transformer network is used to implement a natural language processing task, additional robustness is still observed.

Identifiers

PMID39971908
PMCPMC11840121

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.