Peer Revenue Past citations are no guarantee of future returns

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

All of arXiv

Friday 11 September

Soft Condensed Matter

NEMO: A Framework for Nematic and Morphological Analysis of Curved and Multi-layered Biological Surfaces

Across biological scales, from cytoskeletal networks to whole tissues, orientational order and topological defects arise within complex three-dimensional geometries. However, quantifying nematic order orientational order with head-to-tail symmetry remains challenging: 2D projections introduce geometric distortions, while current 3D methods often struggle to resolve distinct nematic fields within curved or multilayer structures. Here, we introduce NEMO, a modular Python framework for the depth-resolved quantification of tangential nematic order and surface morphology. By reconstructing biological surfaces as triangulated meshes, NEMO projects curved intensity layers, extracts local nematic directors, and computes locally averaged nematic tensors within the tangent plane. The pipeline identifies topological defects and computes their topological charge by accounting for the Gaussian curvature of the underlying surface. Furthermore, NEMO quantifies tissue morphology through inter-surface distance and surface-fitted estimates of Gaussian and mean curvatures. We show the capacities of this framework using a synthetic nematic film on a vesicle and experimental actin organisation in Hydra. By combining customisable projections with surface-constrained analysis, NEMO provides a unified framework for quantifying the interplay between orientational order and geometry across scales.
Read the full abstract

All authors Konstantinos Andreadis, Oriol Mañé-Benach, Claire A. Dessalles, Lodovico Mazzei, Aurélien Roux, Guillaume Salbreux

Machine Learning

Offline Reinforcement Learning for Wind Farm Control: A Wind Tunnel Study under Dynamic Wind Directions

This paper addresses the wind farm power maximization problem in the presence of wind direction changes. Specifically, a model-free Modified Twin Delayed Deep Deterministic Policy Gradient with Behavior Cloning (MTD3-BC) algorithm is proposed to tackle this task through yaw control under varying wind direction conditions. MTD3-BC is an offline reinforcement learning (RL) algorithm that aims to infer good behavior from only a precollected offline dataset. Additionally, to ensure smooth and moderate yaw adjustments, a new action consistency term is introduced into the policy optimization objective. Unlike online RL methods, MTD3-BC does not require extensive interactions with a wind farm simulator during training, significantly reducing computational costs and training time. A wind tunnel experiment is conducted to validate the effectiveness of the algorithm under varying wind directions. The results demonstrate that MTD3-BC successfully mitigates wake effects, delivering farm-level power gains of approximately 10% over the baseline greedy strategy and performance on par with a data-calibrated model-based wake-steering benchmark, while requiring no wake model and only a small fraction of the training cost of online RL. To our knowledge, this is the first time an offline RL wind farm control policy has been validated and demonstrated experimentally.
Read the full abstract

All authors Yuhan Su, Hongyang Dong, Simone Tamaro, Filippo Campagnolo, Carlo L. Bottasso, Xiaowei Zhao

Statistics Applications

MIMO and Multi-Group Comparison Problem in Process Control: A Multivariate Statistical Framework for Systems Represented with Frequency Response Functions

Characterizing complex Multi-Input Multi-Output (MIMO) systems presents two issues: feedback controllers mask fault variance, rendering single-variable monitoring ineffective, and repeated testing across multiple conditions inflates false positive rates due to the multiple comparisons problem. This study proposes a multivariate statistical framework to resolve these limitations. We extend a statistical library that identifies system dynamics via Frequency Response Functions (FRFs) by transforming them into time-domain Pseudo-Impulse Responses (PIRs). This functional representation captures the complete dynamic signature of the system, offering a richer diagnostic profile than traditional static scalar metrics. The framework, originally developed for SISO systems, is extended to the MIMO case by introducing supervectors that aggregate multiple PIRs, evaluated using Permutational Multivariate Analysis of Variance (PERMANOVA). This non-parametric approach handles the high dimensionality and complex correlation structures inherent in MIMO functional data. We demonstrate that the PIR Supervector is more powerful than single-variable analysis, and the MIMO PERMANOVA approach outperforms traditional SISO anomaly detection. By distinguishing between normal operation, external thermal disturbance effectively compensated within the investigated operating range, and severe parametric faults that standard univariate methods miss, the framework provides a single, rigorous metric for specific fault diagnosis ($p < 0.001$).
Read the full abstract

Machine Learning

Hidden in Rounds: Predicting the Time Cost of 802.11 Contention in Federated Learning

Federated learning over IEEE~802.11 shares the wireless channel among clients that send model updates. We use ns-3 to measure the frame-delivery ratio and saturation throughput for different client densities and offered loads. A separate FedAvg trainer uses the frame-delivery ratio as a first-order proxy for the update-admission probability and uses an equation to estimate communication time. The method does not simulate the delivery of a complete model update or measure end-to-end training time. Across 720 evaluated runs with two datasets, two data partitions, six client densities, six offered loads, and five seeds, all runs reached their predefined target accuracy within the round budget. Rounds-to-target changed little with offered load, while communication time-to-target increased by about two orders of magnitude across the client-density range. A Bianchi-anchored estimator produced a mean absolute percentage error from $2.3\%$ to $10.2\%$ on held-out configurations. This error is measured against communication time constructed from the same round-duration equation, not against independently measured completion time. We also compare uniform participation with persistent heterogeneous participation. The study does not detect a statistically distinguishable excluded-class accuracy gap over five seeds, but the confidence intervals are wide. The results apply only to the evaluated configurations and do not provide a general convergence or fairness guarantee.
Read the full abstract

Computer Vision

Parallel Training Using a CNN-DNN Architecture for Accelerated Development of Diagnostic Models

Artificial intelligence has shown promise in assisting radiologists in imaging-based diagnosis across a wide range of diseases. Efficient training of large deep learning models is essential to cope with extremely large data sets or dynamically growing disease data, like in a pandemic like situation. In this retrospective study, we collected 300 CT scans from COVID-19 and non-COVID-19 pneumonia patients from three different centers in Germany. We investigated a hybrid CNN-DNN network model based on image decomposition and localization that naturally supports parallel and efficient training of deep learning models. In total, 156 models with three different architectures were trained to capture features at different levels resulting in 12 patient-level COVID-19 diagnosis models. Diagnostic performance as well as time saving were measured. The highest accuracy was obtained from DenseNet121 and 3D CNN models with a parallel CNN-DNN approach, resulting in $88.78\%$ training, $76.67\%$ validation and $76.03\%$ test accuracy for the DenseNet121 with $4\times4\times1$ subdomains and $87.72\%$ training, $76.82\%$ validation and $74.86\%$ test accuracy, respectively, for the 3D CNN with $4\times4\times1$ subdomains. The strongest reduction in parallel training time by a factor of $31$ was observed for the 3D CNN model and $4\times4\times2$ subdomains. Our parallel training approach improves efficiency as well as performance enabling rapid model development, among others crucial for pandemic preparedness.
Read the full abstract

All authors Janine Weber-Hamacher, Astha Jaiswal, Philipp Fervers, Dorotya Móré, Athanasios Giannakis, Ricarda Fischbach, Andreas Michael Bucher, Rahil Shahzad, Jonathan Kottlors, Thorsten Persigehl, Axel Klawonn

Analysis of PDEs

On space-time derivative estimates for the magnetohydrodynamic equations

In this paper, we present the space-time derivative estimates of solutions to the MHD equations. It is a generalization of a priori bounds for the classical Navier-Stokes system by Duff in \cite[Acta Math. 164, 1990]{[Duff]} and gives an affirmative answer to a question proposed by Zheligovsky in \cite[Mathematics. 9, 2021]{[Zheligovsky]}. In addition, we show that $u, B \in L^{\f{q}{q-3}}(0,T;L^{q} (\mathbb{R}^{3}))$ with $6\leq q\leq\infty $ and $ D ^{k}u, D ^{k}B \in L^{\f{q}{ q(k+1)-3}}(0,T;L^{q} (\mathbb{R}^{3}))$ for $k\geq1, 2\leq q\leq\infty$ in this system.
Read the full abstract

All authors Yanqing Wang, Wei Wei, Gang Wu, Yulin Ye

Computational Physics

Physics-enriched neural solvers for transient ice-flow simulation

Transient glacier simulations with higher-order ice flow require the repeated solution of a nonlinear problem as the geometry evolves. In the online mode of the Instructed Glacier Model, the velocity field is represented by a neural network whose weights are warm-started from the previous time step and updated with a few optimizer iterations. We show that supplying the network with inexpensive input fields derived from low-order ice-flow balances improves this online solver. Unlike residual-based physics-informed neural networks, which incorporate physics through governing-equation penalties in the loss, our approach leaves the governing energy objective unchanged, adding physical structure through the network inputs. Across three real-world glacier configurations, the enriched solver is markedly more robust to solver settings. On the two alpine cases, it also improves the tuned accuracy–runtime trade-off, reducing surface-velocity errors by factors of two to four at fixed runtime and reaching few-percent relative errors with only $10^4$–$10^5$ trainable parameters, far fewer than comparable raw-input baselines. A 300-year Aletsch simulation then completes in under one minute, and the larger Valais domain in about two minutes, on a single GPU—a budget once reserved for much simpler shallow-ice models. Gains are smaller for the fast marine-terminating glacier, where nonlocal stress coupling favors larger or spectral networks. More broadly, the results suggest that enriching a neural solver's inputs with reduced-order physics can make repeated higher-order solves much cheaper, with no training data and no offline training.
Read the full abstract

All authors Thomas Gregov, Sebastian Rosier, Brandon Finley, Andreas Vieli, Guillaume Jouvet

Machine Learning

Physical-State-Guided Diffusion Sampling for Full-Waveform Inversion

Full waveform inversion (FWI) reconstructs subsurface velocity models from seismic mea surements but faces the challenges of ill-posedness and nonlinearity, making accurate inversion dependent on suitable initialization and effective prior constraints. Classical methods stabi lize the inversion and improve convergence by designing hand-crafted regularization terms, yet these terms provide limited descriptions of complex geological structures. Recent diffusion based methods learn more detailed structural priors from data and integrate them into inverse problem solvers. We propose Physical-State-Guided Diffusion Sampling (PSG), which decouples diffusion posterior sampling into two mutually interacting processes: regularized FWI optimiza tion and conditional diffusion sampling with linear guidance. PSG shows overall improvements in reconstruction accuracy, preservation of prior structure, and robustness over classical and diffusion-based baselines across diverse OpenFWI inversion scenarios. Through domain decom position, PSG can generalize without retraining to more complex, realistic velocity fields with structural patterns distinct from those represented by the prior learned from training datasets and larger spatial domains than the training models. Overall, PSG offers a flexible framework for integrating learned priors with physical constraints, with potential for extension to other nonlinear inverse problems.
Read the full abstract

All authors Chen Min, Haowen Jiang, Zheng Ma, Xiong-Bin Yan

Computer Vision

UniPart: Towards Zero-shot Language-Grounded 3D Part Segmentation for Embodied Interaction

Fine-grained robotic manipulation depends on understanding parts, not only whole objects. Existing 3D foundation models tend to be either generalized but object-aware, or part-aware but limited to closed-set taxonomies, which weakens zero-shot transfer. We study text-conditioned 3D part segmentation, where a free-form phrase selects a functional part on point cloud. We introduce UniPart, a feed-forward cross-modal 3D Transformer that conditions CLIP text embedding. To scale supervision, we build LangPart-1M with 160K+ Objaverse assets and 8M text to part pairs using multi-view consistent part generation. We further manually label a high-quality subset, LangPart-4K, for fine-tuning and evaluation. UniPart achieves strong zero-shot results on open-vocabulary part benchmarks and transfers to language-conditioned part grasping in real world.
Read the full abstract

All authors Xinqiang Yu, Zekun qi, Jiawei He, Wenyao Zhang, Xuchuan Chen, Guaocai Yao, Li Yi, Zhaoxiang Zhang, He Wang

Artificial Intelligence

Tracing and Coordinating Cross-Layer Influence for Multimodal Model Merging

Multimodal model merging aims to consolidate task experts into a single model that retains their complementary capabilities. Most unimodal model merging methods combine expert updates within individual layers, and multimodal approaches largely follow this design. However, an expert update changes the representations passed to subsequent layers, allowing its influence to propagate across depth and affect how visual and textual information interact. When visual and language updates are combined, later updates act on inputs already modified by earlier ones, coupling their effects. This poses two challenges: (1) how to characterize the multimodal influence of individual expert updates across depth, and (2) how to jointly combine expert updates based on their multimodal influence. To address these challenges, we propose TAC-Merge for tracing and coordinating cross-layer influence in multimodal model merging. It contains two modules, i.e., multimodal influence mapping (MIM) and coupled merge control (CMC). MIM constructs graphs of update effects and uses Ricci curvature together with expert predictions to define a shared fusion objective. CMC models interactions among coefficient adjustments and jointly optimizes regional weights to synthesize one shared model. Experiments across diverse multimodal tasks demonstrate the effectiveness of TAC-Merge in consolidating complementary expert capabilities and supporting generalization to unseen tasks.
Read the full abstract

All authors Pengyang Zhou, Xiaobin Tu, Zhengxi Liu, Rongkun Xue, Haochen Li, Miancan Liu, Ziyuan Chen, Yinggui Wang, Jinkui Ren, Xiantao Zhang

Machine Learning

Behavior Quotient Learning for Low-Rank Adaptation of LLM Agents

LLM-based agents rely on heterogeneous interaction capabilities to accomplish complex tasks. Existing approaches often distribute these capabilities across multiple LoRA adapters, which increases adapter storage requirements and introduces routing overhead during inference. A single LoRA avoids this overhead, but learning from diverse agent trajectories under a fixed rank budget presents two challenges. First, trajectories with different interaction traces and parameter gradients can induce equivalent changes in decision distributions, causing repeated updates to overemphasize redundant behavioral changes. Second, an aggregated update may exceed the rank budget of the adapter, and approximating it in weight space can distort the decision changes that it is intended to produce. We propose BQ-LoRA, a low-rank adaptation framework that organizes trajectory updates through a local behavior quotient manifold. It contains two modules, i.e., behavior quotient balancing (BQB) and decision preserving compression (DPC). BQB constructs the quotient manifold from decision distributions and reweights trajectory update directions according to their local density in the quotient tangent space. DPC projects the balanced gradient onto the intrinsic fixed rank tangent space and refactorizes the resulting target by jointly controlling effective weight error and distortion of decision distributions. Experiments on AppWorld and BrowseComp-Plus compare BQ-LoRA with standard LoRA and recent low-rank adaptation methods, while separate ablations evaluate the complementary contributions of both components.
Read the full abstract

All authors Pengyang Zhou, Xiaobin Tu, Zhengxi Liu, Rongkun Xue, Haochen Li, Miancan Liu, Ziyuan Chen, Yinggui Wang, Jinkui Ren, Xiantao Zhang

Quantum Algebra

Affine $\mathfrak{sl}_2$ at admissible levels and quantum $\mathfrak{sl}_{2|1}$

We prove braided tensor equivalences between the categories of weight modules of the affine vertex algebra of $\mathfrak{sl}_2$ at any admissible level and categories associated to partially semisimplified versions of quantum $\mathfrak{sl}_{2|1}$ at roots of unity.

Robotics

Before the Tipping Point: Force-Guided Active Perception for Shape-Agnostic Estimation of 3D Centers of Mass

Estimating the 3D center of mass of unknown objects is challenging when grasping is infeasible, geometry is irregular, or mass distribution is uneven. We present a force-based method that estimates CoM height and mass from a single sub-critical tipping experiment by a robot manipulator. The robot applies a quasistatic elevated push and retract motion, using force-angle measurements recorded during tipping to identify parameters from the object trajectory. Our proposed push-retract cycle mitigates frictional bias, enabling generalized fitting. We experimentally validate our method using a robot manipulator with a six-axis force torque sensor on varying types of objects without prior shape information and without specific models. We also propose a method to prevent toppling, keeping the object in a sub-critical tipping regime by leveraging a safety margin. In experimental studies, our method recovers mass, CoM height, and toppling angle with relative errors below 5.0 percent across all unknown objects. This work demonstrates reliable 3D inertial parameter estimation under proper safety thresholds in tipping. Our proposed method informs and enables reliable non-prehensile manipulation and robotic grasping of challenging objects that were previously infeasible.
Read the full abstract

Numerical Analysis

A stabilized, nodal strain finite element method for small and large deformations: formulation, analysis, and impact on remeshing strategies

We present in this article the discretization of small and finite strain mechanics using variationally consistent, stabilized, nodal strain finite element formulations. We prove that these methods derive from a mixed variational principle that uses different meshes for the primal and dual variables. We demonstrate that, for both mechanical problems, nodal strain finite elements can be written as pure primal formulations with assumed strain operators. The stabilization terms are shown to be necessary and a new, general class of stabilizing functions is proposed for the finite strain regime. The ensuing formulations can be interpreted as pure particle methods because all kinematic and material information is stored at the nodes. This point of view explains the favorable properties of nodal strain methods when employed in problems that require frequent remeshing and involve inelastic materials. In these cases, the diffusion of internal variables is kept to a minimum. The numerical examples presented validate the claims.
Read the full abstract

Computer Vision

Beyond Accuracy: Uncertainty-Guided Boundary Refinement for Reliable Biomedical Image Segmentation

Accurate biomedical image segmentation requires not only high global overlap but also reliable delineation of clinically meaningful boundaries. In blood-smear microscopy, cytoplasm and nucleus contours provide the structural basis for downstream morphology analysis; however, deep segmentation models may remain uncertain or overconfident near ambiguous boundary regions even when achieving strong Dice scores. This work proposes a Reliability-Aware Boundary Refinement Network (RABR-Net), a two-stage framework for trustworthy image segmentation. A strong UNet++ EfficientNet-B4 base segmenter first produces initial class probabilities and logits. Predictive entropy, test-time augmentation variance, margin uncertainty, probability gradients, and soft boundary cues are then combined into a boundary-aware reliability representation. This representation guides a gated residual refiner that selectively corrects uncertain boundary pixels while preserving confident regions of the base prediction. The framework is evaluated using overlap accuracy, class-wise Dice, Boundary Dice, HD95/ASSD, calibration, risk–coverage analysis, robustness under image perturbations, qualitative correction maps, and paired statistical testing. On the held-out test set, the proposed method improves Dice from 0.9602 to 0.9614, Boundary Dice from 0.3448 to 0.3611, and HD95 from 3.0354 to 2.8274 compared with the cached base prediction. Statistical analysis confirms significant improvements in Dice, Boundary Dice, and HD95. Qualitative results show that the learned gate concentrates around uncertain cytoplasm and nucleus boundaries, and correction maps confirm localized boundary refinement. Although calibration does not automatically improve after refinement, the proposed framework provides an interpretable and reliability-focused strategy for boundary-sensitive biomedical image segmentation.
Read the full abstract

Machine Learning

Quantifying the Value of Privileged Information Using a PAC-Bayesian Approach

In practice, various learning scenarios provide access to auxiliary features exclusively during training. Incorporating such data to enhance model performance gave rise to a paradigm known as Learning Using Privileged Information (LUPI). While this extra information is intended to improve the resulting model, establishing a generalized, cohesive understanding of how privileged information (PI) transfers useful knowledge remains a challenge. Vapnik's original theory and subsequent works offer performance guarantees in certain cases, but these results are inherently per-algorithm and rely on setting-specific proof approaches. Consequently, a more general framework explaining how and when PI transfers useful knowledge is still missing. To bridge this gap, we introduce an algorithm-agnostic, information-theoretic approach based on the PAC-Bayes framework. Rather than asking whether a particular algorithm exploits PI, we ask how much value it could offer: comparing the tightest achievable risk bound with and without PI yields its potential - an upper limit on the extractable gain. We introduce a metric that quantifies this potential directly from empirical training risk, bypassing the need for test-time data access, and validate our findings in both supervised and unsupervised settings. The results demonstrate a robust correspondence between our training-time metric and true test-time performance gains. Ultimately, this work takes a necessary step toward an information-theoretic understanding of LUPI, and quantifying the potential of privileged features before committing to a model.
Read the full abstract

All authors Vasily Bokov, Sebastian Schmitt, Vedran Dunjko, Hao Wang

Machine Learning

Large Distant Gradients Need Not Be Reliable: reliability-weighted credit assignment for long-horizon autoregressive forecasting

In autoregressive forecasting, long prediction rollouts provide distant supervision, but backpropagation through time (BPTT) carries gradients from those losses through many autoregressive steps. Repeated Jacobian products can make distant gradients dominate the update while amplifying predictable signal and unpredictable innovation together; a large distant gradient therefore need not carry reliable learning signal. Motivated by this, we introduce Internal Dual-Wiener routing (Internal-DW), a backward-only intervention that preserves the full forward rollout and all step losses while reliability-weighting internal gradient routes. At each residual block, we derive bounded Wiener gains for the identity and nonlinear routes that balance preserving predictable learning signal against suppressing unpredictable variation, and estimate them from route-level gradient statistics and an explicit noise model. In a controlled system with known gradient signal-to-noise ratio (SNR), we show that distant gradients can grow even as their SNR falls, and that Internal-DW reduces error in recovering predictable gradient signals and improves forecasting. On four history-dominated, weak-drive testbeds, Internal-DW reduces forecast error by 5.2%-13.8% relative to full BPTT, outperforms gradient clipping and Jacobian regularization on three testbeds, with similar performance on shear flow, and outperforms validation-selected truncated BPTT (TBPTT) on three. It also extends or preserves the fitted optimal training-horizon range across these four testbeds. Across benchmarks, the current Internal-DW estimator has a clear applicability boundary: its benefit diminishes or reverses when usable history is limited or when the selected sampler fails to represent dominant drive-dependent variation. The results show that retaining long-horizon supervision does not require trusting every backward contribution equally.
Read the full abstract

All authors Junhao Zhao, David Michael Simberg, Jacob Kang, Colin Connor Kurniawan, Nan Xu

Algebraic Geometry

Equivariant $K$-theory ring of the affine Grassmannian as deformation to normal cone

We revisit fixed-point localization techniques in equivariant topological $K$-theory, presenting its fibers over varying points of the equivariant base as cohomology of the corresponding fixed-point schemes. We then employ this framework for an effective description of the equivariant $K$-theory ring of the affine Grassmannian $\mathcal{G}r_G$. We do so by a detailed study of the relevant fixed points, extending known results to the action of any $(x, \zeta) \in T \times \mathbb{G}_{m}^{\mathrm{rot}}$. We obtain a description of the complexified topological $K$-theory ring $K^{\mathrm{top}, 0}_{T\times \mathbb{G}_{m}^{\mathrm{rot}}}(\mathcal{G}r_G; \mathbb{C})$ as the ring of functions on a family of affine blowups, extending and proving a conjecture of Roman Bezrukavnikov. While this ring is fairly big, we provide a preferred infinite set of topological generators.
Read the full abstract

Physics and Society

The hierarchical organization of urban social overlap: How shared social spaces diverge from physical mobility

Cities are commonly characterized through population density, infrastructure, and mobility flows. These quantities describe where people are and how they move, but movement does not uniquely determine where populations repeatedly encounter one another or whether different locations participate in the same social environments. Here, we construct co-presence overlap networks across 13 Brazilian cities to distinguish these dimensions of urban organization. We introduce two complementary measures: colocation, which quantifies recurrent co-presence activity within individual locations, and co-connectedness, which measures the extent to which locations share the same co-present pairs. We find that the spatial concentration of colocation differs substantially from that of mobility, producing social centers that can differ in both number and location from mobility centers. At the network level, co-connectedness exhibits a non-random hierarchical organization in which locations preferentially share recurrent pairs with locations of similar activity. This hierarchy is systematically weaker and substantially more variable across cities than the corresponding mobility hierarchy, demonstrating that cities with similar mobility organization can differ in how recurrent social overlap is organized across locations. Finally, we show that the spatial proximity of colocation activity to social centers relative to residential centers provides a complementary spatial dimension of urban organization. Together, these results separate three features that are conflated when cities are characterized through mobility alone: movement between locations, local opportunities for social interaction, and the organization of recurrent social overlap across locations.
Read the full abstract

All authors Bibandhan Poudyal, Mariana Macedo, Ronaldo Menezes, Gourab Ghoshal

High Energy Physics (Experiment)

Quark-Parton Fusion and the Scaling of Hadron Production at the LHC

Hadron production, including pions, kaons and antiprotons, in proton-proton collisions at an energy of 7 TeV at the ALICE facility has been studied. For the data analysis, a generalised parton model was used, which takes into account the interaction of two partons in colliding beams and the production of new particles. Considering the effects of parton fusion and compound state formation results in a scaling dependence of the hadron production cross sections of different species.
Read the full abstract

Statistical Methodology

Design-Assisted Regression

We consider regression problems in which the marginal distribution of the covariates is informative for estimation and variable selection, rather than merely auxiliary. Motivated by random-design, high-dimensional, and latent-effect settings, we propose a general design-assisted regression framework in which the estimating criterion depends on both the conditional model for $Y \mid \bfX$ and structured features of the covariate distribution. The framework identifies two roles of design information: stabilizing weak design directions through quadratic regularization and correcting latent-effect distortion through nuisance augmentation. We establish oracle properties for the resulting estimator, separate the effects of stochastic error, shrinkage, and approximation, and compare it with a benchmark sparse procedure that ignores design information. These results show that the proposed framework improves estimation while preserving first-order prediction performance. Numerical studies and two real-data applications illustrate the practical impact of incorporating design information.
Read the full abstract

All authors Shangyuan Ye, Guanbo Wang, Cong Zhang, Ye Liang

Computer Vision

Learning Sign Language Recognition under Label Noise: A Study of Noise-Robust Losses for Isolated and Continuous Settings

In sign language recognition, the isolated (ISLR) classification loss treats a single label as ground truth, as does the frame-level auxiliary classifier over pseudo-labels we add to continuous (CSLR) methods, which lack one. Stylistic variation blurs ISLR annotation and the lack of temporal boundaries in CSLR forces pseudo-labels; both are noisy. We therefore apply symmetric and generalized cross entropy (SCE, GCE), robust alternatives to cross entropy (CE) from image classification, not to connectionist temporal classification but to the preceding single-label classifier. On ASL Citizen with injected symmetric noise on three backbones (three seeds for ST-GCN), robust losses cost at most 2.5 pt when labels are clean and beat CE by 2.9-10.0 pt in all six conditions at noise rate 0.2, one of which only after q was re-selected on dev. GCE gains more, but its optimal q does not transfer across backbones, whereas one SCE setting works in all nine conditions; both vary 2-11 times more than CE across runs, so a favorable point estimate does not establish stability. For CSLR (PHOENIX-2014) we report no gain; our frame-level targets carry a systematic assignment bias, making that study a diagnosis of a single configuration. At lambda_aux = 25 the pseudo-label CE auxiliary raises word error rate above the no-auxiliary baseline on VAC, CorrNet and SlowFastSign, and GCE/SCE improve on CE by 1.7-3.2 pt (three of six conditions return below that baseline). However, the three losses differ by more than an order of magnitude in effective gradient at a common lambda_aux: matching the initial gradient shrinks the gap to 0.4-0.9 pt, and lowering the CE weight alone already beats that baseline, so neither the degradation nor the improvement can be separated from the effect of the weight. We use only symmetric noise; multi-seed evaluation covers only ST-GCN and VAC isolated.
Read the full abstract

Computation and Language

MedSNIP: Building and Benchmarking Snippet-Level Granularity for Medical Fact Verification

A medical claim's correctness often depends not on the claim alone, but on the clinical structure around it. A claim may require a lab reference range, a causal or conditional link, or patient-specific details to be judged correctly, and atom-level decomposition can fragment these dependencies, leaving the verifier with clinically incomplete claims. We reformulate medical fact-checking around snippet-level verification, where clause-grouped units preserve local clinical structure. We introduce MedSNIP-Bench, a human-annotated benchmark for snippet-level medical fact verification, and MedSNIP, an automatic snippet-generation pipeline. MedSNIP-Bench covers 276 consumer-health and clinical-vignette responses, segmented into 2,524 snippets with dual in-general and in-patient-context labels and six structural pattern codes. MedSNIP is evaluated against human snippet boundaries on MedSNIP-Bench and then used to generate snippet-level units for external corpora. Across MedSNIP-Bench, HealthFC, and MedHallu, snippet-level verification preserves or improves false-class F1, with gains concentrated where answers are long enough to fragment and where the verifier is strong enough to exploit the recovered structure. The largest merge-pattern gain is on causal-conditional clinical chains. It also reduces verifier calls by 24-73%, though the saving survives end-to-end only when decomposition is cheap, which an open-weight decomposer makes possible at no loss of chunking fidelity.
Read the full abstract

All authors Hasan Iqbal, Sarfraz Ahmad, Hyunjae Kim, Sihyeon Park, Junjie Liao, Qingyu Chen, Preslav Nakov, Yuxia Wang

Robotics

From Transportation to Manipulation: Enabling Grasping in Magnetic Robotics

Magnetic levitation (MagLev) systems have great potential for application in high-mix, low-volume manufacturing due to their scalability and flexibility, enabling highly reconfigurable in-machine material flow. However, their manipulation capabilities remain largely unexploited, as current applications almost exclusively focus on transportation. To enable grasping and manipulation directly on MagLev systems without requiring additional costly handling equipment, such as industrial robot arms, we present the Gripper MagBot, a low-cost parallel 6-DoF manipulator with an integrated 1-DoF gripper that mechanically couples three MagLev movers. The Gripper MagBot supports two operating configurations: a default mode and a single-track mode, selectable depending on the required stability and workspace footprint. To reconfigure a machine, the MagBot can be autonomously dropped off and picked up using a docking station. We showcase pick-and-place examples in simulation, as well as with the real Gripper MagBot using our inverse kinematics controller. CAD files, assembly instructions, a component list, and videos are available at https://sites.google.com/view/gripper-magbot.
Read the full abstract

All authors Lara Bergmann, Noah Greis, Cedric Grothues, Lisa-Marie Weigelt, Klaus Neumann

Differential Geometry

A Two-Stage Construction of Positive Curvature on the Gromoll-Meyer Sphere

We construct an explicit one-parameter family of smooth metrics on the Gromoll-Meyer exotic seven-sphere, converging in $C^\infty$ to a fixed further Cheeger deformation of the Eschenburg-Kerin metric and having strictly positive sectional curvature for all sufficiently small positive parameter values. The first perturbation preserves the totally geodesic flats of one zero-plane family while making curvature positive near the other; the second removes the remaining zero curvature. The metric and the proof were discovered by the Odin Automatic AI Research Agent.
Read the full abstract

Fluid Dynamics

Physical mechanism of turbulence attenuation by polymers from a timescale perspective

To elucidate the physical mechanism of turbulence attenuation by polymers at each scale, we conduct direct numerical simulations of homogeneous isotropic turbulence in dilute polymer solutions. We model polymers as FENE dumbbells and simulate them using Brownian dynamics. By visualising the hierarchical structures of coherent vortices, we demonstrate that as the Weissenberg number increases, polymers progressively suppress vortices from smaller to larger scales, attenuating their turbulent energy. While inspired by Lumley's theory, we propose a novel timescale-based framework for analysing this attenuation process using the scale decomposition. We define a scale-dependent Weissenberg number, $\mathrm{Wi}_{\mathrm{sd}}(k)$, as the ratio of the polymer relaxation time to the turnover time of multiscale vortices at each wave-number. We reveal that when expressed in terms of $\mathrm{Wi}_{\mathrm{sd}}(k)$, the energy attenuation rate at each scale collapses onto a single curve that rises at $\mathrm{Wi}_{\mathrm{sd}}(k) \gtrsim 1$, proving that $\mathrm{Wi}_{\mathrm{sd}}(k)$ successfully describes both the onset and the degree of turbulence attenuation at any given scale $k^{-1}$. Furthermore, the scale decomposition uncovers that polymers preferentially align with the turbulent stretching direction at the scale satisfying $\mathrm{Wi}_{\mathrm{sd}}(k) \approx 1$. Based on these results, we establish a physical picture of the polymer–turbulence interaction and explicitly link it to the statistics in turbulence attenuated by polymers.
Read the full abstract

All authors Hayato Masuda, Yusuke Koide, Yutaro Motoori, Susumu Goto

Optics

Multidimensional attosecond clocking near Dirac cones in graphite

Two-color high-harmonic spectroscopy is widely used to access sub-cycle electron dynamics and to retrieve harmonic timing information, including harmonic phases and attochirp across gases, solids, and liquids. However, the dependence of such timing observables on additional laser-control parameters remains largely unexplored. Here, we introduce driving intensity as an additional dimension of two-color harmonic spectroscopy in highly oriented pyrolytic graphite (HOPG). The retrieved attosecond two-color delays maximizing the 4th and 5th harmonic yields evolve systematically and differently with driving intensity. Semiconductor Bloch-equation calculations reproduce these trends and reveal a pronounced sensitivity of the intensity-dependent delays to the electronic band dispersion. Our results demonstrate multidimensional attosecond clocking near Dirac cones and establish intensity-dependent two-color delays as a sensitive observable for band-dispersion in quantum materials.
Read the full abstract

All authors Daniel Kroeger, Anna Hassine, Eyal Uzner, Camilo Granados, Marcelo F. Ciappina, Ofer Neufeld, Michael Krüger, Zhaopin Chen

Analysis of PDEs

Non-radial minimizers for the first eigenvalue of the Laplacian in cones and a related overdetermined problem

In this work, we consider relative overdetermined problems for the first eigenfunction of the Laplacian for domains in cones, and the related question of minimizing the first eigenvalue among sets of a given fixed measure. By means of a shape derivative analysis, we show that the spherical sector is a critical shape and obtain a geometric condition on the cone for its stability/instability. By a concentration-compactness argument, we prove the existence of a minimizer, which moreover is bounded, open, connected, and whose relative boundary is regular almost everywhere. By another domain variation argument, we conclude that the minimizers admit a solution for the overdetermined problem.
Read the full abstract

General Economics

The Favorite-Longshot Bias in Prediction Markets: Evidence from Polymarket

The favorite–longshot bias (FLB) is one of the most persistent return patterns in betting markets, but its prevalence in modern prediction markets and its relation to recurrent longshot demand remain unclear. We study these questions in Polymarket, a large and increasingly important prediction market, using 588 million trades by 2.48 million accounts. In observed transaction flows, purchases below 10 cents lose 19.3 cents per dollar, while purchases at or above 90 cents earn 0.83 cents. How contracts are grouped changes the result: longshots lose 6.3 cents per dollar when each contract is weighted equally but gain 4.1 cents when related contracts are first grouped by parent event; the two-sided pattern is robust in Crypto and Politics but surprisingly absent in Sports. The top decile of accounts with the strongest past tendency to buy longshots accounts for 26.6 percent of next-month low-price purchases, but earns similar returns to others. The top decile of accounts with the strongest past tendency to buy favorites accounts for 15.1 percent of next-month high-price purchases but earns less than others. These findings provide evidence of an aggregate FLB on Polymarket, but its magnitude depends on how contracts are grouped.
Read the full abstract

High Energy Physics (Phenomenology)

Gauge-invariant Higgs mechanism via gradient-flow regularization

We provide a manifestly gauge-invariant description of the Higgs mechanism in the Standard Model, casting it not as the breaking of a local symmetry, but as a smooth, analytic crossover from a high-temperature symmetric phase to a low-temperature Higgs phase. Taking the vacuum expectation value of a gauge-invariant local scalar operator and constructing composite quasi-particle states from the original fields of the Lagrangian usually introduces contact-term divergences. Previous attempts to circumvent this issue via bilocal operators remain unsatisfactory. Here we demonstrate that the gradient flow at a flow time $t$ provides a clean, structurally sound, and Lorentz-covariant regularization that permits a consistent, renormalon-free matching onto the standard $\overline{\text{MS}}$ scheme at a scale $\mu \sim 1/\sqrt{2t}\gg m_t$. Beyond its theoretical appeal, this construction clarifies a number of conceptional and practical questions. We demonstrate the utility of this framework at the one-loop level, thereby establishing the foundation for future electroweak precision physics in this approach.
Read the full abstract