Search arXiv⌕ Search

arXiv subjects

Search papers

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

At least 1,099 records · Page 61Linked to original sources

TokenSwap: Benchmarking and Reducing the Modality Gap in Multimodal LLMs

Multimodal large language models (MLLMs) should exhibit cross-modal consistency, generating consistent responses given semantically equivalent inputs across modalities. However, we observe a systematic discrepancy in model predictions under such cross-modal variations. Specifically, we define the modality gap as the difference in model performance under semantically equivalent textual and multimodal inputs. We introduce TokenSwap, a method that constructs such inputs by replacing textual concepts with semantically aligned images, resulting in sequences where visual tokens are interleaved with text tokens. Based on TokenSwap, we transform existing text-based benchmarks (e.g., MMLU) into image-interleaved counterparts, resulting in TokenSwap-Bench. Across 42 MLLMs, we observe a pervasive modality gap, with performance decreasing by 4.2% to 47.4% when moving from text-only to image-interleaved inputs, averaging 19.6% +/- 3.3% across models. Notably, reasoning models exhibit consistently smaller gaps, achieving an average gap of 10.1% compared to 25.5% for non-reasoning models, suggesting greater robustness in multimodal reasoning across equivalent textual and visual representations. In contrast, neither prompting strategies nor scaling training compute alone reliably reduces the modality gap. Finally, we demonstrate that incorporating TokenSwap during training effectively mitigates this gap, improving cross-modal alignment while preserving strong text-only and vision-language model performance. The project page is available at https://dongxzz.github.io/TokenSwap/.

cs.CL↗

Cellular $\mathbb{A}^1$-homology of wonderful models of subspace arrangements

We compute the cellular $\mathbb{A}^1$-homology of De Concini--Procesi wonderful models of subspace arrangements. For a building set $\mathcal{G}$ over a field $k$, we identify the cellular $\mathbb{A}^1$-chain complex of $\mathbb{P}(\mathcal{G})$ with an $η$-twisted nested-set complex carrying Milnor--Witt coefficients and derived orientation data. The key geometric input is a motivic blow-up calculation: for a blow-up along a smooth center of codimension $c$, the relevant connecting class is $(c-1)_εη$, hence it is zero for $c$ odd and $η$ for $c$ even. This replaces the parity condition in the computation of Rains by a Milnor--Witt attaching class. As a consequence, the part of cellular $\mathbb{A}^1$-homology surviving after multiplication by $η$, and also the homology after inverting $η$, are expressed by the interval cohomology of the $2$-divisible subposet of the lattice generated by $\mathcal{G}$. For the braid arrangement, the condition becomes the odd-block condition on partitions, yielding explicit decompositions for the cellular $\mathbb{A}^1$-homology of $\overline{\mathcal M}_{0,N}$ and examples in low rank.

math.AG↗

TRACT: Temporally Routed Action Chunks with Chronological Phase Authority for Contact-Rich Manipulation

Action chunking shortens the effective decision horizon of robot imitation learning by predicting multiple future actions, while conventional phase conditioning describes the current control instant. When a predicted horizon crosses a procedural boundary, assigning the current phase to the entire chunk creates a structural temporal mismatch. We present TRACT, which factorizes phase-structured action chunking into an accepted current phase and a single CURRENT-to-NEXT boundary inside the future horizon. A task-local graph constrains chronological phase authority, and a cumulative boundary distribution monotonically routes future queries through phase-specific query and action paths. For contact execution, a causal response-deficit integrator compares policy intent with ACK-eligible subsequent motion, accumulates arm compensation when directional response is suppressed, and decays after confirmed recovery. Across six real-robot variants with ten trials each, full TRACT achieves 10/10 full-sequence success, 99.00 [88.75, 100.00]% median [min, max] wipe completion, zero observed phase ambiguity, and zero stalls. Under the current complete method package and evaluation setting, the routed representation obtains better observed task results than the flat package (6/10 vs. 3/10 success; 77.08% vs. 8.03% median wipe completion). Chronological authority reduces observed phase ambiguity from 8/10 to 0/10, and response integration reduces stalls from 4/10 to 0/10. The package comparison does not isolate routing from other generator-package differences.

cs.RO↗

Fibre Inflation Beyond BHP: Constraints and a BHP-Free Regime

We study a restricted fibre-dependent $α'$-loop sector in Type IIB Large Volume Scenario fibre inflation beyond the conventional Berg-Haack-Pajer (BHP) parametrisation. Motivated by effective-field-theory corrections in K3-fibred Calabi--Yau orientifolds, we analyse BHP-complete, partially BHP-driven and BHP-free configurations. For BHP-driven cases, the additional corrections act as effective deformations of the standard fibre potential and are bounded at the percent level relative to the corresponding BHP structures, with logarithmic terms typically more restricted due to their effects on the slope and curvature. At the effective-field-theory level, we identify a BHP-free fibre-inflation regime, referred to as $α'$-loop inflation, in which the conventional KK- and winding-type BHP channels vanish while the generalized loop sector stabilises the fibre modulus and supports slow-roll inflation. This regime exhibits a characteristic hierarchy between fibre-dependent loop structures controlled by the large-volume suppression and satisfies CMB, Kähler-cone, large-volume and heavy-modulus constraints. Our results show that fibre inflation is sensitive to the orientifold and brane configurations, and that corrections beyond the BHP ansatz can generate new controlled inflationary regimes.

hep-th↗

Phase-Drift Limits and Adaptive Quadrature Readout in Programmable Photonic Processors

Phase fluctuations between optical inputs limit programmable photonic processors because their output powers depend on coherent interference. We study the phase-drift penalty that arises when sine and cosine quadratures are measured sequentially rather than simultaneously. The analysis is motivated by measurements from an eight-mode programmable photonic processor, including 35 free-running recordings of 300 s acquired at approximately 125 samples per second per channel. These recordings provide an empirical route for estimating the phase-increment variance at a selected reconfiguration interval. The estimate is defined at the time of the second measurement. For fixed quadrature order, perturbation of the atan2 reconstruction gives $e_{C\to S}=-δ_τ\sin^2ϕ_0+O(δ_τ^2)$ and $e_{S\to C}=-δ_τ\cos^2ϕ_0+O(δ_τ^2)$. Writing $Q_τ=\operatorname{Var}(δ_τ)$, uniform phase averaging gives the first-order drift mean-square error $3Q_τ/8$. A phase-predicted ordering rule measures the locally less informative quadrature first and the more informative quadrature second. Its uniform first-order penalty is $(3/8-1/π)Q_τ$, which is 84.9 percent below the fixed-order value. We also derive an increment-aware estimator from a local state-space model. Marginalizing the unknown phase increment increases the variance of a stale phase observation by $Q_τ$, reducing its Fisher information from $I$ to $I/(1+IQ_τ)$. For ideal balanced Poisson detection, the Fisher information of each quadrature equals its detected signal-photon number. This yields dimensionless architecture boundaries in spatial information and phase-increment variance. Nonlinear Monte Carlo simulations validate the perturbative laws, quantify robustness to prediction error, and compare simultaneous, fixed-order, increment-aware, and adaptive receivers under a common noise model.

physics.optics↗

Magneto-oscillations, nonlinearity, and nonreciprocity of Coulomb drag in quantum circuits

We consider the problem of Coulomb drag in interactively coupled quantum circuits built of adiabatic constrictions: quantum point contacts and short quantum-wire channels. The interplay of spatial confinement and magnetic field leads to a rich oscillatory response of the drag current as a function of gate voltage and magnetic field: drag peaks track the depopulation of magnetoelectric subbands, are asymptotically periodic in inverse field, and their visibility is controlled by the competition of temperature with the field-sharpened tunneling width of the constriction. We derive a closed expression for the linear drag conductance whose interaction kernel simplifies dramatically in the experimentally relevant limit of a long thermal length compared with the range of the interwire coupling, investigate the drag in the nonlinear regime, where the drag current measures the transconductance of the drive channel at any field, and discuss physically motivated models of dissipation-induced nonreciprocity of the drag signal. Extensions accounting for Zeeman splitting, interaction renormalization of the barrier transmission, backscattering at high field, and the frequency structure of the circuit coupling delineate how each mechanism imprints itself on the temperature dependence and lineshapes of the drag oscillations.

cond-mat.mes-hall↗

Effort without Evidence

I study how paternalistic concern for descendants' success affects learning about the need for costly effort. Each generation can use a demanding method or experiment with a less demanding alternative whose effectiveness is uncertain. Parents who underweight descendants' effort costs undervalue the savings that discovery would provide. On an explicit region of priors and preferences, paternalism removes a materially valuable experiment even though the relevant private record is truthfully transmitted. Relative to an aligned equilibrium attaining the material full-record optimum, the paternalistic equilibrium has greater long-run effort and observed success, lower discounted material welfare, and a less informative terminal public signal. Each sender obtains its preferred full-record continuation, so the comparison survives communication deviations within the same physical environment. I also study concealment as an incentive to experiment. A continuous-effort extension establishes that concealment and finite evidence production can coexist in an infinite-horizon equilibrium. Its welfare gain over babbling is distinct from the loss relative to alignment in the main result.

econ.TH↗

Analytical Prediction of Voltage Collapse in Current-Limited Grid-Forming Inverters

As converter-interfaced units become dominant in power systems, understanding nonlinear stability phenomena involving discrete switching events becomes essential for secure operation. The limited overcurrent capability of grid-forming (GFM) inverters makes current limiting essential during large disturbances. Activation of a circular current limiter (CCL) can cause the operating equilibrium to disappear under certain circumstances. This paper develops an analytical framework to predict the grid-voltage boundaries for CCL activation and determine whether the operating equilibrium persists or disappears after activation. For CCL-based GFM inverters with frozen anti-windup, closed-form expressions for the activation boundaries are derived while accounting for the filter capacitor. A criterion is established to determine whether a saturated (i.e., current-limited) stable equilibrium point (satSEP) persists following limiter activation. A continuation method is also developed to trace equilibria across normal-control and current-limited operation. Power-angle analysis and dynamic-model continuation in single-inverter and modified 9-bus systems validate these predictions. Time-domain simulations further confirm the results. The results show that CCL activation can either cause immediate loss of the stable equilibrium or allow stable current-limited operation to continue until the equilibrium is lost as operating conditions change further.

eess.SY↗

QSCI-CMP: Quantum-Selected Configuration Interaction with Chemically Motivated Preselection

We present QSCI-CMP, a quantum-classical hybrid algorithm for molecular ground-state calculations that reduces both the query count and the gate count of sample-based quantum diagonalization with amplitude amplification (SQD-AA). SQD-AA mitigates the measurement bottleneck of quantum-selected configuration interaction (QSCI) by amplifying the basis states that have not yet been measured. Its oracle, however, specifies the measured states by listing them one by one, so its gate count grows with the number of collected states. Moreover, the quantum resources are spent even on states whose importance is evident from chemical knowledge, such as low-order excitations from the Hartree-Fock reference, which could be collected classically at the outset. We therefore propose to fix such chemically trivial states in advance, include them in the diagonalization subspace from the start, and exclude them from the amplification target, using a low-cost oracle that recognizes them through the excitation level and the seniority number of each basis state. We numerically demonstrate that QSCI-CMP reduces the query count and the gate count required to reach chemical accuracy by up to approximately 68% and 72% relative to SQD-AA for 24-qubit systems. The chemically trivial subspace is freely tunable within the classical computational budget. A larger subspace shifts more work onto the classical solver and increases the reduction in quantum cost, and when it captures the ground state sufficiently well, no quantum sampling is needed at all. We also point out that a query-optimal iteration count known from the analysis of quantum search further reduces the query count of both methods by approximately 12%.

quant-ph↗

Reducing belief in conspiracy theories as they unfold using large language models

The emergence of conspiracy theories in the wake of major events is a significant societal challenge. Here we test whether conversational dialogues with a large language model (LLM) can reduce belief in immediately unfolding conspiracies. In experiments conducted in the days following the July 2024 assassination attempt on Donald Trump and the September 2025 assassination of Charlie Kirk, U.S. adults (Experiment 1: N = 472; Experiment 2: N = 1042) holding conspiratorial views about the crisis event engaged in a multi-turn conversation with an LLM prompted to reduce their conspiracy belief. Compared to control participants who either discussed an irrelevant topic with an LLM or viewed a static fact sheet, participants in the LLM treatment showed significantly reduced conspiracy beliefs in both experiments. We also found some suggestive evidence of downstream effects of the LLM treatment, observing reduced belief in some -- but not all -- analyses of different conspiratorial beliefs one to two months later. These results shed light on the psychology of emerging conspiracies and highlight the potential for scalable, cognitively-focused interventions to counteract misinformation in the immediate aftermath of high-profile societal events.

cs.HC↗

How Much AI Is in This Track? Quantifying the Proportion of AI-Generated Stems in Hybrid Music Mixtures

AI-generated music is increasingly used at the stem level, with producers integrating synthetic drums, basslines, or vocals alongside human-performed instruments. However, current AI music detection systems are binary, treating tracks as either fully AI or fully human. In this paper, we reformulate AI music detection as a regression problem on a continuous AI energy ratio, alpha in [0, 1]. We propose a methodology that leverages a multi-track music dataset to assemble mixtures of human-performed and AI-reconstructed stems (obtained using a neural audio codec) with known proportions of each content type. Using this approach, we first show that a CNN-based model trained on fully AI-generated or human-performed tracks, which achieves >99% accuracy as a binary detector, when faced with mixed content, yields an output that rises with the AI stems' energy contribution, acting as a noisy and miscalibrated estimator. Our analysis of the influence of different stems shows that detection sensitivity depends on the instrument and reflects its frequency content: drums and guitar carry strong codec-artifact signatures, while vocals and bass are less detectable. Based on these insights, we train a similar CNN-based model for regression of alpha, achieving MAE = 0.076 and R^2 = 0.85 on held-out mixtures from the same pipeline. These results suggest that the regression formulation is an initial promising step towards AI-music detection in realistic music production workflows.

eess.AS↗

Calling the Bluff: Detecting Ever-Shifting Harmful Chat Dialogue via Ordered Reasoning Chain Regularization

Harmful chat dialogues are ever-shifting through type-shifting and lexical evasion, yet we find they share invariant principles, i.e., an Ordered Reasoning Chain (ORC) of recurring topics, harm language indicators, severity hierarchies, and type characteristics, which can help us capture the key information in the frequently changing lexical expressions. We propose BRACE, which encodes the ORC as four differentiable stages (Topic -> Indicator -> Severity -> Type) with intermediate supervision, serving as a structured regularizer blended with direct heads, and supported by prototype-based feature augmentation and feature path disentanglement. The evaluation results show that, across 4 domains and 5 harm categories, BRACE achieves harm-type macro F1 of 0.934 (RoBERTa-wwm-ext, 3-seed mean), with decoder backbones (Qwen3-1.7B LoRA) reaching 0.949. Ablation studies show that all components contribute to BRACE, and the structural decomposition of ORC enables BRACE to distinguish harmful types with semantic ambiguity. Disclaimer: This paper may contain content that is disturbing to some readers.

cs.CL↗

Security and Privacy Taxonomy Generation from Mobile App Reviews

Mobile app reviews are a rich, continuously renewing source of how users experience privacy and security, yet existing taxonomies of these concerns are hand-crafted and cannot keep pace with the evolving nature of the data. Automating taxonomy construction is the natural response, but scalability is the core challenge: current LLM- and clustering-based methods are developed for scientific corpora of a few thousand documents and do not extend to app review collections numbering in the hundreds of thousands. We address this gap in two ways. First, we filter app reviews for privacy- and security-related content, yielding a comprehensive corpus of over 600K reviews. Second, we introduce TaxoScale, a pipeline that handles taxonomy construction at this scale by extending an expert-defined taxonomy via Recursive Hierarchical Clustering and LLM-based node naming. TaxoScale outperforms strong automatic-taxonomy baselines on path, level, coverage, and novelty metrics, and discovers novel branches absent from prior taxonomies. We publicly release our code and data to support reproducibility and future research.

cs.CL↗

Test-Time Augmentation for LLMs: Where to Inject Diversity at Inference Time

Aggregating several LLM responses to the same question can improve accuracy, but every method that does so must decide where the responses should differ. Established test-time scaling methods such as self-consistency vary only the reasoning path, resampling from a fixed input. The input modification offers several further options: the wording of the question can be rephrased, the spelling can be perturbed, and the accompanying images can be transformed. We study Test-Time Augmentation (TTA), which aggregates predictions across transformed versions of the input, and use it to ask where diversity is best injected. Comparing these options across six benchmarks at a matched number of inference calls, we find that where the diversity comes from matters more than how much of it there is. Meaning-preserving paraphrases of the input yield the largest accuracy gains (+1.80 pp over a single call) and reach peak accuracy with the fewest samples. Yet, they are not the most diverse: character-level noise makes the responses disagree far more often (37.8% versus 27.4%) while gaining less accuracy, and perturbing two modalities at once falls below the single-call baseline. Not all diversity is equally useful: perturbations that keep the meaning intact produce disagreement that aggregation can use, while those that corrupt it produce disagreement that is wrong. Overall, our results suggest that for mid-tier LLMs such as Claude Haiku, varying how a question is phrased is a better use of an inference call than varying the reasoning path. Our TTA implementation is available at github.com/aws-samples/sample-genai-reflection-for-bedrock.

cs.LG↗

Decoding Transient X-ray Absorption Spectra of Acetylacetone With Multireference Algebraic Diagrammatic Construction Theory

Time-resolved X-ray absorption spectroscopy (TR-XAS) offers an element- and site-specific probe of coupled electronic and nuclear dynamics, but its interpretation requires methods that can treat multiconfigurational excited states across nonequilibrium nuclear ensembles. Here, we report time-resolved simulations of the acetylacetone (AcAc) transient X-ray absorption spectra by combining surface-hopping dynamics from complete active space second-order perturbation theory with multireference algebraic diagrammatic construction (MR-ADC). The simulated 20-200 fs spectra show a good agreement with experimental measurements and reveal that the TR-XAS response is governed by continuously evolving distributions of molecular geometries on the singlet potential energy surfaces (S2 and S1). In particular, absorption at 279.5-281.5 eV is enhanced for transient, nearly symmetric proton-sharing configurations, whereas the 284-286 eV profile reflects geometry-dependent C1s excitations modulated by proton transfer, bond alternation, and ring opening. For the long-time T_1 spectrum (7-10 ps), the principal features near 281.4 and 283.8 eV are assigned to central C 1s excitations into low-lying triplet pi-orbitals. Together, our simulations provide a more complete mechanistic picture of AcAc photorelaxation by directly linking ultrafast carbon K-edge signals to proton transfer, skeletal reorganization, internal conversion, and triplet formation.

physics.chem-ph↗

A stable and efficient Galerkin spectral method with asymmetrically-weighted Hermite functions for the Vlasov-Poisson system

We analyze a Galerkin spectral method applied to the Vlasov-Poisson (VP) system based on time-independent asymmetrically-weighted (AW) Hermite functions in velocity. The VP system is written as an hyperbolic system using AW Hermite functions in velocity. Unlike the classical Petrov-Galerkin spectral method, which is not stable, the proposed Galerkin spectral method admits a natural stability in the unweighted L2 norm. This stability property enables a rigorous convergence analysis of the method. For sufficiently regular solutions with exponential decay in velocity, we establish error estimates between the exact and numerical solutions and prove convergence of the Galerkin spectral method. In particular, the method achieves spectral convergence in Sobolev spaces, with convergence rates determined by the regularity of the exact solution. Since the Gram matrix arising from the proposed Galerkin method is dense, we derive an equivalent form that retains the same approximation properties while preserving the sparsity structure similar to the classical Petrov-Galerkin method.

math.NA↗

Thread Scaling of Hexaly on the TDVRPTW across Two Model Encodings. An Experimental Report: Binding Choice, Slice-Count Choice, and Two Thread Ladders

Thread scaling in Hexaly on the Time-Dependent Vehicle Routing Problem with Time Windows (TDVRPTW) depends on modeling, and on the language binding through which the model reaches the solver. We compare two encodings, both reaching the solver through its C++ binding: one evaluates continuous travel-time functions exactly through external callbacks, which that binding evaluates concurrently, while the other approximates them with time slices evaluated natively by the solver. Independent CPU accounting confirms that both use the cores they are allocated, but they respond differently to width. The external-function encoding stabilizes, reducing its seed dispersion by about 30% up to 8 threads before widening again, yet its pooled quality barely moves, because nine of the ten instances improve while the hardest one degrades by enough to cancel them. For the time-sliced encoding we first select a discretization on feasibility under the original travel-time functions rather than on approximation error, and the retained setting then improves monotonically with the thread count, gaining about a quarter of its final gap and reducing the seed dispersion by nearly half between 1 and 16 threads. At equal single-threaded budget the two encodings are close, and the small pooled edge of exact evaluation comes from that same hardest instance, so the practical advantage of the discretization is thread scaling rather than fidelity traded for speed. These descriptive results support multi-threading as a way to improve solution quality and stability when the model can exploit it, and they show that binding-level constraints on external evaluation must be measured, not assumed.

math.OC↗

REATS: LLM Reasoning-based Ensemble Learning for Adaptive Time Series Forecasting

Due to the diversity of real-world time series, no single forecasting model consistently dominates across all samples. Ensemble learning addresses this by combining complementary model strengths, yet existing methods rely on fixed rules or black-box models based solely on numerical inputs, failing to leverage LLM reasoning for interpretable weighting decisions. We propose REATS, which leverages LLM reasoning capabilities as an intelligent ensemble router that jointly processes textual temporal pattern descriptions and numerical features to produce interpretable, sample-adaptive ensemble weights through chain-of-thought reasoning. To enable effective LLM-based ensembling, we study its key design choices and propose: (i) a structured input pipeline that transforms raw time series into hybrid textual--numerical representations with fixed token cost, enabling rule-based chain-of-thought construction without API dependency, augmented with retrieved similar-sample priors; (ii) a diverse multi-row weight supervision scheme coupled with a token-efficient percentage-table format that reduces numerical complexity and mitigates LLM hallucinations; and (iii) a two-stage fine-tuning framework combining SFT with GRPO, where a reciprocal reward mapping transforms the continuous unbounded MSE gap into bounded signals with amplified near-oracle sensitivity, addressing the uniform sensitivity and outlier-dominated advantage compression inherent in naive reward designs for regression-based GRPO. Experiments on eight benchmarks demonstrate that REATS outperforms competitive ensemble baselines while providing natural language explanations and demonstrating strong transfer learning and out-of-domain generalization to unseen candidate models.

cs.LG↗