Searcharxiv⌕ Search

arXiv subjects

Apurv Shukla

Publications and source records attributed to Apurv Shukla.

12 recordsLinked to original sources

An Accurate Modulation-Assisted Method for Phasor Estimation Under Decaying DC Offsets

Decaying DC (DDC) offsets severely compromise the accurate estimation of current phasors immediately following power grid fault occurrence. Consequently, conventional full-cycle discrete Fourier transform (FCDFT) algorithms experience decaying oscillatory magnitude errors, potentially causing distance relays to malfunction. This paper introduces a modulation-assisted technique designed to precisely eliminate the DDC components from fault current signals. By multiplying the fault signal with a high-frequency carrier and applying consecutive sliding Fourier projections, the proposed method effectively isolates the DDC signal while entirely rejecting higher-order harmonic interference. It utilizes a direct algebraic solution derived from a robust forward-difference operation across just three sequential projections to estimate and extract the DDC parameters. Furthermore, the algorithm seamlessly processes both single and multiple DDC components by dynamically tracking them as one equivalent first-order mode. Extensive evaluations are conducted to validate the proposed method accuracy. The proposed algorithm limits the maximum overshoot (MO) to 0.62% (0.59% for $k \geq 8$) for the evaluated DDC cases, and to 2.47% (0.95% at 20 dB for $k = 8$) under noisy conditions.

eess.SY↗

Robust Streaming PCA

We consider streaming principal component analysis when the stochastic data generating model is subject to perturbations. While existing models assume a fixed covariance, we adopt a robust perspective where the covariance matrix belongs to a temporal uncertainty set. Under this setting, we provide fundamental limits on convergence of any algorithm recovering principal components. We analyze the convergence of the noisy power method and Oja's algorithm, both studied for the stationary data generating model, and argue that the noisy power method is rate-optimal in our setting. Finally, we demonstrate the validity of our analysis through numerical experiments on synthetic and real-world datasets.

stat.ML↗

Efficient Decentralized Learning of Generalized Quantal Response Equilibrium

We study a solution concept for bounded rational agents in finite normal-form general-sum games called Generalized Quantal Response Equilibrium (GQRE) which generalizes Quantal Response Equilibrium~\citep{mckelvey1995quantal}. In our setup, each player can individually maximize a smooth, regularized expected utility of the mixed profiles used, reflecting both bounded rationality that subsumes stochastic choice and also individual choice of behaviors. After establishing existence under mild conditions, we present a computationally efficient no-regret decentralized learning algorithm via a smoothened version of the Frank--Wolfe algorithm. Our algorithm uses noisy gradient estimates via bandit-feedback from a simulation oracle that reports on repeated plays of the game. We analyze finite-time convergence properties of our algorithm under assumptions that ensure uniqueness of equilibrium, using a novel class of gap functions that generalize the Nash gap. We end by demonstrating the effectiveness of our method on a set of complex general-sum games such as high-rank two-player games, large action two-player games, and known examples of difficult multi-player games.

cs.GT↗

FraPPE: Fast and Efficient Preference-based Pure Exploration

Preference-based Pure Exploration (PrePEx) aims to identify with a given confidence level the set of Pareto optimal arms in a vector-valued (aka multi-objective) bandit, where the reward vectors are ordered via a (given) preference cone $\mathcal{C}$. Though PrePEx and its variants are well-studied, there does not exist a computationally efficient algorithm that can optimally track the existing lower bound for arbitrary preference cones. We successfully fill this gap by efficiently solving the minimisation and maximisation problems in the lower bound. First, we derive three structural properties of the lower bound that yield a computationally tractable reduction of the minimisation problem. Then, we deploy a Frank-Wolfe optimiser to accelerate the maximisation problem in the lower bound. Together, these techniques solve the maxmin optimisation problem in $\mathcal{O}(KL^{2})$ time for a bandit instance with $K$ arms and $L$ dimensional reward, which is a significant acceleration over the literature. We further prove that our proposed PrePEx algorithm, FraPPE, asymptotically achieves the optimal sample complexity. Finally, we perform numerical experiments across synthetic and real datasets demonstrating that FraPPE achieves the lowest sample complexities to identify the exact Pareto set among the existing algorithms.

cs.LG↗

Vector preference-based contextual bandits under distributional shifts

We consider contextual bandit learning under distribution shift when reward vectors are ordered according to a given preference cone. We propose an adaptive-discretization and optimistic elimination based policy that self-tunes to the underlying distribution shift. To measure the performance of this policy, we introduce the notion of preference-based regret which measures the performance of a policy in terms of distance between Pareto fronts. We study the performance of this policy by establishing upper bounds on its regret under various assumptions on the nature of distribution shift. Our regret bounds generalize known results for the existing case of no distribution shift and vectorial reward settings, and scale gracefully with problem parameters in presence of distribution shifts.

cs.LG↗

Preference-based Pure Exploration

We study the preference-based pure exploration problem for bandits with vector-valued rewards. The rewards are ordered using a (given) preference cone $\mathcal{C}$ and our goal is to identify the set of Pareto optimal arms. First, to quantify the impact of preferences, we derive a novel lower bound on sample complexity for identifying the most preferred policy with a confidence level $1-δ$. Our lower bound elicits the role played by the geometry of the preference cone and punctuates the difference in hardness compared to existing best-arm identification variants of the problem. We further explicate this geometry when the rewards follow Gaussian distributions. We then provide a convex relaxation of the lower bound and leverage it to design the Preference-based Track and Stop (PreTS) algorithm that identifies the most preferred policy. Finally, we show that the sample complexity of PreTS is asymptotically tight by deriving a new concentration inequality for vector-valued rewards.

stat.ML↗

Sample Complexity of Chance Constrained Optimization in Dynamic Environment

We study the scenario approach for solving chance-constrained optimization in time-coupled dynamic environments. Scenario generation methods approximate the true feasible region from scenarios generated independently and identically from the actual distribution. In this paper, we consider this problem in a dynamic environment, where the scenarios are assumed to be drawn sequentially from an unknown and time-varying distribution. Such dynamic environments are driven by changing environmental conditions that could be found in many real-world applications such as energy systems. We couple the time-varying distributions using the Wasserstein metric between the sequence of scenario-generating distributions and the actual chance-constrained distribution. Our main results are bounds on the number of samples essential for ensuring the ex-post risk in chance-constrained optimization problems when the underlying feasible set is convex or non-convex. Finally, our results are illustrated on multiple numerical experiments for both types of feasible sets.

math.OC↗

Differentially Private High Dimensional Bandits

We consider a high-dimensional stochastic contextual linear bandit problem when the parameter vector is $s_{0}$-sparse and the decision maker is subject to privacy constraints under both central and local models of differential privacy. We present PrivateLASSO, a differentially private LASSO bandit algorithm. PrivateLASSO is based on two sub-routines: (i) a sparse hard-thresholding-based privacy mechanism and (ii) an episodic thresholding rule for identifying the support of the parameter $θ$. We prove minimax private lower bounds and establish privacy and utility guarantees for PrivateLASSO for the central model under standard assumptions.

cs.LG↗

Efficient Scenario Generation for Chance-constrained Economic Dispatch Considering Ambient Wind Conditions

Scenario generation is an effective data-driven method for solving chance-constrained optimization while ensuring desired risk guarantees with a finite number of samples. Crucial challenges in deploying this technique in the real world arise due to the absence of appropriate risk-tuning models tailored for the desired application. In this paper, we focus on designing efficient scenario generation schemes for economic dispatch in power systems. We propose a novel scenario generation method based on filtering scenarios using ambient wind conditions. These filtered scenarios are deployed incrementally in order to meet desired risk levels while using minimum resources. In order to study the performance of the proposed scheme, we illustrate the procedure on case studies performed for both 24-bus and 118-bus systems with real-world wind power forecasting data. Numerical results suggest that the proposed filter-and-increment scenario generation model leads to a precise and efficient solution for the chance-constrained economic dispatch problem.

math.OC↗

Voltage Constrained Heavy Duty Vehicle Electrification: Formulation and Case Study

The electrification of heavy-duty vehicles (HDEVs) is a rapidly emerging avenue for decarbonization of energy and transportation sectors. Compared to light duty vehicles, HDEVs exhibit unique travel and charging patterns over long distances. In this paper, we formulate an analytically tractable model that considers the routing decisions for the HDEVs and their charging implications on the power grid. Our model captures the impacts of increased vehicle electrification on the transmission grid, with particular focus on HDEVs. We jointly model transportation and power networks coupling them through the demand generated for charging requirements of HDEVs. In particular, the voltage constraint violation is explicitly accounted for in the proposed model given the signifcant amount of charging power imposed by HDEVs. We obtain optimal routing schedules and generator dispatch satisfying mobility constraints of HDEVs while minimizing voltage violations in electric transmission network. Case study based on an IEEE 24-bus system is presented using realistic data of transit data of HDEVs. The numerical results suggest that the proposed model and algorithm effectively mitigate the voltage violation when a significant amount of HDEVs are integrated to the power transmission network. Such mitigation includes reduction in the voltage magnitude, geographical dispersion of voltage violations and worst-case voltage violations at critical nodes.

eess.SY↗

An Efficient Deep Convolutional Neural Network Model For Yoga Pose Recognition Using Single Images

Pose recognition deals with designing algorithms to locate human body joints in a 2D/3D space and run inference on the estimated joint locations for predicting the poses. Yoga poses consist of some very complex postures. It imposes various challenges on the computer vision algorithms like occlusion, inter-class similarity, intra-class variability, viewpoint complexity, etc. This paper presents YPose, an efficient deep convolutional neural network (CNN) model to recognize yoga asanas from RGB images. The proposed model consists of four steps as follows: (a) first, the region of interest (ROI) is segmented using segmentation based approaches to extract the ROI from the original images; (b) second, these refined images are passed to a CNN architecture based on the backbone of EfficientNets for feature extraction; (c) third, dense refinement blocks, adapted from the architecture of densely connected networks are added to learn more diversified features; and (d) fourth, global average pooling and fully connected layers are applied for the classification of the multi-level hierarchy of the yoga poses. The proposed model has been tested on the Yoga-82 dataset. It is a publicly available benchmark dataset for yoga pose recognition. Experimental results show that the proposed model achieves the state-of-the-art on this dataset. The proposed model obtained an accuracy of 93.28%, which is an improvement over the earlier state-of-the-art (79.35%) with a margin of approximately 13.9%. The code will be made publicly available.

cs.CV↗

Variance-Aware Optimal Power Flow

The incorporation of stochastic loads and generation into the operation of power grids gives rise to an exposure to stochastic risk. This risk has been addressed in prior work through a variety of mechanisms, such as scenario generation or chance constraints, that can be incorporated into OPF computations. Nevertheless, numerical experiments reveal that the resulting operational decisions can produce power flows with very high variance. In this paper we introduce a variety of convex variants of OPF that explicitly address the interplay of (power flow) variance with cost minimization, and present numerical experiments that highlight our contributions.

math.OC↗