RESEARCH INITIATIVES/Information Retrieval & Graph Systems
GraphCLaRa: Decoupling Semantic Alignment from Reasoning Potential in Dense Retrieval via Causal Representation Partitioning
Information Retrieval & Graph Systems● ACTIVE RESEARCH

GraphCLaRa: Decoupling Semantic Alignment from Reasoning Potential in Dense Retrieval via Causal Representation Partitioning

Project Summary

Dense retrieval systems encode documents into a single semantic vector, coupling factual content with logical implication. GraphCLaRa introduces a causal partition mask over distilled reasoning LLMs, enforcing architecturally disjoint reasoning and semantic sub-representations within a single forward pass alongside differentiable Personalized PageRank graph routing.

RESEARCH OVERVIEW & DETAILS

Project Scope & Details

Dense retrieval systems achieve strong recall by encoding documents into a single semantic vector, but this geometry couples factual content with logical implication into one undifferentiated space.

We present GraphCLaRa, a retrieval architecture that imposes a causal partition mask over a distilled reasoning LLM (DeepSeek-R1-Distill-Qwen), enforcing architecturally disjoint reasoning (M_r) and semantic (M_s) sub-representations within a single forward pass. Within an oracle-corpus evaluation setting (665,766-passage index), GraphCLaRa CPC embeddings achieve 81.2% NQ Recall@5—matching ColBERTv2 (83.7%) within the confidence interval—validating representation quality and ranking precision under controlled corpus conditions.

The project formulates a differentiable Personalized PageRank (PPR) routing layer using implicit differentiation alongside a Convex Residual Highway that bounds the multi-hop Lipschitz constant, characterizing the scaling limits of end-to-end differentiable routing on large document graphs.

ARCHITECTURAL & SCIENTIFIC HIGHLIGHTS
01.

Causal Partitioned Compressor (CPC)

Imposes architectural decoupling between semantic similarity and multi-hop reasoning sub-representations in a single forward pass.

02.

Zero Jacobian Orthogonality

Enforces strict mathematical independence between routing and semantic embeddings, preventing catastrophic capacity collapse.

03.

Differentiable Graph Routing

Dynamic topological propagation across knowledge subgraphs achieving superior passage recall on complex multi-hop queries.

04.

Local Sparse Training Fix

Eliminates dense scaling walls by restricting backpropagation to active localized graph neighborhoods.

PROJECT GALLERY [4 PHOTOS]
Click to expand
GraphCLaRa System Architecture
FIG. 01

GraphCLaRa System Architecture

Causal Representation Partitioning Mask
FIG. 02

Causal Representation Partitioning Mask

Lipschitz Contraction Bounds
FIG. 03

Lipschitz Contraction Bounds

NQ Recall@5 Comparison
FIG. 04

NQ Recall@5 Comparison

ACADEMIC PUBLICATIONS [1]
2026Under Review / 35th ACM International Conference on Information and Knowledge Management (CIKM 2026)

Decoupling Semantic Alignment from Reasoning Potential in Dense Retrieval via Causal Representation Partitioning

Authors: Chaitanya Anand, Himangshu Sarma

RESEARCH TEAM
  • Chaitanya Anand
  • Dr. Himangshu Sarma
TECHNOLOGIES
Dense RetrievalDeepSeek-R1-Distill-QwenCausal Representation PartitioningDifferentiable PageRank (PPR)Implicit DifferentiationLipschitz ContractionPyTorch
PREVIOUS PROJECTAlgorithmic Collusion in Two-Sided Labor Markets: AI Resume Screeners, Monoculture, and Wage Compression
NEXT PROJECTReallyUnderstandPapers.com: Autonomous AI Research Agent & Pedagogical Paper Coach
HCI Lab IIITS | Human-Computer Interaction Laboratory