arXiv subjects

Yongqiang Wang

Publications and source records attributed to Yongqiang Wang.

At least 37 records · Page 2Linked to original sources

arXiv2025

Distributed Finite-Horizon Optimal Control for Consensus with Differential Privacy Guarantees

This paper addresses the problem of privacy-preserving consensus control for multi-agent systems (MAS) using differential privacy. We propose a novel distributed finite-horizon linear quadratic regulator (LQR) framework, in which agents share individual state information while preserving the confidentiality of their local pairwise weight matrices, which are considered sensitive data in MAS. Protecting these matrices effectively safeguards each agent's private cost function and control preferences. Our solution injects consensus error-dependent Laplace noise into the communicated state information and employs a carefully designed time-dependent scaling factor in the local cost functions. {This approach guarantees bounded consensus and achieves rigorous $ε$-differential privacy for the weight matrices without relying on specific noise distribution assumptions.} Additionally, we analytically characterize the trade-off between consensus accuracy and privacy level, offering clear guidelines on how to enhance consensus performance through appropriate scaling of the LQR weight matrices and the privacy budget.

eess.SY↗

arXiv2025

A spin-embedded diamond optomechanical resonator with mechanical quality factor exceeding one million

Diamond optomechanical crystal (OMC) devices with embedded color center spins are promising platforms for a broad range of applications in quantum sensing, networking, and computing applications, offering an interface between a GHz-frequency mechanical mode and both optical photons and coherent spins. A crucial but elusive step towards realizing this platform is to engineer a device with a high-quality factor mechanical mode while preserving the bulk-like coherence of embedded spins. Here we demonstrate sideband-resolved diamond OMCs with mechanical quality factors in excess of $10^6$ at cryogenic temperatures, and find coherence times up to $T_2$ = 270 $μ$s for embedded nitrogen vacancy (NV) centers. Furthermore, we measure these devices across five orders of magnitude in intracavity optical power, demonstrating robust power handling and a high optomechanical cooperativity ($C\gg1$) at cryogenic temperatures that is essential for a broad range of quantum protocols requiring strong, coherent interactions between photons and phonons. These results are enabled by a robust, high-throughput method for forming single-crystal diamond membranes in combination with chemical vapor deposition (CVD) diamond overgrowth with nitrogen $δ$-doping. We discuss the prospects of this platform for hybrid spin-mechanical devices in the quantum regime.

quant-ph↗

arXiv2025

Ensuring Truthfulness in Distributed Aggregative Optimization

Distributed aggregative optimization methods are gaining increased traction due to their ability to address cooperative control and optimization problems, where the objective function of each agent depends not only on its own decision variable but also on the aggregation of other agents' decision variables. Nevertheless, existing distributed aggregative optimization methods implicitly assume all agents to be truthful in information sharing, which can be unrealistic in real-world scenarios, where agents may act selfishly or strategically. In fact, an opportunistic agent may deceptively share false information in its own favor to minimize its own loss, which, however, will compromise the network-level global performance. To solve this issue, we propose a new distributed aggregative optimization algorithm that can ensure truthfulness of agents and convergence performance. To the best of our knowledge, this is the first algorithm that ensures truthfulness in a fully distributed setting, where no "centralized" aggregator exists to collect private information/decision variables from participating agents. We systematically characterize the convergence rate of our algorithm under nonconvex/convex/strongly convex objective functions, which generalizes existing distributed aggregative optimization results that only focus on convex objective functions. We also rigorously quantify the tradeoff between convergence performance and the level of enabled truthfulness under different convexity conditions. Numerical simulations using distributed charging of electric vehicles confirm the efficacy of our algorithm.

cs.MA↗

arXiv2025

Communication Efficient Federated Learning with Linear Convergence on Heterogeneous Data

By letting local clients perform multiple local updates before communicating with a parameter server, modern federated learning algorithms such as FedAvg tackle the communication bottleneck problem in distributed learning and have found many successful applications. However, this asynchrony between local updates and communication also leads to a ''client-drift'' problem when the data is heterogeneous (not independent and identically distributed), resulting in errors in the final learning result. In this paper, we propose a federated learning algorithm, which is called FedCET, to ensure accurate convergence even under heterogeneous distributions of data across clients. Inspired by the distributed optimization algorithm NIDS, we use learning rates to weight information received from local clients to eliminate the ''client-drift''. We prove that under appropriate learning rates, FedCET can ensure linear convergence to the exact solution. Different from existing algorithms which have to share both gradients and a drift-correction term to ensure accurate convergence under heterogeneous data distributions, FedCET only shares one variable, which significantly reduces communication overhead. Numerical comparison with existing counterpart algorithms confirms the effectiveness of FedCET.

cs.LG↗

arXiv2025

Mapping strain and structural heterogeneities around bubbles in amorphous ionically conductive Bi$_2$O$_3$

While amorphous materials are often approximated to have a statistically homogeneous atomic structure, they frequently exhibit localized structural heterogeneity that challenges simplified models. This study uses 4D scanning transmission electron microscopy to investigate the strain and structural modifications around gas bubbles in amorphous Bi$_2$O$_3$ induced by argon irradiation. We present a method for determining strain fields surrounding bubbles that can be used to measure the internal pressure of the gas. Compressive strain is observed around the cavities, with higher-order crystalline symmetries emerging near the cavity interfaces, suggesting paracrystalline ordering as a result of bubble coarsening. This ordering, along with a compressive strain gradient, indicates that gas bubbles induce significant localized changes in atomic packing. By analyzing strain fields with maximum compressive strains of 3\%, we estimate a lower bound on the internal pressure of the bubbles at 2.5 GPa. These findings provide insight into the complex structural behavior of amorphous materials under stress, particularly in systems with gas inclusions, and offer new methods for probing the local atomic structure in disordered materials. Although considering structural heterogeneity in amorphous systems is non-trivial, these features have crucial impacts on material functionalities, such as mechanical strength, ionic conductivity, and electronic mobility.

cond-mat.mtrl-sci↗

arXiv2024

Structure and magnetic properties of a family of two-leg spin ladder compounds Ba2RE2Ge4O13 (RE = Pr, Nd, and Gd-Ho) with strong rung interaction

Compared to the intensive investigation on the 3d transition-metal (TM)-based spin ladder compounds, less attention has been paid to the ones constructed by the rare-earth (RE) ions. Herein, we report a family of RE-based spin ladder compounds Ba2RE2Ge4O13 (RE = Pr, Nd, Gd-Ho) crystallized into the monoclinic structure with the space group C2/c. The RE ions are arranged on a two-leg spin ladder motif along the b-axis, where the rung and leg exchange interactions are bridged via the RE-O-RE pathways and RE-O-Ge-O-RE routes, respectively. Moreover, the much shorter rung distance in the RE2O12 dimer units than the leg distance suggests Ba2RE2Ge4O13 to be a strong-rung spin ladder system. All the synthesized Ba2RE2Ge4O13 (RE = Pr, Nd, Gd-Ho) compounds exhibit the dominant antiferromagnetic (AFM) interactions and absence of magnetic order down to 1.8 K. Among the family members, Ba2Dy2Ge4O13 can be described by Jeff = 1/2 Kramers doublet states, the low temperature specific heat indicates the coexistence of spin dimerized state with broad maximum at ~ 2.4 K and long-range AFM order with TN = 0.81 K. This family of Ba2RE2Ge4O13 compounds thereby provides a rare platform to investigate the novel spin ladder physics constructed by 4f electrons.

cond-mat.str-el↗

arXiv2024

Effects of eco-driving on energy consumption and battery degradation for electric vehicles at signalized intersections

Eco-driving has been shown to reduce energy consumption for electric vehicles (EVs). Such strategies can also be implemented to both reduce energy consumption and improve battery lifetime. This study considers the eco-driving of a connected electric vehicle equipped with vehicle-to-infrastructure (V2I) communication passing through two signalized intersections. Dynamic programming is employed to construct an eco-driving algorithm that incorporates a battery degradation model in addition to minimizing energy consumption to optimize the vehicle's speed trajectory while transiting the control zone. A parametric study is conducted for various signal timings and distances between the two intersections. It is found that eco-driving can provide up to 49\% in cost benefits over regular driving due to energy savings and improved battery life which could boost consumers' interests on EVs. This study also considered different battery capacity decay rates based on battery chemistry. Although a higher decay rate affects the optimal speed trajectories only slightly, it amplifies the benefits of eco-driving on battery life. Two battery sizes were also studied to show that the larger battery is associated with a drastically increased lifetime, thus creating opportunities for electric vehicles in other applications such as vehicle-to-grid (V2G) integration. Field tests were also conducted using a simplified rule-based version of the eco-driving algorithm implemented as a phone app which issues audio speed recommendations to the driver. The field test results were promising and validated the results from simulations. The phone app implementation is convenient and could facilitate broader adoption and widespread use of eco-driving which helps to improve transportation efficiency and protect the environment.

eess.SY↗

arXiv2024

Locally Differentially Private Distributed Online Learning with Guaranteed Optimality

Distributed online learning is gaining increased traction due to its unique ability to process large-scale datasets and streaming data. To address the growing public awareness and concern on privacy protection, plenty of algorithms have been proposed to enable differential privacy in distributed online optimization and learning. However, these algorithms often face the dilemma of trading learning accuracy for privacy. By exploiting the unique characteristics of online learning, this paper proposes an approach that tackles the dilemma and ensures both differential privacy and learning accuracy in distributed online learning. More specifically, while ensuring a diminishing expected instantaneous regret, the approach can simultaneously ensure a finite cumulative privacy budget, even in the infinite time horizon. To cater for the fully distributed setting, we adopt the local differential-privacy framework, which avoids the reliance on a trusted data curator that is required in the classic "centralized" (global) differential-privacy framework. To the best of our knowledge, this is the first algorithm that successfully ensures both rigorous local differential privacy and learning accuracy. The effectiveness of the proposed algorithm is evaluated using machine learning tasks, including logistic regression on the the "mushrooms" datasets and CNN-based image classification on the "MNIST" and "CIFAR-10" datasets.

cs.LG↗

arXiv2024

Ensure Differential Privacy and Convergence Accuracy in Consensus Tracking and Aggregative Games with Coupling Constraints

We address differential privacy for fully distributed aggregative games with shared coupling constraints. By co-designing the generalized Nash equilibrium (GNE) seeking mechanism and the differential-privacy noise injection mechanism, we propose the first GNE seeking algorithm that can ensure both provable convergence to the GNE and rigorous epsilon-differential privacy, even with the number of iterations tending to infinity. As a basis of the co-design, we also propose a new consensus-tracking algorithm that can achieve rigorous epsilon-differential privacy while maintaining accurate tracking performance, which, to our knowledge, has not been achieved before. To facilitate the convergence analysis, we also establish a general convergence result for stochastically-perturbed nonstationary fixed-point iteration processes, which lie at the core of numerous optimization and variational problems. Numerical simulation results confirm the effectiveness of the proposed approach.

cs.GT↗

arXiv2024

Experimental Study of Decentralized Robot Network Coordination

Synchronization and desynchronization in networks is a highly studied topic in many electrical systems, but there is a distinct lack of research on this topic with respect to robotics. Creating an effective decentralized synchronization algorithm for a robotic network would allow multiple robots to work together to achieve a task and would be able to adapt to the addition or loss of robots in real-time. The purpose of this study is to improve algorithms implemented developed by the authors for this purpose and experimentally evaluate these methods. The most effective algorithm for synchronization and desynchronization found in a former study were modified to improve testing and vary its methods of calculation. A multi-robot platform composed of multiple Roomba robots was used in the experimental study. Observation of data showed how adjusting parameters of the algorithms affected both the time to reach a desired state of synchronization or desynchronization and how the network maintained this state. Testing three different methods on each algorithm showed differing results. Future work in cooperative robotics will likely see success using these algorithms to accomplish a variety of tasks.

eess.SY↗

arXiv2024

Analysis of Dead Reckoning Accuracy in Swarm Robotics System

The objective of this paper is to determine the position of a single mobile robot in a swarm using dead reckoning techniques. We investigate the accuracy of navigation by using this process. The paper begins with the research background and social importance. Then, the specific experimental setup and analysis of experimental results are presented. Finally, the results are detailed and some potential improvements are provided.

eess.SY↗

arXiv2024

S2LIC: Learned Image Compression with the SwinV2 Block, Adaptive Channel-wise and Global-inter Attention Context

Recently, deep learning technology has been successfully applied in the field of image compression, leading to superior rate-distortion performance. It is crucial to design an effective and efficient entropy model to estimate the probability distribution of the latent representation. However, the majority of entropy models primarily focus on one-dimensional correlation processing between channel and spatial information. In this paper, we propose an Adaptive Channel-wise and Global-inter attention Context (ACGC) entropy model, which can efficiently achieve dual feature aggregation in both inter-slice and intraslice contexts. Specifically, we divide the latent representation into different slices and then apply the ACGC model in a parallel checkerboard context to achieve faster decoding speed and higher rate-distortion performance. In order to capture redundant global features across different slices, we utilize deformable attention in adaptive global-inter attention to dynamically refine the attention weights based on the actual spatial relationships and context. Furthermore, in the main transformation structure, we propose a high-performance S2LIC model. We introduce the residual SwinV2 Transformer model to capture global feature information and utilize a dense block network as the feature enhancement module to improve the nonlinear representation of the image within the transformation structure. Experimental results demonstrate that our method achieves faster encoding and decoding speeds and outperforms VTM-17.1 and some recent learned image compression methods in both PSNR and MS-SSIM metrics.

eess.IV↗

arXiv2024

Privacy-Preserving Nonlinear Cloud-based Model Predictive Control via Affine Masking

With the advent of 5G technology that presents enhanced communication reliability and ultra low latency, there is renewed interest in employing cloud computing to perform high performance but computationally expensive control schemes like nonlinear model predictive control (MPC). Such a cloud-based control scheme, however, requires data sharing between the plant (agent) and the cloud, which raises privacy concerns. This is because privacy-sensitive information such as system states and control inputs has to be sent to/from the cloud and thus can be leaked to attackers for various malicious activities. In this paper, we develop a simple yet effective affine masking strategy for privacy-preserving nonlinear MPC. Specifically, we consider external eavesdroppers or honest-but-curious cloud servers that wiretap the communication channel and intend to infer the plant's information including state information and control inputs. An affine transformation-based privacy-preservation mechanism is designed to mask the true states and control signals while reformulating the original MPC problem into a different but equivalent form. We show that the proposed privacy scheme does not affect the MPC performance and it preserves the privacy of the plant such that the eavesdropper is unable to identify the actual value or even estimate a rough range of the private state and input signals. The proposed method is further extended to achieve privacy preservation in cloud-based output-feedback MPC. Simulations are performed to demonstrate the efficacy of the developed approaches.

eess.SY↗

arXiv2024

Robust Constrained Consensus and Inequality-constrained Distributed Optimization with Guaranteed Differential Privacy and Accurate Convergence

We address differential privacy for fully distributed optimization subject to a shared inequality constraint. By co-designing the distributed optimization mechanism and the differential-privacy noise injection mechanism, we propose the first distributed constrained optimization algorithm that can ensure both provable convergence to a global optimal solution and rigorous $ε$-differential privacy, even when the number of iterations tends to infinity. Our approach does not require the Lagrangian function to be strictly convex/concave, and allows the global objective function to be non-separable. As a byproduct of the co-design, we also propose a new constrained consensus algorithm that can achieve rigorous $ε$-differential privacy while maintaining accurate convergence, which, to our knowledge, has not been achieved before. Numerical simulation results on a demand response control problem in smart grid confirm the effectiveness of the proposed approach.

math.OC↗

arXiv2024

Quantization Avoids Saddle Points in Distributed Optimization

Distributed nonconvex optimization underpins key functionalities of numerous distributed systems, ranging from power systems, smart buildings, cooperative robots, vehicle networks to sensor networks. Recently, it has also merged as a promising solution to handle the enormous growth in data and model sizes in deep learning. A fundamental problem in distributed nonconvex optimization is avoiding convergence to saddle points, which significantly degrade optimization accuracy. We discover that the process of quantization, which is necessary for all digital communications, can be exploited to enable saddle-point avoidance. More specifically, we propose a stochastic quantization scheme and prove that it can effectively escape saddle points and ensure convergence to a second-order stationary point in distributed nonconvex optimization. With an easily adjustable quantization granularity, the approach allows a user to control the number of bits sent per iteration and, hence, to aggressively reduce the communication overhead. Numerical experimental results using distributed optimization and learning problems on benchmark datasets confirm the effectiveness of the approach.

math.OC↗

arXiv2024

Privacy in Multi-agent Systems

With the increasing awareness of privacy and the deployment of legislations in various multi-agent system application domains such as power systems and intelligent transportation, the privacy protection problem for multi-agent systems is gaining increased traction in recent years. This article discusses some of the representative advancements in the filed.

eess.SY↗

arXiv2024

Privacy-Preserving Distributed Optimization and Learning

Distributed optimization and learning has recently garnered great attention due to its wide applications in sensor networks, smart grids, machine learning, and so forth. Despite rapid development, existing distributed optimization and learning algorithms require each agent to exchange messages with its neighbors, which may expose sensitive information and raise significant privacy concerns. In this survey paper, we overview privacy-preserving distributed optimization and learning methods. We first discuss cryptography, differential privacy, and other techniques that can be used for privacy preservation and indicate their pros and cons for privacy protection in distributed optimization and learning. We believe that among these approaches, differential privacy is most promising due to its low computational and communication complexities, which are extremely appealing for modern learning based applications with high dimensions of optimization variables. We then introduce several differential-privacy algorithms that can simultaneously ensure privacy and optimization accuracy. Moreover, we provide example applications in several machine learning problems to confirm the real-world effectiveness of these algorithms. Finally, we highlight some challenges in this research domain and discuss future directions.

cs.LG↗

arXiv2024

Communication-Efficient Decentralized Multi-Agent Reinforcement Learning for Cooperative Adaptive Cruise Control

Connected and autonomous vehicles (CAVs) promise next-gen transportation systems with enhanced safety, energy efficiency, and sustainability. One typical control strategy for CAVs is the so-called cooperative adaptive cruise control (CACC) where vehicles drive in platoons and cooperate to achieve safe and efficient transportation. In this study, we formulate CACC as a multi-agent reinforcement learning (MARL) problem. Diverging from existing MARL methods that use centralized training and decentralized execution which require not only a centralized communication mechanism but also dense inter-agent communication during training and online adaptation, we propose a fully decentralized MARL framework for enhanced efficiency and scalability. In addition, a quantization-based communication scheme is proposed to reduce the communication overhead without significantly degrading the control performance. This is achieved by employing randomized rounding numbers to quantize each piece of communicated information and only communicating non-zero components after quantization. Extensive experimentation in two distinct CACC settings reveals that the proposed MARL framework consistently achieves superior performance over several contemporary benchmarks in terms of both communication efficiency and control efficacy. In the appendix, we show that our proposed framework's applicability extends beyond CACC, showing promise for broader intelligent transportation systems with intricate action and state spaces.

eess.SY↗