Olusola Tolulope Odeyomi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Olusola Tolulope Odeyomi has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Temitayo Olayemi Olowu
Energy and Environment Science and Technology Directorate, Idaho National Laboratory, Idaho Falls, ID, USA
6 shared publications - Kaushik Roy
West Bengal State University
3 shared publications - Kaushik Roy
Department of Computer Science, North Carolina Agricultural and Technical State University, Greensboro, NC, USA
3 shared publications - Arif I. Sarwat
Department of Electrical and Computer Engineering, Florida International University, Miami, FL, USA
2 shared publications Opeyemi Ajibuwa
Department of Computer Science, North Carolina Agricultural and Technical State University, Greensboro, NC, USA
2 shared publications- Abdollah Homaifar
Department of Electrical and Computer Engineering, North Carolina AT State University, Greensboro, NC, USA
1 shared publication
Latest Publications
- Open Access
- 20 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 75-80
Distributionally Robust Federated Optimization Against Distribution Shifts and Adversarial Data Corruption
- 20 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 75-80
Open AccessDistributionally Robust Federated Optimization Against Distribution Shifts and Adversarial Data Corruption
- 8 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. PP (3) , 1-12
Differentially Private Online Distributed Aggregative Games With Time-Varying and Non-Identical Communication and Feedback Delays
This paper investigates online distributed aggregative games with time-varying cost functions, where agents are interconnected through an unbalanced communication graph. Due to the distributed and noncooperative nature of the game, some curious agents may wish to steal sensitive information from neighboring agents during parameter exchanges. Additionally, communication delays arising from network congestion, particularly in wireless settings, as well as feedback delays, can hinder the convergence of agents to a Nash equilibrium. Although a recent work addressed both communication and feedback delays in aggregative games, it is based on the unrealistic assumption that the delays are fixed over time and identical across agents. Hence, the case of time-varying and non-identical delays across agents has never been considered in aggregative games. In this work, we address the combined challenges of privacy leakage with time-varying and non-identical communication and feedback delays for the first time. We propose an online distributed dual averaging algorithm that simultaneously tackles these challenges while achieving a provably low regret bound. We perform extensive simulations to show the performance of our proposed algorithm and also compare it with the state-of-the-art algorithm.
- 8 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. PP (3) , 1-12
Differentially Private Online Distributed Aggregative Games With Time-Varying and Non-Identical Communication and Feedback Delays
This paper investigates online distributed aggregative games with time-varying cost functions, where agents are interconnected through an unbalanced communication graph. Due to the distributed and noncooperative nature of the game, some curious agents may wish to steal sensitive information from neighboring agents during parameter exchanges. Additionally, communication delays arising from network congestion, particularly in wireless settings, as well as feedback delays, can hinder the convergence of agents to a Nash equilibrium. Although a recent work addressed both communication and feedback delays in aggregative games, it is based on the unrealistic assumption that the delays are fixed over time and identical across agents. Hence, the case of time-varying and non-identical delays across agents has never been considered in aggregative games. In this work, we address the combined challenges of privacy leakage with time-varying and non-identical communication and feedback delays for the first time. We propose an online distributed dual averaging algorithm that simultaneously tackles these challenges while achieving a provably low regret bound. We perform extensive simulations to show the performance of our proposed algorithm and also compare it with the state-of-the-art algorithm.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 12, 8776-8794
Data Heterogeneity and Byzantine Resiliency in Decentralized Federated Learning
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 12, 8776-8794
Data Heterogeneity and Byzantine Resiliency in Decentralized Federated Learning
- Open Access
Differentially Private Online Distributed Aggregative Games With Time-Varying and Non-Identical Communication and Feedback Delays
This paper investigates online distributed aggregative games with time-varying cost functions, where agents are interconnected through an unbalanced communication graph. Due to the distributed and noncooperative nature of the game, some curious agents may wish to steal sensitive information from neighboring agents during parameter exchanges. Additionally, communication delays arising from network congestion, particularly in wireless settings, as well as feedback delays, can hinder the convergence of agents to a Nash equilibrium. Although a recent work addressed both communication and feedback delays in aggregative games, it is based on the unrealistic assumption that the delays are fixed over time and identical across agents. Hence, the case of time-varying and non-identical delays across agents has never been considered in aggregative games. In this work, we address the combined challenges of privacy leakage with time-varying and non-identical communication and feedback delays for the first time. We propose an online distributed dual averaging algorithm that simultaneously tackles these challenges while achieving a provably low regret bound. Our simulation result shows that the running average of each client's local action converges over time.
Open AccessDifferentially Private Online Distributed Aggregative Games With Time-Varying and Non-Identical Communication and Feedback Delays
This paper investigates online distributed aggregative games with time-varying cost functions, where agents are interconnected through an unbalanced communication graph. Due to the distributed and noncooperative nature of the game, some curious agents may wish to steal sensitive information from neighboring agents during parameter exchanges. Additionally, communication delays arising from network congestion, particularly in wireless settings, as well as feedback delays, can hinder the convergence of agents to a Nash equilibrium. Although a recent work addressed both communication and feedback delays in aggregative games, it is based on the unrealistic assumption that the delays are fixed over time and identical across agents. Hence, the case of time-varying and non-identical delays across agents has never been considered in aggregative games. In this work, we address the combined challenges of privacy leakage with time-varying and non-identical communication and feedback delays for the first time. We propose an online distributed dual averaging algorithm that simultaneously tackles these challenges while achieving a provably low regret bound. Our simulation result shows that the running average of each client's local action converges over time.
- 9 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Industry Applications Magazine
- Vol. 32 (1) , 64-77
Coordinated Voltage Control and Optimization of Distribution Feeders Using Gaussian Process Regression: Proposing A New Framework
This article proposes a constrained Gaussian process regression (GPR)-based multiobjective distribution optimal power flow (GPR-DOPF) framework to coordinate the voltage-regulating devices [capacitor banks (CBs) and voltage regulators (VRs)] with smart inverter (SI) controls. The GPRs are well suited for the complexity and nonlinearity that characterizes power distribution networks. This work provides a detailed mathematical formulation of the GPR, proposes a scalable GPR-DOPF to address computational inefficiency with large datasets, and models the SI control modes and other voltage-regulating devices for application in the DOPF. The GPR is trained (assuming no significant physical changes in the network) using the extensive power flow data obtained from the power distribution network. To determine the optimal settings of the SIs and the legacy devices using the GPR-DOPF, a multiobjective mixed integer nonlinear problem (MINLP) is formulated. The GPR model is coupled with the Non-Dominated Sorting Genetic Algorithm II (NSGA II) to determine the pareto optimal solutions (POSs) of the proposed MINLP formulation. The mathematical objectives include minimizing the voltage deviation and the overall network active power loss.
- 9 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Industry Applications Magazine
- Vol. 32 (1) , 64-77
Coordinated Voltage Control and Optimization of Distribution Feeders Using Gaussian Process Regression: Proposing A New Framework
This article proposes a constrained Gaussian process regression (GPR)-based multiobjective distribution optimal power flow (GPR-DOPF) framework to coordinate the voltage-regulating devices [capacitor banks (CBs) and voltage regulators (VRs)] with smart inverter (SI) controls. The GPRs are well suited for the complexity and nonlinearity that characterizes power distribution networks. This work provides a detailed mathematical formulation of the GPR, proposes a scalable GPR-DOPF to address computational inefficiency with large datasets, and models the SI control modes and other voltage-regulating devices for application in the DOPF. The GPR is trained (assuming no significant physical changes in the network) using the extensive power flow data obtained from the power distribution network. To determine the optimal settings of the SIs and the legacy devices using the GPR-DOPF, a multiobjective mixed integer nonlinear problem (MINLP) is formulated. The GPR model is coupled with the Non-Dominated Sorting Genetic Algorithm II (NSGA II) to determine the pareto optimal solutions (POSs) of the proposed MINLP formulation. The mathematical objectives include minimizing the voltage deviation and the overall network active power loss.
- Open Access
- 30 October 2025
- Published by Elsevier in Power Electronic Devices and Components
- Vol. 12
Multi-objective GPR-based design optimization of high frequency transformers
- 30 October 2025
- Published by Elsevier in Power Electronic Devices and Components
- Vol. 12
Open AccessMulti-objective GPR-based design optimization of high frequency transformers
- Open Access
- 18 September 2025
- Published by MDPI AG in Future Internet
- Vol. 17 (9) , 424
Special Issue: Intrusion Detection and Resiliency in Cyber-Physical Systems and Networks
The rapid expansion of cyber-physical systems (CPSs) and networked environments—including the Internet of Things (IoT), Industrial IoT (IIoT), and the Internet of Vehicles (IoV)—has transformed modern infrastructures, enabling unprecedented connectivity, automation, and data-driven intelligence
- 18 September 2025
- Published by MDPI AG in Future Internet
- Vol. 17 (9) , 424
Open AccessSpecial Issue: Intrusion Detection and Resiliency in Cyber-Physical Systems and Networks
The rapid expansion of cyber-physical systems (CPSs) and networked environments—including the Internet of Things (IoT), Industrial IoT (IIoT), and the Internet of Vehicles (IoV)—has transformed modern infrastructures, enabling unprecedented connectivity, automation, and data-driven intelligence
- Open Access
Online Decentralized Federated Multi-task Learning With Trustworthiness in Cyber-Physical Systems
Multi-task learning is an effective way to address the challenge of model personalization caused by high data heterogeneity in federated learning. However, extending multi-task learning to the online decentralized federated learning setting is yet to be explored. The online decentralized federated learning setting considers many real-world applications of federated learning, such as autonomous systems, where clients communicate peer-to-peer and the data distribution of each client is time-varying. A more serious problem in real-world applications of federated learning is the presence of Byzantine clients. Byzantine-resilient approaches used in federated learning work only when the number of Byzantine clients is less than one-half the total number of clients. Yet, it is difficult to put a limit on the number of Byzantine clients within a system in reality. However, recent work in robotics shows that it is possible to exploit cyber-physical properties of a system to predict clients' behavior and assign a trust probability to received signals. This can help to achieve resiliency in the presence of a dominating number of Byzantine clients. Therefore, in this paper, we develop an online decentralized federated multi-task learning algorithm to provide model personalization and resiliency when the number of Byzantine clients dominates the number of honest clients. Our proposed algorithm leverages cyber-physical properties, such as the received signal strength in wireless systems or side information, to assign a trust probability to local models received from neighbors in each iteration. Our simulation results show that the proposed algorithm performs close to a Byzantine-free setting.
Open AccessOnline Decentralized Federated Multi-task Learning With Trustworthiness in Cyber-Physical Systems
Multi-task learning is an effective way to address the challenge of model personalization caused by high data heterogeneity in federated learning. However, extending multi-task learning to the online decentralized federated learning setting is yet to be explored. The online decentralized federated learning setting considers many real-world applications of federated learning, such as autonomous systems, where clients communicate peer-to-peer and the data distribution of each client is time-varying. A more serious problem in real-world applications of federated learning is the presence of Byzantine clients. Byzantine-resilient approaches used in federated learning work only when the number of Byzantine clients is less than one-half the total number of clients. Yet, it is difficult to put a limit on the number of Byzantine clients within a system in reality. However, recent work in robotics shows that it is possible to exploit cyber-physical properties of a system to predict clients' behavior and assign a trust probability to received signals. This can help to achieve resiliency in the presence of a dominating number of Byzantine clients. Therefore, in this paper, we develop an online decentralized federated multi-task learning algorithm to provide model personalization and resiliency when the number of Byzantine clients dominates the number of honest clients. Our proposed algorithm leverages cyber-physical properties, such as the received signal strength in wireless systems or side information, to assign a trust probability to local models received from neighbors in each iteration. Our simulation results show that the proposed algorithm performs close to a Byzantine-free setting.
- 12 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 11, 752-766
Online Non-Convex Non-Cooperative Cluster-Based Games With Byzantine Resiliency in Decentralized Multi-Agent Systems
Decentralized multi-agent systems are well known for their ability to model complex systems, such as smart grids, autonomous vehicles, etc. Many decentralized multi-agent systems can be modeled as cluster-based non-cooperative games in which agents within a cluster have selfish interests different from those of agents in other clusters. In this paper, we consider a cluster-based non-cooperative game for multi-agent systems in the presence of Byzantine attacks. This is an area of research yet to be explored in non-cooperative games. Therefore, we propose a novel Byzantine-resilient online mirror descent-based decentralized Nash algorithm. We assume that the loss function is time-varying and non-convex. Also, the agents within each cluster form an unbalanced graph network. Our theoretical and simulation results show that the proposed algorithm is resilient against Byzantine attacks and computationally efficient.
- 12 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 11, 752-766
Online Non-Convex Non-Cooperative Cluster-Based Games With Byzantine Resiliency in Decentralized Multi-Agent Systems
Decentralized multi-agent systems are well known for their ability to model complex systems, such as smart grids, autonomous vehicles, etc. Many decentralized multi-agent systems can be modeled as cluster-based non-cooperative games in which agents within a cluster have selfish interests different from those of agents in other clusters. In this paper, we consider a cluster-based non-cooperative game for multi-agent systems in the presence of Byzantine attacks. This is an area of research yet to be explored in non-cooperative games. Therefore, we propose a novel Byzantine-resilient online mirror descent-based decentralized Nash algorithm. We assume that the loss function is time-varying and non-convex. Also, the agents within each cluster form an unbalanced graph network. Our theoretical and simulation results show that the proposed algorithm is resilient against Byzantine attacks and computationally efficient.
- Open Access
Enhancing Deepfake Detection using SE Block Attention with CNN
In the digital age, Deepfake present a formidable challenge by using advanced artificial intelligence to create highly convincing manipulated content, undermining information authenticity and security. These sophisticated fabrications surpass traditional detection methods in complexity and realism. To address this issue, we aim to harness cutting-edge deep learning methodologies to engineer an innovative deepfake detection model. However, most of the models designed for deepfake detection are large, causing heavy storage and memory consumption. In this research, we propose a lightweight convolution neural network (CNN) with squeeze and excitation block attention (SE) for Deepfake detection. The SE block module is designed to perform dynamic channel-wise feature recalibration. The SE block allows the network to emphasize informative features and suppress less useful ones, which leads to a more efficient and effective learning module. This module is integrated with a simple sequential model to perform Deepfake detection. The model is smaller in size and it achieves competing accuracy with the existing models for deepfake detection tasks. The model achieved an overall classification accuracy of 94.14% and AUC-ROC score of 0.985 on the Style GAN dataset from the Diverse Fake Face Dataset. Our proposed approach presents a promising avenue for combating the Deepfake challenge with minimal computational resources, developing efficient and scalable solutions for digital content verification.
Open AccessEnhancing Deepfake Detection using SE Block Attention with CNN
In the digital age, Deepfake present a formidable challenge by using advanced artificial intelligence to create highly convincing manipulated content, undermining information authenticity and security. These sophisticated fabrications surpass traditional detection methods in complexity and realism. To address this issue, we aim to harness cutting-edge deep learning methodologies to engineer an innovative deepfake detection model. However, most of the models designed for deepfake detection are large, causing heavy storage and memory consumption. In this research, we propose a lightweight convolution neural network (CNN) with squeeze and excitation block attention (SE) for Deepfake detection. The SE block module is designed to perform dynamic channel-wise feature recalibration. The SE block allows the network to emphasize informative features and suppress less useful ones, which leads to a more efficient and effective learning module. This module is integrated with a simple sequential model to perform Deepfake detection. The model is smaller in size and it achieves competing accuracy with the existing models for deepfake detection tasks. The model achieved an overall classification accuracy of 94.14% and AUC-ROC score of 0.985 on the Style GAN dataset from the Diverse Fake Face Dataset. Our proposed approach presents a promising avenue for combating the Deepfake challenge with minimal computational resources, developing efficient and scalable solutions for digital content verification.