SearcharxivSearch

SEARCH · Searcharxiv

Search Searcharxiv

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

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3Linked to original sources

Measuring the Value of World-Model Updates: A Counterfactual Utility Protocol for Continual Adaptation

Continual world models must decide whether new data justify changing the model. Fixed replay schedules and prediction-error triggers specify when to update, but neither reveals the value of an individual update: one deployment run cannot show how the same model would have performed at that moment had it held its parameters. We introduce the fork ledger, which branches a deployment stream at pre-registered decision points into matched update and hold continuations under common random numbers. It evaluates both continuations on the same episodes and records $\Delta R = R_{\mathrm{update}} - R_{\mathrm{hold}}$. Always applying one fixed update mechanism lowers return on all three simulated control tasks: CartPole ($-144.0$; checkpoint-bootstrap $95\%$ CI $[-185.4,-116.1]$, against a converged return near $650$), Walker ($-82.8$; $[-101.1,-61.7]$) and Cheetah ($-18.6$; $[-29.0,-6.6]$). Divergence is an outcome of applying the update, so the estimand counts every attempted fork; restricted to the $693$ of $720$ that did not collapse, CartPole and Walker are unchanged in sign ($-113.4$ and $-82.1$) and Cheetah becomes unresolved ($-3.9$; $[-17.5,+13.0]$). The task is the unit of inference: each contributes $240$ attempted forks over five pretrained checkpoints crossed with two drift directions. The ledger makes counterfactual utility observable for a fixed mechanism, allowing triggers to be judged by the updates they select rather than by surprise detection alone.

cs.LG

Fast Dynamical Modelling of Milky Way Globular Clusters -- II. Impacts of Black Hole Prescriptions

The populations of stellar-mass black holes (BHs) in globular clusters (GCs) play a key role in their dynamical evolution, however the mechanisms surrounding their formation and retention are uncertain. In this work, we extend the analysis of Paper I by fitting coupled rapid cluster evolution and multimass equilibrium models to a large sample of Milky Way GCs, under a variety of prescriptions for stellar evolution, BH formation and supernovae (SN) natal kicks. We explore the impacts of adopting SSE or PARSEC (through SEVN) prescriptions for BH initial-final mass relations, the rapid or delayed SN fallback mechanisms, and an ad hoc grid of kick strengths ejecting between 40 and 80 per cent of all BHs formed. All models reproduce the same present-day conditions despite starting from notably different initial BH populations, due to the correlation found between the initial cluster densities and initial BH mass fractions. A linear relationship is found between the (log) initial half-mass density and the initial BH mass fraction, with the SEVN models resulting in median densities ($\rho_{h,0} \sim 10^{7.2\pm1.1}\,{M_\odot pc^{-3}}$) nearly an order of magnitude higher than those of SSE ($\rho_{h,0} \sim 10^{6.4\pm0.9}\,{M_\odot pc^{-3}}$). We also find that both the bottom-light initial mass functions and the present-day BH mass fractions previously inferred are relatively robust against the stellar evolution models and natal kick prescriptions assumed. Finally, we discuss the implications of these results on the expected numbers and properties of dynamical binary-BH mergers, and the growth of intermediate-mass BHs.

astro-ph.GA

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Typical dynamical properties of operators on $\ell_p$

We investigate the typical dynamical properties of hypercyclic operators in $\mathcal{L}_M(X)$, the set of all bounded linear operators on $X$ whose norms are at most $M$, when $X=\ell_p$, $1< p<\infty$. We show that, with respect to SOT$^*$, a typical operator $T\in \mathcal{L}_M(X)$ is weakly mixing, is weakly disjoint from a given hypercyclic operator $S$, is not topologically ergodic, and satisfies $(T,T^2,\dotsc,T^k)$ is disjoint hypercyclic for any $k\geq 2$. We also study the typical dynamical properties for the concrete family $\mathcal{M}=\{I+B_w\in \mathcal{L}(X)\colon w\in c_0(\mathbb{Z})\}$, endowed with the norm topology, where $B_w$ is a bilateral weighted backward shift.

math.FA

Particle-resolved pathways to energetic-ion formation in a fluctuating low-current hollow-cathode plume

Energetic-ion formation in a low-current hollow-cathode plume is investigated using experiments, self-consistent electrostatic particle-in-cell (PIC) simulation, and particle-resolved analysis. Retarding potential analyzer measurements show a substantial energetic-ion population over discharge currents of 0.8-3.5 A, while probe measurements reveal broadband plume fluctuations. Two-point phase-derived frequency-wavenumber measurements do not resolve a continuous ion-acoustic dispersion branch within the principal apparent-wavenumber interval. Because the inferred wavenumber is obtained from a cross-spectral phase defined modulo 2pi, the fluctuation diagnostics do not provide an unambiguous modal attribution for the energetic-ion population. A representative PIC plume, used as a qualitative kinetic reference, likewise develops broadband time-dependent electrostatic fluctuations together with a nonthermal energetic-ion population. Particle-resolved analysis shows that the energetic outflow is dominated by ions generated through ionization inside the plume, while source localization biases access to distinct trajectory and escape families. Matched field controls further show that time-averaged and frozen fields strongly suppress access to high-energy trajectories relative to the full time-dependent field over the analyzed interval. At the single-particle level, ion kinetic-energy gain is determined by electrostatic-field work accumulated along the actual trajectory, with different escape families exhibiting distinct radial and axial work contributions. These results establish a source-trajectory-field-work pathway for energetic-ion formation that can be identified without first assigning the fluctuating plume to a unique resolved plasma mode.

physics.plasm-ph

Global existence and time decay for a bipolar Euler-Poisson system with one pressureless and undamped fluid

We study the Cauchy problem for a three-dimensional bipolar Euler--Poisson system in which one fluid is pressureless and undamped, while the other is subject to momentum relaxation. For sufficiently small smooth perturbations of a constant equilibrium, we prove the global existence and uniqueness of smooth solutions under an irrotationality assumption on the initial velocity of the pressureless fluid, together with algebraic time-decay estimates. The main difficulty is that the velocity of the pressureless fluid is dissipated only indirectly through the Poisson coupling, and this mechanism degenerates strongly at high frequencies, leading to a regularity-loss structure. We overcome this difficulty by combining refined Green-function estimates, a low--middle--high frequency decomposition, and high-order nonlinear energy estimates adapted to the asymmetric regularity hierarchy. The result establishes a global small-data theory for this asymmetric regime, in which pressure and damping are simultaneously absent from the same fluid.

math.AP

MMS Allocation for Chores with Online Agent Arrivals

We study the fair allocation of $m$ indivisible chores to $n$ agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed of her cost function and must irrevocably assign her a set of chores. We focus on the Maximin Share (MMS) fairness notion and aim to compute an allocation in which all items are assigned, and no agent incurs a cost more than $\alpha$ times her MMS. Without any prior information about the instance (other than $n$ and $m$), we design an algorithm with a competitive ratio of $O(\min\{n, k\log^{1+\epsilon}k, \log m\})$ for any constant $\epsilon > 0$, where $k$ denotes the number of cost function types. Our bound matches the best known offline approximation guarantees for MMS under subadditive costs and is nearly optimal with respect to all three parameters: we show that even for binary additive cost functions, no online algorithm can achieve a competitive ratio of $o(\min\{n, k\log k, \log m\})$. We then consider the setting in which the $k$ cost function types are known in advance (though the realized types of arriving agents are not). For additive cost functions, we provide an algorithm with a competitive ratio of $O(\min\{\log k, \log(kn)/\log\log(kn)\})$, and show that constant-competitive algorithms do not exist for general $k$, even for the binary additive setting. For binary additive functions when $k \le n$, we propose a $3$-competitive algorithm and establish a lower bound of $2$.

cs.GT

When More Is Not Better: Component Anti-Synergy in a P300 Speller

P300 brain-computer interface (BCI) spellers can provide hands-free communication for people with severe motor impairments. Modern pipelines combine multiple individually promising components, often assuming that 'more-is-better'. We tested this assumption using a four-component full-factorial experiment varying the inclusion of Euclidean Alignment (EA), xDAWN spatial filtering, subject calibration, and language model priors on a public P300 dataset. Performance was evaluated using accuracy, repetitions, and information transfer rate (ITR) with mixed-effects models. Results show that the value of components is conditional rather than additive. Calibration was the strongest singular contributor, while EA compensated for its absence in zero-calibration settings. Adding independently useful components could also reduce performance, revealing component anti-synergy. Contrary to conventional wisdom, LM support was not universally beneficial: its effect depends strongly on the strength of the underlying EEG pipeline, while results from a larger LM showed a similar pattern. Together, these findings challenge maximal 'all-on' pipeline design and highlight the value of selecting spatial and language-support components according to the quality of available EEG evidence.

cs.LG

What a Random Draw from the MCP Registry Contains, and What Tool-Use Benchmarks Contain Instead

Studies of the Model Context Protocol (MCP) server ecosystem draw their samples in ways that quietly select for servers that work: reference sets, popularity lists, hand-curated frames, or pipelines that repair a server until it starts. We report what an unrepaired probability sample actually contains. From a 24,135-server registry census we draw 400 npm/stdio servers with a published seed and probe each one over the wire. Only 48.8% complete an initialize handshake, against 66.7% for a hand-curated frame measured with the same instrument, and the dominant failure is not missing credentials (13.3%) but servers that never start at all (37.5%). Among the 195 that do run, hard conformance is total: zero fatal JSON Schema violations across 2,766 advertised tools. Optional safety annotations are the real variance, and the tool-level omission rate on a random draw is 58.8% against 41.5% on the curated frame, so curation flatters this figure too. We then compare the tool descriptions these servers advertise against two tool-use benchmark corpora using one method held constant. Real MCP tools show 2.8% near-duplication at cosine 0.70, and all of it lies within single servers: cross-author near-duplication is 0.0% at every threshold tested. BFCL v4 shows 16.7%, of which 16.4 points lie between independently presented tasks. UltraTool shows 0.3%, cleaner than real tools, so this is a property of BFCL and not of synthetic corpora as a class. Separately, 68.8% of raw BFCL rows and 85.6% of raw UltraTool rows are exact name-plus-description repeats, against 0.4% for real MCP, so any statistic computed over these releases without global deduplication measures repetition rather than tools. All figures regenerate from released scripts and a published seed.

cs.SE

Production of Light Nuclei and Hypernuclei in Heavy-Ion Collisions

We review recent STAR and ALICE measurements of light-nucleus and hypernucleus yields, femtoscopic correlations, and collective flow presented at SQM 2026. Statistical-hadronization calculations provide a useful baseline for integrated yields but do not simultaneously describe all measured light-nucleus ratios across collision energies and system sizes. For bound states with mass number $A<4$, current coalescence calculations provide a broadly consistent description of yields, femtoscopic correlations, and collective flow, although the quantitative hypertriton comparison depends on the assumed few-body wave function. The suppressed production of resonant $^{4}$Li relative to compact $^{4}$He indicates an effect of nuclear structure and late-stage dynamics. However, the quantitative model comparison also depends on the treatment of feed-down from unstable states. In high-multiplicity $p$+$p$ collisions, pion-deuteron femtoscopy further indicates that most observed (anti)deuterons are formed through nucleon fusion after strong decays of short-lived resonances. Taken together, these measurements show that production chronology and internal nuclear structure leave measurable imprints on the physics observables.

hep-ex

Decoupling Readiness from Release for Tail-Aware Scheduling of Agentic LLM Workflows

Agentic LLM workflows consist of sequences of model turns interleaved with tool interactions, so their end-to-end completion time depends not only on inference speed but also on when ready turns are released. Most runtimes release each turn immediately upon readiness. Under contention, this eager release policy can accumulate released but unfinished work; once submitted, those turns can no longer be reordered by the workflow-level policy, increasing tail latency. We present a tail-risk-aware turn release scheduling method that jointly decides which ready turn to release next and how much released but unfinished work to maintain. The method uses a mean--Conditional Value-at-Risk (CVaR) objective to capture the evolving tail risk of unfinished workflows, incorporates online estimates of turn work when prioritizing ready turns, and adapts the released work budget to observed queue pressure. We evaluate the method using real agent execution traces from software engineering tasks across multiple LLMs and workflow arrival rates. The method performs comparably to eager release under light load and substantially reduces the P95 of workflow flow time under contention, achieving up to a \(3.50\times\) speedup.

cs.AI

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Eclipse Properties and Superhump Evolution in the SU UMa-Type Dwarf Nova Z Cha

The advent of large-scale time-domain surveys provides both opportunities and challenges for understanding accretion disk evolution in cataclysmic variables (CVs). Using high-cadence photometry from the Transiting Exoplanet Survey Satellite (TESS), we investigate the eclipsing SU UMa-type dwarf nova Z Cha. Leveraging eclipses as a natural probe, we examine the evolution of the accretion disk through variations in eclipse depth, O--C of eclipse minima, and positive superhump (PSH) amplitude. During superoutbursts, all three quantities exhibit quasi-periodic modulations with a common period of $\sim$2 days, consistent with the precession period of an eccentric disk. We interpret these correlated variations as evidence of an eccentric, precessing disk: O--C traces the periodic shift of the system's brightness center, while eclipse depth and PSH amplitude vary with the orientation of the disk bulge relative to the line of sight. In quiescence (Sectors 13 and 93), PSHs with periods of $\sim$0.0762 days show linearly decreasing amplitudes and periods, indicating gradual shrinkage of the eccentric disk and a slowing precession. Remarkably, a coherent signal with a period of $\sim$0.0729~days ($\epsilon^{-}\approx-0.02$) appears in the same quiescent intervals. This signal may represent negative superhumps (NSHs) coexisting with PSHs, although an orbital sideband of the PSH cannot presently be excluded with the available data. If confirmed as NSHs, their coexistence with PSHs would challenge the classical tilted-disk model, and could be explained by retrograde apsidal precession of an eccentric disk, where the inner disk precesses retrogradely (NSHs) and the outer disk progradely (PSHs); this interpretation remains to be tested by further observations.

astro-ph.SR

Timelike Entanglement from Spacetime Density Matrices: A Lattice Realization

We investigate timelike entanglement in quantum field theory using spacetime density matrices and provide a microscopic lattice realization. For a two-dimensional free real scalar field, we extend Gaussian diagonalization methods to the generally non-Hermitian reduced spacetime density matrix and determine its complete nonzero spectrum in the generic regular case, together with all integer R\'enyi moments. The real-time replica construction identifies these moments with Lorentzian branch-point twist-operator correlation functions. We test this identification against the full four-point function on a circle, boundary two-point functions with Dirichlet and Neumann boundary conditions, and massive form-factor predictions, finding quantitative agreement in both magnitude and phase across distinct causal regimes. The boundary setup exhibits a finite causally connected window in which every integer R\'enyi entropy is real, showing that reality is not equivalent to causal disconnection. These results provide a microscopic lattice foundation for timelike entanglement and for Lorentzian twist-operator methods beyond equal-time regions.

hep-th

Quasi-Whittaker supermodules over Lie superalgebras

In this paper, we develop a general theory of quasi-Whittaker supermodules over Lie superalgebras induced from an arbitrary ideal. We determine the quasi-Whittaker vectors in universal supermodules, establish an irreducibility criterion, and classify several families of irreducible supermodules. The odd part produces a new irreducibility phenomenon absent from the Lie algebra setting. As applications, we determine all irreducible quasi-Whittaker supermodules over the $N=1$ super Schr\"odinger algebra and the $N=1$ $\frac{3}{2}$-conformal Galilei superalgebra, and over the complete spectrum-generating superalgebra in a special case.

math.RT

Engineering Reliable Commit Gates for Agentic AI: Cost-Aware Verification Portfolios under Common-Mode Data Failures

Agentic systems commit state-changing actions, but additional verifiers can inherit the same upstream fault. We present VP-CONTROL, a runtime-assurance design and deterministic benchmark for cost-aware commit gates. Its 48 task templates yield 2,880 scenarios across six fault regimes. A fixed-call 2 x 2 experiment separates verifier-model diversity from evidence-source diversity. On frozen proposals from two local actor families, a cross-model vote over shared evidence approves 62.9% of unsafe proposals, versus 22.9% with an independent source. The source effect is 40.9 percentage points, compared with 11.3 for model diversity. A portfolio controller selects verification plans using only deployment-observable metadata. Approximate cluster-adjusted calibration at a nominal 5% per-task target yields 1.9% unsafe execution and 38.2% automated safe coverage on the locked test. Matched-budget portfolios also improve on fixed verification policies. Transfer remains conditional: unseen fault families yield 16-26% risk, and a FinQA check fails to reproduce the source effect with the tested small verifiers. A preregistered live HTTP/SQLite study tests concurrent writes and lost responses. After-check races defeat verifier-only gates; transactional partial guards prevent only covered failures, while a full atomic guard records no unsafe effects across 216 episodes. Idempotent request identifiers prevent duplicate effects after lost responses. The results motivate explicit evidence lineage, cost-aware selection, and commit-time enforcement, while exposing the limits of approximate calibration and local-tool generalization.

cs.SE

Fengshui: Demystifying Chiplet Ecosystem and Bespoke Neural Network Accelerator Codesign

Modern ML workloads, with stringent latency and energy constraints, are increasingly hard to run efficiently on homogeneous commodity hardware. We argue that operator-level disaggregation--tailoring microarchitecture, batching, and memory hierarchy to each operator--is essential to overcome these limitations, though the resulting highly bespoke accelerators incur prohibitive Non-Recurring Engineering (NRE) costs. Chiplet-based integration amortizes NRE across applications, but choosing which chiplets to build and how to compose them into accelerators is circularly dependent--a chiplet pool's value depends on the constructed accelerators, while accelerator quality is constrained by available chiplets. This paper introduces Fengshui, a chiplet ecosystem and accelerator co-design framework that jointly optimizes chiplet pool composition and bespoke application-specific integrated circuit (BASIC) design. Fengshui constructs BASICs through operator-level disaggregation, co-exploring chiplet and memory heterogeneity, tensor fusion, and pipeline/tensor/expert parallelism with place-and-route validation for physical implementability. With just 8 strategically selected chiplets, encompassing network switches, processing-in-memory units, and accelerators with diverse microarchitectures, Fengshui-generated BASICs achieve 48.5%, 88.1%, 93.0%, and 97.8% reductions in energy, energy-cost product (EC), energy-delay product (EDP), and energy-delay-cost product (EDPC) over homogeneous accelerators, while scoring within 4.1% of unconstrained heterogeneous designs across diverse neural networks. For datacenter MoE and dense LLM serving, Fengshui reduces prefill energy and EC by up to 16.8% and 28.7%, respectively; for edge autonomous vehicle perception, it achieves 12.0% energy and 23.6% EC reductions under real-time latency constraints.

cs.AR

Experimental Design for Policy Choice

We show how to optimally design experiments when the resulting data will be used to choose a welfare-maximizing policy subject to constraints. A decision maker seeks to maximize Bayes expected welfare by choosing a policy whose effects depend on an unknown finite-dimensional parameter. The decision maker has access to a first wave of experimental data with a fixed design but may choose the design of a second wave that will be collected before choosing the policy. The resulting experimental design--policy choice problem is a very high-dimensional dynamic program that is generally intractable in finite samples. We propose a tractable approximation based on the limit experiment and show it is asymptotically optimal using a new asymptotic representation theorem for adaptive experiments with continuous treatments. We apply the method to a conditional cash transfer experiment and demonstrate the potential for large gains from tailoring the experiment to the policy choice.

econ.EM