pwc-archive/papers-with-abstracts huggingface dataset:
Low-Complexity Control for a Class of Uncertain MIMO Nonlinear Systems under Generalized Time-Varying Output Constraints (extended version)
Authors: Farhad Mehdifar, Lars Lindemann, Charalampos P. Bechlioulis, Dimos V. Dimarogonas
Date: 2024-01-08 00:00:00

This paper introduces a novel control framework to address the satisfaction of multiple time-varying output constraints in uncertain high-order MIMO nonlinear control systems. Unlike existing methods, which often assume that the constraints are always decoupled and feasible, our approach can handle coupled time-varying constraints even in the presence of potential infeasibilities. First, it is shown that satisfying multiple constraints essentially boils down to ensuring the positivity of a scalar variable, representing the signed distance from the boundary of the time-varying output-constrained set. To achieve this, a single consolidating constraint is designed that, when satisfied, guarantees convergence to and invariance of the time-varying output-constrained set within a user-defined finite time. Next, a novel robust and low-complexity feedback controller is proposed to ensure the satisfaction of the consolidating constraint. Additionally, we provide a mechanism for online modification of the consolidating constraint to find a least violating solution when the constraints become mutually infeasible for some time. Finally, simulation examples of trajectory and region tracking for a mobile robot validate the proposed approach.
Federated Analytics for 6G Networks: Applications, Challenges, and Opportunities
Authors: Juan Marcelo Parra-Ullauri, Xunzheng Zhang, Anderson Bravalheri, Yulei Wu, Reza Nejabati, Dimitra Simeonidou
Date: 2024-01-08 00:00:00
Tasks: Distributed Computing, Federated Learning

Extensive research is underway to meet the hyper-connectivity demands of 6G networks, driven by applications like XR/VR and holographic communications, which generate substantial data requiring network-based processing, transmission, and analysis. However, adhering to diverse data privacy and security policies in the anticipated multi-domain, multi-tenancy scenarios of 6G presents a significant challenge. Federated Analytics (FA) emerges as a promising distributed computing paradigm, enabling collaborative data value generation while preserving privacy and reducing communication overhead. FA applies big data principles to manage and secure distributed heterogeneous networks, improving performance, reliability, visibility, and security without compromising data confidentiality. This paper provides a comprehensive overview of potential FA applications, domains, and types in 6G networks, elucidating analysis methods, techniques, and queries. It explores complementary approaches to enhance privacy and security in 6G networks alongside FA and discusses the challenges and prerequisites for successful FA implementation. Additionally, distinctions between FA and Federated Learning are drawn, highlighting their synergistic potential through a network orchestration scenario.
Recursively Feasible Chance-constrained Model Predictive Control under Gaussian Mixture Model Uncertainty
Authors: Kai Ren, Colin Chen, Hyeontae Sung, Heejin Ahn, Ian Mitchell, Maryam Kamgarpour
Date: 2024-01-08 00:00:00
Tasks: Autonomous Driving, model, Model Predictive Control, Trajectory Prediction

We present a chance-constrained model predictive control (MPC) framework under Gaussian mixture model (GMM) uncertainty. Specifically, we consider the uncertainty that arises from predicting future behaviors of moving obstacles, which may exhibit multiple modes (for example, turning left or right). To address the multi-modal uncertainty distribution, we propose three MPC formulations: nominal chance-constrained planning, robust chance-constrained planning, and contingency planning. We prove that closed-loop trajectories generated by the three planners are safe. The approaches differ in conservativeness and performance guarantee. In particular, the robust chance-constrained planner is recursively feasible under certain assumptions on the propagation of prediction uncertainty. On the other hand, the contingency planner generates a less conservative closed-loop trajectory than the nominal planner. We validate our planners using state-of-the-art trajectory prediction algorithms in autonomous driving simulators.
Decision-Oriented Learning for Future Power System Decision-Making under Uncertainty
Authors: Ran Li, Haipeng Zhang, Mingyang Sun, Fei Teng, Can Wan, Salvador Pineda, Georges Kariniotakis
Date: 2024-01-08 00:00:00
Tasks: Decision Making, Decision Making Under Uncertainty

Better forecasts may not lead to better decision-making. To address this challenge, decision-oriented learning (DOL) has been proposed as a new branch of machine learning that replaces traditional statistical loss with a decision loss to form an end-to-end model. Applications of DOL in power systems have been developed in recent years. For renewable-rich power systems, uncertainties propagate through sequential tasks, where traditional statistical-based approaches focus on minimizing statistical errors at intermediate stages but may fail to provide optimal decisions at the final stage. This paper first elaborates on the mismatch between more accurate forecasts and more optimal decisions in the power system caused by statistical-based learning (SBL) and explains how DOL resolves this problem. Secondly, this paper extensively reviews DOL techniques and their applications in power systems while highlighting their pros and cons in relation to SBL. Finally, this paper identifies the challenges to adopt DOL in the energy sector and presents future research directions.
On Metzler positive systems on hypergraphs
Authors: Shaoxuan Cui, Guofeng Zhang, Hildeberto Jardón-Kojakhmetov, Ming Cao
Date: 2024-01-08 00:00:00

In graph-theoretical terms, an edge in a graph connects two vertices while a hyperedge of a hypergraph connects any more than one vertices. If the hypergraph's hyperedges further connect the same number of vertices, it is said to be uniform. In algebraic graph theory, a graph can be characterized by an adjacency matrix, and similarly, a uniform hypergraph can be characterized by an adjacency tensor. This similarity enables us to extend existing tools of matrix analysis for studying dynamical systems evolving on graphs to the study of a class of polynomial dynamical systems evolving on hypergraphs utilizing the properties of tensors. To be more precise, in this paper, we first extend the concept of a Metzler matrix to a Metzler tensor and then describe some useful properties of such tensors. Next, we focus on positive systems on hypergraphs associated with Metzler tensors. More importantly, we design control laws to stabilize the origin of this class of Metzler positive systems on hypergraphs. In the end, we apply our findings to two classic dynamical systems: a higher-order Lotka-Volterra population dynamics system and a higher-order SIS epidemic dynamic process. The corresponding novel stability results are accompanied by ample numerical examples.
IMPaCT: Interval MDP Parallel Construction for Controller Synthesis of Large-Scale Stochastic Systems
Authors: Ben Wooding, Abolfazl Lavaei
Date: 2024-01-07 00:00:00
Tasks: Cloud Computing

This paper is concerned with developing a software tool, called IMPaCT, for the parallelized verification and controller synthesis of large-scale stochastic systems using interval Markov chains (IMCs) and interval Markov decision processes (IMDPs), respectively. The tool serves to (i) construct IMCs/IMDPs as finite abstractions of underlying original systems, and (ii) leverage interval iteration algorithms for formal verification and controller synthesis over infinite-horizon properties, including safety, reachability, and reach-avoid, while offering convergence guarantees. IMPaCT is developed in C++ and designed using AdaptiveCpp, an independent open-source implementation of SYCL, for adaptive parallelism over CPUs and GPUs of all hardware vendors, including Intel and NVIDIA. IMPaCT stands as the first software tool for the parallel construction of IMCs/IMDPs, empowered with the capability to leverage high-performance computing platforms and cloud computing services. Specifically, parallelism offered by IMPaCT effectively addresses the challenges arising from the state-explosion problem inherent in discretization-based techniques applied to large-scale stochastic systems. We benchmark IMPaCT on several physical case studies, adopted from the ARCH tool competition for stochastic models, including a 2-dimensional robot, a 3-dimensional autonomous vehicle, a 5-dimensional room temperature system, and a 7-dimensional building automation system. To show the scalability of our tool, we also employ IMPaCT for the formal analysis of a 14-dimensional case study.
Uncertainty Propagation and Bayesian Fusion on Unimodular Lie Groups from a Parametric Perspective
Authors: Jikai Ye, Gregory S. Chirikjian
Date: 2024-01-07 00:00:00

We address the problem of uncertainty propagation and Bayesian fusion on unimodular Lie groups. Starting from a stochastic differential equation (SDE) defined on Lie groups via Mckean-Gangolli injection, we first convert it to a parametric SDE in exponential coordinates. The coefficient transform method for the conversion is stated for both Ito's and Stratonovich's interpretation of the SDE. Then we derive a mean and covariance fitting formula for probability distributions on Lie groups defined by a concentrated distribution on the exponential coordinate. It is used to derive the mean and covariance propagation equations for the SDE defined by injection, which coincides with the result derived from a Fokker-Planck equation in previous work. We also propose a simple modification to the update step of Kalman filters using the fitting formula, which improves the fusion accuracy with moderate computation time.
Data-driven Dynamic Event-triggered Control
Authors: Tao Xu, Zhiyong Sun, Guanghui Wen, Zhisheng Duan
Date: 2024-01-07 00:00:00
Tasks: Quantization

This paper revisits the event-triggered control problem from a data-driven perspective, where unknown continuous-time linear systems subject to disturbances are taken into account. Using data information collected off-line instead of accurate system model information, a data-driven dynamic event-triggered control scheme is developed in this paper. The dynamic property is reflected by that the designed event-triggering function embedded in the event-triggering mechanism (ETM) is dynamically updated as a whole. Thanks to this dynamic design, a strictly positive minimum inter-event time (MIET) is guaranteed without sacrificing control performance. Specifically, exponential input-to-state stability (ISS) of the closed-loop system with respect to disturbances is achieved in this paper, which is superior to some existing results that only guarantee a practical exponential ISS property. The dynamic ETM is easy-to-implement in practical operation since all designed parameters are determined only by a simple data-driven linear matrix inequality (LMI), without additional complicated conditions as required in relevant literature. As quantization is the most common signal constraint in practice, the developed control scheme is further extended to the case where state transmission is affected by a uniform or logarithmic quantization effect. Finally, adequate simulations are performed to show the validity and superiority of the proposed control schemes.
Dynamic and Memory-efficient Shape Based Methodologies for User Type Identification in Smart Grid Applications
Authors: Rui Yuan, S. Ali Pourmousavi, Wen L. Soong, Jon A. R. Liisberg
Date: 2024-01-07 00:00:00
Tasks: Dimensionality Reduction, Edge-computing

Detecting behind-the-meter (BTM) equipment and major appliances at the residential level and tracking their changes in real time is important for aggregators and traditional electricity utilities. In our previous work, we developed a systematic solution called IRMAC to identify residential users' BTM equipment and applications from their imported energy data. As a part of IRMAC, a Similarity Profile (SP) was proposed for dimensionality reduction and extracting self-join similarity from the end users' daily electricity usage data. The proposed SP calculation, however, was computationally expensive and required a significant amount of memory at the user's end. To realise the benefits of edge computing, in this paper, we propose and assess three computationally-efficient updating solutions, namely additive, fixed memory, and codebook-based updating methods. Extensive simulation studies are carried out using real PV users' data to evaluate the performance of the proposed methods in identifying PV users, tracking changes in real time, and examining memory usage. We found that the Codebook-based solution reduces more than 30\% of the required memory without compromising the performance of extracting users' features. When the end users' data storage and computation speed are concerned, the fixed-memory method outperforms the others. In terms of tracking the changes, different variations of the fixed-memory method show various inertia levels, making them suitable for different applications.
Joint Optimization of Continuous Variables and Priority Assignments for Real-Time Systems with Black-box Schedulability Constraints
Authors: Sen Wang, Dong Li, Shao-Yu Huang, Xuanliang Deng, Ashrarul H. Sifat, Changhee Jung, Ryan Williams, Haibo Zeng
Date: 2024-01-06 00:00:00

In real-time systems optimization, designers often face a challenging problem posed by the non-convex and non-continuous schedulability conditions, which may even lack an analytical form to understand their properties. To tackle this challenging problem, we treat the schedulability analysis as a black box that only returns true/false results. We propose a general and scalable framework to optimize real-time systems, named Numerical Optimizer with Real-Time Highlight (NORTH). NORTH is built upon the gradient-based active-set methods from the numerical optimization literature but with new methods to manage active constraints for the non-differentiable schedulability constraints. In addition, we also generalize NORTH to NORTH+, to collaboratively optimize certain types of discrete variables (e.g., priority assignments, categorical variables) with continuous variables based on numerical optimization algorithms. We demonstrate the algorithm performance with two example applications: energy minimization based on dynamic voltage and frequency scaling (DVFS), and optimization of control system performance. In these experiments, NORTH achieved $10^2$ to $10^5$ times speed improvements over state-of-the-art methods while maintaining similar or better solution quality. NORTH+ outperforms NORTH by 30% with similar algorithm scalability. Both NORTH and NORTH+ support black-box schedulability analysis, ensuring broad applicability.
Filtering Homogeneous Observer for MIMO System
Authors: Xubin Ping, Konstantin Zimenko, Andrey Polyakov, Denis Efimov
Date: 2024-01-06 00:00:00

Homogeneous observer for linear multi-input multi-output (MIMO) system is designed. A prefilter of the output is utilized in order to improve robustness of the observer with respect to measurement noises. The use of such a prefilter also simplifies tuning, since the observer gains in this case are parameterized by a linear matrix inequality (LMI) being always feasible for observable system. In particular case, the observer is shown to be applicable in the presence of the state and the output bounded perturbations. Theoretical results are supported by numerical simulations.
To Balance or to Not? Battery Aging-Aware Active Cell Balancing for Electric Vehicles
Authors: Enrico Fraccaroli, Seongik Jang, Logan Stach, Hoeseok Yang, Sangyoung Park, Samarjit Chakraborty
Date: 2024-01-06 00:00:00

Due to manufacturing variabilities and temperature gradients within an electric vehicle's battery pack, the capacities of cells in it decrease differently over time. This reduces the usable capacity of the battery - the charge levels of one or more cells might be at the minimum threshold while most of the other cells have residual charge. Active cell balancing (i.e., transferring charge among cells) can equalize their charge levels, thereby increasing the battery pack's usable capacity. But performing balancing means additional charge transfer, which can result in energy loss and cell aging, akin to memory aging in storage technologies due to writing. This paper studies when cell balancing should be optimally triggered to minimize aging while maintaining the necessary driving capability. In particular, we propose optimization strategies for cell balancing while minimizing their impact on aging. By borrowing terminology from the storage domain, we refer to this as "wear leveling-aware" active balancing.
Distributed Learning and Function Fusion in Reproducing Kernel Hilbert Space
Authors: Aneesh Raghavan, Karl Henrik Johansson
Date: 2024-01-05 00:00:00

We consider the problem of function estimation by a multi-agent system comprising of two agents and a fusion center. Each agent receives data comprising of samples of an independent variable (input) and the corresponding values of the dependent variable (output). The data remains local and is not shared with other members in the system. The objective of the system is to collaboratively estimate the function from the input to the output. To this end, we develop an iterative distributed algorithm for this function estimation problem. Each agent solves a local estimation problem in a Reproducing Kernel Hilbert Space (RKHS) and uploads the function to the fusion center. At the fusion center, the functions are fused by first estimating the data points that would have generated the uploaded functions and then subsequently solving a least squares estimation problem using the estimated data from both functions. The fused function is downloaded by the agents and is subsequently used for estimation at the next iteration along with incoming data. This procedure is executed sequentially and stopped when the difference between consecutively estimated functions becomes small enough. To analyze the algorithm, we define learning operators for the agents, fusion center and the system. We study the asymptotic properties of the norm of the learning operators and find sufficient conditions under which they converge to $1$. Given a sequence of data points, we define and prove the existence of the learning operator for the system. We prove that the porposed learning algorithm is consistent and demonstrate the same using an example. The paper has been submitted to L4DC 2024.
SAPNet: a deep learning model for identification of single-molecule peptide post-translational modifications with surface enhanced Raman spectroscopy
Authors: Mulusew W. Yaltaye, YingQi Zhao, Eva Bozo, Pei-Lin Xin, Vahid Farrah, Francesco De Angelis, Jian-An Huang
Date: 2024-01-05 00:00:00

Nanopore resistive pulse sensors are emerging technologies for single-molecule protein sequencing. But they can hardly detect small post-translational modifications (PTMs) such as hydroxylation in single-molecule level. While a combination of surface enhanced Raman spectroscopy (SERS) with plasmonic nanopores can detect the small PTMs, the blinking Raman peaks in the single-molecule SERS spectra leads to a big challenge in data analysis and PTM identification. Herein, we developed and validated a one-dimensional convolutional neural network (1D-CNN) for amino acids and peptides identification from their PTMs including hydroxylation and phosphorylation by their single-molecule SERS spectra, named Single Amino acid and Peptide Network (SAPNet). Our work combines cutting-edge plasmonic nanopore technology for SERS signal acquisition and deep learning for fully automated extraction of information from the SERS signals. The SAPNet model achieved an overall accuracy of 99.66% for the identification of amino acids from their modification, and 98.38% for the identification of peptides from their PTM translation. We also evaluated the model with out-of-sample examples with good performance. Our work can be beneficial for early detection of diseases such as cancers and Alzheimer's disease.
Qualitatively Distinct Signaling in Cells: The Informational Landscape of Amplitude and Frequency Encoding
Authors: Alan Givré, Alejandro Colman-Lerner, Silvina Ponce Dawson
Date: 2024-01-08 00:00:00

Cells continuously sense their surroundings to detect modifications and generate responses. Very often changes in extracellular concentrations initiate signaling cascades that eventually result in changes in gene expression. Increasing stimulus strengths can be encoded in increasing concentration amplitudes or increasing activation frequencies of intermediaries of the pathway. In this paper we show that the different way in which amplitude and frequency encoding map environmental changes endow cells with qualitatively different information transmission capabilities. While amplitude encoding is optimal for a limited range of stimuli strengths, frequency encoding can transmit information with equal reliability over much broader ranges. The qualitative difference between the two strategies stems from the scale invariant discriminating power of the first transducing step in frequency codification. The apparently redundant combination of both strategies in some cell types may then serve the purpose of expanding the span over which stimulus strengths can be reliably discriminated. In this paper we discuss a possible example of this mechanism in yeast.
Dimensional reduction of gradient-like stochastic systems with multiplicative noise via Fokker-Planck diffusion maps
Authors: Andrew Baumgartner, Sui Huang, Jennifer Hadlock, Cory Funk
Date: 2024-01-05 00:00:00
Tasks: graph construction

Dimensional reduction techniques have long been used to visualize the structure and geometry of high dimensional data. However, most widely used techniques are difficult to interpret due to nonlinearities and opaque optimization processes. Here we present a specific graph based construction for dimensionally reducing continuous stochastic systems with multiplicative noise moving under the influence of a potential. To achieve this, we present a specific graph construction which generates the Fokker-Planck equation of the stochastic system in the continuum limit. The eigenvectors and eigenvalues of the normalized graph Laplacian are used as a basis for the dimensional reduction and yield a low dimensional representation of the dynamics which can be used for downstream analysis such as spectral clustering. We focus on the use case of single cell RNA sequencing data and show how current diffusion map implementations popular in the single cell literature fit into this framework.
Robust Estimation in Network Vector Autoregression with Nonstationary Regressors
Authors: Christis Katsouris
Date: 2024-01-08 00:00:00
Tasks: Time Series, Unity

This article studies identification and estimation for the network vector autoregressive model with nonstationary regressors. In particular, network dependence is characterized by a nonstochastic adjacency matrix. The information set includes a stationary regressand and a node-specific vector of nonstationary regressors, both observed at the same equally spaced time frequencies. Our proposed econometric specification correponds to the NVAR model under time series nonstationarity which relies on the local-to-unity parametrization for capturing the unknown form of persistence of these node-specific regressors. Robust econometric estimation is achieved using an IVX-type estimator and the asymptotic theory analysis for the augmented vector of regressors is studied based on a double asymptotic regime where both the network size and the time dimension tend to infinity.