SearcharxivSearch

arXiv subjects

Amit Patel

Publications and source records attributed to Amit Patel.

At least 19 recordsLinked to original sources

Motion-Guided Causal Disentanglement for Robust Multi-View Cine Cardiac MRI Diagnosis

Multi-view cardiac magnetic resonance (CMR) imaging provides complementary anatomical information and is widely used for noninvasive disease assessment. Recent transformer-based models have demonstrated strong representation learning capabilities for CMR analysis; however, they typically learn unified latent embeddings that entangle view-specific anatomical variations with disease-related features. Such entanglement biases classifiers toward structural attributes rather than view-invariant pathological patterns. This issue is exacerbated in low-data regimes, particularly for underrepresented cardiac conditions, where limited samples increase the susceptibility to shortcut learning and view-dependent decision boundaries. To address this, we propose a Motion-Guided View--Disease Disentanglement framework MoViD built upon a ViT-MAE backbone. The model explicitly factorizes latent representations into view-specific and disease-discriminative components using dual-branch supervised contrastive objectives and a gradient-reversal adversarial constraint that minimizes disease leakage into the view embedding. Additionally, an annotation-free temporal motion feature, derived from inter-frame difference maps, is introduced to localize the beating heart region and suppress background artifacts. A focal reweighting mechanism is incorporated into the contrastive loss to mitigate class imbalance. We evaluate the framework on a private clinical venous thrombosis dataset and two public benchmarks (M&Ms, M&Ms2). Across disease classification and cardiac segmentation tasks, our approach consistently outperforms standard transformer baselines and demonstrates competitive performance against large-scale pretrained foundation models, validating the efficacy of structural disentanglement in medical image analysis.

cs.CV

Leveraging AI to Accelerate Medical Data Cleaning: A Comparative Study of AI-Assisted vs. Traditional Methods

Clinical trial data cleaning represents a critical bottleneck in drug development, with manual review processes struggling to manage exponentially increasing data volumes and complexity. This paper presents Octozi, an artificial intelligence-assisted platform that combines large language models with domain-specific heuristics to transform medical data review. In a controlled experimental study with experienced medical reviewers (n=10), we demonstrate that AI assistance increased data cleaning throughput by 6.03-fold while simultaneously decreasing cleaning errors from 54.67% to 8.48% (a 6.44-fold improvement). Crucially, the system reduced false positive queries by 15.48-fold, minimizing unnecessary site burden. Economic analysis of a representative Phase III oncology trial reveals potential cost savings of $5.1 million, primarily driven by accelerated database lock timelines (5-day reduction saving $4.4M), improved medical review efficiency ($420K savings), and reduced query management burden ($288K savings). These improvements were consistent across reviewers regardless of experience level, suggesting broad applicability. Our findings indicate that AI-assisted approaches can address fundamental inefficiencies in clinical trial operations, potentially accelerating drug development timelines such as database lock by 33% while maintaining regulatory compliance and significantly reducing operational costs. This work establishes a framework for integrating AI into safety-critical clinical workflows and demonstrates the transformative potential of human-AI collaboration in pharmaceutical clinical trials.

cs.CV

$\ell^p$-Stability of Weighted Persistence Diagrams

We introduce the concept of weighted persistence diagrams and develop a functorial pipeline for constructing them from finite metric measure spaces. This builds upon an existing functorial framework for generating classical persistence diagrams from finite pseudo-metric spaces. To quantify differences between weighted persistence diagrams, we define the $p$-edit distance for $p\in [1,\infty]$, and-focusing on the weighted Vietoris-Rips filtration-we establish that these diagrams are stable with respect to the $p$-Gromov-Wasserstein distance as a direct consequence of functoriality. In addition, we present an Optimal Transport-inspired formulation of the $p$-edit distance, enhancing its conceptual clarity. Finally, we explore the discriminative power of weighted persistence diagrams, demonstrating advantages over their unweighted counterparts.

math.AT

BAMAX: Backtrack Assisted Multi-Agent Exploration using Reinforcement Learning

Autonomous robots collaboratively exploring an unknown environment is still an open problem. The problem has its roots in coordination among non-stationary agents, each with only a partial view of information. The problem is compounded when the multiple robots must completely explore the environment. In this paper, we introduce Backtrack Assisted Multi-Agent Exploration using Reinforcement Learning (BAMAX), a method for collaborative exploration in multi-agent systems which attempts to explore an entire virtual environment. As in the name, BAMAX leverages backtrack assistance to enhance the performance of agents in exploration tasks. To evaluate BAMAX against traditional approaches, we present the results of experiments conducted across multiple hexagonal shaped grids sizes, ranging from 10x10 to 60x60. The results demonstrate that BAMAX outperforms other methods in terms of faster coverage and less backtracking across these environments.

cs.RO

A Categorical Approach to M\"obius Inversion via Derived Functors

We develop a cohomological approach to M\"obius inversion using derived functors in the enriched categorical setting. For a poset $P$ and a closed symmetric monoidal abelian category $\mathcal{C}$, we define M\"obius cohomology as the derived functors of an enriched hom functor on the category of $P$-modules. We prove that the Euler characteristic of our cohomology theory recovers the classical M\"obius inversion, providing a natural categorification. As a key application, we prove a categorical version of Rota's Galois Connection. Our approach unifies classical ideas from combinatorics with homological algebra.

math.AT

M\"obius Homology

This paper introduces and develops M\"obius homology, a homology theory for representations of finite posets into abelian categories. Although the connection between poset topology and M\"obius functions is classical, we go further by establishing a direct connection between poset topology and M\"obius inversions. In particular, we show that M\"obius homology categorifies the M\"obius inversion, as its Euler characteristic coincides with the M\"obius inversion applied to the dimension function of the representation. We also present a homological version of Rota's Galois Connection Theorem, relating the M\"obius homologies of two posets connected by a Galois connection. Our main application concerns persistent homology over general posets. We prove that, under a suitable definition, the persistence diagram arises as an Euler characteristic over a poset of intervals, and thus M\"obius homology provides a categorification of the persistence diagram. This furnishes a new invariant for persistent homology over arbitrary finite posets. Finally, leveraging our homological variant of Rota's Galois Connection Theorem, we establish several results about the persistence diagram.

math.AT

Poincar\'e Duality for Generalized Persistence Diagrams of (co)Filtrations

We dualize previous work on generalized persistence diagrams for filtrations to cofiltrations. When the underlying space is a manifold, we express this duality as a Poincar\'e duality between their generalized persistence diagrams. A heavy emphasis is placed on the recent discovery of functoriality of the generalized persistence diagram and its connection to Rota's Galois Connection Theorem.

math.AT

Combinatorial Persistent Homology Transform

The combinatorial interpretation of the persistence diagram as a M\"obius inversion was recently shown to be functorial. We employ this discovery to recast the Persistent Homology Transform of a geometric complex as a representation of a cellulation on $\mathbb{S}^n$ to the category of combinatorial persistence diagrams. Detailed examples are provided. We hope this recasting of the PH transform will allow for the adoption of existing methods from algebraic and topological combinatorics to the study of shapes.

math.AT

Output-sensitive Computation of Generalized Persistence Diagrams for 2-filtrations

When persistence diagrams are formalized as the Mobius inversion of the birth-death function, they naturally generalize to the multi-parameter setting and enjoy many of the key properties, such as stability, that we expect in applications. The direct definition in the 2-parameter setting, and the corresponding brute-force algorithm to compute them, require $\Omega(n^4)$ operations. But the size of the generalized persistence diagram, $C$, can be as low as linear (and as high as cubic). We elucidate a connection between the 2-parameter and the ordinary 1-parameter settings, which allows us to design an output-sensitive algorithm, whose running time is in $O(n^3 + Cn)$.

cs.CG

Edit Distance and Persistence Diagrams Over Lattices

We build a functorial pipeline for persistent homology. The input to this pipeline is a filtered simplicial complex indexed by any finite metric lattice and the output is a persistence diagram defined as the M\"obius inversion of its birth-death function. We adapt the Reeb graph edit distance to each of our categories and prove that both functors in our pipeline are $1$-Lipschitz making our pipeline stable. Our constructions generalize the classical persistence diagram and, in this setting, the bottleneck distance is strongly equivalent to the edit distance.

math.AT

Leray Spectral Sequence for Simplicial Maps

The Leray spectral sequence of a map $f$ computes the homology of the domain of $f$ from the fibers of $f$. In this expository paper, we relate in full detail the Leray spectral sequence associated to a simplicial map $f$ to the Leray cosheaves of $f$. We then give applications to level set persistent homology and Reeb spaces.

math.AT

Canonical stratifications along bisheaves

A theory of bisheaves has been recently introduced to measure the homological stability of fibers of maps to manifolds. A bisheaf over a topological space is a triple consisting of a sheaf, a cosheaf, and compatible maps from the stalks of the sheaf to the stalks of the cosheaf. In this note we describe how, given a bisheaf constructible (i.e., locally constant) with respect to a triangulation of its underlying space, one can explicitly determine the coarsest stratification of that space for which the bisheaf remains constructible.

math.AT

Persistent Local Systems

In this paper, we give lower bounds for the homology of the fibers of a map to a manifold. Using new sheaf theoretic methods, we show that these lower bounds persist over whole open sets of the manifold, and that they are stable under perturbations of the map. This generalizes certain ideas of persistent homology to higher dimensions.

math.AT

Classification of Constructible Cosheaves

In this paper we prove an equivalence theorem originally observed by Robert MacPherson. On one side of the equivalence is the category of cosheaves that are constructible with respect to a locally cone-like stratification. Our constructibility condition is new and only requires that certain inclusions of open sets are sent to isomorphisms. On the other side of the equivalence is the category of functors from the entrance path category, which has points for objects and certain homotopy classes of paths for morphisms. When our constructible cosheaves are valued in $\mathsf{Set}$ we prove an additional equivalence with the category of stratified coverings.

math.AT

Reinforcement Learning approach for Real Time Strategy Games Battle city and S3

In this paper we proposed reinforcement learning algorithms with the generalized reward function. In our proposed method we use Q-learning and SARSA algorithms with generalised reward function to train the reinforcement learning agent. We evaluated the performance of our proposed algorithms on two real-time strategy games called BattleCity and S3. There are two main advantages of having such an approach as compared to other works in RTS. (1) We can ignore the concept of a simulator which is often game specific and is usually hard coded in any type of RTS games (2) our system can learn from interaction with any opponents and quickly change the strategy according to the opponents and do not need any human traces as used in previous works. Keywords : Reinforcement learning, Machine learning, Real time strategy, Artificial intelligence.

cs.AI

Generalized Persistence Diagrams

We generalize the persistence diagram of Cohen-Steiner, Edelsbrunner, and Harer to the setting of constructible persistence modules valued in a symmetric monoidal category. We call this the type A persistence diagram of a persistence module. If the category is also abelian, then we define a second type B persistence diagram. In addition, we show that both diagrams are stable to all sufficiently small perturbations of the module.

math.AT