Searcharxiv⌕ Search

arXiv subjects

Abhishek Bhardwaj

Publications and source records attributed to Abhishek Bhardwaj.

13 recordsLinked to original sources

MorphStrata: Layer-Specific Perturbations for Generating Morphence Students in Time-Series Moving Target Defense

Time-series forecasting models remain vulnerable to gradient-based adversarial attacks while existing defense mechanisms typically incur a trade-off in robustness for bounded response and compute cost. The problem is pronounced in Moving Target Defense where maintaining multiple randomized model instances substantially exacerbates the training overhead. In this work, we introduce MorphStrata, a student generation strategy with selective, layer-specific stochastic noise injection that extends the traditional Morphence defense. MorphStrata uses a Transformer backbone as the teacher and perturbs randomly selected architectural blocks to create structured heterogeneity across student models in response to varied data distributions and threat models. We evaluate against vanilla Transformer and Morphence backbones on a suite of benchmarks including the Jena Climate, Electricity Load Diagrams, and Appliances Energy Prediction using FGSM, BIM and PGD attacks across multiple attack strengths. Across datasets and attack regimes, the proposed ensemble maintains comparable adversarial RMSE. Specifically, for high entropy, periodic datasets as in the case of the AEP data, MorphStrata achieves the lowest RMSE across all attacks and perturbation budgets, improving over the static baseline by up to 24.11% and 97.97% under FGSM and BIM respectively at an epsilon value of 0.5 over 30 randomized trials. Targeting the layers to generate MorphStrata students accounts for less than 1% increase in train-times over the Morphence MTD baseline for most of the experiments, while accounting for double digit gains in adversarial RMSE reduction. We also observe a positive correlation between higher pairwise L2 distance (among generated students) and overall defense effectiveness. In summary, MorphStrata maintains adversarial robustness as an MTD defense at marginal cost deltas when compared to existing baselines.

cs.LG↗

LLM Unlearning for Cyber Defense: A Survey on Methods, Challenges, and Emerging Threats

LLMs are increasingly deployed in security-critical systems across healthcare, finance, education, and decision support, yet their inability to forget creates serious cybersecurity, privacy, and safety risks. Sensitive personal information, copyrighted material, hazardous domain knowledge, and memorized training data remain encoded across billions of parameters long after deployment, leaving models vulnerable to extraction, jailbreak attacks, membership inference, and regulatory non-compliance. Real-world incidents, from chatbots regenerating private information to fabricated legal citations producing direct legal and financial cost, place the problem at the center of the emerging-threats landscape rather than the realm of speculation. Because retraining billion-parameter models on revised corpora is computationally infeasible, and because knowledge within an LLM is distributed and entangled across parameters rather than localized to identifiable units, LLM unlearning has emerged as the principal cyber defense response, aiming to remove or suppress targeted knowledge from a trained model without retraining and without eroding what the model should still know. A central question, however, remains unresolved. Do current methods genuinely remove knowledge, or do they only stop the model from expressing it under ordinary prompting conditions? This survey examines LLM unlearning through the lens of security, robustness, and verifiable forgetting, with primary focus on gradient-based methods, which have come to dominate the field due to their compatibility with existing training pipelines and their scalability to billion-parameter models.

cs.LG↗

A constructive approach to the truncated moment problem on cubic curves in Weierstrass form

In this paper, we develop a constructive solution for the pure truncated moment problem on cubic curves in Weierstrass form, establishing the existence of a representing measure whose number of atoms equals the rank of the associated moment matrix. By a recent result of Baldi, Blekherman, and Sinn, for projectively smooth curves whose projective closure has exactly one real point at infinity, the existence of such a rank-attaining atomic measure is equivalent to the existence of a representing measure; consequently, the TMP is constructively solved for this class of curves. We also present a numerical degree--$6$ example in which every minimal representing measure supported on the cubic curve requires $\operatorname{rank} M(3)+1$ atoms, where $M(3)$ denotes the moment matrix. Finally, we provide a constructive solution for the symmetric case, i.e., when all moments of odd degree in $y$ vanish.

math.FA↗

AprielGuard

Safeguarding large language models (LLMs) against unsafe or adversarial behavior is critical as they are increasingly deployed in conversational and agentic settings. Existing moderation tools often treat safety risks (e.g. toxicity, bias) and adversarial threats (e.g. prompt injections, jailbreaks) as separate problems, limiting their robustness and generalizability. We introduce AprielGuard, an 8B parameter safeguard model that unify these dimensions within a single taxonomy and learning framework. AprielGuard is trained on a diverse mix of open and synthetic data covering standalone prompts, multi-turn conversations, and agentic workflows, augmented with structured reasoning traces to improve interpretability. Across multiple public and proprietary benchmarks, AprielGuard achieves strong performance in detecting harmful content and adversarial manipulations, outperforming existing opensource guardrails such as Llama-Guard and Granite Guardian, particularly in multi-step and reasoning intensive scenarios. By releasing the model, we aim to advance transparent and reproducible research on reliable safeguards for LLMs.

cs.CL↗

Gershgorin Disc-based Voltage Stability Regions for DER Siting and Control in Distribution Grids

As a consequence of the transition to distributed and renewable energy systems, some distribution system operators are increasingly concerned about power quality, including steady-state voltage volatility. In this paper, we study the control of real and reactive power injections by inverter-based distributed energy resources to regulate voltage magnitudes and phase angles measured by sensors positioned across 3-phase unbalanced distribution grids. Our proposed controllers are agnostic to the location and type of communications supporting energy resource operations. To design the controllers, we apply the Gershgorin Disc Theorem and determine analytic stability regions in terms of renewable energy operating parameters and grid impedances. The stability regions yield direct relationships between renewable energy system siting and the convergence of voltage phasors to references. Beyond defining stability regions, we compute ranges of stable operating parameters for renewable energy systems that promote operational flexibility by including customer economics. By means of a case study on the IEEE 123-node test circuit, we observe our approach to coordinating renewable energy systems achieves non-oscillatory voltage regulation and reduces the duration of voltage violations by 26%.

eess.SY↗

Communication-Censored-ADMM for Electric Vehicle Charging in Unbalanced Distribution Grids

We propose an alternating direction method of multipliers (ADMM)-based algorithm for coordinating the charge and discharge of electric vehicles (EVs) to manage grid voltages while minimizing EV time-of-use energy costs. We prove that by including a Communication-Censored strategy, the algorithm maintains its solution integrity, while reducing peer-to-peer communications. By means of a case study on a representative unbalanced two node circuit, we demonstrate that our proposed Communication-Censored-ADMM (CC-ADMM) EV charging strategy reduces peer-to-peer communications by up to 80%, compared to a benchmark ADMM approach.

math.OC↗

MHATC: Autism Spectrum Disorder identification utilizing multi-head attention encoder along with temporal consolidation modules

Resting-state fMRI is commonly used for diagnosing Autism Spectrum Disorder (ASD) by using network-based functional connectivity. It has been shown that ASD is associated with brain regions and their inter-connections. However, discriminating based on connectivity patterns among imaging data of the control population and that of ASD patients' brains is a non-trivial task. In order to tackle said classification task, we propose a novel deep learning architecture (MHATC) consisting of multi-head attention and temporal consolidation modules for classifying an individual as a patient of ASD. The devised architecture results from an in-depth analysis of the limitations of current deep neural network solutions for similar applications. Our approach is not only robust but computationally efficient, which can allow its adoption in a variety of other research and clinical settings.

q-bio.NC↗

Towards Online Optimization for Power Grids

In this note, we discuss potential advantages in extending distributed optimization frameworks to enhance support for power grid operators managing an influx of online sequential decisions. First, we review the state-of-the-art distributed optimization frameworks for electric power systems, and explain how distributed algorithms deliver scalable solutions. Next, we introduce key concepts and paradigms for online optimization, and present a distributed online optimization framework highlighting important performance characteristics. Finally, we discuss the connection and difference between offline and online distributed optimization, showcasing the suitability of such optimization techniques for power grid applications.

math.OC↗

Noncommutative Polynomial Optimization

In this chapter we present the sums of Hermitian squares approach to noncommutative polynomial optimization problems. This is an extension of the sums of squares approach for polynomial optimization arising from real algebraic geometry. We provide a gentle introduction to the underlying theory of this methodology and highlight its importance.

math.OC↗

The Constant Trace Property in Noncommutative Optimization

In this article, we show that each semidefinite relaxation of a ball-constrained noncommutative polynomial optimization problem can be cast as a semidefinite program with a constant trace matrix variable. We then demonstrate how this constant trace property can be exploited via first order numerical methods to solve efficiently the semidefinite relaxations of the noncommutative problem.

math.OC↗

The Tracial Moment Problem on Quadratic Varieties

The truncated moment problem asks to characterize finite sequences of real numbers that are the moments of a positive Borel measure on Rn. Its tracial analog is obtained by integrating traces of symmetric matrices and is the main topic of this article. The solution of the bivariate quartic tracial moment problem with a nonsingular (7x7) moment matrix M(2) whose columns are indexed by words of degree 2 was established by Burgdorf and Klep, while in our previos work we completely solved all cases with M(2) of rank at most 5, split M(2) of rank 6 into four possible cases according to the column relation satisfied and solved two of them. Our first main result in this article is the solution for M(2) satisfying the third possible column relation, i.e., Y^2 = 1 + X^2. Namely, the existence of a representing measure is equivalent to the feasibility problem of certain linear matrix inequalities. The second main result is a thorough analysis of the atoms in the measure for M(2) satisfying Y^2 = 1, the most demanding column relation. We prove that size 3 atoms are not needed in the representing measure, a fact proved to be true in all other cases. The third main result extends the solution for M(2) of rank 5 to general M(n), n>1, with two quadratic column relations. The main technique is the reduction of the problem to the classical univariate truncated moment problem, an approach which applies also in the classical truncated moment problem. Finally, our last main result, which demonstrates this approach, is a simplification of the proof for the solution of the degenerate truncated hyperbolic moment problem first obtained by Curto and Fialkow.

math.FA↗

Practical construction of positive maps which are not completely positive

This article introduces PnCP, a MATLAB toolbox for constructing positive maps which are not completely positive. We survey optimization and sum of squares relaxation techniques to find the most numerically efficient methods for this construction. We also show how this package can be applied to the problem of classifying entanglement in quantum states.

math.OC↗

The singular bivariate quartic tracial moment problem

The (classical) truncated moment problem, extensively studied by Curto and Fialkow, asks to characterize when a finite sequence of real numbers indexes by words in commuting variables can be represented with moments of a positive Borel measure $μ$ on $\mathbb R^n$. In \cite{BK12} Burgdorf and Klep introduced its tracial analog, the truncated tracial moment problem, which replaces commuting variables with non-commuting ones and moments of $μ$ with tracial moments of matrices. In the bivariate quartic case, where indices run over words in two variables of degree at most four, every sequence with a positive definite $7\times 7$ moment matrix $\mathcal M_2$ can be represented with tracial moments \cite{BK10,BK12}. In this article the case of singular $\mathcal M_2$ is studied. For $\mathcal M_2$ of rank at most 5 the problem is solved completely; namely, concrete measures are obtained whenever they exist and the uniqueness question of the minimal measures is answered. For $\mathcal M_2$ of rank 6 the problem splits into four cases, in two of which it is equivalent to the feasibility problem of certain linear matrix inequalities. Finally, the question of a flat extension of the moment matrix $\mathcal M_2$ is addressed. While this is the most powerful tool for solving the classical case, it is shown here by examples that, while sufficient, flat extensions are mostly not a necessary condition for the existence of a measure in the tracial case.

math.FA↗