Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Aram Avetisyan

dblp:133/8481 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Efficient and distributed learning · 50% Trustworthy machine learning · 50%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness › byzantine robustness
byzantine attack defense
1.012026
Bant: Byzantine Antidote via Trial Function and Trust Scores · AAAI 2026
Machine learning › Efficient and distributed learning › federated learning › robust federated learning
byzantine-robust federated learning
1.012026
Bant: Byzantine Antidote via Trial Function and Trust Scores · AAAI 2026
Machine learning › Efficient and distributed learning
federated learning
1.012026
Bant: Byzantine Antidote via Trial Function and Trust Scores · AAAI 2026
Machine learning › Trustworthy machine learning
robustness
1.012026
Bant: Byzantine Antidote via Trial Function and Trust Scores · AAAI 2026

Methods — techniques the papers use, named apart from their topics

trust scores · 1.0trial function · 1.0adam · 1.0RMSProp · 1.0
YearPublicationVenuePosition
2026 Bant: Byzantine Antidote via Trial Function and Trust Scores
abstract
Recent advancements in machine learning have improved performance while also increasing computational demands. While federated and distributed setups address these issues, their structures remain vulnerable to malicious influences. In this paper, we address a specific threat: Byzantine attacks, wherein compromised clients inject adversarial updates to derail global convergence. We combine the concept of trust scores with trial function methodology to dynamically filter outliers. Our methods address the critical limitations of previous approaches, allowing operation even when Byzantine nodes are in the majority. Moreover, our algorithms adapt to widely used scaled methods such as Adam and RMSProp, as well as practical scenarios, including local training and partial participation. We validate the robustness of our methods by conducting extensive experiments on both public datasets and private ECG data collected from medical institutions. Furthermore, we provide a broad theoretical analysis of our algorithms and their extensions to the aforementioned practical setups. The convergence guaranties of our methods are comparable to those of classical algorithms developed without Byzantine interference.
Gleb Molodtsov, Daniil Medyakov, Sergey Skorik, Nikolas Khachaturov, Shahane Tigranyan, Vladimir Aletov, Aram Avetisyan, Martin Takác 0001, Aleksandr Beznosikov
AAAI7
2025 Self-Trained Model for ECG Complex Delineation
abstract
Electrocardiogram (ECG) delineation plays a crucial role in assisting cardiologists with accurate diagnoses. Prior research studies have explored various methods, including the application of deep learning techniques, to achieve precise delineation. However, existing approaches face limitations primarily related to dataset size and robustness.In this paper, we introduce a dataset for ECG delineation and propose a novel self-trained method aimed at leveraging a vast amount of unlabeled ECG data. Our approach involves the pseudolabeling of unlabeled data using a neural network trained on our dataset. Subsequently, we train the model on the newly labeled samples to enhance the quality of delineation. We conduct experiments demonstrating that our dataset is a valuable resource for training robust models and that our proposed self-trained method improves the prediction quality of ECG delineation.
Aram Avetisyan, Nikolas Khachaturov, Ariana A. Asatryan, Shahane Tigranyan, Yury Markin
ICASSP1
2024 Transferring Knowledge from 12-Lead to 1-Lead ECGs via Contrastive Learning
abstract
The increasing adoption of smartwatches has concurrently expanded the potential for ongoing health monitoring via single-lead ECG recordings. This advancement has led to new possibilities for automatically identifying heart conditions. Neural networks have become one of the most popular methods for handling the classification of ECGs, achieving notable successes in this field. However, there are significant challenges that need to be addressed. One such challenge is the lack of labeled single-lead ECG data. Another one is that single-lead ECGs contain less diagnostic information compared to traditional 12-lead ECGs, which limits the effectiveness of neural networks in ECG classification. Addressing these challenges, in this paper we introduce a novel approach that leverages the multi-view structure of ECG records in a contrastive learning paradigm. Our method not only involves creating positive pairs through augmentations of the original signal but also through diverse combinations of leads from the same ECG. After pretraining models on 12-lead ECGs, we fine-tune them using single-lead ECGs to improve classification performance. We compare the proposed method with existing contrastive learning frameworks and show its superior performance in the classification of cardiac abnormalities.
Sergey Skorik, Aram Avetisyan, Ekaterina Diatlinko, Renata Mindiiarova, Yury Markin
COMPSAC2