Searcharxiv⌕ Search

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 703 records · Page 39Linked to original sources

Projective Braids in $\mathbb{R}P^3$

Links in projective space $\mathbb{R}P^3$ can be represented by diagrams in $\mathbb{R}P^2$ where the projective plane $\mathbb{R}P^2$ is represented by a disk with antipodal identifications on the boundary. In this context if we place an $n-$strand braid $β$ on this disk keeping its end points on the boundary then due to the identification of antipodal points it naturally represents a link diagram in $\mathbb{R}P^3$. We call this the projective closure of the braid $β$. In this paper we show that not all links in $\mathbb{R}P^3$ possess a diagram represented by projective closure of some braid.

math.GT↗

Variable-Horizon Model Predictive Control for Switched Systems

This paper investigates model predictive control (MPC) for switched systems subject to control and state constraints. A variable-horizon switched MPC approach is proposed. By steering the system state into a well-designed switching feasible set, the proposed method structurally decouples the dwell-time conditions from the MPC constraints, thereby relaxing the dwell-time requirements to match those of the unconstrained switched systems. Furthermore, algorithms are developed to construct this switching feasible set and characterize the domain of attraction, ensuring both persistent feasibility and closed-loop asymptotic stability. To further decouple the prediction horizon length from strict dwell-time bounds, advanced short-horizon switched MPC schemes are designed, which expand the overall domain of attraction. Simulations illustrate the efficacy of the proposed methods.

eess.SY↗

AdaptDuplex: from static to adaptive full-duplex spoken dialogue

Full-duplex spoken dialogue requires simultaneous listening and speaking at sub-second latency, under conversational timing and cognitive demands that change moment to moment. Yet current models mostly impose static operating points, lacking a systematic mechanism for adaptive decisions. We present AdaptDuplex, which extends Qwen3-Omni with such a mechanism, co-designed across three layers. A compact token-level protocol represents every window as a canonical sequence, trains dual-stream alignment through a bounded text lead over speech, and exposes every behavioral decision as an explicit token for training-free runtime control via logits bias. Adaptive mechanisms dynamically predict among discrete window durations and augment direct response as needed with non-blocking cognitive consolidation and multi-flight external reasoning. A progressive pipeline introduces these behaviors through a three-stage Thinker curriculum, then Talker-only and joint SFT, with GRPO as a preliminary increment. On Full-Duplex-Bench v1 and v1.5, AdaptDuplex outperforms DuplexOmni on 18 of 21 comparable turn-taking, overlap-behavior, and timing metrics and MiniCPM-o 4.5 on 19 of 22, with gains in both interaction decisions and response timing. On human-recorded HumDial-FDBench, it attains the top Final score (69.6) of the compared duplex models.

cs.SD↗

Decoupled Early Exits for Task-Dependent Compute Allocation in Flow-Matching VLAs

Flow-matching Vision-Language-Action (VLA) models have emerged as a potential solution for generalist robot control, designed by combining a pretrained Vision-Language Model (VLM) backbone with an action expert that generates continuous robot actions. While these models exhibit impressive capabilities, due to their very high number of parameters, their computational requirements are often prohibitive for robotics control. To mitigate these inefficiencies, existing methods predominantly skip VLM backbone layers with early exits or reduce denoising steps, while leaving action expert depth untouched. We propose a framework that exposes backbone depth $V$, action expert depth $A$, and denoising steps $D$ as three jointly configurable compute axes in a VLA. Starting from a pretrained VLA, we attach lightweight Exit Transformers (ET) at intermediate depths in both the backbone and the action expert, trained to distil the last layer of the policy into each exit. Furthermore, we introduce a KV Cache synthesis mechanism that manages the missing keys and values of the skipped backbone layers, allowing the action expert to exit deeper than the backbone. Finally, we show that the optimal compute budget is task-dependent, with different tasks benefiting from different axes and depths. Notably, our method does not require training the original policy from scratch, and for each exit, it increases the number of parameters by only $2.1\%$ for SmolVLA and $4.1\%$ for $π_{0.5}$. We validate our approach across two flow-matching VLAs (SmolVLA, $π_{0.5}$) and two benchmarks (LIBERO, Meta-World), revealing complementary effects: $V$ and $A$ respectively reduce FLOPs and latency, while $D$ improves both. Our joint configurations $(V,A,D)$ reduce latency by $79.2\%$ and computation (FLOPs) by $31.8\%$, while improving mean success rate by $5.6\%$.

cs.RO↗

Dynamical Diversity for Reservoir Computing in Reconfigurable Nanomechanics

Physical reservoir computing uses nonlinear dynamics and a trained linear readout to process information. Nanoelectromechanical (NEMS) resonators combine geometric Duffing nonlinearity with fading memory, but most electromechanical implementations use a single resonance mode. Here, we demonstrate reservoir computing with two interacting modes of a single NEMS resonator measured through one readout port. We introduce dynamical diversity through complementary modal drive settings: the same input sequence is replayed under different allocations of drive amplitude between the modes, and the responses are concatenated into a single feature matrix. This multiplexing expands the representation available to the readout without additional devices or training of internal parameters. On NARMA-2, it reduces variance-normalized test error more than 28-fold relative to single-mode operation and more than threefold relative to the best individual two-mode setting. Linear memory-capacity measurements show that accessible recall spans only a few symbols at the tested symbol duration. Its rapid decline with delay, consistent with mechanical dissipation, accompanies rising NARMA error and the eventual loss of multiplexing gains at higher orders. We also use electrical feedthrough as an internal reference for assessing the computational contribution of the NEMS response. Separate linear readouts are trained on feedthrough features and features derived from the measured NEMS response, using the same recordings and matched drive settings and processing. On challenging nonlinear mapping tasks, the multiplexed NEMS features yield substantially lower errors than the feedthrough features. These results demonstrate how dynamical diversity through variations in modal drive amplitudes expands the computational capability of a single multimode NEMS resonator.

physics.app-ph↗

X2SBench: an open benchmark for evaluating crystal structure determination from powder diffraction

Progress towards practical powder X-ray diffraction (PXRD) structure determination requires evaluation beyond small crystals and idealized patterns. X2SBench combines 152,587 simulated structure-pattern pairs with 591 curated measurements, extending evaluation to larger cells, lower-symmetry structures and diverse compositions. Fixed splits, defined inputs and common structural metrics support comparisons by crystal system, atom count and element count. Joint stratification locates weaknesses within these groups. On 558 paired targets, an X2SBench-fine-tuned model improves recovery from simulated patterns but loses accuracy on measured inputs, revealing a gap in experimental transfer. Background subtraction and smoothing improve recovery for one tested checkpoint, while augmentation and reference-lattice comparisons identify further opportunities for measurement adaptation and reliable cell estimation. An open platform provides data access and standardized result submission, establishing a shared basis for community evaluation and progress towards practical PXRD analysis.

cond-mat.mtrl-sci↗

Quasi-Fuchsian groups and complex realisations of $q$-deformed real numbers

We relate the theory of $q$-rational and $q$-real numbers introduced by Morier-Genoud and Ovsienko to the classical theory of Kleinian groups and their Teichmüller spaces. This provides a geometric point of view on several recent results about realisations of $q$-rationals for particular values of $ q \in \mathbb{C} $. As an application we resolve a conjecture of Bapat, Becker, and Licata on the topology of the $q$-deformed Farey tessellation.

math.CV↗

A Spiking Neural Network Model of Elementary Self-Consciousness via Endogenous Default Mode Network Dynamics

Understanding the neurobiological mechanisms underlying self-referential cognition and baseline self-consciousness remains a fundamental challenge in computational neuroscience. In this work, we propose a large-scale computational model incorporating a 10,000-neuron spiking neural network (SNN) based on Izhikevich dynamics. The network is structured into two interacting subsystems: a sensory processing layer (5,000 regular-spiking cortical neurons) and an endogenous Default Mode Network (DMN) pacemaker subsystem (5,000 intrinsically bursting neurons). The DMN layer is modulated by continuous tonic currents reflecting ascending brainstem neuromodulation, maintaining intrinsic, autonomous bioelectric rhythms independent of external sensory input. To represent top-down cognitive modulation, synaptic weights are hierarchically structured such that DMN-to-network projections exceed sensory-level connections. Through numerical simulations using a modified two-step Euler integration scheme, we demonstrate how endogenous pacemaker activity interacts with transient external sensory perturbations, providing an elementary mathematical framework for the emergence of a persistent, self-sustaining neural representation of "Self".

q-bio.NC↗

Aim Short to Reach Far: Your Frozen World Model Can Plan Better Than You Think

Latent world models plan toward goal images with a frozen pretrained predictor, without task rewards or extra trained heads. However, their planners struggle with long-range goals, and prior work addresses this by training extra components such as value functions or subgoal models. We show that the planning target itself can cause this failure: even with exact dynamics and globally optimal short-horizon search, scoring predictions by their distance to the final goal rejects the first steps of a route that initially moves away from the goal. Building on this insight, we propose Anchored Planning (AP), a training-free method that reuses the world model's own offline trajectories. AP retrieves a segment that leads from the current observation toward the goal and aims the frozen planner at an observation shortly after the segment's start. Across four diverse tasks, AP substantially improves frozen LeWM planners for both action synthesis and action ranking, and it outperforms both additional final-goal search and the LeWM planner on long-range goals.

cs.LG↗

Quenched Cosmological Collider Physics: Random fields & white noise

We study a massive spectator field in de Sitter space coupled linearly to a spatially quenched random source with a deterministic power-law time profile. For arbitrary temporal weight, the fixed-realization problem is exactly solvable in terms of Lommel functions, while a Mellin--Barnes representation separates the analytic forced response from the homogeneous massive completion. After Gaussian disorder averaging, the random field modifies only the statistical sector of the propagator, leaving the spectral function and heavy-field poles unchanged. The resulting cosmological-collider seed factorizes exactly into one generalized hypergeometric sector associated with the forced response and two Gauss hypergeometric branches carrying the massive signal, with cancellation of the nonanalytic folded contribution. A persistent source produces a local late-time logarithm in the bispectrum sector, whereas any decaying source renders the physical Schwinger--Keldysh endpoint integrable. For sufficiently fast decay, the nonanalytic massive clock becomes parametrically dominant in the squeezed limit. For spatial white noise, the crossover also removes the explicit exchanged-scale dependence of the disorder contribution and allows destructive interference with the original collapsed trispectrum collider branch. More generally, the temporal profile controls the clock envelope, amplitude, and phase while leaving its logarithmic frequency fixed by the heavy-field mass.

hep-th↗

Relative volume comparison theorem under Kato type conditions

Let $(M, g)$ be an $n$ $(\ge 3)$ dimensional, non-collapsed compact Riemannian manifold and $\operatorname{Ric}^-$ be the negative part of the Ricci curvature and $β\in (\frac{2n}{n+2}, 2)$. We prove a relative volume comparison theorem when $|\operatorname{Ric}^-|^β$ is in the Kato class (cf. Definition 1.1), which results from a new integral Laplace comparison theorem in the spirit of \cite{PW} for a suitable conformal metric. This partly addresses an expectation in \cite{TZZZZ}, where the same result was proven when $|\operatorname{Ric}^-|^2$ is in the class.

math.DG↗

Climate, Science, and the FCC: Think Clearly, Choose Wisely, Act Swiftly

Could a collider become the symbol of everything that must be abandoned to save the climate? In the summer of 2026, this question ran through discussions within the Particles and Fields Division of the French Physical Society. An unacceptable carbon footprint, two EPR nuclear reactors, five hundred deaths, billions to be reallocated and, to top it all, unclear scientific objectives: the objections to CERN's Future Circular Collider (FCC) appeared to form an overwhelming indictment. This essay examines each charge in turn. Grounded in a clear and compelling scientific vision, it confronts emotionally charged imagery with orders of magnitude, distinguishes a project's footprint from its full balance sheet, considers the costs of postponing or abandoning it, and explores ways of reducing its impacts-including the still uncertain prospect of natural hydrogen. The climate alone does not decide the future of the FCC; it requires us to judge the available choices by their real consequences. Developed for the public debate organised by France's National Commission for Public Debate (CNDP) and for the Swiss consultation, this essay is intended for the broadest possible readership, well beyond particle physics and the scientific community. It frames the FCC debate as a choice about the kind of society we want to build: should we organise society around renunciation and ever-shrinking horizons, or transform how we produce and choose a future worth wanting?

hep-ex↗

Incipient superconductivity and tunable Chern insulators in twisted bilayer-trilayer graphene

Moiré superlattices assembled by twisting Bernal and rhombohedral multilayer graphene host a rich set of interaction-driven magnetic and topological states, yet superconductivity has not been observed in these systems except in proximity to a transition-metal dichalcogenide. Here we report incipient superconductivity and tunable Chern insulators in twisted bilayer-trilayer graphene encapsulated by hexagonal boron nitride. Across twist angles from $θ= 1.05^\circ$ to $1.50^\circ$, Chern insulators form at integer and fractional moiré fillings for electron doping, with Chern numbers up to |C| = 3 set by twist angle and tuned by doping. At $θ= 1.18^\circ$, a symmetry-broken metallic region forms for hole doping and hosts a trivial insulator at band filling $ν= -2$. Displacement field alone drives this insulator into a pocket of incipient superconductivity with a sharp transition, a well-defined critical current, and a critical temperature that peaks near the insulating boundary, although the resistance does not fall to zero. In-plane magnetic field expands the pocket, which persists to more than four times the weak-coupling Pauli limit, and stabilizes a second pocket in which Fraunhofer-like modulation of the critical current signals phase-coherent pairing. Twisted bilayer-trilayer graphene thus offers a single gate-tunable system in which pairing can be interfaced with Chern insulators whose topology is itself an adjustable parameter.

cond-mat.mes-hall↗

Exact-palette rainbow embeddings in uniformly coloured pseudorandom graphs

We study rainbow spanning configurations in bijumbled graphs whose edges are coloured independently and uniformly from a prescribed palette. For $n$-vertex $(p,β)$-bijumbled graphs with minimum degree at least a fixed positive multiple of $pn$, we obtain rainbow perfect matchings and Hamilton cycles with a sufficient palette surplus of order $(\log n)/p$, assuming $pn=ω(\log n)$ and $β\le cpn$ for a sufficiently small constant $c$. For each prescribed spanning tree of fixed maximum degree $Δ\ge2$, a surplus of order $L_{n,Δ}(\log n)/p$ suffices under $β\le cpn/L_{n,Δ}$, where $L_{n,Δ}=Δ^{5\sqrt{\log n}}$. The palette surplus is sublinear under these hypotheses. These results use a McDiarmid-type coupling and retain the discrepancy scales of the relevant deterministic embedding theorems. We also prove exact-palette results, using precisely as many colours as the number of edges of the target configuration. After independent edge percolation at rate $ρ$, it is shown that a rainbow perfect matching or Hamilton cycle exists asymptotically almost surely when $ρpn \ge C(\log n)^2$ and $β\leγpn$ for appropriate constants $C$ and $γ$. We obtain corresponding results for each prescribed bounded-degree spanning tree and for clique factors under appropriate stronger hypotheses. The exact-palette proofs construct spread measures from uncoloured containment estimates and apply the rainbow threshold theorem of Han and Yuan.

math.CO↗

Prediction bias in biological ageing markers

Biological ageing markers have attracted growing interest, with models estimating age from organ imaging or blood biomarkers. An estimated age above chronological age or the age-specific population expectation is assumed to reflect accelerated ageing and poorer health. Previous research has supported this assumption through positive associations between disease and age gaps or acceleration. However, in this study, we identified a widespread health-dependent prediction bias in ageing markers that affects their key interpretation and application. Specifically, we investigated five ageing markers derived from retinal images, brain MRI, chest radiographs, abdominal CT, and blood tests, and evaluated them using association analyses. We observed the well-recognised phenomenon of regression to the mean (RTM) in the four organ-image based markers, whereby estimated ages were shifted towards the mean age of the training cohort. More importantly, we revealed that the strength of RTM varied with health status, with stronger RTM in unhealthy than in healthy individuals. This differential RTM introduced a health-dependent prediction bias that persisted after calibration and systematically altered associations across age subgroups, suggesting that whole cohort associations may not reflect those observed within individual age subgroups. Additionally, we showed that the tested ageing markers, including PhenoAge derived from blood biomarkers, had limited ability to distinguish health status at the individual level. These findings call for careful interpretation of biological ageing markers and their use in clinical studies, and highlight the need for further development and validation before these ageing markers can reliably inform individual health assessments.

q-bio.QM↗

RAZOR: Pruning Replaceable Experts in LLMs

Mixture-of-experts (MoE) models activate only a few experts per token yet store the entire expert pool. Whole-expert pruning shrinks that pool, but for reasoning models it must remove experts without eroding reasoning ability. Common scores rank experts by routing frequency or output magnitude, which measures isolated contribution rather than deletion damage. What decides the damage is functional replaceability, whether the surviving computation can reproduce what is removed. A large contribution may be replaceable by the remaining mixture, whereas a small one may carry a direction the survivors cannot recover. We introduce RAZOR, a training-free method that scores replaceability from consensus residuals, the deviations of individual expert outputs from their original weighted mixture. Holding the layer input fixed, these residuals yield the exact output change from deleting one expert, including survivor reweighting and the replacement expert promoted by router refill. RAZOR aggregates this change over calibration tokens and prunes to a layerwise budget using forward passes alone, without gradients, subset search, or recovery training. On GLM-4.7-Flash, Qwen3.6-35B-A3B, DeepSeek-V4-Flash-0731, and Hy3 at 25% and 50% expert removal, RAZOR attains the highest macro average over nine reasoning-centered tasks among the evaluated pruning methods in all eight model-budget settings. Against REAP on GLM-4.7-Flash and Qwen3.6-35B-A3B, it gains 2.12-5.59 points on this average and lowers reverse KL in all four comparisons. Retained accuracy is not the whole picture, as pruned Qwen3.6-35B-A3B still shifts in response diversity, formatting, and termination.

cs.LG↗

Fully 3GPP-Compatible Long-Range Sensing for LEO-ISAC: A Window-Grid Processing Framework

This paper addresses the long-range sensing problem in bistatic low-Earth-orbit integrated sensing and communication (LEO-ISAC) systems. Conventional OFDM-based sensing schemes fail in LEO-ISAC due to excessive propagation delays, which cause cross-symbol misalignment and unequal signal durations. We propose a window-grid processing framework that leverages the deterministic target geometry to resolve both challenges as a pure receiver-side processing: the transmitted sensing signal is 3GPP-compatible. Simulations demonstrate meter-level ranging accuracy for two targets at bistatic ranges beyond 640 km with 100.8 MHz bandwidth.

cs.IT↗