Evidence map›Paper›PMID 31276469›Full record

ArticlePloS one2019

BioGD: Bio-inspired robust gradient descent.

Ilona Kulikovskikh, Sergej Prokhorov, Tomislav Lipić, Tarzan Legović, Tomislav Šmuc

Abstract read
In one paragraph

Article in PloS one, 2019. 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

5 authors.

Ilona KulikovskikhDepartment of Information Systems and Technologies, Samara National Research University, Samara, Russia.ORCID 0000-0002-6653-5978
Sergej ProkhorovDepartment of Information Systems and Technologies, Samara National Research University, Samara, Russia.
Tomislav LipićDivision of Electronics, Ruđer Bošković Institute, Zagreb, Croatia.ORCID 0000-0002-8037-8198
Tarzan LegovićDivision of Marine and Environmental Research, Ruđer Bošković Institute, Zagreb, Croatia.
Tomislav ŠmucDivision of Electronics, Ruđer Bošković Institute, Zagreb, Croatia.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Recent research in machine learning pointed to the core problem of state-of-the-art models which impedes their widespread adoption in different domains. The models' inability to differentiate between noise and subtle, yet significant variation in data leads to their vulnerability to adversarial perturbations that cause wrong predictions with high confidence. The study is aimed at identifying whether the algorithms inspired by biological evolution may achieve better results in cases where brittle robustness properties are highly sensitive to the slight noise. To answer this question, we introduce the new robust gradient descent inspired by the stability and adaptability of biological systems to unknown and changing environments. The proposed optimization technique involves an open-ended adaptation process with regard to two hyperparameters inherited from the generalized Verhulst population growth equation. The hyperparameters increase robustness to adversarial noise by penalizing the degree to which hardly visible changes in gradients impact prediction. The empirical evidence on synthetic and experimental datasets confirmed the viability of the bio-inspired gradient descent and suggested promising directions for future research. The code used for computational experiments is provided in a repository at https://github.com/yukinoi/bio_gradient_descent.

Indexed as

Machine LearningModels, Theoretical

Identifiers

PMID31276469
PMCPMC6611597

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.