Ren Wang

Dr. Ren Wang

Department of Electrical and Computer Engineering, Illinois Institute of Technology, Chicago, IL 60616, USA
orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 November 2020
Verified
Book Chapter
Closed access
PDF file
Ren WangRen Wang
Ren Wang
GZGaoyuan Zhang
Gaoyuan Zhang
SLSijia Liu
Sijia Liu
PCPin-Yu Chen
Pin-Yu Chen
JXJinjun Xiong
Jinjun Xiong
MWMeng Wang
Meng Wang

2 April 2018 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
PGPengzhi Gao
Pengzhi Gao
Ren WangRen Wang
Ren Wang
MWMeng Wang
Meng Wang
JCJoe H. Chow
Joe H. Chow
This paper proposes a communication-reduced, cyber-resilient, and information-preserved data collection framework. Random noise and quantization are applied to the measurements before transmission to compress data and enhance data privacy. Leveraging the low-rank property of the data, we develop novel methods to recover the original data from quantized measurements even when partial measurements are corrupted. The data recovery is achieved through solving a constrained maximum likelihood estimation problem. The recovery error is proven to be order-wise optimal and decays in the same order as that of the state-of-the-art method when there is no corruption. The data accuracy is thus maintained while the data privacy is enhanced. A proximal algorithm with convergence guarantee is proposed to solve the nonconvex problem. The analyses are extended to situations when some measurements are lost, or when multiple copies of noisy, quantized measurements are sent for each data point. A new application of this framework for data privacy in power systems is discussed. Experiments on synthetic data and real synchrophasor data in power systems demonstrate the effectiveness of our method.

11 January 2023 in IEEE Transactions on Artificial Intelligence
Verified
Journal Article
Closed access
WLWenting Li
Wenting Li
DDDeepjyoti Deka
Deepjyoti Deka
Ren WangRen Wang
Ren Wang
MPMario Arrieta Paternina
Mario Arrieta Paternina
The growth in distributed energy resources (DERs) is an important step toward solving the global climate crisis. However, many DERs, such as wind and solar power, are random and intermittent, causing the data in power grids to be perturbed with high uncertainty. Such perturbations degrade the performance of data-driven algorithms introduced in power grids for sensing and control. Existing approaches can strengthen machine learning models against well-designed malicious attacks. However, such physics-agnostic efforts fail to ensure the robustness to natural perturbations in power grids, that occur due to varying loads and changes in control inputs. This paper proposes a novel physics-constrained adversarial training method for robustifying neural networks for the crucial problem of locating edge-faults in power grids. Our approach relies on first deriving analytical physical laws that are satisfied by state perturbations in realistic grids, and then using the descriptive sets during adversarial training. Compared to state of the art methods, our perturbation-robust neural networks have higher robust accuracy as well as training efficiency. Also, we demonstrate that the proposed approach achieves a tighter upper bound of robust risks than traditional efforts. The numerical experimental results in the IEEE 68-bus benchmark system validate our adversarial training in two scenarios when loads and control inputs vary randomly. The proposed method shows superior performance in accuracy and efficiency for different perturbed datasets. In addition, we testify the influence of different inputs on the robustness.

17 January 2024 in Electronics
Verified
Journal Article
Open access
PDF file
IGIgnacio de Cominges Guerra
Ignacio de Cominges Guerra
WLWenting Li
Wenting Li
Ren WangRen Wang
Ren Wang
The integration of machine learning in power systems, particularly in stability and dynamics, addresses the challenges brought by the integration of renewable energies and distributed energy resources (DERs). Traditional methods for power system transient stability, involving solving differential equations with computational techniques, face limitations due to their time-consuming and computationally demanding nature. This paper introduces physics-informed Neural Networks (PINNs) as a promising solution for these challenges, especially in scenarios with limited data availability and the need for high computational speed. PINNs offer a novel approach for complex power systems by incorporating additional equations and adapting to various system scales, from a single bus to multi-bus networks. Our study presents the first comprehensive evaluation of physics-informed Neural Networks (PINNs) in the context of power system transient stability, addressing various grid complexities. Additionally, we introduce a novel approach for adjusting loss weights to improve the adaptability of PINNs to diverse systems. Our experimental findings reveal that PINNs can be efficiently scaled while maintaining high accuracy. Furthermore, these results suggest that PINNs significantly outperform the traditional ode45 method in terms of efficiency, especially as the system size increases, showcasing a progressive speed advantage over ode45.

27 August 2018 in IEEE Journal of Selected Topics in Signal Processing
Verified
Journal Article
Closed access
Ren WangRen Wang
Ren Wang
MWMeng Wang
Meng Wang
JXJinjun Xiong
Jinjun Xiong
Quantized low-rank matrix recovery estimates the original matrix from its entry-wise quantized measurements. Subspace clustering divides data points belonging to the union of subspaces (UoS) into the respective subspaces. Generalizing from both quantized matrix recovery and subspace clustering, this paper for the first time studies the problem of combined data recovery and subspace clustering based on the quantized measurements of data points following the UoS model. The recovery and clustering is achieved simultaneously by solving a nonconvex constrained maximum likelihood problem. The relative recovery error is proved to diminish to zero as the matrix size increases. A Sparse Alternative Proximal Algorithm (Sparse-APA) with a convergence guarantee is proposed to solve the non-convex problem. The proposed method is evaluated numerically on synthetic and Extended Yale Face B Datasets.

1 June 2020
Verified
Conference Paper
Closed access
BLBin Li
Bin Li
YWYipeng Wang
Yipeng Wang
Ren WangRen Wang
Ren Wang
CTCharlie Tai
Charlie Tai
RIRavi Iyer
Ravi Iyer
KAKrste Asanovic
Krste Asanovic
Network function virtualization (NFV) technology attracts tremendous interests from telecommunication industry and data center operators, as it allows service providers to assign resource for Virtual Network Functions (VNFs) on demand, achieving better flexibility, programmability, and scalability. To improve server utilization, one popular practice is to deploy best effort (BE) workloads along with high priority (HP) VNFs when high priority VNF's resource usage is detected to be low. The key challenge of this deployment scheme is to dynamically balance the Service level objective (SLO) and the total cost of ownership (TCO) to optimize the data center efficiency under inherently fluctuating workloads. With the recent advancement in deep reinforcement learning, we conjecture that it has the potential to solve this challenge by adaptively adjusting resource allocation to reach the improved performance and higher server utilization. In this paper, we present a closed-loop automation system RLDRM 1 1 RLDRM: Reinforcement Learning Dynamic Resource Management to dynamically adjust Last Level Cache allocation between HP VNFs and BE workloads using deep reinforcement learning. The results demonstrate improved server utilization while maintaining required SLO for the HP VNFs.