Statistical Methodology
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Sunday 30 August
Via Computational Taxonomy (CT), we develop Design of Experiment(DoE) based on rigorously redefined constituting ingredients of complex system dynamics: randomness, nonlinearity and even class, through a data-driven constructed Taxonomic Hierarchy. As an opposite quest of Classification without man-made assumptions and structures, we illustrate this new perspective of DoE through a civil engineering complex system: Concrete Compressive Strength (CCS). CT begins by building a Taxonomic Hierarchy as a heterogeneity-vs-homogeneity map framed with a tree geometry to represent CCS-system dynamics. At each internal node of this hierarchy, a heatmap is computed via Scientific Data Analysis (SDA) to reveal locality-embraced heterogeneity through block structured covariate homogeneity annotated with response's locality-split. Only arriving at each ending-node of this hierarchy, coherence of homogeneity is achieved on both response and covariate sides. As such a class of finite sample nature is computationally recognized and confirmed. In contrast, nonlinearity is evidently observed as incoherence of response-vs-covariate homogeneity when comparing two classes located on two distinct branches. This hierarchy explicitly maps out system's randomness and nonlinearity to serve as a scientific basis for any DoE quest. Design of Experiment (DoE) for any designated class is redefined as a search for a covariate subspace that embraces the class-representative randomness and at the same time avoids potential nonlinearities with respect to the rest of classes. This is a brand-new theme of DoE.
Computational Engineering
Spillover Effects under Network Interference When Neighbours' Treatment Effects Are Heterogeneous
Optimising budget-constrained network interventions requires evaluating not just who is connected, but predicting how strongly individual recipients will propagate the treatment's benefits. Existing models predict spillover from neighbours' treatments and attributes. We argue that spillover also depends on how strongly each neighbour responded to its own treatment. We prove that no model in which neighbours' responsiveness enters separately from their treatments can capture this interaction, and we introduce SpilloverNet, a graph neural network designed to preserve neighbour-level response dynamics. Because a neighbour's response is unobserved, a natural approach is to estimate it from covariates and plug it in. However, we prove that any predictor relying solely on standard network data faces an irreducible error floor set by unobserved personal responsiveness. Empirically, at low heterogeneity the plug-in's correlation with the true response looks acceptable while its spillover error is already 24.5% against an oracle 13.8%; as heterogeneity grows its error climbs to 51.9%, worse than using no responsiveness estimate at all. A per-unit estimate from a direct-response measurement, collected in a small pilot before spillover arrives, escapes this bound and cuts regret against oracle-$\tau$ targeting by up to 14 percentage points in a budgeted targeting problem. On two real social graphs, SpilloverNet reaches 7.7–8.4% error, outperforming standard GNNs as well as specialised causal-representation baselines.
Read the full abstract
Computer Vision
OptiGeo: Efficient Monocular Geometry for Embodied Perception in Optically Challenging Scenes
Monocular depth estimation has achieved strong open-domain generalization, yet reliable robotic deployment remains difficult in transparent, reflective, and specular environments, where depth sensors often produce missing or biased depth. Existing methods often handle such optical failures with scene-specific preprocessing, auxiliary modules, or post-hoc fine-tuning. While effective in constrained settings, these designs increase architectural redundancy and can over-specialize general geometry models to narrow optical scenarios. We revisit this problem as a localized failure mode within base-model training and identify sensor-induced supervision bias as a key bottleneck: models inherit sensor failure patterns from biased real-depth supervision in optically challenging regions. We then introduce OptiGeo, a bias-aware training framework that rehabilitates biased real supervision using a clean-geometry teacher and residual-trimmed alignment. We redefine transparency-targeted rendering as a compact source of clean optical geometry, rather than a large domain-specific fine-tuning set. With only a small targeted rendering set, OptiGeo learns the geometric structure of transparent objects and regions, correcting local geometry distortions that real sensors cannot reliably supervise. Despite only 30M parameters, OptiGeo outperforms substantially larger 300M-scale monocular models and billion-scale multi-view baselines on transparent-scene benchmarks, while remaining competitive on general zero-shot depth and boundary sharpness. Real-world navigation cases further validate its practicality as an efficient perception module in optically challenging scenes.
Read the full abstract
Artificial Intelligence
Perceive to Hypothesize, Verify to Ground: An Agentic Reasoning Framework for Open-World Geo-Localization
Open-world geo-localization requires models to reason over ambiguous visual cues through multi-step reasoning and external knowledge grounding. While recent large vision-language models exhibit strong multimodal reasoning capabilities, existing approaches still suffer from perceptual hallucination and context drift due to the lack of explicit evidence-grounded verification. In this work, we reformulate geo-localization as a human-like perceive-then-verify reasoning problem and propose GeoPAVE (Geo-localization Perception-and-Verification-Engine), a bi-level agentic framework that contains perception-based hypothesis generation via single-pass rollouts and verification-based evidence grounding for decision actions: support, refute, and refine. To support rigorous evaluation, we further introduce PAVED, a novel dataset derived from real-world user check-in data, equipped with comprehensive reasoning trajectories featuring multi-hop queries, multi-round tool invocations, and structured perception-verification traces. The dataset and code are available at https://github.com/Arandinglv/GeoPAVE.
Read the full abstract
High Energy Physics (Theory)
The warp factor of supersymmetric $D=11$ near-horizon geometries: single-point rigidity, the $Spin(7)$ perfect square, and global constraints
On a compact connected section ${\cal S}$ of a supersymmetric $M$-horizon the Killing-spinor bilinears give a pointwise identity relating the warp factor $\Delta$, the rotation one-form $h$ and the two spinor norms, with nothing assumed about the norm of the Killing spinor. We derive three consequences of that unreduced identity. First, a single-point rigidity theorem: if $\Delta$ and $h$ vanish at one point of the section, then the flux vanishes identically, ${\cal S}$ is Ricci-flat and the horizon is $\mathbb{R}^{1,1}\times{\cal S}$. A single point replaces the usual global spinorial hypothesis. Second, the ${\rm Spin}(7)$ decomposition of the flux fixes $h$ algebraically and exhibits the invariant flux content of the scalar square $\Delta=4\Phi^2$ known in an adapted gauge, $\Delta=\frac{1}{108}\|w_{\bf 7}\pm\sigma({\cal Y}_{\bf 7})\|^2$. Only the two ${\bf 7}$-summands $w_{\bf 7}$, ${\cal Y}_{\bf 7}$ reach the warp factor, and the square is degenerate rather than definite: it vanishes on the linear subspace $w_{\bf 7}=\mp\sigma({\cal Y}_{\bf 7})$ rather than at the origin, so positivity of $\Delta$ yields no case list. Third, the two combine into a pointwise budget: the single constant of supersymmetry is shared between the deviation from staticity and the ${\rm Spin}(7)$ mismatch of the flux, each bounded by that constant. The same identities characterise the constancy hypothesis, equivalent to $V=-fh$ for the bilinear one-form $V$, which fails on the static branch of known warped $AdS_2$ solutions; they fix a weighted integral of the warp factor; and they reduce the Komar angular momentum of the horizon to a positive bilinear integral. Two no-go statements, for hidden symmetries built from the Killing spinor and for a second isometry from its bilinears, are stated with their hypotheses.
Read the full abstract
Probability
Discontinuous phase transitions in the one-dimensional pair and triplet creation processes
Dickman and Tomé (1991) introduced models on $Z$ in which $k$ consecutive occupied sites give birth at rate $\lambda$, individual particles die at rate 1, and the configuration is subject to nearest neighbor stirring. They claimed that the pair creation model ($k=2$) has a continuous phase transition and was in the universality class of directed percolation, but the triplet creation model ($k=3$) has a discontinuous (or first-order) phase transition when the stirring rate is large. Hinrichsen (2000a) disputed the second claim and argued that first-order phase transitions in 1+1-dimensional nonequilibrium systems with fluctuating ordered phases are impossible. In this paper we prove rigorously that the phase transitions are discontinuous in both the pair and triplet models when the stirring rate is large. At the end of Section 2 we state some open problems and suggest reasons that the results in the physics literature differ from those presented here,
Read the full abstract
Numerical Analysis
High-order energy-stable BGN parametric finite element methods for geometric flows
We construct high-order Runge–Kutta extensions of Barrett–Garcke–Nürnberg (BGN) parametric finite element methods for curve-shortening flow and curve diffusion of planar curves and for mean curvature flow and surface diffusion of closed genus-$0$ surfaces. On each time slab $I_m=(t_m,t_{m+1}]$, the continuous equations are posed on the left-endpoint surface $\Gamma^m=\Gamma^{t_m}$ through the map $\X^{m,t}:\Gamma^m\to\Gamma^t$, whose target is the evolving surface at time $t$. For curves, this formulation follows by harmonic pullback from $\Gamma^0$ to $\Gamma^m$. For surfaces, an orientation-preserving harmonic diffeomorphism is posed separately on each time slab, and conformality yields the weight $\frac12|\nabla_{\Gamma^m}\X^{m,t}|^2$. Evaluating the time-slab equations at the Runge–Kutta internal times and applying mass-lumped parametric finite elements yields systems on the common domain $\Gamma^m$, with $\Gamma^{t_m+c_i\tau_m}$ as the intermediate target geometry. This internal-time discretization constructs high-order BGN-structured extensions for the four flows. For an algebraically stable tableau with nonnegative weights, every exact stage solution with nondegenerate intermediate configurations satisfies monotone decay of the discrete curve length or surface area for every positive time step for which that solution exists. Radau IIA experiments exhibit energy decay for all four flows and BGN-type mesh redistribution in the curve tests. The Hausdorff self-convergence results exhibit high-order behavior consistent with the corresponding design orders.
Read the full abstract
Mathematical Physics
Local Density Approximation and Other Limit Regimes for a Homogeneous Bose Gas with Repulsive Three-Body Interactions in Low-Dimensional Space
In the whole space of low spatial dimensions, namely $d \leq 2$, we study the minimizers of an energy functional with an attractive cubic nonlinearity and a repulsive quintic nonlinearity, which describes a quantum Bose gas with a two-body attraction and a three-body repulsion. We prove the existence of minimizers at fixed effective statistics parameter. In the limit of a large effective statistics parameter of the mass-critical nonlinearity (with respect to the kinetic energy), we derive an effective Thomas-Fermi-like model for the homogeneous Bose gas. We also consider other limit regimes depending on the mass-critical nonlinearity.
Read the full abstract
Mathematical Physics
Homogeneous attractive Bose-Einstein condensates with repulsive three-body interactions: the two-dimensional case
We consider a homogeneous Bose gas composed of $N$ identical bosons occupying an infinite two-dimensional space. This gas exhibits both an attractive two-body interaction and a repulsive three-body interaction. Via the intermediate Hartree theory, we rigorously derive the homogeneous cubic-quintic nonlinear Schroedinger functional as the mean-field limit of the model. Our investigation focuses on the system's behavior in relation to the two-body interaction.
Read the full abstract
Mathematical Physics
Homogeneous attractive Bose-Einstein condensates with repulsive three-body interactions: the one-dimensional case
We investigate the behavior of a homogeneous one-dimensional Bose gas composed of $N$ identical bosons experiencing attractive two-body and repulsive three-body interactions. Utilizing intermediate Hartree theory, we rigorously derive the homogeneous cubic-quintic nonlinear Schrödinger functional as the mean-field limit of the many-body Hamiltonian. Particular attention is given to the impact of the repulsive three-body term on ground state energy estimates and mass concentration properties
Read the full abstract
Mesoscale and Nanoscale Physics
Chiral superconductors and competing states across a Lifshitz transition in rhombohedral pentalayer graphene
Rhombohedral multilayer graphene hosts a distinctive low-energy electronic structure in which strong Coulomb interactions and nontrivial quantum geometry intertwine to generate exotic quantum states. Recent experiments reported signatures of chiral superconductivity in electron-doped rhombohedral multilayer graphene within the spin- and valley-polarized regime. Here we map the normal-state fermiology surrounding chiral superconductivity in rhombohedral pentalayer graphene. Quantum oscillation measurements reveal an electrically controlled Lifshitz transition between a simply-connected circular quarter-metal Fermi surface and an annular quarter-metal Fermi surface. The Lifshitz boundary itself shifts with perpendicular magnetic field, consistent with the strongly momentum-dependent orbital magnetic moment of the low-energy band. Approaching the transition from either side, the electron effective mass becomes strongly enhanced, implying the formation of a nearly dispersionless band bottom and a strongly reduced kinetic-energy scale. This singular electronic structure produces a regime of exceptionally strong instability in which chiral superconductivity competes with Wigner crystalline phases and reentrant quantum Hall states. In particular, two superconducting regions with signatures of orbital time-reversal-symmetry breaking lie on opposite sides of the Lifshitz boundary and have comparable transition temperatures, yet the annular-side state is suppressed by a substantially smaller perpendicular magnetic field. Our calculation finds comparable chiral pairing tendencies on the two parent Fermi surfaces while producing a much lower orbital-Zeeman pair-breaking scale and an additional finite-momentum pairing tendency for the annular state. These results identify Fermi-surface topology as a key control parameter for chiral superconductivity in rhombohedral graphene.
Read the full abstract
Probability
Local Law and Outlier Eigenvalues of Spiked Separable Covariance Matrices
We prove local laws for the resolvents of separable covariance matrices of the form $\mathcal Q=A^{1/2}XBX^*A^{1/2}$, where $X=(x_{ij})$ is a $p\times n$ random matrix whose entries $x_{ij}$ are i.i.d.~random variables with mean 0 and variance $n^{-1}$, and $A,B$ are deterministic non-negative definite symmetric (or Hermitian) matrices. Following the method developed in arXiv:1611.05364, we first establish a self-consistent equation for the resolvent of $\mathcal Q$ and use it to prove optimal local laws without the technical assumption $\mathbb{E}[x_{ij}^{3}]=0$, which was essential in the previous derivation of the local laws in arXiv:1809.04572. As an application of our local law, we compute the asymptotic distribution of the outlier eigenvalues for spiked separable covariance matrices, extending the corresponding result in arXiv:2008.11903.
Read the full abstract
Optimization and Control
Quiver Semistability and Structured Kalman Decompositions for Networked Linear Dynamical Systems
We introduce new notions of controllability and observability for networked linear time-invariant (LTI) systems based on $\sigma$-semistability of quiver representations. Utilizing King's criterion for $\sigma$-semistability, we define a network generalization of the Kalman decomposition for networked LTI systems, which systematically decomposes the local and interconnection dynamics while respecting the underlying network structure. Furthermore, we present efficient algorithms for deciding the proposed controllability and observability of a given networked LTI system and for finding the Kalman-type decomposition. We also show efficient algorithms for deciding the $\sigma$-semistability of representations of acyclic quivers with self-loops if the weight $\sigma$ has the same sign for all vertices with self-loops. Such quiver representations and weights arise from networked LTI systems.
Read the full abstract
Algebraic Geometry
Wall-crossing formula and genus-one Virasoro conjecture for Fano complete intersections
The Virasoro conjecture predicts a set of universal relations among all genera Gromov–Witten invariants of any smooth projective variety. The conjecture is well understood for semisimple theories, but remains largely open in the non-semisimple setting. We prove the genus-one Virasoro conjecture on the ambient state space of smooth Fano complete intersections in projective space. For most of these complete intersections, the big quantum cohomology is nowhere semisimple. We also generalize the wall-crossing formula for quasimap invariants with weighted markings to the equivariant twisted setting, allowing descendant insertions at light markings. Together with genus-one quantum Lefschetz for quasimaps with light markings, this wall-crossing formula provides the key bridge from the Gromov–Witten theory of the complete intersection to the semisimple equivariant twisted theory of the projective space.
Read the full abstract
Machine Learning
Towards an Expressivity-Normalized Energy-Demand Comparison of ANNs and SNNs
Spiking neural networks (SNNs) are often regarded as energy-efficient alternatives to artificial neural networks (ANNs), yet their advantage depends critically on both network architecture and data properties. We develop an analytical framework to compare fully-connected ReLU ANNs and integrate-and-fire SNNs for time-series data with respect to their theoretical energy efficiency at matched expressive capacity. By relating an inference-energy model to theoretical bounds on representational expressivity, we derive an expressivity-normalized efficiency ratio and explicit thresholds in network width, spike sparsity, and ANN depth scaling. Our analysis characterizes the regimes in which event-driven computation offsets the temporal overhead of SNNs, providing capacity-aware principles for designing energy-efficient temporal networks. It shows that ANNs exceed SNNs in expressivity-normalized efficiency only in specific regimes.
Read the full abstract
Signal Processing
Robust Model Order Selection via Dithered Differential Step-Down Thresholding
We propose a dithered differential step-down thresholding (DSDT) algorithm for robust model order selection in stationary noise. Evaluating only exceedance counts over a decreasing threshold grid, the proposed algorithm stops when detecting noise extrema value clustering. We prove that deterministic threshold grids are inconsistent under lowered floor detection thresholds due to threshold grid misalignment error. We bound this error using randomized grid dithering. For arbitrary deterministic shifts, any joint noise distribution, and data-dependent thresholds, we obtain non-asymptotic bounds on the estimation risk and family-wise error rate, establishing DSDT as a universal false alarm suppressor for any single-threshold algorithm. When the scale sequence tends to zero or extremes cluster along the search grid, DSDT achieves asymptotic exact order recovery of separated deterministic components exceeding the noise maximum plus the grid step, even below the minimax threshold or without a detection threshold. Using multiple independent dithers reduces error bounds. We provide convergence and consistency analysis for an arbitrary number of dithers. This analysis establishes asymptotic bounds under extreme value laws and non-asymptotic bounds under nondecreasing hazard rates. The results extend to unseparated deterministic shifts, random shifts, unknown noise scales, and multi-dimensional search grids. We show that DSDT is robust to data quantization.
Read the full abstract
Machine Learning
Partially Linear Autoencoders for Manifold Learning and Dimensionality Reduction
Autoencoders are widely used for nonlinear dimensionality reduction and manifold learning. While most common implementations rely on both nonlinear encoders and decoders, we investigate the specific role of the encoder and the extent to which it can be constrained to be linear without reducing accuracy. We conduct a comparative study on four autoencoder architectures: standard fully nonlinear autoencoders (AE), linear-encoder autoencoders (Lenc-AE), linear-decoder autoencoders (Ldec-AE), and fully linear autoencoders (LAE), evaluated on synthetic manifolds, computational mechanics data sets, and real-world image data sets including MNIST. We demonstrate that imposing a linear encoder preserves most of the representational capacity of the autoencoder, provided the decoder remains nonlinear. In particular, Lenc-AE consistently outperforms both Ldec-AE and LAE, and achieves reconstruction quality comparable to fully nonlinear AE, while offering advantages in terms of parsimony and interpretability of the latent representation. These results suggest that the nonlinear decoder is the critical component for manifold learning, rather than the encoder. A geometric interpretation of this finding is developed, which identifies the precise conditions under which a linear encoder is sufficient, and the specific manifold configurations that expose its limitations.
Read the full abstract
Soft Condensed Matter
Birefringent-colored optical profiling of wood presenting the 3D cellulose microfibril architecture
Wood slices under a polarized optical microscope show a spectrum of interference colors, such as cyan, blue, magenta, yellow, and bluish gray because of the birefringent cellulose in the microfibrils. An optical model is established to simulate the birefringent-colored micrograph of wood. Five typical cell wall architectures, line, helix, ring, crossed helix, and twisted helix, are considered. With a retardation wave plate to distinguish fibrils of different orientations, each structure displays its unique birefringent-colored texture, presenting its underlying 3D structure with the vivid colors. Cross sections of the trunk and twig of Eucalyptus grandis presented birefringent-colored profiles. Three identification methods were compared: visible fibril trends, birefringent-colored optical textures, and the simulated look-up library. The three methods gave consistent results, proving that the birefringent-color tags are efficient and accurate. Electron and atomic force microscopy are unable to resolve cellulose microfibrils embedded in the lignin and hemicellulose matrix. Polarized optical microscopy overcomes this by selectively detecting birefringent cellulose, enabling accurate identification of complex helical structures. This method enables statistical and spatial analysis of complex biomaterial compositions. Capable of profiling dozens of cells simultaneously, this high-throughput optical method provides a potentially fully automated analysis framework for plant science, biomechanics, and bioinspired cellulose materials.
Read the full abstract
Computation and Language
ManGo: Manga Active Narrative Grounding Optimization
Manga visual question answering requires models to answer questions over panel-based visual narratives, where relevant evidence is distributed across ordered panels, embedded text, recurring characters, and implicit event transitions. This structure makes passive page encoding insufficient, as the model must identify which panels to inspect, what clues to retain, and when the accumulated evidence is sufficient for answering. We propose ManGo (Manga Active Narrative Grounding Optimization), an unsupervised framework for active manga visual question answering. ManGo introduces Active Narrative Sketching (ANS), which iteratively selects panels, extracts concise grounded clues, and decides when to stop, forming a compact question-directed evidence sketch before answer generation. To optimize this behavior without human-annotated answers or rationale paths, ManGo samples multiple ANS rollouts and applies group-relative training with two rewards: answer preference from listwise self-ranking and path consistency from stable ordered panel trajectories. The combined reward is optimized with group-relative policy training, encouraging the model to improve both final answers and the panel-level evidence paths that support them. Experiments on standard manga understanding benchmarks show that ManGo achieves state-of-the-art performance across different settings.
Read the full abstract
High Energy Physics (Phenomenology)
NNLO QCD corrections to the weak radiative $B$-meson decay with exact dependence on $m_c$
The inclusive weak radiative $B$-meson decay provides important constraints on many popular extensions of the Standard Model. Some of the numerically relevant Next-to-Next-to-Leading-Order QCD corrections to its branching ratio have so far been evaluated using an interpolation in the charm quark mass between the $m_c=0$ and $m_c \gg m_b$ limits. In the current paper, we present their determination for the physical value of $m_c$, which required calculating hundreds of four-loop propagator diagrams with unitarity cuts and two mass scales. Our final result for the CP- and isospin-averaged branching ratio reads ${\mathcal B}_{s \gamma}^{\rm SM} = (3.54 \pm 0.14)\times 10^{-4}$ for $E_\gamma > 1.6\,{\rm GeV}$ in the decaying meson rest frame. It is in good agreement with the current Particle Data Group average ${\mathcal B}_{s \gamma}^{\rm exp} = (3.49 \pm 0.19)\times 10^{-4}$.
Read the full abstract
High Energy Physics (Phenomenology)
The inclusive $\bar B \to X_s \gamma$ decay rate with higher precision
We present a new and upgraded analysis of the inclusive weak radiative decay of the $B$ meson in the standard model and beyond. The ${\mathcal O}(\alpha_s)$ perturbative corrections are included in a formally complete manner. At the order $\alpha_s^2$, exact dependence on the charm quark mass is calculated for the dominant corrections, which removes a sizeable uncertainty that was present in all the previous analyses. The global normalization factor and many of the non-perturbative contributions are expressed in terms of the kinetic-scheme mass of the $b$-quark and the heavy-quark-expansion matrix elements. These parameters are adopted from the most recent semileptonic fits that include ${\mathcal O}(\alpha_s^3)$ corrections and up-to-date experimental results. We find ${\mathcal B}_{s\gamma}^{\rm SM} = (3.54 \pm 0.14)\times 10^{-4}$ for the CP- and isospin-averaged branching ratio of the considered decay in the standard model, with a lower cut on the photon energy $E_\gamma > 1.6\,{\rm GeV}$. It agrees with the current experimental average ${\mathcal B}_{s\gamma}^{\rm exp} = (3.49 \pm 0.19)\times 10^{-4}$, which provides constraints on beyond standard model physics. In particular, we find $M_{H^\pm} > 670\,{\rm GeV}$ at $95\%\,{\rm C.L.}$ for the charged Higgs boson mass in the two-Higgs-doublet model~II.
Read the full abstract
Statistical Methodology
Spatial-sign-based multilinear principal component analysis for tensor data
Multilinear principal component analysis (MPCA) reduces the dimension of tensor-valued data while preserving their mode-specific structure, but its quadratic scatter criterion can be unstable under heavy-tailed distributions and contamination. We propose spatial-sign-based multilinear principal component analysis (SMPCA), a robust dimension-reduction method that centers the observations by their spatial median, removes radial magnitude through spatial-sign normalization, and estimates the mode-wise loading spaces by alternating eigendecompositions. Under a separable tensor elliptical model, we show that the target mode-wise loading spaces uniquely maximize the population criterion and that one complete sweep of exact population block updates recovers them from any initialization. We also characterize exactly when their tensor-product subspace coincides with a leading unrestricted subspace of vectorized spatial-sign PCA and, when finite second moments exist, ordinary vectorized PCA. At the sample level, we derive explicit statistical rates for the mode-wise subspaces and the joint multilinear projector, obtain corresponding reconstruction guarantees, establish consistency of the cumulative-contribution dimension selector, and prove that the objective values generated by exact cyclic updates are nondecreasing and convergent. Simulations and an empirical application show that SMPCA is more accurate and stable than competitors under heavy-tailed distributions and outlier contamination, while retaining competitive performance under light-tailed settings.
Read the full abstract
Mesoscale and Nanoscale Physics
Spin-textured orbitals in altermagnetic artificial atoms
Artificial atoms provide a versatile platform for engineering atomic-like orbitals, yet spin generally remains a passive degree of freedom in their orbital structure. Here, we introduce the concept of altermagnetic artificial atoms formed by confining electrons with momentum-dependent spin splitting. We show that altermagnetism reconstructs conventional confined orbitals into spin-textured orbitals, with spatially distinct distributions of opposite spin components. The resulting confined spectrum retains a twofold degeneracy protected by the combined $C_{4z}\mathcal{T}$ symmetry. These spin textures persist in higher-energy states, where additional radial structures combine with the characteristic angular spin pattern. Furthermore, strain resolves the degenerate orbital pairs into spin-polarized states, and continuously tunes their energy splitting. Our results establish altermagnetic artificial atoms as a route to engineering spin-dependent orbital structures in quantum-confined systems.
Read the full abstract
Machine Learning
Uncertainty-Driven Replay Memory for Reinforcement Learning
Uncertainty estimation provides promising capabilities for reinforcement learning (RL) agents. Notably, estimating uncertainty can reduce the training time and enable agents to obtain greater rewards over time by exploiting information related to whether an action would facilitate exploration of portions of an environment that are well-known versus those that are relatively unknown. In this work, we propose a novel formulation of the experience replay buffer commonly used in RL that we call uncertainty-driven replay memory (UDRM), which entails an update scheme for internally stored memories based on uncertainty estimates obtained by an RL model during training. In contrast to existing forms of RL, which typically use temporal difference error or the distribution of transitions to update the replay memory buffer and train RL controllers, our scheme biases the memory buffer to store more uncertain transitions that will improve an RL agent's generalization throughout training. Experimental results demonstrate that our proposed uncertainty-aware replay buffer enables an RL agent to obtain higher rewards during training compared to other existing uncertainty-aware RL frameworks.
Read the full abstract
Soft Condensed Matter
Chiral cellulose fibril organization in a plant cell wall as liquid crystal confined in a cylindrical boundary
The order of cellulose microfibrils in xylem cell walls is identified using polarized optical microscopy. The line, helix, ring, crossed helix, and twisted helix organizations in a cylindrical shell are the equilibrium states of balanced elastic deformation and surface anchoring. A computational model of the five organizations is established to simulate their birefringent-colored profiles. These five textures present unique optical textures, which are clearly recognized in the cross sections of Eucalyptus grandis. The libriform fiber cell for support has a twisted helical cell wall. The vessel cell for high-speed water uptake consists of a helical layer covered by a layer of vortex array. The ray cell for radial transportation is crossed helical. The microfibril angles versus the radius of the cell wall were measured utilizing the distribution of birefringence colors. In fiber cell walls, the MFA is significantly correlated with the curvature, bending, and surface anchoring, respectively. In vessel cell walls, the vortex array includes focal conic domains of chiral order and topological defects of nematic order, suggesting that the phase transition of cellulose fibrils leads to pattern formation. Liquid crystal phases and patterns in the cell walls reveal how the cell wall thickens and how cells differentiate. Out of the frustration of long, stiff, twisting fibrils packed in slender tubes, trees generate the helical channel networks, transforming the brittle lamina into an elastic, tear-resistant, self-healing tissue.
Read the full abstract
Quantum Physics
Decay versus dephasing in Rydberg analog optimization: the exchange rate depends on the readout
Numerical studies of noisy Rydberg-atom optimization compress decoherence into a single rate, treating spontaneous decay ($\Gamma$) and dephasing ($\gamma$) as equivalent. We resolve the two as independent Lindblad axes for quantum annealing of unit-disk maximum independent set at fixed annealing time and ask how their relative effect depends on the readout. For the raw readout the size error collapses onto the effective dephasing rate $u=\kappa\Gamma+\gamma$, and at small noise a unit of decay rate degrades the result as much as $\kappa=7.4$ units of dephasing rate; a collapse fit across the whole grid returns 8.3. After greedy completion followed by a $(1,2)$-swap local search, classical post-processing of polynomial cost, the exchange rate falls to $\kappa=1.6$, and at the calibrated operating point of a commercial device dephasing produces three quarters of the noise-induced error instead of two fifths. First-order perturbation theory built from noiseless propagation gives the decay and dephasing susceptibilities of every readout, raw or post-processed, to a few parts in $10^6$ of the full Lindblad result. The raw asymmetry is set at the end of the schedule, where a decay event deletes an atom and a dephasing event leaves the readout unchanged. Post-processing refills most deletions and leaves misplaced atoms, which the two channels produce at comparable rates. Which channel limits a device therefore depends on the readout as well as on the hardware.
Read the full abstract
Statistical Methodology
Worst-Case Win Ratios Under Partially Specified Outcome Hierarchies
Win statistics require a prespecified outcome hierarchy. Clinical teams sometimes agree only on the highest priority outcome, leaving the order of lower priority outcomes unresolved, and clinically meaningful thresholds may be specified as ranges. Separate sensitivity analyses describe how the results change. A single inference for the full set of planned analyses is generally absent. We define the estimand as the smallest net benefit among the comparison rules allowed by the protocol or statistical analysis plan. Each rule uses the usual two-sample U-statistic. Large-sample results are developed for a finite list of rules and for a continuous threshold range. Inversion of an intersection-union test gives a one-sided lower confidence bound, with no multiplicity adjustment for the single claim that every individual net benefit is positive. Simulations show valid one-sided coverage and illustrate the gap between a favorable result for one selected hierarchy and a favorable result across all prespecified hierarchies. An application to ACTG 175 shows how the ordering of laboratory outcomes can affect the strength of the conclusion. A further example identifies an unfavorable threshold that is missed by a sparse grid.
Read the full abstract
Computation and Language
GenRubric: Self-Evolving Rubric Generation for Scalable LLM Evaluation
Large language models are increasingly used as scalable evaluators for open-ended tasks. However, many LLM judges derive query-specific criteria during scoring, leaving the evaluation requirements insufficiently specified and their coverage difficult to audit. Query-specific rubrics make these requirements explicit, but expert-written rubrics are costly to construct, while existing automatic methods typically rely on inference-time refinement or external supervision. We introduce GenRubric, a self-evolving framework that improves rubric generation from unlabeled queries without requiring additional human annotations during self-evolution. Our approach is based on rubric-induced self-consistency: independently sampled rubrics for the same query provide partial views of its latent evaluation requirements, and a comprehensive rubric should induce a response that generalizes across these complementary evaluation views. We implement this principle through reinforcement learning, combining a cross-rubric comprehensiveness signal with group-level and criterion-level rewards for rubric quality. We train GenRubric models at 4B, 8B, and 14B scales across multiple domains. Experiments on human-annotated rubric benchmarks show that self-evolution improves the agreement between evaluations induced by generated rubrics and those induced by expert-written rubrics. The improvements further generalize to held-out domains, demonstrating the potential of self-evolving rubric generation for scalable and query-specific LLM evaluation. Code and models are publicly available at https://github.com/foggpoy/GenRubric.
Read the full abstract
Geometric Topology
Growth of Simple Closed Geodesics in Finite-Volume Hyperbolic Manifolds
Let $M$ be a finite-volume hyperbolic $d$-manifold with $d\ge3$. We prove that the number of primitive nonsimple closed geodesics has exponential growth rate strictly smaller than $d-1$. Consequently, asymptotically almost every primitive closed geodesic in $M$ is simple. In contrast, we show that on an arithmetic hyperbolic manifold of type~I, the unit vectors tangent to nonsimple closed geodesics are dense in the unit tangent bundle.
Read the full abstract
Probability
One-dimensional Feynman–Kac regularity under the Engelbert–Schmidt conditions
Let $X$ be a time-homogeneous one-dimensional diffusion whose coefficients satisfy the Engelbert–Schmidt conditions, and let $q$ be a bounded potential. We show that the associated Feynman–Kac semigroup is smooth in time and $C^1$ in space, with a locally absolutely continuous first spatial derivative; the Kolmogorov equation holds almost everywhere. If the drift, second-order coefficient, and potential are continuous, the Feynman–Kac value is $C^{1,2}$ in the interior. Thus, in the time-homogeneous one-dimensional setting, continuity suffices for interior $C^{1,2}$ regularity. We identify the corresponding semigroups with the killed and reflected Feynman–Kac functionals, treat nonzero, time-independent Dirichlet data, and give examples showing the sharpness of the continuity assumptions and the failure of the corresponding statement in two dimensions.