Related papers: Fast Multiagent Formation Stabilization with Spars…
In recent years, substantial progress has been made on Graph Convolutional Networks (GCNs). However, the computing of GCN usually requires a large memory space for keeping the entire graph. In consequence, GCN is not flexible enough,…
This paper presents an enhanced adaptive random Fourier features (ARFF) training algorithm for shallow neural networks, building upon the work introduced in "Adaptive Random Fourier Features with Metropolis Sampling", Kammonen et al.,…
We propose a method for the collective maneuvering of affine formations in the plane by modifying the original weights of the Laplacian matrix used to achieve static formations of robot swarms. Specifically, the resulting collective motion…
We investigate the interplay between pre-stress and mechanical properties in random elastic networks. To do this in a controlled fashion, we introduce an algorithm for creating random freestanding frames that support exactly one state of…
We investigate the performance of First-In, First-Out (FIFO) queues over wireless networks. We characterize the stability region of a general scenario where an arbitrary number of FIFO queues, which are served by a wireless medium, are…
In context of the universal presence of defects in additively manufactured (AM) metals, efficient computational tools are required to rapidly screen AM microstructures for mechanical integrity. To this end, a deep learning approach is used…
Hybrid Graphene/magnetic structures offer a unique playground for fundamental research, and opportunities for emerging technologies. Graphene-spaced ultrathin structures with antiferromagnetic exchange-coupling (AFC) seem a relevant…
In the field of distributed system, Arbitrary Pattern Formation (APF) problem is an extensively studied problem. The purpose of APF is to design an algorithm to move a swarm of robots to a particular position on an environment (discrete or…
We study personalized federated learning for multivariate responses where client models are heterogeneous yet share variable-level structure. Existing entry-wise penalties ignore cross-response dependence, while matrix-wise fusion…
In this paper, we present a topology optimization (TO) framework to simultaneously optimize the matrix topology and fiber distribution of functionally graded continuous fiber-reinforced composites (FRC). Current approaches in density-based…
One main challenge in federated learning is the large communication cost of exchanging weight updates from clients to the server at each round. While prior work has made great progress in compressing the weight updates through gradient…
Affine frequency division multiplexing (AFDM) has emerged as a promising integrated sensing and communication (ISAC) waveform due to its intrinsic chirp signalling nature. Nevertheless, practical AFDM-based ISAC still faces two key…
Deep model compression has been extensively studied, and state-of-the-art methods can now achieve high compression ratios with minimal accuracy loss. This paper studies model compression through a different lens: could we compress models…
Federated learning (FL) allows multiple clients cooperatively train models without disclosing local data. However, the existing works fail to address all these practical concerns in FL: limited communication resources, dynamic network…
The scalable solution of large sparse linear systems is a bottleneck in scientific computing and graph analysis. While algebraic multigrid (AMG) offers optimal linear scaling, its performance is severely constrained by the trade-off between…
Affine frequency division multiplexing (AFDM) has garnered significant attention due to its superior performance in high-mobility scenarios, coupled with multiple waveform parameters that provide greater degrees of freedom for system…
Federated learning (FL) has gained significant attention for enabling decentralized training on edge networks without exposing raw data. However, FL models remain susceptible to adversarial attacks and performance degradation in non-IID…
Multi Agent Path Finding (MAPF) is critical for coordinating multiple robots in shared environments, yet robust execution of generated plans remains challenging due to operational uncertainties. The Action Dependency Graph (ADG) framework…
Joint network topology inference represents a canonical problem of jointly learning multiple graph Laplacian matrices from heterogeneous graph signals. In such a problem, a widely employed assumption is that of a simple common component…
An abstract framework is developed that enables the analysis of algebraically stabilized discretizations in a unified way. This framework is applied to a discretization of this kind for convection-diffusion-reaction equations. The…