SearcharxivSearch

arXiv subjects

Shivam Dubey

Publications and source records attributed to Shivam Dubey.

10 recordsLinked to original sources

Shaping the Prior: How Synthetic Task Distributions Determine Tabular Foundation Model Quality

What determines the quality of a tabular foundation model? Unlike language or vision, tabular foundation models acquire their inductive biases almost entirely from synthetic pretraining distributions, yet the design of these distributions remains poorly understood. Standard synthetic priors are too well-behaved: they omit the irregularities and failure modes that determine deployment robustness. We introduce O'Prior, a compositional realism prior built around four coupled components: a hierarchical SCM meta-generator spanning diverse functional families; a modular realism engine covering heterogeneous marginals, missingness, and target transforms; an explicit stress module injecting confounding and support-query mismatch; and a curriculum-governed, leakage-safe generation protocol. To isolate prior design as the scientific variable, we hold architecture, optimizer, and compute budget fixed and vary only the synthetic task distribution. O'Prior yields consistent and substantial improvements in downstream accuracy and robustness across real tabular benchmarks, with gains concentrated in regimes characterized by distributional irregularities. Ablations confirm that mechanism diversity, realism composition, and shift-aware stress each contribute independently, their effects are not interchangeable. These results establish synthetic prior construction as a first-order and largely overlooked determinant of tabular foundation model quality

cs.LG

Weaker quantization dimension results for self-similar measures

In this paper, we investigate the quantization dimension of self-similar measures, particularly when the IFS does not satisfy the separation condition, but the sub-IFS at some level satisfies the separation condition. Further, we study the approximation of the space of Borel probability measures $\mathcal{P}(\mathbb{R}^m)$ with respect to the geometric mean error, i.e., the quantization dimension of order zero.

math.DS

AMBEDKAR-A Multi-level Bias Elimination through a Decoding Approach with Knowledge Augmentation for Robust Constitutional Alignment of Language Models

Large Language Models (LLMs) can inadvertently reflect societal biases present in their training data, leading to harmful or prejudiced outputs. In the Indian context, our empirical evaluations across a suite of models reveal that biases around caste and religion are particularly salient. Yet, most existing mitigation strategies are Western-centric and fail to address these local nuances. We propose AMBEDKAR, a framework inspired by the egalitarian vision of Dr B. R. Ambedkar, architect of the Indian Constitution, to guide LLM outputs toward fairness, neutrality, and inclusion in line with Articles 14 to 17. Our approach introduces a Constitution-Aware Decoding Layer, guided by the AI Constitution of India and applied only at inference time, without any parameter updates to the base model. We incorporate a speculative decoding algorithm that proactively reduces casteist and communal bias during generation. This mitigation layer operates directly within the decoding process, avoiding changes to model internals and lowering the computational and infrastructural costs associated with retraining. We reinterpret speculative decoding not merely as an efficiency tool but as a mechanism for fairness. In this framework, a Small Language Model (SLM) acts as a potentially biased generator, while a constitutionally guided Large Language Model (LLM) serves as the verifier. Rather than accelerating generation, the LLM enforces bias-robust trajectories in the SLM outputs. This inversion of roles gives rise to a fairness-by-speculation paradigm. Our approach yields an absolute reduction of bias up to 26.41 percent compared to baseline. Our source code, datasets, and results are available at https://anonymous.4open.science/r/AMBEDKAR-983B/

cs.CL

Some results on Lower Assouad and quantization dimensions

In this paper, we first show that the collection of all subsets of \( \mathbb{R} \) having lower dimension \( γ\in [0,1] \) is dense in \( Π(\mathbb{R}) \), the space of compact subsets of \( \mathbb{R} \). Furthermore, we show that the set of Borel probability measures with lower dimension \( β\in [0, m] \) is dense in \( Ω(\mathbb{R}^m) \), the space of Borel probability measures on \( \mathbb{R}^m \). We also prove that the quantization and the lower dimension of a measure \( \vartheta \) coincide with those of the convolution of \( \vartheta \) with a finite combination of Dirac measures. In the end, we compute the lower dimension of the invariant measure associated with the product IFS.

math.DS

Dimension Of Inhomogeneous Sub-Self-Similar Sets

In this paper, we introduce the concept of Inhomogeneous sub-self-similar (ISSS) sets, building upon the foundations laid by Falconer (Trans. Amer. Math. Soc. 347 (1995) 3121-3129) in the study of sub-self-similar sets and drawing inspiration from Barnsley's work on inhomogeneous self-similar sets (Proc. Roy. Soc. London Ser. A 399 (1985), no. 1817, 24). We explore a range of examples of ISSS sets and elucidate a method to construct ISSS sets. We also investigate the upper and lower box dimensions of ISSS sets and discuss the continuity of the Hausdorff dimension.

math.DS

HumorPlanSearch: Structured Planning and HuCoT for Contextual AI Humor

Automated humor generation with Large Language Models (LLMs) often yields jokes that feel generic, repetitive, or tone-deaf because humor is deeply situated and hinges on the listener's cultural background, mindset, and immediate context. We introduce HumorPlanSearch, a modular pipeline that explicitly models context through: (1) Plan-Search for diverse, topic-tailored strategies; (2) Humor Chain-of-Thought (HuCoT) templates capturing cultural and stylistic reasoning; (3) a Knowledge Graph to retrieve and adapt high-performing historical strategies; (4) novelty filtering via semantic embeddings; and (5) an iterative judge-driven revision loop. To evaluate context sensitivity and comedic quality, we propose the Humor Generation Score (HGS), which fuses direct ratings, multi-persona feedback, pairwise win-rates, and topic relevance. In experiments across nine topics with feedback from 13 human judges, our full pipeline (KG + Revision) boosts mean HGS by 15.4 percent (p < 0.05) over a strong baseline. By foregrounding context at every stage from strategy planning to multi-signal evaluation, HumorPlanSearch advances AI-driven humor toward more coherent, adaptive, and culturally attuned comedy.

cs.CL

Activation Steering for Bias Mitigation: An Interpretable Approach to Safer LLMs

As large language models (LLMs) become more integrated into societal systems, the risk of them perpetuating and amplifying harmful biases becomes a critical safety concern. Traditional methods for mitigating bias often rely on data filtering or post-hoc output moderation, which treat the model as an opaque black box. In this work, we introduce a complete, end-to-end system that uses techniques from mechanistic interpretability to both identify and actively mitigate bias directly within a model's internal workings. Our method involves two primary stages. First, we train linear "probes" on the internal activations of a model to detect the latent representations of various biases (e.g., gender, race, age). Our experiments on \texttt{gpt2-large} demonstrate that these probes can identify biased content with near-perfect accuracy, revealing that bias representations become most salient in the model's later layers. Second, we leverage these findings to compute "steering vectors" by contrasting the model's activation patterns for biased and neutral statements. By adding these vectors during inference, we can actively steer the model's generative process away from producing harmful, stereotypical, or biased content in real-time. We demonstrate the efficacy of this activation steering technique, showing that it successfully alters biased completions toward more neutral alternatives. We present our work as a robust and reproducible system that offers a more direct and interpretable approach to building safer and more accountable LLMs.

cs.AI

Quantization for a condensation system

For a given $r \in (0, +\infty)$, the quantization dimension of order $r$, if it exists, denoted by $D_r(μ)$, represents the rate at which the $n$th quantization error of order $r$ approaches to zero as the number of elements $n$ in an optimal set of $n$-means for $μ$ tends to infinity. If $D_r(μ)$ does not exist, we define $\underline{D}_r(μ)$ and $\overline{D}_r(μ)$ as the lower and the upper quantization dimensions of $μ$ of order $r$, respectively. In this paper, we investigate the quantization dimension of the condensation measure $μ$ associated with a condensation system $(\{S_j\}_{j=1}^N, (p_j)_{j=0}^N, ν).$ We provide two examples: one where $ν$ is an infinite discrete distribution on $\mathbb{R}$, and one where $ν$ is a uniform distribution on $\mathbb{R}$. For both the discrete and uniform distributions $ν$, we determine the optimal sets of $n$-means, and calculate the quantization dimensions of condensation measures $μ$, and show that the $D_r(μ)$-dimensional quantization coefficients do not exist. Moreover, we demonstrate that the lower and upper quantization coefficients are finite and positive.

math.DS

Quantization dimension for a generalized inhomogeneous bi-Lipschitz iterated function system

For a given $r\in (0, +\infty)$, the quantization dimension of order $r$, if it exists, denoted by $D_r(\mu)$, of a Borel probability measure $\mu$ on ${\mathbb R}^d$ represents the speed how fast the $n$th quantization error of order $r$ approaches to zero as the number of elements $n$ in an optimal set of $n$-means for $\mu$ tends to infinity. If $D_r(\mu)$ does not exists, we call $\underline D_r(\mu)$ and $\overline D_r(\mu)$, the lower and upper quantization dimensions of $\mu$ of order $r$. In this paper, we estimate the quantization dimension of condensation measures associated with condensation systems $(\{f_i\}_{i=1}^N, (p_i)_{i=0}^N, \nu)$, where the mappings $f_i$ are bi-Lipschitz and the measure $\nu$ is an image measure of an ergodic measure with bounded distortion supported on a conformal set. In addition, we determine the optimal quantization for an infinite discrete distribution, and give an example which shows that the quantization dimension of a Borel probability measure can be positive with zero quantization coefficient.

math.DS

Fractal dimension for Inhomogeneous graph-directed attractors

In this paper, we define inhomogeneous Graph-Directed (GD) separation conditions for a given inhomogeneous GD Iterated Function Systems (IFS), and estimate the upper box dimension of attractors by the dimension of the condensation set and associated Mauldin-Williams graph dimension. Following some work of Fraser, we also estimate the lower box dimension of attractors generated by inhomogeneous GDIFS. In the end, we shed few lights on the continuity of dimensions for the attractors of inhomogeneous GDIFS.

math.DS