Evidence map›Paper›PMID 41041082›Full record

ArticleFrontiers in artificial intelligence2025

Lipschitz-based robustness estimation for hyperdimensional learning.

Calvin Yeung, Hamza Errahmouni Barkam, Zhuowen Zou, Sanggeon Yun, Nathaniel D Bastian, Mohsen Imani

Abstract read
In one paragraph

Article in Frontiers in artificial intelligence, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing 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

0 citing papers in PubMed.

No citing paper in PubMed yet.

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

6 authors.

Calvin YeungDepartment of Computer Science, University of California, Irvine, Irvine, CA, United States.
Hamza Errahmouni BarkamDepartment of Computer Science, University of California, Irvine, Irvine, CA, United States.
Zhuowen ZouDepartment of Computer Science, University of California, Irvine, Irvine, CA, United States.
Sanggeon YunDepartment of Computer Science, University of California, Irvine, Irvine, CA, United States.
Nathaniel D BastianDepartment of Electrical Engineering & Computer Science, United States Military Academy, West Point, NY, United States.
Mohsen ImaniDepartment of Computer Science, University of California, Irvine, Irvine, CA, United States.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

With the adoption of machine learning models in various practical domains, there is a growing need for evaluating and increasing model robustness. Hyperdimensional computing (HDC) is a neurosymbolic computational paradigm that represents symbols as high dimensional vectors and symbolic operations as vector operations, seamlessly interfacing between neuro- and symbolic components of a model. However, there is a notable gap in HDC research regarding the robustness of HDC models to input perturbations. This study presents a novel theoretical framework tailored to evaluate the robustness of hyperdimensional classifiers against perturbations in the input space. In particular, our proposed measure of robustness gives a theoretical upper bound for the magnitude of noise a model can tolerate without changing its prediction for any given data point. We also propose a method to enhance the robustness of the model based on our proposed measure of robustness. Our approach introduces several methods to calculate model robustness as a function of the specific dataset and type of hyperdimensional encoding used. The results show that the average robustness of HDC models increases under the proposed optimization scheme while maintaining accuracy by varying the variance of the Gaussian distribution used to encode hypervectors. The practical effectiveness of our proposed measure of robustness is also demonstrated.

Indexed as

adversarial attacksclassificationhyperdimensional computingrobustnessvector symbolic architectures

Identifiers

PMID41041082
PMCPMC12486168

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.