Content area

Abstract

As networked systems grow in scale and complexity, they become increasingly vulnerable to failures, congestion, and inefficiencies that may lead to system-wide breakdowns. To address these challenges, this work develops adaptive frameworks, algorithmic solutions, and theoretical analyzes that improve robustness, scalability, learning, and personalization. We investigate optimization and learning in robust networked systems across three interconnected domains: interdependent network resilience, next-generation transportation systems, and decentralized federated learning.

First, we examine cascading failures in interdependent networks. A novel dynamic coupling strategy is introduced, which adaptively adjusts load redistribution in real time. This strategy is mathematically characterized, computationally efficient, and empirically validated to improve system survival rates compared to static approaches, significantly increasing the critical attack threshold, the minimum initial disruption required to trigger total collapse.

Second, the research extends resilience analysis to transportation networks under mixed autonomy, where autonomous vehicles (AVs) coexist with human-driven vehicles (HVs). Using a game-theoretic framework, the thesis derives equilibrium strategies for AV routing and flow re-balancing that mitigate congestion propagation. To capture the dynamic and decentralized nature of real traffic, a multi-agent reinforcement learning (MARL) framework is further developed for fleet management, enabling scalable coordination of AVs that improves throughput and network resilience without centralized control.

Third, we address the pressing scalability and personalization challenges in federated learning, particularly in decentralized settings where no central server coordinates training and client data are highly heterogeneous. Existing methods often struggle with non-IID distributions, communication bottlenecks, and the need for models that adapt to diverse users. To overcome these limitations, we propose FedSPD (Federated learning with Soft-clustering Personalized Decentralized), which enhances decentralized federated learning by enabling clients to form flexible, soft clusters that balance global collaboration with personalized adaptation. This design directly tackles data heterogeneity and connectivity constraints, allowing effective learning even in low-resource or sparsely connected networks.

Together, these contributions establish a systematic approach for building intelligent, adaptive, and failure-resistant infrastructures. The results offer both theoretical insights and practical frameworks, providing a foundation for the development of secure, scalable, and trustworthy networked systems in an increasingly interconnected world.

Details

1010268
Business indexing term
Title
Learning and Optimization Over Robust Networked Systems
Author
Number of pages
197
Publication year
2025
Degree date
2025
School code
0041
Source
DAI-B 87/3(E), Dissertation Abstracts International
ISBN
9798293877386
Committee member
Kar, Soummya; Lin, Wan-Yi
University/institution
Carnegie Mellon University
Department
Electrical and Computer Engineering
University location
United States -- Pennsylvania
Degree
Ph.D.
Source type
Dissertation or Thesis
Language
English
Document type
Dissertation/Thesis
Dissertation/thesis number
32243567
ProQuest document ID
3253538507
Document URL
https://www.proquest.com/dissertations-theses/learning-optimization-over-robust-networked/docview/3253538507/se-2?accountid=208611
Copyright
Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works.
Database
ProQuest One Academic