arXiv subjects

Shubham Gupta

Publications and source records attributed to Shubham Gupta.

At least 37 records · Page 2Linked to original sources

arXiv2025

Infinitely Many Counter Examples of a Conjecture of Franušić and Jadrijević

Let $d$ be a square-free integer such that $d \equiv 15 \pmod{60}$ and the Pell's equation $x^2 - dy^2 = -6$ is solvable in rational integers $x$ and $y$. In this paper, we prove that there exist infinitely many Diophantine quadruples in $\mathbb{Z}[\sqrt{d}]$ with the property $D(n)$ for certain $n$'s. As an application of it, we `unconditionally' prove the existence of infinitely many rings $\mathbb{Z}[\sqrt{d}]$ for which the conjecture of Franušić and Jadrijević (Conjecture 1.1) does `not' hold. This conjecture states a relationship between the existence of a Diophantine quadruple in $\mathcal{R}$ with the property $D(n)$ and the representability of $n$ as a difference of two squares in $\mathcal{R}$, where $\mathcal{R}$ is a commutative ring with unity.

math.NT↗

arXiv2025

A Transfer Framework for Enhancing Temporal Graph Learning in Data-Scarce Settings

Dynamic interactions between entities are prevalent in domains like social platforms, financial systems, healthcare, and e-commerce. These interactions can be effectively represented as time-evolving graphs, where predicting future connections is a key task in applications such as recommendation systems. Temporal Graph Neural Networks (TGNNs) have achieved strong results for such predictive tasks but typically require extensive training data, which is often limited in real-world scenarios. One approach to mitigating data scarcity is leveraging pre-trained models from related datasets. However, direct knowledge transfer between TGNNs is challenging due to their reliance on node-specific memory structures, making them inherently difficult to adapt across datasets. To address this, we introduce a novel transfer approach that disentangles node representations from their associated features through a structured bipartite encoding mechanism. This decoupling enables more effective transfer of memory components and other learned inductive patterns from one dataset to another. Empirical evaluations on real-world benchmarks demonstrate that our method significantly enhances TGNN performance in low-data regimes, outperforming non-transfer baselines by up to 56\% and surpassing existing transfer strategies by 36\%

cs.LG↗

arXiv2025

Quality Concerns Caused by Quality Control -- deformation of silicon strip detector modules in thermal cycling tests

The ATLAS experiment at the Large Hadron Collider (LHC) is currently preparing to replace its present Inner Detector (ID) with the upgraded, all-silicon Inner Tracker (ITk) for its High-Luminosity upgrade (HL-LHC). The ITk will consist of a central pixel tracker and the outer strip tracker, consisting of about 19,000 strip detector modules. Each strip module is assembled from up to two sensors, and up to five flexes (depending on its geometry) in a series of gluing, wirebonding and quality control steps. During detector operation, modules will be cooled down to temperatures of about -35C (corresponding to the temperature of the support structures on which they will be mounted) after being initially assembled and stored at room temperature. In order to ensure compatibility with the detector's operating temperature range, modules are subjected to thermal cycling as part of their quality control process. Ten cycles between -35C and +40C are performed for each module, with full electrical characterisation tests at each high and low temperature point. As part of an investigation into the stress experienced by modules during cooling, it was observed that modules generally showed a change in module shape before and after thermal cycling. This paper presents a summary of the discovery and understanding of the observed changes, connecting them with excess module stress, as well as the resulting modifications to the module thermal cycling procedure.

hep-ex↗

arXiv2025

Granite Vision: a lightweight, open-source multimodal model for enterprise Intelligence

We introduce Granite Vision, a lightweight large language model with vision capabilities, specifically designed to excel in enterprise use cases, particularly in visual document understanding. Our model is trained on a comprehensive instruction-following dataset, including document-related tasks, such as content extraction from tables, charts, diagrams, sketches, and infographics, as well as general image tasks. The architecture of Granite Vision is centered around visual modality alignment with a decoder-only, 2 billion parameter Granite large language model. Additionally, we introduce a dedicated safety classification approach in test-time that leverages a sparse set of attention vectors to identify potential harmful inputs. Despite its lightweight architecture, Granite Vision achieves strong results in standard benchmarks related to visual document understanding, as well as on the LiveXiv benchmark, which is designed to avoid test set contamination by using a constantly updated corpus of recently published Arxiv papers. We are releasing the model under the Apache-2 license, allowing for both research and commercial use, while offering complete visibility into the training data and other relevant details. See https://huggingface.co/ibm-granite/ for model weights.

cs.CV↗

arXiv2025

LAST SToP For Modeling Asynchronous Time Series

We present a novel prompt design for Large Language Models (LLMs) tailored to Asynchronous Time Series. Unlike regular time series, which assume values at evenly spaced time points, asynchronous time series consist of timestamped events occurring at irregular intervals, each described in natural language. Our approach effectively utilizes the rich natural language of event descriptions, allowing LLMs to benefit from their broad world knowledge for reasoning across different domains and tasks. This allows us to extend the scope of asynchronous time series analysis beyond forecasting to include tasks like anomaly detection and data imputation. We further introduce Stochastic Soft Prompting, a novel prompt-tuning mechanism that significantly improves model performance, outperforming existing fine-tuning methods such as QLoRA. Through extensive experiments on real world datasets, we demonstrate that our approach achieves state-of-the-art performance across different tasks and datasets.

cs.LG↗

arXiv2025

Docling: An Efficient Open-Source Toolkit for AI-driven Document Conversion

We introduce Docling, an easy-to-use, self-contained, MIT-licensed, open-source toolkit for document conversion, that can parse several types of popular document formats into a unified, richly structured representation. It is powered by state-of-the-art specialized AI models for layout analysis (DocLayNet) and table structure recognition (TableFormer), and runs efficiently on commodity hardware in a small resource budget. Docling is released as a Python package and can be used as a Python API or as a CLI tool. Docling's modular architecture and efficient document representation make it easy to implement extensions, new features, models, and customizations. Docling has been already integrated in other popular open-source frameworks (e.g., LangChain, LlamaIndex, spaCy), making it a natural fit for the processing of documents and the development of high-end applications. The open-source community has fully engaged in using, promoting, and developing for Docling, which gathered 10k stars on GitHub in less than a month and was reported as the No. 1 trending repository in GitHub worldwide in November 2024.

cs.CL↗

arXiv2024

Docling Technical Report

This technical report introduces Docling, an easy to use, self-contained, MIT-licensed open-source package for PDF document conversion. It is powered by state-of-the-art specialized AI models for layout analysis (DocLayNet) and table structure recognition (TableFormer), and runs efficiently on commodity hardware in a small resource budget. The code interface allows for easy extensibility and addition of new features and models.

cs.CL↗

arXiv2024

Know Your RAG: Dataset Taxonomy and Generation Strategies for Evaluating RAG Systems

Retrieval Augmented Generation (RAG) systems are a widespread application of Large Language Models (LLMs) in the industry. While many tools exist empowering developers to build their own systems, measuring their performance locally, with datasets reflective of the system's use cases, is a technological challenge. Solutions to this problem range from non-specific and cheap (most public datasets) to specific and costly (generating data from local documents). In this paper, we show that using public question and answer (Q&A) datasets to assess retrieval performance can lead to non-optimal systems design, and that common tools for RAG dataset generation can lead to unbalanced data. We propose solutions to these issues based on the characterization of RAG datasets through labels and through label-targeted data generation. Finally, we show that fine-tuned small LLMs can efficiently generate Q&A datasets. We believe that these observations are invaluable to the know-your-data step of RAG systems development.

cs.IR↗

arXiv2024

Dynamic HumTrans: Humming Transcription Using CNNs and Dynamic Programming

We propose a novel approach for humming transcription that combines a CNN-based architecture with a dynamic programming-based post-processing algorithm, utilizing the recently introduced HumTrans dataset. We identify and address inherent problems with the offset and onset ground truth provided by the dataset, offering heuristics to improve these annotations, resulting in a dataset with precise annotations that will aid future research. Additionally, we compare the transcription accuracy of our method against several others, demonstrating state-of-the-art (SOTA) results. All our code and corrected dataset is available at https://github.com/shubham-gupta-30/humming_transcription

cs.LG↗

arXiv2024

Phoneme Discretized Saliency Maps for Explainable Detection of AI-Generated Voice

In this paper, we propose Phoneme Discretized Saliency Maps (PDSM), a discretization algorithm for saliency maps that takes advantage of phoneme boundaries for explainable detection of AI-generated voice. We experimentally show with two different Text-to-Speech systems (i.e., Tacotron2 and Fastspeech2) that the proposed algorithm produces saliency maps that result in more faithful explanations compared to standard posthoc explanation methods. Moreover, by associating the saliency maps to the phoneme representations, this methodology generates explanations that tend to be more understandable than standard saliency maps on magnitude spectrograms.

eess.AS↗

arXiv2024

Hardy inequalities for antisymmetric functions

We study Hardy inequalities for antisymmetric functions in three different settings: euclidean space, torus and the integer lattice. In particular, we show that under the antisymmetric condition the sharp constant in Hardy inequality increases substantially and grows as d^4 as d \rightarrow \infty in all cases. As a side product, we prove Hardy inequality on a domain whose boundary forms a corner at the point of singularity x=0.

math.FA↗

arXiv2024

Transfer Learning for Emulating Ocean Climate Variability across $CO_2$ forcing

With the success of machine learning (ML) applied to climate reaching further every day, emulators have begun to show promise not only for weather but for multi-year time scales in the atmosphere. Similar work for the ocean remains nascent, with state-of-the-art limited to models running for shorter time scales or only for regions of the globe. In this work, we demonstrate high-skill global emulation for surface ocean fields over 5-8 years of model rollout, accurately representing modes of variability for two different ML architectures (ConvNext and Transformers). In addition, we address the outstanding question of generalization, an essential consideration if the end-use of emulation is to model warming scenarios outside of the model training data. We show that 1) generalization is not an intrinsic feature of a data-driven emulator, 2) fine-tuning the emulator on only small amounts of additional data from a distribution similar to the test set can enable the emulator to perform well in a warmed climate, and 3) the forced emulators are robust to noise in the forcing.

physics.ao-ph↗

arXiv2024

Statements: Universal Information Extraction from Tables with Large Language Models for ESG KPIs

Environment, Social, and Governance (ESG) KPIs assess an organization's performance on issues such as climate change, greenhouse gas emissions, water consumption, waste management, human rights, diversity, and policies. ESG reports convey this valuable quantitative information through tables. Unfortunately, extracting this information is difficult due to high variability in the table structure as well as content. We propose Statements, a novel domain agnostic data structure for extracting quantitative facts and related information. We propose translating tables to statements as a new supervised deep-learning universal information extraction task. We introduce SemTabNet - a dataset of over 100K annotated tables. Investigating a family of T5-based Statement Extraction Models, our best model generates statements which are 82% similar to the ground-truth (compared to baseline of 21%). We demonstrate the advantages of statements by applying our model to over 2700 tables from ESG reports. The homogeneous nature of statements permits exploratory data analysis on expansive information found in large collections of ESG reports.

cs.CL↗

arXiv2024

Diophantine $D(n)$-quadruples in $\mathbb{Z}[\sqrt{4k + 2}]$

Let $d$ be a square-free integer and $\mathbb{Z}[\sqrt{d}]$ a quadratic ring of integers. For a given $n\in\mathbb{Z}[\sqrt{d}]$, a set of $m$ non-zero distinct elements in $\mathbb{Z}[\sqrt{d}]$ is called a Diophantine $D(n)$-$m$-tuple (or simply $D(n)$-$m$-tuple) in $\mathbb{Z}[\sqrt{d}]$ if product of any two of them plus $n$ is a square in $\mathbb{Z}[\sqrt{d}]$. Assume that $d \equiv 2 \pmod 4$ is a positive integer such that $x^2 - dy^2 = -1$ and $x^2 - dy^2 = 6$ are solvable in integers. In this paper, we prove the existence of infinitely many $D(n)$-quadruples in $\mathbb{Z}[\sqrt{d}]$ for $n = 4m + 4k\sqrt{d}$ with $m, k \in \mathbb{Z}$ satisfying $m \not\equiv 5 \pmod{6}$ and $k \not\equiv 3 \pmod{6}$. Moreover, we prove the same for $n = (4m + 2) + 4k\sqrt{d}$ when either $m \not\equiv 9 \pmod{12}$ and $k \not\equiv 3 \pmod{6}$, or $m \not\equiv 0 \pmod{12}$ and $k \not\equiv 0 \pmod{6}$. At the end, some examples supporting the existence of quadruples in $\mathbb{Z}[\sqrt{d}]$ with the property $D(n)$ for the above exceptional $n$'s are provided for $d = 10$.

math.NT↗

arXiv2024

Interactive Visualization of Time-Varying Flow Fields Using Particle Tracing Neural Networks

In this paper, we present a comprehensive evaluation to establish a robust and efficient framework for Lagrangian-based particle tracing using deep neural networks (DNNs). Han et al. (2021) first proposed a DNN-based approach to learn Lagrangian representations and demonstrated accurate particle tracing for an analytic 2D flow field. In this paper, we extend and build upon this prior work in significant ways. First, we evaluate the performance of DNN models to accurately trace particles in various settings, including 2D and 3D time-varying flow fields, flow fields from multiple applications, flow fields with varying complexity, as well as structured and unstructured input data. Second, we conduct an empirical study to inform best practices with respect to particle tracing model architectures, activation functions, and training data structures. Third, we conduct a comparative evaluation of prior techniques that employ flow maps as input for exploratory flow visualization. Specifically, we compare our extended model against its predecessor by Han et al. (2021), as well as the conventional approach that uses triangulation and Barycentric coordinate interpolation. Finally, we consider the integration and adaptation of our particle tracing model with different viewers. We provide an interactive web-based visualization interface by leveraging the efficiencies of our framework, and perform high-fidelity interactive visualization by integrating it with an OSPRay-based viewer. Overall, our experiments demonstrate that using a trained DNN model to predict new particle trajectories requires a low memory footprint and results in rapid inference. Following best practices for large 3D datasets, our deep learning approach using GPUs for inference is shown to require approximately 46 times less memory while being more than 400 times faster than the conventional methods.

cs.GR↗

arXiv2024

Discrete functional inequalities on lattice graphs

In this thesis, we study problems at the interface of analysis and discrete mathematics. We discuss analogues of well known Hardy-type inequalities and Rearrangement inequalities on the lattice graphs $\mathbb{Z}^d$, with a particular focus on behaviour of sharp constants and optimizers.In the first half of the thesis, we analyse Hardy inequalities on $\mathbb{Z}^d$, first for $d=1$ and then for $d \geq 3$. We prove a sharp weighted Hardy inequality on integers with power weights of the form $n^α$. This is done via two different methods, namely super-solution and Fourier method. We also use Fourier method to prove a weighted Hardy type inequality for higher order operators. After discussing the one dimensional case, we study the Hardy inequality in higher dimensions ($d \geq 3$). In particular, we compute the asymptotic behaviour of the sharp constant in the discrete Hardy inequality, as $d \rightarrow \infty$. This is done by converting the inequality into a continuous Hardy-type inequality on a torus for functions having zero average. These continuous inequalities are new and interesting in themselves. In the second half, we focus our attention on analogues of Rearrangement inequalities on lattice graphs. We begin by analysing the situation in dimension one. We define various notions of rearrangements and prove the corresponding Polya-Szegő inequality. These inequalities are also applied to prove some weighted Hardy inequalities on integers. Finally, we study Rearrangement inequalities (Polya-Szegő) on general graphs, with a particular focus on lattice graphs $\mathbb{Z}^d$, for $d \geq 2$. We develop a framework to study these inequalities, using which we derive concrete results in dimension two. In particular, these results develop connections between Polya-Szegő inequality and various isoperimetric inequalities on graphs.

math.FA↗

arXiv2024

One-dimensional discrete Hardy and Rellich inequalities on integers

In this paper, we consider a weighted version of one-dimensional discrete Hardy inequalities with power weights of the form $n^α$. We prove the inequality when $α$ is an even natural number with the sharp constant and remainder terms. We also find explicit constants in standard and weighted Rellich inequalities and its higher order versions. As a by-product of this work we derive a combinatorial identity using purely analytic methods. This suggests a correlation between combinatorial identities and functional identities.

math.FA↗

arXiv2024

Robust Training of Temporal GNNs using Nearest Neighbours based Hard Negatives

Temporal graph neural networks Tgnn have exhibited state-of-art performance in future-link prediction tasks. Training of these TGNNs is enumerated by uniform random sampling based unsupervised loss. During training, in the context of a positive example, the loss is computed over uninformative negatives, which introduces redundancy and sub-optimal performance. In this paper, we propose modified unsupervised learning of Tgnn, by replacing the uniform negative sampling with importance-based negative sampling. We theoretically motivate and define the dynamically computed distribution for a sampling of negative examples. Finally, using empirical evaluations over three real-world datasets, we show that Tgnn trained using loss based on proposed negative sampling provides consistent superior performance.

cs.LG↗