Statistics Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 31 August
For Gaussian approximation over high-dimensional rectangles under unrestricted covariance, Chernozhukov et al. (2023b) conjectured that the $n^{-1/4}$ rate, up to logarithmic factors, is near-optimal. We show that, under the coordinatewise subexponential condition with scale $B_n$ and the marginal variance lower bound condition with constant $b$ in Chernozhukov et al. (2023b), the approximation error in dimension $d$ is bounded by \begin{align*} C_b\min\left\{ 1,\, \left(\frac{B_n^2}{n}\right)^{1/3}\{\log(2dn)\}^{7/3} + \frac{B_n}{\sqrt n}\{\log(2dn)\}^{5/2} \right\}. \end{align*} In particular, for bounded $B_n$ and polynomial dimension, the new bound is $n^{-1/3}$ and therefore falsifies the polynomial-dimensional $n^{-1/4}$ near-optimality conjecture. The proof uses a two-stage interpolation and a rank-free matrix-weighted Gaussian surface bound, which may be of independent interest. The initial proof attempt was generated by ChatGPT 5.6 Pro (OpenAI) and subsequently corrected and rewritten by the authors. The machine-checked Lean formalization of the proof can be found at the GitHub repository (https://github.com/WeihanZhang2001/cubic-root-gaussian-approximation-under-unrestricted-covariance).
Robotics
Contrast-Free Autonomous Navigation of Untethered Endovascular Microrobots Using Single-Plane Fluoroscopy
Reliable three-dimensional (3D) navigation of magnetically actuated untethered microrobots remains a major barrier to clinical translation. X-ray fluoroscopy is the standard real-time imaging modality for endovascular procedures, but single-plane fluoroscopy provides only a two-dimensional (2D) projection, eliminating depth information and complicating autonomous navigation. Recovering this information through biplane imaging or repeated contrast-enhanced angiography increases procedural complexity, radiation exposure, or contrast burden. Here, we introduce VISTA (Virtual Integration for Spatial Tracking and Autonomy), a digital twin framework enabling contrast-free autonomous navigation under single-plane fluoroscopy. VISTA reconstructs vascular anatomy as a 3D digital twin, discretizes the vessel centerline into navigation milestones, and assigns the detected 2D robot position to the nearest projected milestone. Consecutive milestones define the local vessel orientation used to generate magnetic actuation commands, converting single-plane fluoroscopic observations into topology-constrained navigation states without requiring contrast injection during navigation. VISTA is demonstrated across anatomically distinct vascular phantoms under continuous flow and within the inferior vena cava of a live rat in vivo. Compared with conventional fluoroscopic human-in-the-loop control, VISTA reduced navigation time by up to 62%, corrective actuation commands by up to 98%, and radiation exposure by up to 57%. These results establish VISTA as a digital twin-guided framework for contrast-free autonomous navigation of untethered endovascular microrobots using widely available single-plane fluoroscopy.
Read the full abstract
Physics and Society
Does the Power-Law Advantage in the Tails Outweigh the Global q-Gaussian Description?
Financial markets are complex systems whose return distributions exhibit heavy tails, traditionally described by power laws. An alternative framework based on Tsallis nonextensive statistical mechanics allows both the central region and the tails of the distribution to be represented by a single q-Gaussian functional form. In this work, we systematically compare these two descriptions across different time scales, considering stock markets from Brazil and the United States, as well as traditional assets and cryptocurrencies. The q-Gaussian parameters are estimated using the method of moments ratio, whereas the power-law parameters are obtained by maximum likelihood estimation in the asymptotic region. The quality of the fits is assessed using goodness-of-fit measures, bootstrap resampling, and the Vuong test. When the analysis is restricted exclusively to the extreme tails, the power law generally provides a better description, as expected from the asymptotic power-law behavior of the q-Gaussian itself. However, this superiority is not sufficiently pronounced to outweigh the main advantage of the q-Gaussian: its ability to provide a consistent description of the entire distribution, including the central peak, bulk, and tails, over all investigated time scales. Moreover, the evolution of the parameter $q$ offers a simple and direct characterization of aggregational Gaussianity and of the transition between heavy- and short-tailed statistical regimes, without requiring separate fits for different regions of the distribution. These results indicate that, although the power law remains particularly suitable for describing extreme events, the q-Gaussian provides a broader and more practical framework for characterizing the statistical evolution of financial returns.
Read the full abstract
Computer Vision
Amortized Anchor Refinement for Deployable Continuous-Time 4D Gaussian Reconstruction
Continuous-time 4D reconstruction remains impractical on standalone XR headsets. Per-scene optimization demands deployment-infeasible compute, and lower budgets cause collapse rather than degrade gradually. Feed-forward prediction is fast, but struggle to recover scene-specific detail. We present Amortized Anchor Refinement, which uses a frozen backbone to predict an initial Gaussian representation and a short optimization to specialize it under a fixed compute budget, with a capacity floor preserving representational density. A training-free stage then applies a persistent-homology constraint to prune unstable Gaussians while preserving topologically persistent structures, and streams the resulting trajectories directly as scene flow. On the Stage-Capture benchmark, Amortized Anchor Refinement achieves 24.31$\pm$2.22dB, while our deployment experiments demonstrate reconstruction within the target budget on a single consumer GPU and playback on a standalone XR headset.
Read the full abstract
Algebraic Geometry
Compactification of $\operatorname{SL}(3,\mathbb{C})$-Character Varieties of Surfaces via Skein Algebras
We investigate the filtration structure of the skein algebra induced by the (quantum) trace map. Utilizing the structure, we prove that relative $\operatorname{SL}(3, \mathbb{C})$ character varieties of punctured surfaces admit log Calabi-Yau compactifications and prove the (weak) geometric P=W conjecture.
Read the full abstract
Computation and Language
Label Semantic Expansion via Label Guided Neural Topic Modeling
Topic models are widely used for content analysis, where users often analyze corpora around predefined labels rather than unordered latent topics. Existing label-aware topic models mainly follow a labels-for-topics perspective, using labels to guide topic learning, while the learned topics are not directly usable for label-centered analysis. We explore the reverse topics-for-labels perspective and instantiate it as Label Semantic Expansion (LSE), which enriches sparse label representations with corpus-grounded descriptive topic words. To exploit topics in LSE effectively, we propose a Label-Guided Neural Topic Model (LGNTM), which learns dedicated label-aligned topics, grounds them in lexical and document semantic spaces, and preserves consistency between topic structures and label structures. Experiments on label-topic alignment, label expansion, topic quality, and downstream classification demonstrate strong overall performance across complementary evaluation dimensions.
Read the full abstract
Systems and Control
Control of Decommissioned Satellites and Space Debris Using CubeSats with Ion Electrospray Engines
The emergence of the New Space era has led to a rapidly increasing number of satellites in Low Earth Orbit (LEO). Consequently, more stringent deorbiting requirements have recently been imposed to avoid the Kessler syndrome in LEO. This has resulted in the proposal of new concepts for space debris removal, including attaching CubeSats to space debris as a promising mitigation strategy. The initial phase of this strategy involves stabilizing and controlling the debris' attitude. This paper proposes an attitude control design for decommissioned satellites using attached CubeSats with staged ion electrospray engines (iESE). The compact design of iESE combined with staging provides increased reliability and mission durations. The large uncertainty in the dynamics of the combined system, i.e. satellite and attached CubeSats, poses a significant challenge to the control design. The approach taken here uses the robust control framework, specifically $\mu$-synthesis, to tackle this challenge. The feasibility of the approach is demonstrated on a decommissioned satellite with multiple flexile appendages.
Read the full abstract
Artificial Intelligence
SPARK: Skeleton-Guided Reasoning Synthesis from Large-Scale Scientific Literature
Scientific reasoning remains challenging for open-source models, largely due to the lack of high-quality scientific reasoning data. Existing datasets are often dominated by factual recall or formulaic problem solving, with limited emphasis on mechanism understanding, evidence-grounded reasoning, and hypothesis evaluation. To address this, we introduce SPARK (Scientific Paper Abstracted Reasoning sKeleton), a paper-oriented synthesis framework built on Sci-Base, a large-scale corpus of research papers spanning 10 scientific disciplines. Instead of directly converting papers into question-answer pairs, SPARK treats the claim-evidence-derivation structure of a paper as the fundamental unit of reasoning synthesis. Specifically, SPARK (1) distills each paper into a compact reasoning skeleton capturing its central claims and supporting evidence, enabling self-contained question generation, and (2) synthesizes reasoning tasks from four scientific perspectives: mechanistic reasoning, hypothesis falsification, quantitative derivation, and boundary calibration. A final consistency verification stage further removes unsupported or contradictory outputs. Using this framework, we construct Spark-234K, a scientific reasoning dataset with substantially higher difficulty and diversity than existing resources. Experiments show that Spark-234K consistently outperforms existing scientific reasoning datasets while achieving stronger performance with significantly fewer training samples.
Read the full abstract
Computer Vision
Towards a Joint Khmer Text Recognition and Word Segmentation
Text recognition, or extracting electronic text from document images, has been indispensable for knowledge retrieval tasks, such as retrieval-augmented generation (RAG). For Khmer, extracted text is subject to an extra word segmentation step, as Khmer does not use any visible word delimiters to denote word boundaries. Thus, a recognition-then-segmentation pipeline for Khmer requires two separate sequential models; this is not only error-prone but also adds significant latency for large-scale document processing. This paper proposes a novel joint Khmer text recognition and word segmentation framework in a unified model. The proposed model, using a connectionist-temporal-classification (CTC) decoder for fast, parallel decoding, can be instructed to recognize Khmer text with ($b=1$) and without ($b=0$) word segmentation. Experimental results on different benchmark datasets of different document modalities (document, scene, and handwritten images) show that the proposed model can not only recognize characters in document images but also locate word boundaries, removing the need for an extra word segmentation step in a conventional sequential pipeline.
Read the full abstract
Classical Analysis and ODEs
A Painlevé equation for the Hörmander-Bernhardsson constant
The Hörmander-Bernhardsson constant $\mathscr{C}$ is the sharp constant in $|f(0)|\le \mathscr{C} \|f\|_1$ for entire functions of exponential type $\le \pi$. We prove that $\mathscr{C} = 2\pi \theta_*^{-2}$ where $\theta_*$ is the least positive singularity of the regular solution $v$ with $v(0)=0$ of the cosh-Gordon equation $v_{\theta\theta} + v_\theta/\theta = \cosh(v)$. It is known that $\mathscr{C}$ is a scaling limit in $n$ from the analogous problem for polynomials of degree $\le n$. We reformulate the polynomial problem as a Padé approximation problem at infinity. The associated matrix Riemann-Hilbert problem is analyzed by a Deift-Zhou steepest descent whose local parametrix is built from a Painlevé transcendent.
Read the full abstract
Analysis of PDEs
Parameter-uniform Robin uniqueness on large dilations
Berestycki and Graham proved large-dilation uniqueness for bounded positive solutions of \[ -\Delta u=f(u)\quad\hbox{in }\kappa\Omega, \qquad u+\alpha\partial_\nu u=0\quad\hbox{on }\partial(\kappa\Omega),\] when $\alpha$ is fixed, and remarked that the dilation threshold should not depend on $\alpha$. We show that it does not, including at the Dirichlet and Neumann endpoints, for possibly unbounded uniformly $C^{2,\gamma}$ domains. The half-space linearizations have a common positive spectral gap over the compactified boundary parameter. The Dirichlet end requires a separate compactness argument because the Robin coefficient diverges there. After rescaling by its inverse, the equation has a harmonic half-space limit. A Liouville lemma rules out a nonzero limiting trace, and the resulting endpoint compactness, together with the half-space gap and localization, yields the uniform uniqueness statement. When $\partial\Omega\neq\varnothing$, we further obtain convergence of the spectral bottom to its half-space value with error $O(\kappa^{-1/2})$. For bounded $C^{4,\gamma}$ domains the boundary layer also has a first mean-curvature correction, with remainder $O(\kappa^{-1-\gamma}+\kappa^{-2})$ on each fixed boundary strip.
Read the full abstract
Human-Computer Interaction
Frontier vision-language models have overtaken young adults at detecting AI-generated portraits – but not their calibration
AI image generators now create face portraits that are hard to tell from real photographs. Vision-language models (VLMs) are increasingly proposed to flag such images. We benchmarked 19 VLMs on the same 198 face portraits – real photographs and identity-matched ChatGPT-4o and Imagen 3 versions – under the same task as our earlier study of 1,667 adults (85% correct overall; accuracy fell steeply with age). The June-2026 cohort of 14 models only matched adults in their 20s-30s. Four weeks later the ceiling broke. Among five July-2026 releases under the identical protocol, gpt-5.6-sol reached 92.8% balanced accuracy (five-draw mean 92.1%), clearly above adults in their 20s (88.5%), and claude-fable-5 detected every AI image while averaging 91.9%. Model sensitivity now exceeds young adults decisively (d' up to 3.4 versus ~ 2.4). What has not been overtaken is human calibration. Model criteria spread from c = -1.10 to +1.45 while humans sit near zero at every age; both new leaders are biased (+0.44, -0.97), and only a few mid-ranked models approach the human balance. Changing the labelled examples still flipped about one answer in four. The best machines now out-see young adults here, without matching the human balance between suspicion and trust.
Read the full abstract
Computer Vision
DICS: Exploring Data Intrinsic Consistency for Visual Instruction Selection
Visual instruction tuning is crucial for advancing the vision-language alignment and instruction-following capabilities of Vision-Language Models (VLMs). However, identifying optimal subsets under a fixed ratio constraint from rapidly expanding datasets remains a significant bottleneck. While existing methods largely depend on distribution diversity or heuristic filtering, they often overlook the internal coherence within individual samples. To bridge this gap, we propose Data Intrinsic Consistency (DIC), a self-scoring metric designed to quantify the sample-level inter-component consistency. DIC consists of two modules: Visual Information Consistency (VIC), evaluating the alignment between visual content and instructions, and Response Information Consistency (RIC), assessing response coherence relative to the instruction. Building upon DIC, we introduce Data Intrinsic Consistency Selection (DICS), an adaptive data selection method that optimizes the trade-off between high intra-sample consistency and global distributional diversity under varying data budgets. Extensive experiments demonstrate that DICS consistently outperforms state-of-the-art methods across diverse dataset scales and model architectures, surpassing full-dataset fine-tuning while using only 25% of the LLaVA-1.5-665K data. We further curate DICS-6M, a 6M-sample multi-modal instruction corpus that enables the largest-scale visual instruction selection study to date; remarkably, DICS reaches 94.52% of the official InternVL3-8B-Instruct performance using less than 25% of its reported training data. Code can be seen at https://github.com/cqu-student/DICS
Read the full abstract
Analysis of PDEs
Sharp Dispersive and Strichartz Estimates for the Neumann Cylindrical Wave Model
We establish local-in-time dispersive and sharp Strichartz estimates for the linear wave equation with Neumann boundary conditions inside a cylindrical convex domain $\Omega \subset \mathbb{R}^3$ featuring a non-empty smooth boundary $\partial\Omega$. The cylindrical geometry dictates that the nonnegative radius of curvature vanishes along the axial direction. By utilizing an explicit spectral analysis based on the zeros of the Airy function derivative, alongside a tailored Airy–Poisson summation formula, we capture the microlocal behavior of multi-reflected waves and caustics. Finally, we apply these sharp Strichartz estimates without loss of derivatives to prove local well-posedness and small-data global well-posedness for the energy-critical quintic nonlinear wave equation (NLW) subject to Neumann boundary conditions.
Read the full abstract
Cryptography and Security
SIR: Self-improving Red-teaming for Compute Use Agents
Computer-use agents (CUAs) are agents powered by vision-language models (VLMs) that perceive a screen and operate an operating system through mouse, keyboard, and terminal interactions to automate everyday digital tasks. Their exposure to untrusted content creates a risk of indirect prompt injection (IPI), where an adversary embeds instructions in content the agent reads to redirect it toward actions that violate the user's intent. Evaluations based on fixed, hand-written injections may underestimate the risk posed by adaptive adversaries. We present SIR, a black-box self-improving IPI framework that (i) composes task-specific injections from a small library of reusable red-teaming principles stated in plain language and (ii) uses an iterative feedback loop to analyze unsuccessful attack trajectories and distill new, named principles that are retained in a shared library and reused across tasks. We target operating-system-level compromise and evaluate outcomes through deterministic checks on filesystem, service, and permission state rather than an LLM judge. An attack counts as successful only when both the adversarial objective and the benign user task are completed in the same execution. We evaluate three frontier CUAs, allowing SIR up to 10 attack attempts per case. It achieves joint attack success rates of 24% on Claude Opus 4.8 and 28% on Gemini 3.5 Flash, compared with 4% and 0%, respectively, for the benchmark's fixed, hand-written injection. The red-teaming principles discovered against one victim also improve attacks against other victims, including a different model family, without additional feedback.
Read the full abstract
Signal Processing
Agentic Quantum Deep Reinforcement Learning for RAN Slicing
Radio access network (RAN) slicing enables ultra-reliable low-latency communications (URLLC) and enhanced mobile broadband (eMBB) services to share radio resources, but their requirements create a challenging reliability–throughput tradeoff. URLLC requires low-latency and reliable packet delivery, whereas eMBB targets high sustained throughput. This paper considers downlink URLLC/eMBB RAN slicing and formulates it as a queue-aware long-term eMBB throughput maximization problem subject to URLLC delay-violation, physical resource block (PRB) exclusivity, and slice-budget constraints. To solve this problem, we propose agentic quantum deep reinforcement learning (Agentic-QDRL), a two-time-scale framework that combines agentic slice-level resource control with quantum-enhanced PRB scheduling. At the slow time scale, a perceive–memory–act–reflect (PMAR) controller adapts the resource shares of URLLC and eMBB slices. At the fast time scale, a compact variational quantum circuit (VQC)-based QDRL scheduler performs PRB allocation under the current slice configuration. A feasibility projection and a safety fallback mechanism is further introduced to satisfy scheduling constraints and reduce URLLC deadline violations. Simulation results under different eMBB traffic loads show that Agentic-QDRL improves eMBB throughput, reduces eMBB queue buildup, and maintains URLLC delay reliability compared with classical DRL and heuristic baselines.
Read the full abstract
Machine Learning
Diffusion-Based Refinement for Kilometer-Scale Probabilistic Precipitation Nowcasting
Localized extreme precipitation is a major trigger of urban flash floods and landslides, yet producing nowcasts that combine fine spatial detail with probabilistic uncertainty remains challenging. Here we introduce exPreCast-ENS, a conditional residual diffusion framework that transforms the deterministic 4 km radar nowcaster exPreCast into a 1 km probabilistic ensemble while correcting systematic forecast errors. Conditioning on both the forecast and preceding radar observations lets the ensemble-mean correct the baseline rather than perturb it, while members represent unresolved fine-scale variability. Over the Korean Peninsula, skill improves with ensemble size. In two high-impact events in 2023, a 30-member ensemble recovers 38-47% of heavy-rain pixels missed by exPreCast while retaining approximately 95% of its correct detections and alarming on under 1% of the pixels it correctly left clear. The method generates a 1-h forecast in 3.4 s on a single GPU and yields consistent improvements on the French regional MeteoNet radar dataset.
Read the full abstract
Computation and Language
When Models Hear What They Expect: Diagnosing Prosodic Heuristics in Multimodal Sarcasm Detection
Multimodal Large Language Models (MLLMs) process speech and text jointly, yet whether they exploit prosodic cues for pragmatic inference or rely on surface acoustic patterns has received little systematic investigation. We address this through sarcasm detection, evaluating Qwen2.5-Omni and Qwen3-Omni on Mandarin Chinese and English under five modality conditions that decompose the contributions of lexical content, vocal semantics, and prosodic structure. Adding audio systematically inflates false positives without improving true positive detection. Acoustic error diagnosis reveals that model errors cluster on a shared stereotype of expressive prosody, namely elevated pitch and irregular pausing, that diverges from the actual cues marking sarcasm in both languages. Targeted manipulation of only these two dimensions causally confirms the heuristic, inducing false positive rates of up to 60%. Applying the same manipulation template to Gemini~3 Flash Preview without modification replicates the effect, suggesting that the stereotype extends beyond the Qwen Omni family rather than arising from a single model architecture.
Read the full abstract
Game Theory
Rival-Injective Allocations: Support-List Structure and Maximum-Anchor EFX$_0$ Certificates
We study complete allocations under nonnegative additive valuations through the positive supports of goods, focusing on the all-good form of envy-freeness up to any good (EFX$_0$). We define rival-injective (RI) endpoint ownership: every good with nonempty positive support is assigned to an agent who values it positively, and every ordered observer–owner pair is used by at most one good. RI ownership is exactly proper list coloring of the graph joining goods whose positive supports overlap in at least two agents. For pair-supported goods with arbitrary exceptional goods, fixing the exceptional owners yields a necessary-and-sufficient pair-capacity criterion and an exact finite-domain owner constraint satisfaction problem (CSP). Every RI allocation in which each agent's own bundle is worth at least her maximum-valued singleton is all-good EFX$_0$. A specified injective choice of maximum-singleton anchors, together with residual support-list degeneracy, constructs such an allocation by reverse greedy coloring in $O(nm^2)$ time. We give two explicit witness families: a nonempty relatively open, 22-dimensional cone on a fixed $4\times10$ support face, and a family for every $n\ge4$ with two universal-support goods and $m=(n-1)(n-2)+2$ goods. Both fail unanchored list degeneracy and are not implied by the explicit pure-multigraph or published high-girth/controlled-multiplicity hypotheses compared here. We also study recognition of the maximum-anchor certificate class, leaving its general complexity unresolved. The exact list-coloring and pair-capacity results concern RI ownership, not general EFX$_0$ existence; unrestricted four-agent, ten-good all-good EFX$_0$ remains unresolved.
Read the full abstract
Image and Video Processing
ReLViC: Loss-Resilient Learned Video Coding with Dispersed Packetization and Controllable Packet Dependencies
Packet loss can severely impair learned video coding because missing latent tokens compromise both spatial reconstruction and temporal prediction. We present ReLViC, a loss-resilient learned video coding framework that jointly addresses latent coding and packet-loss recovery. ReLViC disperses spatially adjacent latent tokens across packets and employs a dual-purpose Transformer to estimate entropy-model parameters during coding and reconstruct missing latent tokens at the receiver. It controls packet dependencies through a periodic-reset packet-context topology parameterized by the segment length, thereby tuning the trade-off between compression efficiency and error-propagation range without retraining. A three-stage progressive training procedure establishes single-frame coding, learns temporal context for entropy modeling, and then optimizes the recovery of masked latent tokens under simulated packet loss. Experiments using burst-loss traces evaluate ReLViC against H.265 protected by Reed–Solomon forward error correction (FEC) and GRACE, a loss-resilient learned video codec. ReLViC delivers more stable reconstruction and outperforms both baselines under severe packet loss.
Read the full abstract
Machine Learning
Certified Safety Radii in Forecast-Error Space for Wasserstein Distributionally Robust Small Signal Stability-Constrained AC Optimal Power Flow via Lifted Spectrahedral Containment
Directly robustifying small-signal stability in AC optimal power flow is challenging since the stability boundary in the original uncertainty space is implicit, highly nonconvex, and changes with the operating decision. This paper exploits an alternative geometry. For a fixed model-specific stability certificate admitting suitable physical lifts, the small-signal stability requirement becomes an affine positive semidefinite constraint in the lifted variables, thereby defining a convex certified safe region. Instead of approximating the nonlinear instability boundary itself, we optimize a sample-wise safe radius in the original uncertainty space and certify, in the lifted space, that the entire power-flow image of the corresponding uncertainty ball is contained in the convex stability region. To this end, a componentwise Perron certificate guarantees existence, uniqueness, and Jacobian regularity of the target AC power-flow branch throughout each ball. An adjoint elimination then provides an exact affine-quadratic representation of the stability-relevant quantities, while rigorous matrix remainder bounds convert their nonlinear variation into finite robust PSD constraints. The resulting radii are certified lower bounds on the distances from empirical samples to failure and can therefore be coupled directly to the distance-based reformulation of a Wasserstein distributionally robust chance constraint, without directly approximating the instability boundary. Numerical studies demonstrate the effectiveness of the proposed framework.
Read the full abstract
Solar and Stellar Astrophysics
OB stars identified in LAMOST Data Release 10
A large sample of OB stars plays an important role in studying the stellar parameters of massive stars, as well as the formation and evolution of the Milky Way. With the help of the Large Sky Area Multi-Object Fiber Spectroscopic Telescope (LAMOST) Data Release 10 (DR10), we are able to construct a large sample of OB stars with spectroscopic data. In this study, we identify 48,463 spectra of 34,550 OB stars from LAMOST DR10, based on the Hertzsprung-Russell (H-R) diagram constructed with Gaia DR3 data and spectral line indices measured from LAMOST DR10 low-resolution spectra. Among these, 6907 OB stars are newly identified. We use the MKCLASS tool to derive the spectral subtypes of the OB sample. The spatial distribution of 25,287 OB stars and the Toomre diagram of 20,397 OB stars indicate that the majority of these stars are located in the Galactic disk. Based on their peculiar velocities, we identify 1960 runaway star candidates.
Read the full abstract
Systems and Control
A High-Resolution Synthetic EV Charging Dataset for Cold-Climate Distribution Grid Impact Analysis: Trondheim, Norway (2020-2030)
This data article presents a high-resolution, long-term synthetic electric-vehicle (EV) charging dataset for Trondheim, Norway, spanning February 2020 to December 2030. Empirically grounded in 14 months of historical charging logs from December 2018 to January 2020, the dataset captures session-level behavioral patterns, including delivered energy, plug-in duration, connection schedules, user categorization (private vs. shared), seasonal variations, public-holiday effects, and daily ambient temperature dependencies. To model future electrification dynamics, the synthetic generation pipeline integrates historical session records, calendar and weather features from MET Norway, annual EV-adoption growth multipliers derived from Statistics Norway (SSB) registration trajectories, a daily session-count model, a Conditional Tabular Generative Adversarial Network (CTGAN), seasonal Kernel Density Estimation (KDE), and post-generation physical charger-power feasibility correction. Under a standardized 7.2 kW AC charging constraint, the resulting medium EV-adoption scenario dataset contains 76,993 hourly charging-activity records. The hourly profile is activity-based rather than a complete continuous hourly time series; hours with no allocated EV charging energy are not included. The records provide total hourly charging energy, equivalent average charging power, active session counts, private/shared user load breakdowns, ambient temperature features, and calendar indicators. The dataset provides a validated cold-climate benchmark for distribution-grid impact assessment, transformer-loading analysis, EV charging-demand forecasting, charger-capacity planning, energy-management optimization, and the development of data-driven smart-charging control strategies.
Read the full abstract
Computation and Language
When Errors Become Memories: Causal Pathway Tracing in Multi-Turn Memory-Augmented LLMs
Long-term memory enables large language models (LLMs) to preserve and reuse information across interactions, but it can also turn localized errors into persistent risks. Existing work mainly evaluates whether memory systems store and retrieve information correctly, leaving limited understanding of how errors propagate across responses, memory states, and future interactions. We propose a structural causal model (SCM)-based framework for cross-turn error propagation in memory-augmented LLMs. We model user questions, model responses, and memory states as a dynamic causal process, and identify two entry pathways: internal memory updating and external question feedback. By intervening on these pathways, we construct four counterfactual trajectories and quantify their downstream effects and interaction. Error influence is evaluated at four levels: memory retention, natural responses, targeted diagnostic probing, and probability-level error preference. Experiments show that error influence generally decays with interaction distance, while the memory-update pathway contributes more persistent effects than question feedback; latent errors may remain even after disappearing from natural responses. Propagation patterns also vary across memory categories and memory mechanisms. Pathway-guided restoration further validates this decomposition: Question Repair reduces residual error by 27.5%, Memory Repair by 70.2%, and Joint Repair by 98.3%, nearly eliminating residual propagation.
Read the full abstract
Computation and Language
ALTSTEER: Selective Safety Steering for Moving Beyond Hard Refusals to Constructive Alternatives
Safety alignment is essential for deploying large language models, requiring systems to prevent harmful compliance while preserving helpfulness on benign requests. Activation steering offers a training-free inference-time approach to safety control, but effective safety steering requires addressing two coupled questions: when to intervene and how generation should be shaped after intervention. However, existing safety steering methods remain limited along both dimensions, as their triggering mechanisms can be unstable across domains and refusal-oriented steering often yields rigid refusals rather than constructive safe guidance. To address these limitations, we propose ALTSTEER, an inference-time framework that couples selective intervention with refusal-anchored constructive redirection within a single inference pass. ALTSTEER uses an internal refusal-relevant signal to decide when to steer, and applies staged steering to shift generation from refusal-oriented control toward constructive alternatives. Evaluations on Llama-3.1 and Qwen2.5 show that ALTSTEER preserves benign utility while improving constructive safe-completion behavior, especially on models that otherwise tend to produce short refusals for harmful requests.
Read the full abstract
Combinatorics
Regular, and (bi-)rotary Hall Cayley maps
A classification is given of regular, rotary, and birotary Cayley maps of which the vertex number is coprime to the valency. The classification is involved in constructions of new examples of interesting Cayley maps.
Numerical Analysis
Checkerboard Shells: A Position-Only Thin-Shell Discretization with Scale-Compatible Completion
Checkerboard edge-midpoint geometry provides an exact planar Varignon parallelogram for every spatial quadrilateral, allowing a local tangent frame and normal to be recovered directly from nodal positions even when the raw quadrilateral is warped. Building on this property, we develop a position-only thin-shell discretization with no independent director, rotation, or strain variables. The connected edge-midpoint surface is taken as the physical midsurface: the first fundamental form is evaluated on planar B faces, while a W-centered second fundamental form is constructed from variations of neighboring B-face normals, so membrane and bending share the same geometric carrier. A variational-kernel analysis shows that smooth second-order consistency does not eliminate lattice-scale blind modes. After quotienting out the raw checkerboard gauge, the B metric has one physical membrane blind direction and the symmetric W curvature has two curvature blind directions. We introduce a quotient-minimal membrane compatibility coordinate $X_M$ and an objective reference-relative curvature coordinate $X_W^{rel}$, placed consistently in the $O(t)$ membrane and $O(t^3)$ bending sectors. The formulation admits an explicit midpoint quotient, complete flat blind-mode classification, rigid-motion objectivity, reference-state consistency, and an $O(h^2)$ near-isometry approximation result for aligned generalized cylinders. Numerical tests show second-order curvature convergence, targeted removal of the membrane defect, and a sub-percent, refinement-decaying influence of $X_W^{rel}$. Linear and nonlinear shell benchmarks further demonstrate flat bending, curved-shell membrane-bending coupling, thickness sensitivity, large rotation, nonlinear pinching, and localized ovalization within a single position-only framework.
Read the full abstract
Computer Vision
NoisEasier: Test-Time Noise Optimization for Text-to-Video Generation
Diffusion models have recently advanced text-to-video (T2V) generation, yet they still struggle with fine-grained compositional alignment, such as attribute binding, spatial relations, and object interactions. While reward-based fine-tuning improves alignment, it is susceptible to reward hacking and adapts poorly to new prompt distributions. In this work, we propose NoisEasier, a test-time scaling framework that improves T2V generation through differentiable reward-guided noise optimization without modifying the underlying model. By combining efficient short-step generators with a multi-objective reward formulation, NoisEasier enables stable and practical test-time optimization under realistic inference budgets. Our key insight is that jointly optimizing the entire stochastic trajectory accelerates reward convergence and improves compositional alignment over optimizing only the initial latent, with negligible additional computational and time cost. Experiments on VBench and T2V-CompBench demonstrate consistent improvements across multiple backbones, achieving over 10% average gains on challenging dimensions such as attribute binding, object interaction, and numeracy. Overall, NoisEasier serves as both a flexible alternative and a complementary enhancement to reward-based fine-tuning, establishing test-time scaling as an effective paradigm for controllable text-to-video generation.
Read the full abstract
Systems and Control
Robust Semi-passive Velocity Field Control with Boundedness Guarantees for Safe Interaction between Mechanical Systems and Physical Environment
Controllers that guarantee energetic passivity with respect to the pair of external force and velocity realize safe interaction between the mechanical system and its physical environment. However, solely adhering to energetic passivity constraints may impose fundamental limitations on control performance and, in some cases, prevent the successful execution of controlled tasks. In addition, external disturbances from the physical environment can drive the system energy level and states beyond operational regions, thereby undermining task performance and safety. In this paper, we study a robust time-varying semi-passive velocity field control to aim to relax the inherently conservative nature of fully passive control methods in a controlled manner. Specifically, the proposed control method guarantees passivity of the closed-loop system with respect to the force-velocity input-output pair when the energy level exceeds a predefined level, while permitting non-passive behaviors to preserve task performance otherwise. Furthermore, the energy level and the states of the closed-loop system are proved to converge to bounded domains even in the presence of unpredicted disturbances. Additionally, the proposed method also enables constraining power flow between the closed-loop system and its physical environment to enhance safety in the interaction process. Numerical simulation examples demonstrate the effectiveness of the proposed method.
Read the full abstract
Artificial Intelligence
FaVOR: LLM-Based Agentic Framework for Factor Mining via Empirical Validation
Traditional finance relies on experts to hand-craft factors through a principled process grounded in economic rationale. Recent LLM-based multi-agent systems have automated this process, scaling factor mining far beyond manual effort. However, these automated approaches optimize directly for returns and rarely check whether a generated factor still expresses the economic hypothesis that motivated it. We identify this inconsistency between mathematical form and economic meaning as a structural failure mode of return-oriented automation. The resulting factors blur the line between real signals and spurious correlations and break down across regime shifts. We propose FaVOR (Factor Validation through Observable Reasoning), an agentic framework that restructures factor mining around hypothesis-level evidence rather than return outcomes. In place of the standard hypothesis-to-formula leap, FaVOR enforces a three-stage consistency loop tying mathematical form to economic rationale throughout. (1) Decomposition splits a broad economic hypothesis into independent observable conditions. (2) Validation checks whether each factor reflects its intended condition. (3) Integration merges them into a composite whose structure remains interpretable. On the CSI 500 and S&P 500 in 2025, FaVOR outperforms existing baselines while remaining effective across regimes. FaVOR shows that hypothesis-grounded factor discovery produces signals that are interpretable by construction, regime-robust, and economically faithful. The code is available at https://github.com/damilab/FaVOR.