SearcharxivSearch

arXiv subjects

Aviral Srivastava

Publications and source records attributed to Aviral Srivastava.

8 recordsLinked to original sources

Attention Is Where You Attack

Safety-aligned large language models rely on RLHF and instruction tuning to refuse harmful requests, yet the internal mechanisms implementing safety behavior remain poorly understood. We introduce the Attention Redistribution Attack (ARA), a white-box adversarial attack that identifies safety-critical attention heads and crafts nonsemantic adversarial tokens that redirect attention away from safety-relevant positions. Unlike prior jailbreak methods operating at the semantic or output-logit level, ARA targets the geometry of softmax attention on the probability simplex using Gumbel-softmax optimization over targeted heads. Across LLaMA-3-8B-Instruct, Mistral-7B-Instruct-v0.1, and Gemma-2-9B-it, ARA bypasses safety alignment with as few as 5 tokens and 500 optimization steps, achieving 36% ASR on Mistral-7B and 30% on LLaMA-3 against 200 HarmBench prompts, while Gemma-2 remains at 1%. Our principal mechanistic finding is a dissociation between ablation and redistribution: zeroing out the top-ranked safety heads produces at most 1 flip among 39 to 50 baseline refusals, while ARA targeting the corresponding safety-heavy layers flips 72/200 prompts on Mistral-7B and 60/200 on LLaMA-3. This suggests that safety is not localized in these heads as removable components, but emerges from the attention routing they perform. Removing a head allows compensation through the residual stream, while redirecting its attention propagates a corrupted signal downstream.

cs.CR

Non-Rascoe partitions and a rank parity function associated to the Rogers-Ramanujan partitions

We study the generating function of the excess number of Rogers-Ramanujan partitions with odd rank over those with even rank, and, using combinatorial and analytical techniques, show that this generating function is closely connected with an interesting class of restricted partitions, namely, partitions into distinct parts where the number of parts is not a part. We derive arithmetic properties of the number of such partitions and conjecture an interesting mod $4$ congruence. Generalizations of most of these results in a parameter $\ell$ are also obtained.

math.CO

Some identities of the sums-of-tails type

A new sums-of-tails identity involving two parameters $b$ and $d$ is obtained and is used to derive more results of similar type. One of Ramanujan's sums-of-tails identities from the Lost Notebook is shown to be a special case of our result. In the course of deriving Ramanujan's identity, we obtain a new result of combinatorial significance. Two new representations for an infinite series associated to a mock theta function are derived. Also, we give an application of an identity of Andrews and Onofri.

math.CO

Beyond Visual Understanding: Introducing PARROT-360V for Vision Language Model Benchmarking

Current benchmarks for evaluating Vision Language Models (VLMs) often fall short in thoroughly assessing model abilities to understand and process complex visual and textual content. They typically focus on simple tasks that do not require deep reasoning or the integration of multiple data modalities to solve an original problem. To address this gap, we introduce the PARROT-360V Benchmark, a novel and comprehensive benchmark featuring 2487 challenging visual puzzles designed to test VLMs on complex visual reasoning tasks. We evaluated leading models: GPT-4o, Claude-3.5-Sonnet, and Gemini-1.5-Pro, using PARROT-360V to assess their capabilities in combining visual clues with language skills to solve tasks in a manner akin to human problem-solving. Our findings reveal a notable performance gap: state-of-the-art models scored between 28 to 56 percentage on our benchmark, significantly lower than their performance on popular benchmarks. This underscores the limitations of current VLMs in handling complex, multi-step reasoning tasks and highlights the need for more robust evaluation frameworks to advance the field.

cs.CV

A Formal Framework for Assessing and Mitigating Emergent Security Risks in Generative AI Models: Bridging Theory and Dynamic Risk Mitigation

As generative AI systems, including large language models (LLMs) and diffusion models, advance rapidly, their growing adoption has led to new and complex security risks often overlooked in traditional AI risk assessment frameworks. This paper introduces a novel formal framework for categorizing and mitigating these emergent security risks by integrating adaptive, real-time monitoring, and dynamic risk mitigation strategies tailored to generative models' unique vulnerabilities. We identify previously under-explored risks, including latent space exploitation, multi-modal cross-attack vectors, and feedback-loop-induced model degradation. Our framework employs a layered approach, incorporating anomaly detection, continuous red-teaming, and real-time adversarial simulation to mitigate these risks. We focus on formal verification methods to ensure model robustness and scalability in the face of evolving threats. Though theoretical, this work sets the stage for future empirical validation by establishing a detailed methodology and metrics for evaluating the performance of risk mitigation strategies in generative AI systems. This framework addresses existing gaps in AI safety, offering a comprehensive road map for future research and implementation.

cs.CR

Discovering an invisible Z' at the muon collider

We show in this letter how a heavy $(\mathcal{O}(TeV))$ invisible $Z'$ gauge boson that will practically be out of reach of the Large Hadron Collider (LHC), can be discovered at the future muon collider. The new force carrier has a relatively stronger coupling with the beyond standard model (BSM) sector, while its interaction with the SM fields is much weaker. This weaker coupling is induced through mixing mechanisms, specifically via gauge kinetic mixing and the $Z-Z'$ mixing. We consider a scenario where the new gauge boson decays mostly to charge-neutral long-lived particles and/or dark matter (DM). We show how producing and detecting this heavier invisible $Z'$, that will be beyond the reach of even the very high luminosity LHC, becomes possible if it is produced in association with an energetic photon at the future muon collider. The on-shell production of the $Z'$ will lead to a peak in the photon energy distribution, following the so-called radiative return phenomena and can lead to the accurate determination of the $Z'$ mass and its interaction with SM particles.

hep-ph

Dynamics of Phase Transition in Quark-Gluon Plasma Droplet Formation under Magnetic Field

Pre-existing density of states for a Quark-Gluon Phase, based on Thomas-Fermi and Bethe mode, is expanded by incorporation of new variables. Results from recent study indicate that perturbations in the form of a finite non-zero chemical potential T, B, dynamic thermal masses M and of course Temperature T are indeed vital to fully comprehend the formation and dynamics of QGP. Simulations depict an overall increase in the stability of QGP in the paradigm of the statistical model. On the top of Free Energy, Entropy and heat capacity are calculated for the phase transition. The overall qualitative behavior, of entropy or Heat Capacity determines the order of phase transition of the QGP. Investigation of order of phase transition is carried out in this study through Monte-Carlo based differential element, which ensures the inclusion of the randomness of the collisions at the particle colliders.

hep-ph

Anticipated Network Surveillance -- An extrapolated study to predict cyber-attacks using Machine Learning and Data Analytics

Machine learning and data mining techniques are utiized for enhancement of the security of any network. Researchers used machine learning for pattern detection, anomaly detection, dynamic policy setting, etc. The methods allow the program to learn from data and make decisions without human intervention, consuming a huge training period and computation power. This paper discusses a novel technique to predict an upcoming attack in a network based on several data parameters. The dataset is continuous in real-time implementation. The proposed model comprises dataset pre-processing, and training, followed by the testing phase. Based on the results of the testing phase, the best model is selected using which, event class which may lead to an attack is extracted. The event statistics are used for attack

cs.CR