arXiv subjects

Vishal Srivastava

Publications and source records attributed to Vishal Srivastava.

10 recordsLinked to original sources

arXiv2026

The AI Evaluability Gap: The Missing Layer for Managing Risk and Sustaining Value

Organizations deploying AI face two fundamental governance challenges: managing AI risk and sustaining AI value. Both depend on evidence whose sufficiency cannot be taken for granted. We call the shared underlying challenge the AI Evaluability Gap: the condition in which organizations lack sufficient evidence to support high-confidence governance decisions regarding either risk or value. We argue that this gap reflects a category error in current practice. Existing governance approaches focus primarily on properties of systems, such as safety, fairness, reliability, compliance, and value, while paying comparatively little attention to the evidentiary foundations required to justify decisions about those properties. We further argue that AI governance encompasses both operational decisions regarding whether a system may operate and investment decisions regarding whether it merits continued organizational resources. To address this problem, we introduce Evaluability, defined as the capability of a system to generate, maintain, and renew evidence sufficient to support high-confidence governance decisions over time. We formalize governance decisions as functions of calibrated confidence Conf(D|E) and identify six properties of evaluable evidence: observability, attributability, intervenability, verifiability, calibration, and temporal validity. The framework distinguishes Operational Certification, which relies primarily on structural evidence to justify deployment decisions, from Investment Certification, which relies primarily on causal evidence to justify continued resource allocation. We argue that evidence sufficiency is a missing layer of AI governance and that closing the AI Evaluability Gap is a prerequisite for both managing risk and sustaining value in AI-enabled organizations.

cs.AI↗

arXiv2026

The Verifier Tax: Horizon Dependent Safety Success Tradeoffs in Tool Using LLM Agents

We study how runtime enforcement against unsafe actions affects end-to-end task performance in multi-step tool using large language model (LLM) agents. Using tau-bench across Airline and Retail domains, we compare baseline Tool-Calling, planning-integrated (TRIAD), and policy-mediated (TRIAD-SAFETY) architectures with GPT-OSS-20B and GLM-4-9B. We identify model dependent interaction horizons (15 to 30 turns) and decompose outcomes into overall success rate (SR), safe success rate (SSR), and unsafe success rate (USR). Our results reveal a persistent Safety Capability Gap. While safety mediation can intercept up to 94 percent of non-compliant actions, it rarely translates into strictly safe goal attainment (SSR below 5 percent in most settings). We find that high unsafe success rates are primarily driven by Integrity Leaks, where models hallucinate user identifiers to bypass mandatory authentication. Recovery rates following blocked actions are consistently low, ranging from 21 percent for GPT-OSS-20B in simpler procedural tasks to near zero in complex Retail scenarios. These results demonstrate that runtime enforcement imposes a significant verifier tax on conversational length and compute cost without guaranteeing safe completion, highlighting the critical need for agents capable of grounded identity verification and post-intervention reasoning.

cs.CR↗

arXiv2026

Quantifying Automation Risk in High-Automation AI Systems: A Bayesian Framework for Failure Propagation and Optimal Oversight

Organizations across finance, healthcare, transportation, content moderation, and critical infrastructure are rapidly deploying highly automated AI systems, yet they lack principled methods to quantify how increasing automation amplifies harm when failures occur. We propose a parsimonious Bayesian risk decomposition expressing expected loss as the product of three terms: the probability of system failure, the conditional probability that a failure propagates into harm given the automation level, and the expected severity of harm. This framework isolates a critical quantity -- the conditional probability that failures propagate into harm -- which captures execution and oversight risk rather than model accuracy alone. We develop complete theoretical foundations: formal proofs of the decomposition, a harm propagation equivalence theorem linking the harm propagation probability to observable execution controls, risk elasticity measures, efficient frontier analysis for automation policy, and optimal resource allocation principles with second-order conditions. We motivate the framework with an illustrative case study of the 2012 Knight Capital incident ($440M loss) as one instantiation of a broadly applicable failure pattern, and characterize the research design required to empirically validate the framework at scale across deployment domains. This work provides the theoretical foundations for a new class of deployment-focused risk governance tools for agentic and automated AI systems.

cs.AI↗

arXiv2026

Fundamental Limits of Black-Box Safety Evaluation: Information-Theoretic and Computational Barriers from Latent Context Conditioning

Black-box safety evaluation of AI systems assumes model behavior on test distributions reliably predicts deployment performance. We formalize and challenge this assumption through latent context-conditioned policies -- models whose outputs depend on unobserved internal variables that are rare under evaluation but prevalent under deployment. We establish fundamental limits showing that no black-box evaluator can reliably estimate deployment risk for such models. (1) Passive evaluation: For evaluators sampling i.i.d. from D_eval, we prove minimax lower bounds via Le Cam's method: any estimator incurs expected absolute error >= (5/24)*delta*L approximately 0.208*delta*L, where delta is trigger probability under deployment and L is the loss gap. (2) Adaptive evaluation: Using a hash-based trigger construction and Yao's minimax principle, worst-case error remains >= delta*L/16 even for fully adaptive querying when D_dep is supported over a sufficiently large domain; detection requires Theta(1/epsilon) queries. (3) Computational separation: Under trapdoor one-way function assumptions, deployment environments possessing privileged information can activate unsafe behaviors that any polynomial-time evaluator without the trapdoor cannot distinguish. For white-box probing, estimating deployment risk to accuracy epsilon_R requires O(1/(gamma^2 * epsilon_R^2)) samples, where gamma = alpha_0 + alpha_1 - 1 measures probe quality, and we provide explicit bias correction under probe error. Our results quantify when black-box testing is statistically underdetermined and provide explicit criteria for when additional safeguards -- architectural constraints, training-time guarantees, interpretability, and deployment monitoring -- are mathematically necessary for worst-case safety assurance.

cs.AI↗

arXiv2023

Incorporating Total Variation Regularization in the design of an intelligent Query by Humming system

A Query-By-Humming (QBH) system constitutes a particular case of music information retrieval where the input is a user-hummed melody and the output is the original song which contains that melody. A typical QBH system consists of melody extraction and candidate melody retrieval. For melody extraction, accurate note transcription is the key enabling technology. However, current transcription methods are unable to definitively capture the melody and address inaccuracies in user-hummed queries. In this paper, we incorporate Total Variation Regularization (TVR) to denoise queries. This approach accounts for user error in humming without loss of meaningful data and reliably captures the underlying melody. For candidate melody retrieval, we employ a deep learning approach to time series classification using a Fully Convolutional Neural Network. The trained network classifies the incoming query as belonging to one of the target songs. For our experiments, we use Roger Jang's MIR-QBSH dataset which is the standard MIREX dataset. We demonstrate that inclusion of TVR denoised queries in the training set enhances the overall accuracy of the system to 93% which is higher than other state-of-the-art QBH systems.

cs.SD↗

arXiv2022

A Non-intrusive Approach for Physics-constrained Learning with Application to Fuel Cell Modeling

A data-driven model augmentation framework, referred to as Weakly-coupled Integrated Inference and Machine Learning (IIML), is presented to improve the predictive accuracy of physical models. In contrast to parameter calibration, this work seeks corrections to the structure of the model by a) inferring augmentation fields that are consistent with the underlying model, and b) transforming these fields into corrective model forms. The proposed approach couples the inference and learning steps in a weak sense via an alternating optimization approach. This coupling ensures that the augmentation fields remain learnable and maintain consistent functional relationships with local modeled quantities across the training dataset. An iterative solution procedure is presented in this paper, removing the need to embed the augmentation function during the inference process. This framework is used to infer an augmentation introduced within a Polymer electrolyte membrane fuel cell (PEMFC) model using a small amount of training data (from only 14 training cases.) These training cases belong to a dataset consisting of high-fidelity simulation data obtained from a high-fidelity model of a first generation Toyota Mirai. All cases in this dataset are characterized by different inflow and outflow conditions on the same geometry. When tested on 1224 different configurations, the inferred augmentation significantly improves the predictive accuracy for a wide range of physical conditions. Predictions and available data for the current density distribution are also compared to demonstrate the predictive capability of the model for quantities of interest which were not involved in the inference process. The results demonstrate that the weakly-coupled IIML framework offers sophisticated and robust model augmentation capabilities without requiring extensive changes to the numerical solver.

cs.CE↗

arXiv2021

Generalizable Physics-constrained Modeling using Learning and Inference assisted by Feature Space Engineering

This work presents a formalism to improve the predictive accuracy of physical models by learning generalizable augmentations from sparse data. Building on recent advances in data-driven turbulence modeling, the present approach, referred to as Learning and Inference assisted by Feature-space Engineering (LIFE), is based on the hypothesis that robustness and generalizability demand a meticulously-designed feature space that is informed by the underlying physics, and a carefully constructed features-to-augmentation map. The critical components of this approach are: (1) Maintaining consistency across the learning and prediction environments; (2) Tightly-coupled inference and learning by constraining the augmentation to be learnable throughout the inference process; (3) Identification of relevant physics-informed features in appropriate functional forms to enable significant overlap in feature space for a wide variety of cases to promote generalizability; (4) Maintaining explicit control over feature space to change the augmentation function behavior only in the vicinity of available datapoints. To demonstrate the viability of this approach, it is used in the modeling of bypass transition. The augmentation is developed on skin friction data from two flat plate cases from the ERCOFTAC dataset. Piecewise linear interpolation on a structured grid in feature-space is used as a sample functional form for the augmentation to demonstrate the capability of localized learning. The augmented model is then applied to a variety of flat plate cases which are characterized by different freestream turbulence intensities, pressure gradients, and Reynolds numbers. The predictive capability of the augmented model is also tested on single-stage high-pressure-turbine cascade cases, and the model performance is analyzed from the perspective of information contained in the feature space.

physics.flu-dyn↗

arXiv2019

Self-attention based BiLSTM-CNN classifier for the prediction of ischemic and non-ischemic cardiomyopathy

Heart Failure is a major component of healthcare expenditure and a leading cause of mortality worldwide. Despite higher inter-rater variability, endomyocardial biopsy (EMB) is still regarded as the standard technique, used to identify the cause (e.g. ischemic or non-ischemic cardiomyopathy, coronary artery disease, myocardial infarction etc.) of unexplained heart failure. In this paper, we focus on identifying cardiomyopathy as ischemic or non-ischemic. For this, we propose and implement a new unified architecture comprising CNN (inception-V3 model) and bidirectional LSTM (BiLSTM) with self-attention mechanism to predict the ischemic or non-ischemic to classify cardiomyopathy using histopathological images. The proposed model is based on self-attention that implicitly focuses on the information outputted from the hidden layers of BiLSTM. Through our results we demonstrate that this framework carries a high learning capacity and is able to improve the classification performance.

cs.LG↗

arXiv2019

Deep learning enabled multi-wavelength spatial coherence microscope for the classification of malaria-infected stages with limited labelled data size

Malaria is a life-threatening mosquito-borne blood disease, hence early detection is very crucial for health. The conventional method for the detection is a microscopic examination of Giemsa-stained blood smears, which needs a highly trained skilled technician. Automated classifications of different stages of malaria still a challenging task, especially having poor sensitivity in detecting the early trophozoite and late trophozoite or schizont stage with limited labelled datasize. The study aims to develop a fast, robust and fully automated system for the classification of different stages of malaria with limited data size by using the pre-trained convolutional neural networks (CNNs) as a classifier and multi-wavelength to increase the sample size. We also compare our customized CNN with other well-known CNNs and shows that our network have a comparable performance with less computational time. We believe that our proposed method can be applied to other limited labelled biological datasets.

cs.CV↗

arXiv2015

Study of $^{26}$Mg through 1p pick up reaction $^{27}$Al(d,$^{3}$He)

The even-even nucleus $^{26}$Mg has been studied through the reaction $^{27}$Al(d,$^{3}$He) at 25 MeV beam energy. The spectroscopic factors have been extracted upto 7.50 MeV excitation energy using local, zero range distorted wave Born approximation. The comparison of the spectroscopic factors have been done with previously reported values using the same reaction probe. The extracted spectroscopic factors for different excited states were found to be in good agreement with the previously reported values for the same. The present results were also compared with the predictions from shell model as well as rotational model. The analog states of $^{26}$Al and $^{26}$Mg were found to be in good agreement.

nucl-ex↗