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.

Seyedsina Nabavirazavi

dblp:332/1031 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
5since 2021 · last 2025
0000-0002-9186-4386ORCID · corroborated

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

Security and privacy · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Computer networks · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Distributed systems · 100%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems
convergence analysis
0.912025
FAST: A Lightweight Mechanism Unleashing Arbitrary Client Participation in Federated Learning · IJCAI 2025
Distributed systems
fault tolerance
0.912025
Do We Really Need to Design New Byzantine-robust Aggregation Rules? · NDSS 2025
Distributed systems › distributed machine learning
federated learning
0.912025
FAST: A Lightweight Mechanism Unleashing Arbitrary Client Participation in Federated Learning · IJCAI 2025
Machine learning › Efficient and distributed learning
federated learning
0.312025
Do We Really Need to Design New Byzantine-robust Aggregation Rules? · NDSS 2025

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

byzantine-robust aggregation · 1.7snapshot mechanism · 0.9adaptive snapshot frequency · 0.9
YearPublicationVenuePosition
2025 FAST: A Lightweight Mechanism Unleashing Arbitrary Client Participation in Federated Learning
abstract
Federated Learning (FL) provides a flexible distributed platform where numerous clients with high data and system heterogeneity can collaborate to learn a model. While previous research has shown that FL can handle diverse data, it often completely assumes idealized conditions. In practice, real-world factors make it hard to predict or design individual client participation. This complexity results in an unknown participation pattern - arbitrary client participation (ACP). Hence, the key open problem is to understand the impact of client participation and develop a lightweight mechanism to support ACP in FL. In this paper, we first empirically investigate the client participation's influence in FL, revealing that FL algorithms are adversely impacted by ACP. To alleviate the impact, we propose a lightweight solution, Federated Average with Snapshot (FAST), that supports almost ACP for FL and can seamlessly integrate with other classic FL algorithms. Specifically, FAST enforces clients to take a snapshot once in a while and facilitates ACP for the majority of training processes. We prove that the convergence rates of FAST in non-convex and strongly-convex cases match those under ideal client participation. Furthermore, we empirically introduce an adaptive strategy to dynamically configure the snapshot frequency, tailored to accommodate diverse FL systems. Extensive experiments show that FAST significantly improves performance under ACP and high data heterogeneity.
Zhe Li 0083, Seyedsina Nabavirazavi, Bicheng Ying, S. Sitharama Iyengar, Haibo Yang 0001
IJCAI2
2025 Do We Really Need to Design New Byzantine-robust Aggregation Rules?
Minghong Fang, Seyedsina Nabavirazavi, Zhuqing Liu, Wei Sun 0013, S. Sitharama Iyengar, Haibo Yang 0001
NDSS2
2025 LLM-Enabled In-Context Learning for Data Collection Scheduling in UAV-Assisted Sensor Networks
abstract
Unmanned Aerial Vehicles (UAVs) are increasingly being utilized in various private and commercial applications, e.g., traffic control, parcel delivery, and Search and Rescue (SAR) missions. Machine Learning (ML) methods used in UAV-Assisted Sensor Networks (UASNETs) and, especially, in Deep Reinforcement Learning (DRL) face challenges such as complex and lengthy model training, gaps between simulation and reality, and low sampling efficiency, which conflict with the urgency of emergencies, such as SAR missions. In this paper, an In-Context Learning (ICL)-Data Collection Scheduling (ICLDC) system is proposed as an alternative to DRL in emergencies. The UAV collects sensory data and transmits it to a Large Language Model (LLM), which creates a task description in natural language. From this description, the UAV receives a data collection schedule that must be executed. A verifier ensures safe UAV operations by evaluating the schedules generated by the LLM and overriding unsafe schedules based on predefined rules. The system continuously adapts by incorporating feedback into the task descriptions and using this for future decisions. This method is tested against jailbreaking attacks, where the task description is manipulated to undermine network performance, highlighting the vulnerability of LLMs to such attacks. The proposed ICLDC significantly reduces cumulative packet loss compared to both the DQN and Maximum Channel Gain baselines. ICLDC presents a promising direction for intelligent scheduling and control in UASNETs.
Yousef Emami, Hao Zhou 0013, Seyedsina Nabavirazavi, Luís Almeida 0001
IEEE Internet Things J.3
2024 Enhancing federated learning robustness through randomization and mixture
Seyedsina Nabavirazavi, Rahim Taheri, S. Sitharama Iyengar
Future Gener. Comput. Syst.1
2023 Impact of Aggregation Function Randomization against Model Poisoning in Federated Learning
abstract
Federated learning has gained significant attention as a privacy-preserving approach for training machine learning models across decentralized devices. However, this distributed learning paradigm is susceptible to adversarial attacks, particularly model poisoning attacks, where adversaries inject malicious model updates to compromise the integrity of the global model. In this paper, we investigate the impact of randomness on model poisoning attacks in federated networks, where the server employs two aggregation rules, Krum and Trimmed Mean, randomly in each federated round. We present three distinct adversaries: one targeting Krum throughout the entire learning process, another targeting Trimmed Mean entirely, and a third adversary employing a randomized strategy between Krum and Trimmed Mean for each round. Our objective is to evaluate their performance in reducing the overall accuracy of the federated network. We propose novel techniques to craft poisoned models and explore the efficacy of these attacks by exploiting the aggregation rules. We evaluated our proposed methods on Fashion-MNIST dataset. The experiments reveal the robustness of the federated network against the proposed adversarial scenarios, contributing to a better understanding of the vulnerabilities and defenses in federated learning systems.
Seyedsina Nabavirazavi, Rahim Taheri, Mohammad Shojafar, S. Sitharama Iyengar
TrustCom1