SearcharxivSearch

arXiv subjects

Swapnil Srivastava

Publications and source records attributed to Swapnil Srivastava.

3 recordsLinked to original sources

Commutator identities, Lie product identities, and Multiplicative Lie algebras

The aim of this paper is to give a formal meaning of universal commutator identities and to see as to how the structure of multiplicative Lie algebra on a group is a potential candidate to describe universal commutator identities. We introduce some higher Schur multipliers. We shall also introduce and study Steinberg and Chevalley Multiplicative Lie algebras, the multiplicative Lie algebras with commutator identities among the root vectors describing Lie product relations. Free multiplicative Lie algebra on Steinberg and Chevalley groups are discussed.

math.GR

Trojan horse hunt in deep forecasting models: Insights from the European Space Agency competition

Forecasting plays a crucial role in modern safety-critical applications, such as space operations. However, the increasing use of deep forecasting models introduces a new security risk of trojan horse attacks, carried out by hiding a backdoor in the training data or directly in the model weights. Once implanted, the backdoor is activated by a specific trigger pattern at test time, causing the model to produce manipulated predictions. We focus on this issue in our \textit{Trojan Horse Hunt} data science competition, where more than 200 teams faced the task of identifying triggers hidden in deep forecasting models for spacecraft telemetry. We describe the novel task formulation, benchmark set, evaluation protocol, and best solutions from the competition. We further summarize key insights and research directions for effective identification of triggers in time series forecasting models. All materials are publicly available on the official competition webpage https://www.kaggle.com/competitions/trojan-horse-hunt-in-space.

cs.LG

Line Graph Characterization of Cyclic Subgroup Graph

The cyclic subgroup graph ${Γ(G)}$ of a group $G$ is the simple undirected graph with cyclic subgroups as a vertex set and two distinct vertices $H_1$ and $H_2$ are adjacent if and only if $H_1 \leq H_2$ and there does not exist any cyclic subgroup $K$ such that $H_1 < K < H_2$. In this paper, we classify all the finite groups $G$ such that $Γ(G)$ is the line graph of some graph.

math.CO