Vaibhav Katewa
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Vaibhav Katewa has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Fabio Pasqualetti
Department of Electrical Engineering and Computer Science, University of California, Irvine, Irvine, CA, USA
12 shared publications - Vijay Gupta
Elmore Family School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA
6 shared publications Fabio Pasqualetti
4 shared publicationsRajasekhar Anguluri
Department of Mechanical Engineering, University of California, Riverside
3 shared publications- Abed AlRahman Al Makdah
School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, AZ, USA
2 shared publications - Aranya Chakrabortty
Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC, USA
2 shared publications
Latest Publications
- 11 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (1) , 323-338
Opacity Versus Security in Linear Dynamical Systems
Opacity is a notion of privacy that is wellstudied in computer science and discrete-event systems. It describes an eavesdropper's inability to infer a system's “secret” states by observing the system's outputs. In this paper, we consider opacity in linear dynamical systems and study four opacity classes - initial-state, current-state, Kstep and infinite-step opacity, and show that they are fundamentally connected to two subspaces of the linear system - the weakly unobservable subspace and the weakly unconstructible subspace. With these subspaces, we derive conditions for opacity of secret states under constrained and unconstrained state and input sets. Further, we establish that a trade-off exists between opacity and security in the system. We show this in two ways -(i) we prove that an opaque system always permits undetectable attacks, (ii) we show that expanding the set of opaque states in the system expands the set of undetectable attacks. Our work provides the necessary mathematical foundation for system designers to build opaque systems, while ensuring adequate security.
- 11 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (1) , 323-338
Opacity Versus Security in Linear Dynamical Systems
Opacity is a notion of privacy that is wellstudied in computer science and discrete-event systems. It describes an eavesdropper's inability to infer a system's “secret” states by observing the system's outputs. In this paper, we consider opacity in linear dynamical systems and study four opacity classes - initial-state, current-state, Kstep and infinite-step opacity, and show that they are fundamentally connected to two subspaces of the linear system - the weakly unobservable subspace and the weakly unconstructible subspace. With these subspaces, we derive conditions for opacity of secret states under constrained and unconstrained state and input sets. Further, we establish that a trade-off exists between opacity and security in the system. We show this in two ways -(i) we prove that an opaque system always permits undetectable attacks, (ii) we show that expanding the set of opaque states in the system expands the set of undetectable attacks. Our work provides the necessary mathematical foundation for system designers to build opaque systems, while ensuring adequate security.
- 4 July 2024
- Published by Elsevier in Electric Power Systems Research
- Vol. 235
Cyber-Physical Modeling and Vulnerability Assessment of Substations for Transmission System Operator
- 4 July 2024
- Published by Elsevier in Electric Power Systems Research
- Vol. 235
Cyber-Physical Modeling and Vulnerability Assessment of Substations for Transmission System Operator
- Open Access
- 14 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 763-768
Robust Adversarial Classification via Abstaining
In this work, we consider a binary classification problem and cast it into a binary hypothesis testing framework, where the observations can be perturbed by an adversary. To improve the adversarial robustness of a classifier, we include an abstain option, where the classifier abstains from making a decision when it has low confidence about the prediction. We propose metrics to quantify the nominal performance of a classifier with an abstain option and its robustness against adversarial perturbations. We show that there exist a tradeoff between the two metrics regardless of what method is used to choose the abstain region. Our results imply that the robustness of a classifier with an abstain option can only be improved at the expense of its nominal performance. Further, we provide necessary conditions to design the abstain region for a 1-dimensional binary classification problem. We validate our theoretical results on the MNIST dataset, where we numerically show that the tradeoff between performance and robustness also exist for the general multi-class classification problems.
- 14 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 763-768
Open AccessRobust Adversarial Classification via Abstaining
In this work, we consider a binary classification problem and cast it into a binary hypothesis testing framework, where the observations can be perturbed by an adversary. To improve the adversarial robustness of a classifier, we include an abstain option, where the classifier abstains from making a decision when it has low confidence about the prediction. We propose metrics to quantify the nominal performance of a classifier with an abstain option and its robustness against adversarial perturbations. We show that there exist a tradeoff between the two metrics regardless of what method is used to choose the abstain region. Our results imply that the robustness of a classifier with an abstain option can only be improved at the expense of its nominal performance. Further, we provide necessary conditions to design the abstain region for a 1-dimensional binary classification problem. We validate our theoretical results on the MNIST dataset, where we numerically show that the tradeoff between performance and robustness also exist for the general multi-class classification problems.
- Open Access
Network Theoretic Analysis of Maximum a Posteriori Detectors for Optimal Input Detection
This paper considers maximum-a-posteriori (MAP) and linear discriminant based MAP detectors to detect changes in the mean and covariance of a stochastic input, driving specific network nodes, using noisy measurements from sensors non-collocated with the input nodes. We explicitly characterize both detectors' performance in terms of the network edge weights and input and sensor nodes' location. In the asymptotic measurement regime, when the input and measurement noise are jointly Gaussian, we show that the detectors' performance can be studied using the input to output gain of the system's transfer function matrix. Using this result, we obtain conditions for which the detection performance associated with the sensors on a given network cut is better (or worse) than that of the sensors associated with the subnetwork induced by the cut and not containing the input nodes. Our results also provide structural insights into the sensor placement from a detection-theoretic viewpoint. We validate our theoretical findings via multiple numerical examples.
Open AccessNetwork Theoretic Analysis of Maximum a Posteriori Detectors for Optimal Input Detection
This paper considers maximum-a-posteriori (MAP) and linear discriminant based MAP detectors to detect changes in the mean and covariance of a stochastic input, driving specific network nodes, using noisy measurements from sensors non-collocated with the input nodes. We explicitly characterize both detectors' performance in terms of the network edge weights and input and sensor nodes' location. In the asymptotic measurement regime, when the input and measurement noise are jointly Gaussian, we show that the detectors' performance can be studied using the input to output gain of the system's transfer function matrix. Using this result, we obtain conditions for which the detection performance associated with the sensors on a given network cut is better (or worse) than that of the sensors associated with the subnetwork induced by the cut and not containing the input nodes. Our results also provide structural insights into the sensor placement from a detection-theoretic viewpoint. We validate our theoretical findings via multiple numerical examples.
- 21 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 66 (8) , 3445-3459
Minimum-Gain Pole Placement With Sparse Static Feedback
The minimum-gain eigenvalue assignment/pole placement problem (MGEAP) is a classical problem in linear time-invariant systems with static state feedback. In this article, we study the MGEAP when the state feedback has arbitrary sparsity constraints. We formulate the sparse MGEAP problem as an equality-constrained optimization problem and present an analytical characterization of its locally optimal solution in terms of eigenvector matrices of the closed-loop system. This result is used to provide a geometric interpretation of the solution of the nonsparse MGEAP, thereby providing additional insights for this classical problem. Furthermore, we develop an iterative projected gradient descent algorithm to obtain local solutions for the sparse MGEAP using a parameterization based on the Sylvester equation. We present a heuristic algorithm to compute the projections, which also provides a novel method to solve the sparse eigenvalue/pole assignment problem. Also, a relaxed version of the sparse MGEAP is presented and an algorithm is developed to obtain approximately sparse local solutions to the MGEAP. Finally, numerical studies are presented to compare the properties of the algorithms, which suggest that the proposed projection algorithm converges in most cases.
- 21 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 66 (8) , 3445-3459
Minimum-Gain Pole Placement With Sparse Static Feedback
The minimum-gain eigenvalue assignment/pole placement problem (MGEAP) is a classical problem in linear time-invariant systems with static state feedback. In this article, we study the MGEAP when the state feedback has arbitrary sparsity constraints. We formulate the sparse MGEAP problem as an equality-constrained optimization problem and present an analytical characterization of its locally optimal solution in terms of eigenvector matrices of the closed-loop system. This result is used to provide a geometric interpretation of the solution of the nonsparse MGEAP, thereby providing additional insights for this classical problem. Furthermore, we develop an iterative projected gradient descent algorithm to obtain local solutions for the sparse MGEAP using a parameterization based on the Sylvester equation. We present a heuristic algorithm to compute the projections, which also provides a novel method to solve the sparse eigenvalue/pole assignment problem. Also, a relaxed version of the sparse MGEAP is presented and an algorithm is developed to obtain approximately sparse local solutions to the MGEAP. Finally, numerical studies are presented to compare the properties of the algorithms, which suggest that the proposed projection algorithm converges in most cases.
- 1 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3940-3946
Accuracy Prevents Robustness in Perception-based Control
- 1 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3940-3946
Accuracy Prevents Robustness in Perception-based Control
- 1 March 2020
- Published by Elsevier in Automatica
- Vol. 113
On the real stability radius of sparse systems
- 1 March 2020
- Published by Elsevier in Automatica
- Vol. 113
On the real stability radius of sparse systems
- 25 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 65 (9) , 3903-3910
Centralized Versus Decentralized Detection of Attacks in Stochastic Interconnected Systems
We consider a security problem for interconnected systems with linear, discrete, time-invariant, stochastic dynamics, where the objective is to detect exogenous attacks by processing measurements at different locations. We consider centralized and decentralized detectors, which differ primarily in their knowledge of the system model. In particular, a decentralized detector has a model of the dynamics of the isolated subsystems, but is unaware of the interconnection signals that are exchanged among subsystems. Instead, a centralized detector has a model of the entire dynamical system. We characterize the performance of the two detectors and show that, depending on the system and attack parameters, each of the detectors can outperform the other. Hence, it may be possible for the decentralized detector to outperform its centralized counterpart, despite having less information about the system dynamics, and this property is due to the nature of the considered attack detection problem (that is, a simple vs. composite hypothesis testing problem). Finally, we numerically validate our findings on a power system model.
- 25 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 65 (9) , 3903-3910
Centralized Versus Decentralized Detection of Attacks in Stochastic Interconnected Systems
We consider a security problem for interconnected systems with linear, discrete, time-invariant, stochastic dynamics, where the objective is to detect exogenous attacks by processing measurements at different locations. We consider centralized and decentralized detectors, which differ primarily in their knowledge of the system model. In particular, a decentralized detector has a model of the dynamics of the isolated subsystems, but is unaware of the interconnection signals that are exchanged among subsystems. Instead, a centralized detector has a model of the entire dynamical system. We characterize the performance of the two detectors and show that, depending on the system and attack parameters, each of the detectors can outperform the other. Hence, it may be possible for the decentralized detector to outperform its centralized counterpart, despite having less information about the system dynamics, and this property is due to the nature of the considered attack detection problem (that is, a simple vs. composite hypothesis testing problem). Finally, we numerically validate our findings on a power system model.
- 22 November 2019
- Published by Springer Nature
- p. 157-176
On the Role of Cooperation in Private Multi-agent Systems
- 22 November 2019
- Published by Springer Nature
- p. 157-176
On the Role of Cooperation in Private Multi-agent Systems
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4430-4435
A Probabilistic Approach to Design Switching Attacks against Interconnected Systems
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4430-4435
A Probabilistic Approach to Design Switching Attacks against Interconnected Systems