Probability
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Sunday 8 November
Bar-Lev and Letac (2025) introduced the concept of chainability of infinitely divisible distributions on $\mathbb R$. In this note, we show that a simpler notion of chainability can be used for infinitely divisible distributions on $[0,\infty)$. We derive some properties and give a probabilistic interpretation in terms of so-called size-biased distributions. As an application, we discuss simulation from size-biased distributions associated with an important class of tempered stable distributions.
Lattice Field Theory
Evaluating generative samplers for lattice field theory by scale
Generative samplers for lattice field theory are commonly evaluated by their effective sample size (ESS). We show that a small global ESS need not imply inaccurate long-distance observables: errors spread over many short-distance modes can dominate this diagnostic. We introduce a scale-resolved diagnostic based on the overlap between coarse-grained model and target distributions. At the lattice cutoff, this overlap determines the asymptotic ESS fraction; lower cutoffs isolate long-wavelength errors. In the exactly solvable free theory, two samplers with comparable ESS yield a $32\%$ bias and no bias in the susceptibility, respectively. In two-dimensional $\phi^4$ theory near criticality, trained diffusion samplers show the same separation of scales: their path-weight ESS fraction falls rapidly over the volumes studied, while low moments of the magnetization remain close to their target values. Varying the reference parameters substantially changes infrared observables, with little effect on the log-weight variance. Given the target magnetization distribution, a marginal Metropolis test maintains an acceptance rate of order one in our tests. Combined with exact local updates, it reduces the remaining mismatch, although residual bias remains at finite relaxation length. In the free field, uniformly bounded relative errors in the proposal mode variances give a volume-independent bound on the number of updates needed for a prescribed accuracy of the chain's stationary mode variances at fixed correlation length. The target marginal must be supplied or computed separately; estimating it from the samplers' own weights can inherit the poor global overlap.
Read the full abstract
Astrophysics of Galaxies
Probing faint radio activity from cores to filaments in two $z=2.24$ protoclusters with uGMRT
We present deep 1.26 GHz radio continuum observations of the two $z=2.24$ protoclusters BOSS1244 and BOSS1542 with the upgraded Giant Metrewave Radio Telescope (uGMRT) to investigate their members' radio emission and its possible environmental dependence. Among 187 and 105 H$\alpha$ emitter (HAE) members in BOSS1244 and BOSS1542, we identify ten and two robust radio counterparts, respectively, together with five potential counterparts from forced photometry. Two HAEs and the massive quiescent galaxy QG1 in BOSS1244 show strong radio excesses relative to their H$\alpha$-based star formation rates (SFRs) and are identified as strong radio-excess AGN candidates. Median stacking of the remaining 173 and 102 radio-undetected HAE members yields positive signals at $2.8\sigma$ and $3.2\sigma$ in BOSS1244 and BOSS1542, respectively. The stacked radio luminosities are consistent with those expected from the median H$\alpha$-based SFRs, indicating that star formation can account for the average faint radio emission. After excluding the robust radio counterparts, we divided the HAE members by the projected distance from QG1 in BOSS1244 and from the filament spine in BOSS1542. The largest stacked radio luminosities are found toward the denser regions in both systems, but the differences are not statistically significant, and stellar mass shows no significant dependence on environmental distance. These results identify strong radio-excess AGN candidates among the individually detected members, while the faint HAE population is on average consistent with radio emission from star formation. The similar environmental ordering is suggestive but remains tentative. Deeper radio observations at multiple frequencies and higher angular resolution are required to determine whether this apparent trend reflects weak AGN activity or variations in radio emission associated with star formation.
Read the full abstract
Machine Learning
Jointly Optimizing Memory, Computing and Offloading for Energy-Efficient DNN Inference
In edge intelligence systems, computation offloading and dynamic voltage and frequency scaling (DVFS) are widely used to improve energy efficiency. However, as applications like deep neural network (DNN) inference evolve in complexity, their demands for memory resources have progressively increased, establishing memory as a critical bottleneck that impacts both latency and energy consumption. In this paper, we propose a joint optimization scheme integrating memory, computing and offloading for energy-efficient DNN inference. We formulate the energy minimization problem under deadline constraints as a mixed-integer nonlinear programming (MINLP) problem, where the main challenge arises from the coupling between offloading and resource optimization. To address this issue, we decompose the original problem into two subproblems under a fixed offloading policy. The local subproblem is transformed into an equivalent geometric programming (GP) problem to derive the optimal memory frequency and computing frequency, while the edge subproblem is solved via convex optimization. An efficient coordinate descent (CD) algorithm is further developed to jointly optimize all variables. Simulation results demonstrate that our proposed algorithm achieves near-optimal performance with the gap from the optimal policy being at most 9.3%, and reduces the energy consumption of devices by up to 16.1% compared with benchmarks without memory frequency optimization.
Read the full abstract
Optimization and Control
Local exact boundary controllability for the full compressible magnetohydrodynamic equations
In this paper, we are concerned with the local exact boundary controllability for the full compressible magnetohydrodynamic equations in a bounded domain in two and three space dimensions. We establish the local exact controllability around a constant equilibrium state. Our proof relies on the observability and controllability analysis of a suitably reformulated linearized system, together with a fixed point argument in weighted Sobolev spaces. The main novelty of this paper is to overcome the structural difficulties arising from the divergence free constraint and the strong coupling between the fluid and magnetic variables. To accommodate the solenoidal constraint, we introduce a magnetic potential formulation and develop a mixed coordinate approach.
Read the full abstract
Cryptography and Security
Tracing MCP Security Vulnerabilities: Constructing and Analyzing an MCP Security Vulnerability Dataset
As a core protocol for integrating large language models (LLMs) with external data sources and tools, the Model Context Protocol (MCP) has quickly become a key interface in emerging AI agent systems. As the MCP ecosystem expands, reported vulnerabilities have also increased, creating a growing software-security attack surface. However, MCP vulnerability information remains scattered, noisy, and difficult to study systematically. This paper addresses that gap by constructing a curated MCP vulnerability dataset from CVE disclosures. Starting from 119 MCP-related records retrieved through February 2026, we filter unrelated cases out and obtain a validated snapshot of 24 MCP vulnerabilities. Our filtering methodology explicitly addresses acronym ambiguity and achieves 96.7% inter-rater agreement on a sampled exclusion audit while retaining all known high-severity MCP cases identified in public advisories. Using this initial dataset snapshot, we find that 87.5% of validated vulnerabilities are Critical or High severity, and that injection and path traversal vulnerabilities account for 66.7% of cases. We further identify recurring issues involving insufficient input validation, inadequate access control, and protocol-level security gaps. Through six representative case studies, we illustrate common exploitation patterns and map them to practical defenses. We release the dataset, reproducibility tooling, and a sustainable maintenance workflow as a foundation for future MCP security measurement, benchmarking, and defense research.
Read the full abstract
Signal Processing
An In-Ear Sleep Modulation SoC Featuring a CNN-LSTM Accelerator with Long-Kernel Memory Reuse and Runtime Dynamic Quantization
This work presents a 65 nm SoC for closed-loop in-ear sleep modulation. The SoC performs low-noise in-ear EEG sensing, CNN-LSTM-based sleep stage classification, and phase-specific auditory stimulation under 1 mW. A dedicated accelerator is developed, featuring a memory reuse technique to efficiently process long kernels required for low-frequency EEG feature extraction. A runtime dynamic quantization is incorporated, reducing model size by 3.88 times with only a 0.28% loss in accuracy. A sensitivity of 98.3% is achieved for deep sleep detection, enabling effective sleep modulation.
Read the full abstract
Machine Learning
Task presentation and execution paths shape LLM mathematical performance
Mathematical performance depends on how a language model receives information, uses generated text and submits an answer. We study these dependencies through paired comparisons that separate submission requirements, draft reuse and candidate availability. On 65 development problems, an instruction permitting continued derivation produced no valid final answers in 390 short-output calls; a single-line submission instruction produced 390 format-valid outputs, including 389 parseable answers. Under the fixed submission protocol, 198 problems with failed initial submissions were answered correctly in 9.09p of cases with the question alone, 33.84p with its draft, 46.46p with candidates, and 59.60p with both. Drafts added 13.13 percentage points with candidates fixed, and candidates added 25.76 points with drafts fixed; both effects were significant after Holm correction and were subadditive on the accuracy scale. Retaining a trailing excerpt outperformed retaining a leading excerpt of similar average length by 10.10 points Holm-adjusted p 0.027. A second completion model showed the same directions of input effects on the fixed materials. In a cohort with parseable initial submissions, candidates added no correct answers when the previous draft was supplied, but added 27 points when it was absent. These results establish a conditional value of generated text: a failed submission can leave useful material, whose contribution depends on what else is supplied and what is retained.
Read the full abstract
Systems and Control
Feasibility-Aware Learning for Network-Constrained Unit Commitment
Learning-based approaches to network-constrained unit commitment (NCUC) usually still rely on an optimization solver to repair or complete their predictions, which limits the speedup they can deliver. This paper proposes FALCON-UC, a feasibility-aware graph learning framework that predicts commitment and dispatch jointly and produces final schedules without solving a mixed-integer program at inference time. It combines an LSTM–GraphSAGE predictor over a fully connected generator graph, a differentiable correction that embeds commitment-dependent dispatch bounds, power balance, and PTDF-based branch flows in training, and deterministic commitment, dispatch, and ramp-coupled reserve repairs at inference. On the 2383-bus system, FALCON-UC achieves $99.09\%$ commitment accuracy and a $0.4350\%$ mean absolute cost gap with all evaluated constraints within tolerance at $0.0562$ s per instance, a $2.27\times10^{3}$ speedup over the solver. MTLR R-SCUC-FL is slightly more accurate but still needs an optimization solver to complete each schedule, which takes $262.2$ s per instance, $4.67\times10^{3}$ times the FALCON-UC runtime. A label-only baseline without repair violates the balance and branch limits on every 2383-bus test instance, and FALCON-UC also meets all evaluated constraint tolerances on a 1354-bus system.
Read the full abstract
Software Engineering
Application-Defined Abstractions to Separate Numerical Intent from Computation Orchestration
In High-performance Computing the holy grail has been to translate numerical algorithms expressed in mathematical notation into code that performs well across a range of platforms. A variety of portability frameworks have abstracted data layout, parallelization and orchestration from application's view, however, the resulting format is still code that conforms to the idioms of the framework. Additionally, substantial refactoring is typically needed to achieve performance goals. Increasing sophistication of Large Language Models (LLMs) naturally raises the question whether they can be used to make application codes and/or solvers both portable and performant. The obstacle is the lack of correctness guarantee in LLM produced code. In this paper we pose the question differently – can we start with expressing numerical intent of the code into an immutable core arithmetic component isolated from the surrounding code such that the surrounding code can be safely generated by the LLMs? We answer this question by using Spark, a mature compressible hydrodynamics solver in Flash-X, a multiphysics software system. We use LLM assistance in devising the abstractions and embedding them in the solver. Once properly verified, the resulting solver is lowered to concrete realization deterministically with tools also built with LLM assistance. The driver of the numerics and the code for interfacing with the application are generated by the LLMs. The resulting solver is exercised within Flash-X and with a separate environment we built for this experiment. Our results show that this is a viable approach for producing correct and performance portable code.
Read the full abstract
General Relativity and Quantum Cosmology
Covariant Hamiltonian Gravity in Spherical Symmetry
Building upon the covariant Hamiltonian gravity in spherical symmetry, we construct the effective Einstein equation governing gravitational dynamics. For any prescribed one-parameter family of static, spherically symmetric metrics, this equation can be constructed such that the prescribed family constitutes their vacuum solutions. As an application, we construct generalized Vaidya solutions to the effective Einstein equation and show that the corresponding energy-momentum tensor takes precisely the standard Vaidya form. The results demonstrate that standard null dust sources can serve as matter source for dynamical black-hole geometries beyond general relativity, including regular black holes. Furthermore, this work suggests that quantum gravity corrections alone may not account for Hawking-like evaporation, as mass loss in the ingoing Vaidya solution necessarily requires a violation of the null energy condition within our effective framework.
Read the full abstract
Hardware Architecture
Efficient VLA Inference via Retrieval-Based Speculation and Hardware Acceleration
Vision-language-action (VLA) models enable robots to understand and execute complex instructions, but their autoregressive (AR) action generation introduces significant latency on resource-constrained robotic platforms. Speculative decoding can accelerate AR-based inference by parallelizing action generation and verification; however, existing approaches rely on costly draft models, which are inefficient on edge platforms. In this paper, we propose Zora, a hardware-software co-design framework for accelerating AR-based VLA inference. Specifically, Zora introduces a lightweight retrieval-augmented generation (RAG)-based draft model that exploits robotic dynamics without additional neural draft models. We further reduce batch verification overhead through a kinematics-guided action-acceptance strategy and a KV-cache-sharing attention mechanism. To address the retrieval overhead introduced by RAG-based drafting, we co-design dedicated hardware support, Zora core, to address the memory irregularity in RAG-based drafting. We evaluate Zora on four VLA models with the LIBERO benchmark. Zora retains comparable accuracy while achieving up to 3.4$\times$ speedup with software-only optimization and up to 7.6$\times$ speedup with hardware support over GPUs.
Read the full abstract
Information Theory
QoS-Aware Energy-Efficient Sub-THz Near-Field Multiuser Hybrid MIMO Systems Employing Circular Arrays
Near-field communications have emerged as a promising technology for future sixth-generation (6G) networks. However, designing energy-efficient hybrid beamfocusing schemes for multiuser (MU) systems remains challenging due to the non-convex quality-of-service (QoS) constraints and hardware limitations of hybrid architectures. In this paper, we investigate a hybrid massive multiple-input multiple-output (MIMO) architecture for a near-field sub-THz MU downlink system employing a large uniform circular array (UCA) at the base station. A QoS-aware transmit power minimization problem is formulated for energy-efficient beamfocusing and addressed through a two-stage penalty-driven joint optimization (PDJO) framework, where auxiliary variables are introduced to reformulate the QoS constraints into second-order cone (SOC) constraints. Furthermore, a near-field polar-domain codebook is developed via joint angle- and distance-domain sampling. We establish that the fully digital (FD) beamfocuser lies within the column space of the proposed codebook, enabling hybrid precoder design to be formulated as a multiple measurement vector (MMV)-based sparse approximation problem. The formulated problem is then solved using a low-complexity simultaneous orthogonal matching pursuit (SOMP) algorithm under hardware and transmit power constraints. Simulation results demonstrate that the proposed framework achieves spectral- and energy-efficiency performance close to the ideal FD beamfocusing scheme while providing a favorable trade-off between hardware complexity and system performance.
Read the full abstract
Solar and Stellar Astrophysics
The Role of Small-Scale Flux Emergence in Pre-eruptive Magnetic Destabilization
Recent high-resolution observations have reported the emergence of small-scale magnetic flux shortly before the onset of solar flares; however, their role in solar eruption processes remains unclear. In this study, we perform three-dimensional magnetohydrodynamic (MHD) simulations to examine the effect of small-scale emerging flux on the eruption process. We construct a bipolar active region by extrapolating a potential magnetic field from a pair of sunspots and drive the system with sustained rotational motions to build up strong shear along the polarity inversion line. A small-scale emerging flux, amounting to approximately 0.6%-3.0% of the total magnetic flux and having a polarity opposite to that of the main sunspot, is then introduced at the center of the bipole. As a result, although no significant differences are found in the pre-existing magnetic field during the early phase with or without the emerging flux, the current sheet formed in the sheared field lines collapses more rapidly, and the reconnection-driven eruption is initiated earlier in the case with small-scale emerging flux. This result suggests that small-scale emerging flux accelerates the destabilization of the pre-eruptive magnetic configuration through enhanced current-sheet thinning and magnetic reconnection, leading to an earlier eruption onset. Furthermore, we find that the involvement of highly twisted field lines during the pre-eruption phase plays a crucial role in determining the eruption onset time.
Read the full abstract
High Energy Physics (Phenomenology)
Study of the weak radiative decay $B_c^+\to B_u^{\ast+}\gamma$
We investigate the rare radiative decay $B_c \to B_u^\ast\gamma$ within the Standard Model by using the instantaneous Bethe-Salpeter (BS) approach. The short distance (SD) $c \to u\gamma$ penguin, weak annihilation, and long distance (LD) vector meson dominance (VMD) contributions are all included. In the calculation of LD contribution, we use two scenarios, namely the decay width of $\rho$ being set to zero or kept as the experimental value, which gives $\mathrm{Br}_{\rm LD}=5.0\times10^{-9}$ and $7.3\times10^{-8}$, respectively, indicating an important role of $\Gamma_\rho$ in the calculation. The SD contribution is comparable in magnitude to the LD contributions, but one order larger than the annihilation contribution. This shows the $B_c \to B_u^\ast\gamma$ channel can provide an important way to study the flavor changing neutral current processes of charm quark.
Read the full abstract
Cosmology and Nongalactic Astrophysics
Is Dark Energy Inhomogeneous?
The discovery of dark matter deficient galaxies motivates a fundamental question: Could sufficiently large regions of the Universe be deficient in dark energy as well? We investigate this possibility by developing a phenomenological framework that distinguishes genuine dark energy deficiencies from ordinary matter voids through nonlinear expansion, coherent peculiar velocities and density-momentum correlations. We show that a $10\%$ dark energy deficiency can suppress the expansion of a representative nonlinear void by approximately $2.7\%$, generating peculiar velocity residuals of order $60$-$100\,\mathrm{km\,s^{-1}}$ across scales of $30$-$50\, Mpc$. Intriguingly, we find that deficiencies of order $20\%$ extending over several hundred megaparsecs could also influence the locally inferred Hubble constant, potentially contributing to the $H_0$ tension, subject to stringent isotropy and dynamical consistency constraints. We identify observational strategies involving DESI, Rubin, peculiar velocity surveys, and cosmic void catalogues, opening a new avenue for testing whether the dark energy driving cosmic acceleration is truly homogeneous.
Read the full abstract
Computer Vision
Does Pose Encoding Matter? Analyzing Geometric Representations for Discrete Motion Vocabulary Learning
Compressing continuous human motion into a finite vocabulary of discrete tokens is now the first stage of many motion understanding and generation pipelines. Vector quantization partitions a latent space into Voronoi cells around a finite codebook, but the geometry of that latent space is inherited from the input pose encoding, and it is unclear which encoding admits an efficient discretization. We study four encodings that place skeletal motion in different geometric spaces: Gaussian joint heatmaps on the pixel lattice, which we show to be a morphological dilation of the joint point set by a quadratic structuring function; root-relative joint positions in Euclidean space; local joint rotations on $\SO$ through a continuous 6D embedding; and a redundant full kinematic encoding. For each, we train VQ-VAE tokenizers whose codebooks lie on the unit hypersphere, varying codebook size, temporal stride, and code dimension. Beyond reconstruction, we measure codebook utilization and the effective vocabulary size, i.e., the number of equiprobable spherical Voronoi cells with the same entropy as the observed token distribution. Rotation and position encodings keep converting additional codewords into effective vocabulary, whereas the full kinematic encoding saturates at a few hundred effective cells and heatmaps at fewer than sixty. The smallest code dimension gives the highest utilization for three of the four encodings, and the effect of temporal stride depends on the encoding. Encodings of the same pose family can thus yield effective vocabularies differing by an order of magnitude, a difference that reconstruction loss alone does not reveal, which points to input geometry as a first-order design choice in motion tokenization.
Read the full abstract
Geometric Topology
Twisted pencils of quartics, braid monodromy factorizations, and non-Hopfian Hurwitz curves
We study which groups arise as fundamental groups of complements of affine Hurwitz curves. In every such group the product of the meridians is central and maps to the vector of component degrees in homology; this rules out, for instance, the Baumslag-Solitar groups $\operatorname{BS}(p,q)$ with $\lvert p\rvert\neq\lvert q\rvert$, and the groups of links with at least two components and vanishing linking numbers. O. V. Kulikova circumvented this obstruction for $\operatorname{BS}(2,3)$ by passing to the non-Hopfian group $\operatorname{BS}(2,3)\times\mathbb{Z}$, which Vik. S. Kulikov's doubling algorithm realizes in degree $768$. We give an explicit braid monodromy factorization of degree 12 with this group. The corresponding curve is not isotopic to an algebraic curve, yet it is obtained from a union of three quartics in a pencil by a single twist along a circle. More generally, for every closed braid $\hat\beta$ we realize $\pi_1(S^3\setminus\hat\beta)\times\mathbb{Z}$ by an explicit Hurwitz curve, again a twist of a union of quartics in a pencil. In the other direction, a Hurwitz curve with group $\operatorname{BS}(k,k+1)\times\mathbb{Z}$ has degree at least $4$, as every Hurwitz curve consisting of a conic and a line is H-isotopic to an algebraic one, after separation of its critical points. Finally, we show that certain semiholomorphic germs, among them those realizing the generalized Borromean rings, are braided surfaces but not Hurwitz curve germs.
Read the full abstract
Machine Learning
Uncertainty-Guided Reward Labeling for Reinforcement Learning under Limited Feedback
In reinforcement learning from limited feedback (RLLF), only a small fraction of an offline dataset can be labeled with rewards, and the central question is which samples should be labeled to learn a high-performing policy from the resulting partially labeled dataset. Prior work formalized this as a reward-selection problem by focusing on the selection stage while treating downstream policy learning as a black box, in a regime where queried rewards are not retained for reward-model training. We instead study the retained-label setting, where queried rewards can be stored and used to fit a reward model before policy learning. We bound the suboptimality of the learned policy in terms of two sources of error: one arising from offline RL on a fixed, offline dataset, and the other from uncertainty in the reward model. Since reward selection cannot change the offline dataset, the limited labeling budget must be used to strategically reduce reward uncertainty. Motivated by RLLF's observation that useful rewards tend to keep the agent on high-return trajectories, we introduce Successor-Guided Uncertainty REduction (SURE), a novel method that uses successor features to select rewards that are both uncertain and associated with states from which high-valued states are reachable. We formally derive SURE from a bound-induced design objective and characterize its exact one-step marginal gain. Empirically, SURE reaches near full-feedback performance with few reward labels across a variety of domains and offline-RL backbones, yielding an effective method for feedback-efficient reinforcement learning.
Read the full abstract
Robotics
Large-Scale Hierarchical Decision-Making in Robot Control via ADMM
Sparse hierarchical nonlinear programming (SH-NLP) based on the $\ell_0$-norm provides a powerful framework for integrated, efficient hierarchical decision-making in robot kinematic control, for example in the presence of a large set of possible end-effector candidate locations. While Sequential Sparse Hierarchical Quadratic Programming (S-SHQP) with interior-point method based SHQP sub-problem solvers exploit the hierarchical, sparse structure of such problems, they are less amenable to effective warm-starting between subsequent, coherent control steps. In this work, we formulate an Alternating Direction Method of Multipliers (ADMM) to efficiently solve related SHQP sub-problems. We introduce efficient substitutions for auxiliary variables representing $\ell_0$-norm surrogates. The solver efficiently handles separable decision functions by evaluating linear algebra expressions in the appropriate order. Results in large-scale kinematic and dynamic control show reduced computation times of up to 23.5% compared with a structure-exploiting interior-point method in low- to moderate-accuracy regimes. Furthermore, hierarchical decision-making is extended to whole-body dynamic control for humanoid walking, where the need for high-accuracy solutions is highlighted.
Read the full abstract
Robotics
Control-Aware Command Generation for Asynchronous Control and Action Inference with Vision-Based Policies towards Fast Execution
Vision-based control policies, including vision-language-action models, have enabled robots to perform increasingly complex tasks. However, their execution speed is often limited by the high computational cost of action inference. In this work, we investigate what can be achieved at the control level without modifying the underlying policy learning process. We introduce an asynchronous inference and control framework that enables fast task execution while maintaining smooth and stable robot motions. By formulating the generation of continuous target positions from discontinuous model predictions as a tracking control problem, our method makes asynchronous inference practical for real robots. We further accelerate execution through adaptive action skipping based on the variance of predicted positions. Experiments with Action Chunking Transformer and OpenVLA-OFT on a bimanual robot demonstrate substantial speedups while preserving high task success rates.
Read the full abstract
Optimization and Control
Dual Model Predictive Control through Sampling-Based Belief Propagation
We propose a sampling-based dual model predictive control (MPC) approach that combines belief propagation with parameterized feedback policy optimization. By sampling uncertain dynamics and process noise, we approximate the evolution of the hyperstate over the prediction horizon, allowing future control decisions to adapt to anticipated observations and belief updates. This enables the controller to account for the future value of information without explicit exploration incentives. We establish almost-sure uniform convergence of the sample-average objective to the finite-horizon expected objective over a compact policy class. The approach is specialized to Bayesian linear regression and evaluated on stochastic systems with constant and time-varying uncertain dynamics. We compare our approach to certainty equivalent control, and an MPC that optimizes over open-loop control sequences rather than feedback policies, demonstrating the benefits of our method in terms of both control performance and information gain.
Read the full abstract
Computer Vision
SoftPAT3D: Physics-Augmented Text-to-3D Scene Generation with Deformables
We present SoftPAT3D, a physics-augmented framework for text-to-3D scene generation in which deformable objects, such as cloth, stuffed toys and ropes, are generated as physically valid, simulation-ready bodies and placed in intersection-free contact with the furniture that supports them, with one another and with themselves. Existing physics-augmented pipelines simulate rigid bodies only and cannot accommodate a generated deformable object, which text-to-3D generation returns as a geometrically invalid mesh, sometimes self-intersecting, that has no rest shape, no material model and no admissible initial state. These are the inputs a deformable simulation requires, and we construct each from information already in the pipeline. The rest shape comes from how the object is manufactured rather than from the generated physically inconsistent deformed configuration, and a material library assigns each deformable object its initial elastic parameters, which can then be optimized. The occluded support is regenerated and converted into a watertight collision mesh, each object is released from an optimizable placement above the supporting part that the prompt specifies, and the complete scene is driven to static equilibrium under one unified contact model, with completion verified by geometric checks and a vision-language model. When a scene fails the prompt, a grid search over placements corrects it, and the adjoint of a differentiable simulation of the same contact energy reaches the targets the grid does not, places several bodies jointly and recovers and optimizes material parameters. Multi-body scenes equilibrate in a single simulation, and the pipeline also runs from the text prompt alone. On all sixty-five prompts, SoftPAT3D produces no undesired interpenetration of any kind, whereas every other system does, and its scenes directly support scene editing and robotic manipulation.
Read the full abstract
Optics
A reachability criterion for spectrally factorable SPDC in coupled waveguides without periodic poling
Producing spectrally pure photon pairs by spontaneous parametric down-conversion without periodic poling would broaden the choice of nonlinear materials. It requires optical modes that provide both phase matching and suitable group velocities. We derive a joint reachability criterion for a constant-cross-section coupler with a nonlinear main guide and a linear auxiliary. In a two-mode description, phase closure fixes the hybridization parameter that also determines the main-guide participation and the attainable group-delay ratio. This relation screens material and mode pairs and specifies detuning and participation targets for full-vector refinement. A first-order purity map connects the reachable delay ratio and bandwidth–length product to the photon-pair spectrum. A full-vector AlN/TiO$_2$ feasibility example satisfies direct phase matching with a ratio of pump–idler to pump–signal group-delay mismatches of $-0.899$ and yields a calculated unfiltered Schmidt purity of 0.789 over 5 mm. The criterion links phase closure, dispersion control, and nonlinear participation when assessing coupled-waveguide sources beyond periodically poled materials.
Read the full abstract
Robotics
ObjectWorld: Scaling Object-Centric World Models with A Large-Scale 3D Full-Object Flow Dataset
Generative world modeling from large-scale visual data offers a promising path toward scalable robot manipulation. This calls for an intermediate representation that can be supervised at scale and remains actionable for downstream control. We propose 3D full-object flow, an object-centric motion representation that assigns dense 3D trajectories to points across the complete surface of a target object, including its occluded regions. By extending visible-surface object flow to the full object geometry, this representation makes complete object motion explicit and applies uniformly to both rigid and deformable objects. To realize the potential of this representation at scale, we introduce a 1210-hour full-object flow dataset that addresses the scarcity of large-scale supervision for complete 3D object motion. The dataset integrates diverse real-world videos and physical simulations, with a scalable annotation pipeline for recovering full-object motion from real-world observations and quality metrics for systematically assessing annotation quality. We then train a world model that takes an image and a task description as input and predicts dense full-object flow over the reconstructed object geometry. Experiments show reliable annotation quality, data-scalable flow prediction, and effective downstream manipulation across novel scenes and robot embodiments. Project website with additional results and videos: https://nus-lins-lab.github.io/ObjectWorld/.
Read the full abstract
Quantum Physics
Towards large-scale ab initio Molecular Dynamics Simulation with Efficient Sampling-based Quantum Computing Algorithms
Ab initio molecular dynamics (AIMD) requires the calculation of highly accurate electronic-structure energies and nuclear forces at every time step, which can quickly become computationally expensive. Sample-based quantum diagonalization offers a route to such calculations on quantum hardware, but its use in AIMD simulations has so far been limited to active spaces of about 20 qubits. In these spaces, exact diagonalization is tractable, and the quantum circuits are typically built from standard coupled-cluster amplitudes. Here, we introduce SqDRIFT-AIMD, which combines randomized sample-based Krylov quantum diagonalization (SqDRIFT) with analytical nuclear gradients. With SqDRIFT-AIMD, we obtain more accurate ground-state energies than the conventional coupled-cluster singles and doubles (CCSD) driven AIMD simulation for the $40$-qubit active space. We apply SqDRIFT-AIMD to study the dynamics of proton transfer in the Zundel cation, using circuits executed on IBM Heron r3 quantum processors. SqDRIFT energies fall below CCSD across the $40$-qubit double-well PES and stay within a few m$E_\text{h}$ of CCSD at 52 qubits. The $40$-qubit SqDRIFT-AIMD trajectory tracks the SHCI-driven proton transfer to within $1.33$ mÅ and exhibits excellent total energy conservation, with a standard deviation of only $0.245$ m$E_\text{h}$. These results extend quantum-centric AIMD to active spaces beyond the reach of exact diagonalization.
Read the full abstract
Social and Information Networks
Who Benefits from Wikipedia's Growth Mentorship? The Role of Newcomer Information Needs
Evaluations of Wikipedia's programs for new editors usually ask whether a program works on average; we ask which newcomers benefit when their question to a mentor gets a reply. English Wikipedia's Growth mentorship system assigns every new account a volunteer mentor, and about a quarter of the questions newcomers send never get a reply. Using the first questions of 34,073 newcomers (2021 to 2026), we compare newcomers who received a reply with newcomers who did not, within groups that are similar on 164 characteristics recorded before the question (propensity score stratification). (1) Does a reply help newcomers keep editing? Yes, in the short term: in the 14 days after the reply, newcomers who received one were 1.8 percentage points (pp) more likely to edit an article (22% vs. an estimated 20% without a reply) and 1.8pp more likely to edit on two or more days. Later in the first year, the only difference that remains significant after correction for multiple testing is in the share who edit an article at least once between six months and one year after the reply (+1.5pp). (2) Does the effect depend on what the newcomer asked? Yes. We sort questions by Morrison's (1993) information-seeking types, which earlier studies measured mostly through self-reports, using a language model checked against human labels. A reply has significant effects for questions about rules and norms (+3.4pp), questions that show the newcomer's earlier editing (+3.4pp) and specific how-to questions (+2.4pp). For newcomers who do not know what to work on, a reply has no detectable effect, and the effect is 4.2pp smaller than for newcomers with other questions. (3) Which replies are followed by more editing? Among newcomers who received a reply, those whose reply came sooner or stayed closer to the topic of their question edited more.
Read the full abstract
Rings and Algebras
A seven-element interval of power-semiring varieties
We determine the interval between the varieties generated by the nonempty and full power semirings of a semigroup satisfying \(xy\approx x^2\). It has two elements for a one-element semigroup, three for a nontrivial left-zero or null semigroup, and seven otherwise, without any finiteness assumption. In the seven-element case the interval is \([\Rvar,\Rvar^0]\), where \(\Rvar=\Mod_{\rm ai}\{xy\approx xz\}\) and \(\Rvar^0\) is its zero-adjunction variety. Every word absorption valid in \(\Rvar\) but not in \(\Rvar^0\) is equivalent over \(\Rvar^0\) to one of six relative identities. We give exact absorption criteria and finite bases for all seven varieties. Three have basis rank two and four have basis rank three; their two-generated free algebras have orders \(15\), \(24\), or \(35\). We also count the finite-rank free algebras of both endpoints.
Read the full abstract
Machine Learning
A Hierarchical Tokenization Framework for Voxel-Level fMRI Representation Learning
We introduce HBAR (Hierarchical Brain Activity Representation), a hierarchical tokenization framework for learning compact, multi-scale representations of neuroimaging data. HBAR organizes voxel-level resting-state fMRI into a hierarchy spanning sub-parcel voxel groups, parcels, and large-scale functional networks, enabling up to 415x compression while preserving fine-grained spatial information beyond conventional parcellation. The framework supports fixed atlas-based, fully learned, and softly prior-guided hierarchies, allowing us to systematically study the role of structured priors in brain representation learning. On HCP-YA, at approximately 415x compression, HBAR achieves higher parcel and network correlations than rate-matched flat tokenizers, while at a lower 52x compression rate, shuffling the anatomical grouping reduces parcel correlation from 0.920 to 0.886. Demographic readouts with autoregressive training also reveal potential gains from the hierarchical structure. By combining sub-parcel inputs, compact discrete tokens, and multiscale brain structure, HBAR offers a practical framework for representation learning in high-dimensional neuroimaging data.
Read the full abstract
Formal Languages and Automata
Two barriers for minimal time firing squads, with applications to four and five states
A minimal-time solution of the firing squad synchronization problem synchronizes every line of n cells at time 2n minus 2. Six states suffice; whether five do has been open since 1987. Every line agrees with the half line until its right ends echo returns. For minimal time solutions with any number of states, we prove that cells at distance j behind the half lines front become time-periodic only after time (1.5 minus epsilon)j, for every epsilon greater than 0 and infinitely many j, and that the half line is never periodic in time and space on a wedge at its left border, hence not eventually regular in our sense. With certified satisfiability checks, we exclude four states using the lines of lengths 2 to 5 and parts of the next five, and show that every five state minimal time solution uses at least 15 non quiescent neighbourhoods on its half lines first 78 anti-diagonals. We give five state rules synchronizing exactly the lengths 2 to 14.