SearcharxivSearch

arXiv subjects

Shivam Arora

Publications and source records attributed to Shivam Arora.

9 recordsLinked to original sources

Sustained Gradient Alignment Mediates Subliminal Learning in a Multi-Step Setting: Evidence from MNIST Auxiliary Logit Distillation Experiment

In the MNIST auxiliary logit distillation experiment, a student can acquire an unintended teacher trait despite distilling only on no-class logits through a phenomenon called subliminal learning. Under a single-step gradient descent assumption, subliminal learning theory attributes this effect to alignment between the trait and distillation gradients, but does not guarantee that this alignment persists in a multi-step setting. We empirically show that gradient alignment remains weakly but consistently positive throughout training and causally contributes to trait acquisition. We show that a mitigation method called liminal training works by attenuating the alignment and fails to stop trait acquisition in this setup. These results suggest that mitigation methods that operate in this regime may not reliably suppress trait acquisition when the first-order drive dominates.

cs.LG

One Probe Won't Catch Them All: Towards Targeted Deception Detection

Linear probes are a promising approach for monitoring AI systems for deceptive behaviour. Previous work has shown that a linear classifier trained on a contrastive instruction pair and a simple dataset can achieve good performance. However, these probes exhibit notable failures even in straightforward scenarios, including spurious correlations and false positives on non-deceptive responses. In this paper, we demonstrate that deception detection is inherently heterogeneous: while a single universal probe achieves modest improvements (+0.032 AUC), post-hoc oracle analysis reveals substantially higher potential (+0.108 AUC) when probes are matched to specific deception types, and synthetic validation experiments suggest this ceiling is achievable a priori when the deception type is known in advance. Our findings reveal that instruction pairs capture deceptive intent rather than content-specific patterns, explaining why prompt choice dominates probe performance (70.6% of variance). Given this heterogeneity, we conclude that organizations should define their specific threat models and deploy appropriately matched probes rather than seeking a universal deception detector.

cs.AI

Invariant Physics-Informed Neural Networks for Ordinary Differential Equations

Physics-informed neural networks have emerged as a prominent new method for solving differential equations. While conceptually straightforward, they often suffer training difficulties that lead to relatively large discretization errors or the failure to obtain correct solutions. In this paper we introduce invariant physics-informed neural networks for ordinary differential equations that admit a finite-dimensional group of Lie point symmetries. Using the method of equivariant moving frames, a differential equation is invariantized to obtain a, generally, simpler equation in the space of differential invariants. A solution to the invariantized equation is then mapped back to a solution of the original differential equation by solving the reconstruction equations for the left moving frame. The invariantized differential equation together with the reconstruction equations are solved using a physics-informed neural network, and form what we call an invariant physics-informed neural network. We illustrate the method with several examples, all of which considerably outperform standard non-invariant physics-informed neural networks.

math-ph

Topological groups with a compact open subgroup, Relative hyperbolicity and Coherence

The main objects of study in this article are pairs $(G, \mathcal{H})$ where $G$ is a topological group with a compact open subgroup, and $\mathcal{H}$ is a finite collection of open subgroups. We develop geometric techniques to study the notions of $G$ being compactly generated and compactly presented relative to $\mathcal H$. This includes topological characterizations in terms of discrete actions of $G$ on complexes, quasi-isometry invariance of certain graphs associated to the pairs $(G,\mathcal H)$ when $G$ is compactly generated relative to $\mathcal H$, and extensions of known results for the discrete case. For example, generalizing results of Osin for discrete groups, we show that in the case that $G$ is compactly presented relative to $\mathcal H$: $\bullet$ if $G$ is compactly generated, then each subgroup $H\in \mathcal H$ is compactly generated; $\bullet$ if each subgroup $H\in \mathcal H$ is compactly presented, then $G$ is compactly presented. The article also introduces an approach to relative hyperbolicity for pairs $(G, \mathcal H)$ based on Bowditch's work using discrete actions on hyperbolic fine graphs. For example, we prove that if $G$ is hyperbolic relative to $\mathcal H$ then $G$ is compactly presented relative to $\mathcal H$. As applications of the results of the article we prove combination results for coherent topological groups with a compact open subgroup, and extend McCammond-Wise perimeter method to this general framework.

math.GR

Model-agnostic machine learning of conservation laws from data

We present a machine learning based method for learning first integrals of systems of ordinary differential equations from given trajectory data. The method is model-agnostic in that it does not require explicit knowledge of the underlying system of differential equations that generated the trajectories. As a by-product, once the first integrals have been learned, also the system of differential equations will be known. We illustrate our method by considering several classical problems from the mathematical sciences.

cs.LG

Fixed Point Sets in Diagrammatically Reducible Complexes

Let $H$ be a group acting on a simply-connected diagrammatically reducible combinatorial 2-complex $X$ with fine 1-skeleton. If the fixed point set $X^ H$ is non-empty, then it is contractible. Having fine 1-skeleton is a weaker version of being locally finite.

math.GR

Subgroups, hyperbolicity and cohomological dimension for totally disconnected locally compact groups

This article is part of the program of studying large-scale geometric properties of totally disconnected locally compact groups, TDLC-groups, by analogy with the theory for discrete groups. We provide a characterization of hyperbolic TDLC-groups, in terms of homological isoperimetric inequalities. This characterization is used to prove the main result of the article: for hyperbolic TDLC-groups with rational discrete cohomological dimension $\leq 2$, hyperbolicity is inherited by compactly presented closed subgroups. As a consequence, every compactly presented closed subgroup of the automorphism group $\mathrm{Aut}(X)$ of a negatively curved locally finite $2$-dimensional building $X$ is a hyperbolic TDLC-group, whenever $\mathrm{Aut}(X)$ acts with finitely many orbits on $X$. Examples where this result applies include hyperbolic Bourdon's buildings. We revisit the construction of small cancellation quotients of amalgamated free products, and verify that it provides examples of hyperbolic TDLC-groups of rational discrete cohomological dimension $2$ when applied to amalgamated products of profinite groups over open subgroups. We raise the question of whether our main result can be extended to locally compact hyperbolic groups if rational discrete cohomological dimension is replaced by asymptotic dimension. We prove that this is the case for discrete groups and sketch an argument for TDLC-groups.

math.GR

Subgroups of word hyperbolic groups in rational dimension 2

A result of Gersten states that if $G$ is a hyperbolic group with integral cohomological dimension $\mathsf{cd}_{\mathbb{Z}}(G)=2$ then every finitely presented subgroup is hyperbolic. We generalize this result for the rational case $\mathsf{cd}_{\mathbb{Q}}(G)=2$. In particular, our result applies to the class of torsion-free hyperbolic groups $G$ with $\mathsf{cd}_{\mathbb{Z}}(G)=3$ and $\mathsf{cd}_{\mathbb{Q}}(G)=2$ discovered by Bestvina and Mess.

math.GR

z-Classes in finite groups of conjugate type (n,1)

Two elements in a group $G$ are said to $z$-equivalent or to be in the same $z$-class if their centralizers are conjugate in $G$. In \cite{kkj}, it was proved that a non-abelian $p$-group $G$ can have at most $\frac{p^k-1}{p-1} +1$ number of $z$-classes, where $|G/Z(G)|=p^k$. In this note, we characterize the $p$-groups of conjugate type $(n,1)$ attaining this maximal number. As a corollary, we characterize $p$-groups having prime order commutator subgroup and maximal number of $z$-classes.

math.GR