SearcharxivSearch

arXiv subjects

Aaryan Sharma

Publications and source records attributed to Aaryan Sharma.

4 recordsLinked to original sources

MASCOT: Model-Aware Submodular Coverage for Composite-Attribute Text-to-Image Retrieval

Vision-Language Models (VLMs) are highly effective in retrieving semantically relevant images. However, in practice, relevance alone is often insufficient. Systems must also achieve Result Diversification (RD) across composite attributes such as geography and time, a task for which precise control remains challenging. Current re-ranking methods, such as Multi-Source Determinantal Point Processes (MS-DPP), address this using manifold-based repulsion over similarity representations. Although this strategy is effective for broad exploration, it exposes a key limitation in manifold-based models: when subjected to diversity-decrease tasks on discrete metadata, they suffer substantial degradation in early-rank recall. To bridge this gap, we introduce MASCOT (Model-Aware Submodular Coverage for Composite-Attribute Text-to-Image Retrieval). Instead of relying on manifold repulsion, MASCOT formulates multi-attribute diversity as a resource allocation problem, projecting attributes into a soft-binning space weighted by query-driven importance. Averaged across the three PixelProse diversity-decrease tasks, MASCOT preserves an early-rank recall (R@10) of 88.58%, while MS-DPP retains 67.63%. The margin widens under composite constraints: on PP_geo_hour, where temporal and geographic diversity must be suppressed simultaneously, MS-DPP's recall collapses from 0.9737 to 0.4931 and its top-ranked result degrades to R@1 = 0.23, while MASCOT holds R@10 = 0.9410 and R@1 = 0.7202 at a diversity metric above the unconstrained baseline. We do not claim uniform superiority: on aggregate diversity-relevance scores our own simpler ablations attain higher harmonic means on all three decrease tasks, and MASCOT's advantage is specific to recall beyond rank 1 under composite constraints.

cs.MM

Algebraic Properties of the Ideal of Spectral Invariants for the Discrete Laplacian

Let $Γ=q_1\mathbb{Z}\oplus q_2 \mathbb{Z}\oplus\cdots\oplus q_d\mathbb{Z}$, with $q_j\in \mathbb{Z}^+$ for each $j\in \{1,\ldots,d\}$, and denote by $Δ$ the discrete Laplacian on $\ell^2\left( \mathbb{Z}^d\right)$. We describe various algebraic properties of the ideal of spectral invariants for the discrete Laplacian when $d=1$, including a construction of a Gröbner basis. We also present various collections of complex $Γ$-periodic potentials $V$ that are such that $Δ$ and $Δ+ V$ are Floquet isospectral. We end with a discussion of the general setting, where the $q_i$ are taken to be vectors in $\mathbb{Z}^d$.

math.SP

Design and initial results from the "Junior" Levitated Dipole Experiment

OpenStar Technologies is a private fusion company exploring the levitated dipole concept for commercial fusion energy production. OpenStar has manufactured a new generation of levitated dipole experiment, called "Junior", leveraging recent advances made in high-temperature superconducting magnet technologies. Junior houses a ~5.6 T REBCO high-temperature superconducting magnet in a 5.2 m vacuum chamber, with plasma heating achieved via < 50 kW of electron cyclotron resonance heating power. Importantly, this experiment integrates novel high temperature superconductor power supply technology on board the dipole magnet. Recently OpenStar has completed first experimental campaigns with the Junior experiment, achieving first plasmas in late 2024. Experiments conducted with the full levitated system are planned for 2025. This article provides an overview of the main results from these experiments and details improvements planned for future campaigns.

physics.plasm-ph

Enhancing Multi-Image Question Answering via Submodular Subset Selection

Large multimodal models (LMMs) have achieved high performance in vision-language tasks involving single image but they struggle when presented with a collection of multiple images (Multiple Image Question Answering scenario). These tasks, which involve reasoning over large number of images, present issues in scalability (with increasing number of images) and retrieval performance. In this work, we propose an enhancement for retriever framework introduced in MIRAGE model using submodular subset selection techniques. Our method leverages query-aware submodular functions, such as GraphCut, to pre-select a subset of semantically relevant images before main retrieval component. We demonstrate that using anchor-based queries and augmenting the data improves submodular-retriever pipeline effectiveness, particularly in large haystack sizes.

cs.CV