Peer Revenue Equity in science

Papers

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

All of arXiv

Friday 28 August

Optimization and Control

A Refined Parameter Condition in the Lyapunov Analysis of IGAHD

In a recent paper, Attouch, Chbani, Fadili and Riahi introduced the inertial gradient algorithm with Hessian-driven daming, called (IGAHD). Under the condition $0\leq\beta<2\sqrt{s}$, where $\beta$ is the Hessian driven damping parameter and $s>0$ is the gradient step size, their Lyapunov analysis shows an accelerated estimate of the objective function as well as a weighted summability of the gradient for the case $\beta>0$. For any fixed value of $\beta>0$, this condition excluded sufficiently small step sizes $s>0$. The present note refines one of the estimates in this Lyapunov analysis by retaining two coefficients that were previously replaced by lower bounds. This leads to the following less restrictive and sufficient condition: $$0<\beta L\sqrt{s}<1+\sqrt{1+sL(1-sL)},$$ where $L>0$ is the constant Lipschitz of the gradient objective function and $0<s\leq1/L$. In particular, the simplest condition $0<\beta <\frac{2}{L\sqrt{s}}$ is sufficient. For fixed values of $\beta>0$ and $L>0$, this new condition is satisfied for sufficiently small $s>0$. Consequently, under this new refined sufficient condition, the conclusions in the original paper stay valid. For convex quadratic functions in finite dimensions, a separate spectral analysis leads to a larger region parameters. It gives a necessary and sufficient condition for Schur stability of the limit modal matrices, as well as the geometrical decay of the objective residuals and the gradients. This modal analysis raises the question of whether a different Lyapunov function would allow us to recover part (or all) of this extended spectral domain for non-quadratic objective functions.
Read the full abstract

Econometrics

A Design Concept of Forecasting Software for Normalized Vector Autoregressions with Fat Tails and Stochastic Volatility

We present a suite of R packages for macroeconomic forecasting that leverages advanced Bayesian, structural, multivariate, dynamic, hierarchical, non-linear, and non-Gaussian models. The suite enables both structural and predictive analyses, and is adapted to time series data across various types, dimensions, and sampling frequencies. Each additional feature increases computational complexity. To address this challenge, our software design incorporates a carefully curated selection of models, efficient algorithms implemented in C++, advanced econometric and numerical methods, robust handling of complex input and output objects, and standardised workflows. This approach combines the computational efficiency of C++ with the convenience of working with data in R. We demonstrate that our packages facilitate original research contributions in forecasting, as illustrated by our example in which vector autoregressions with non-centred stochastic volatility enhance density and point predictions relative to models with centred stochastic volatility.
Read the full abstract

Information Theory

Ada-TokenCom: Rate-Adaptive Token Communications via Large-Model-Driven Token Compression and Generation

Token Communications (TokenCom) has recently emerged as a new paradigm in which tokens serve as unified units for communication and computation, enabling efficient multimodal semantic and goal-oriented transmission. In this paper, we develop Ada-TokenCom, a rate-adaptive TokenCom framework based on large autoregressive models, which integrates next-token prediction with arithmetic coding to achieve ultra-low bitrate semantic communication at the token level. We propose a mixed reconstruction/generation scheme, where the transmitter encodes and transmits the highly informative tokens at the beginning of the token sequence leveraging a pre-trained autoregressive large model, while the receiver uses an identical model to predict the rest. Moreover, we design a Lyapunov-based algorithm to dynamically optimize both the source compression rate and the modulation and coding scheme, adapting to time-varying network conditions. Simulation results demonstrate that our proposed Ada-TokenCom framework outperforms both digital and deep joint source-channel coding-based semantic communication baselines.
Read the full abstract

All authors Zijun Zhang, Li Qiao, Mahdi Boloursaz Mashhadi, Zhen Gao, Mehdi Bennis, Kaibin Huang

Information Theory

ODMA-based MIMO Massive Unsourced Random Access with Soft-Output Polar Codes

This paper investigates the design of the on-off division multiple access (ODMA) transmission scheme for multiple-input multiple-output (MIMO) massive unsourced random access (URA) systems with soft-output (SO) polar codes. First, a three-segment pilot-uncoupled coding scheme is introduced under the ODMA framework, which reduces the coding rate of the data segment without increasing the transmission overhead, improving the overall system performance. Building upon this architecture, a hierarchical pattern detection framework is developed. Specifically, a coarse-grained candidate set of transmission patterns is first identified through correlation operations. Based on this, a message-passing (MP)-based pattern detection algorithm is developed to iteratively estimate the posterior probabilities of transmission patterns, followed by the maximum a posteriori (MAP) estimation to obtain the precise pattern detection result. Furthermore, a joint pattern detection and data decoding algorithm based on the bit-wise SO information of polar decoder is investigated, where the posterior probability information provided by the polar decoder is exploited to refine the pattern detection and contribute to an improved accuracy. In addition, by leveraging bit-wise SO information of the successive cancellation list polar decoder, an MP-based iterative decoding algorithm is developed to significantly enhance the decoding performance. The proposed scheme simultaneously exploits the transmission gain of uncoupled-ODMA framework, the coding gain of polar codes in the short-blocklength regime, and the iterative decoding gain enabled by SO information, while the computational complexity is significantly reduced through the hierarchical detection framework. Simulation results demonstrate that the proposed scheme achieves strong robustness ...
Read the full abstract

All authors Tianya Li, Xiaoran Zhang, Nan Hu, Yongpeng Wu, Wenjun Zhang, Xiang-Gen Xia, Chengshan Xiao

Machine Learning

Comparing Classical and Quantum Machine Learning for Regression in High Energy Physics Collision Data

The classification and regression of particle collision events constitute a persistent computational challenge in experimental high energy physics, where large volumes of simulated data must be processed with both speed and precision. This work carries out a systematic comparison of four classical machine learning architectures, support vector machines (SVM), artificial neural networks (ANN), convolutional neural networks (CNN), and long short-term memory (LSTM) networks against their quantum counterparts: quantum SVM (QSVM), quantum neural networks (QNN), quantum CNN (QCNN), and quantum LSTM (QLSTM). All models are trained on simulated proton-proton collision events with electron-positron and muon-antimuon final states from the CERN Open Data portal, using transverse-momentum components as input features and transverse-momentum magnitude as the regression target. Classical architectures, and in particular the CNN and LSTM, achieve marginally better quantitative performance under current hardware and dataset constraints. Quantum models, however, reach competitive accuracy with substantially fewer trainable parameters: the QCNN reproduces the performance of the deep classical CNN using only four qubits and a circuit of depth three, pointing to a genuine parameter-efficiency advantage on near-term quantum devices. A baseline analysis confirms that the regression problem is non-trivial for shallow polynomial fits, supporting the relevance of the architectural comparison. These results characterize the trade-offs between classical and quantum approaches under realistic, resource-constrained conditions and provide a benchmark for future studies on actual quantum hardware.
Read the full abstract

All authors Tariq Mahmood, Zain ul Abidin, Itzel Luviano Soto, Alfredo Raya

Commutative Algebra

Diagonal F-threshold of binomial edge ideals

We compute the diagonal $F$-threshold of binomial edge ideals associated to graphs in the case of cycles, cycles with whiskers, bipartite graphs, and block graphs. Moreover, we provide general bounds for any graph.

Computer Vision

Attribute Token Arithmetic: Disentangled and Continuous Semantic Control for Visual Autoregressive Models

Autoregressive text-to-image generation has recently achieved remarkable progress, offering high-fidelity synthesis via a unified generative framework. However, fine-grained semantic control remains challenging due to the attribute entanglement and the misalignment between textual and fine-grained visual representations. In this paper, we introduce Attribute Token Arithmetic (ATA), a method that enables disentangled and continuous attribute control in visual autoregressive modelling. Inspired by the vector arithmetic property observed in word embeddings, ATA identifies semantic directions corresponding to visual attributes (e.g., aging, fatness, emotion) directly within the pretrained autoregressive latent space. These directions are learned from a single reference image, without model retraining or large-scale supervision. During generation, attributes can be continuously adjusted and compositionally combined through simple arithmetic operations with other attribute tokens. Extensive experiments demonstrate that ATA achieves identity-preserving, fine-grained, and multi-attribute adjustment, outperforming existing autoregressive editing baselines in controllability, generality, and computational efficiency. Our code will be available at https://github.com/Madaoer/ATA.
Read the full abstract

All authors Xindi Yang, Yicheng Wu, Cheng Zhang, Jianfei Cai, Tien-Tsin Wong

Data Structures and Algorithms

A Configuration-LP Framework for Connected $k$-Median Clustering

We study the \emph{connected $k$-median} clustering problem, a clustering problem that augments the classical $k$-median objective with connectivity constraints. We focus on the overlapping variant of the problem, where clusters are allowed to share vertices. In addition to a metric space $(V,d)$, the input contains a connected graph $G$ on the same vertex set $V$ of size $n$. The goal is to select at most $k$ centers $C$ and assign vertices to them so as to minimize the $k$-median cost (i.e., $\sum_{v\in V} d(v,C)$), subject to the constraint that each cluster induces a connected subgraph of $G$. Since the metric space and the connectivity graph are independent, the problem is significantly more challenging than standard clustering. Eube et al.~\cite{eube2025esa} showed that even the assignment version is $\Omega(\log n)$-hard to approximate and gave approximation algorithms with guarantees depending polynomially on $k$. We develop a configuration-LP-based framework that combines covering LP techniques with a rooted minimum-density oracle. For the assignment version, we obtain an $O(\log^2 n)$-approximation. For the general version, we develop a bicriteria framework that opens $O(k\log n)$ centers while achieving an $O(\log^2 n)$-approximation in cost. %Our results provide a different LP-based approach for handling connectivity constraints in clustering problems and demonstrate that configuration LPs, covering LPs, and rooted density oracles can be combined effectively to obtain approximation guarantees for clustering objectives under graph-theoretic constraints.
Read the full abstract

Computer Vision

Cyc3D: Evaluating Cyclic Structural Stability and Asset Usability in Image-to-3D Generation

Image-conditioned 3D generation has advanced rapidly, yet existing evaluation protocols largely judge rendered-view plausibility and semantic alignment, overlooking whether a generator forms a stable 3D interpretation and produces assets usable in graphics pipelines. We introduce Cyc3D, a multidimensional benchmark that evaluates image-to-3D generation along two complementary axes: Cross-View Object Consistency and Representation Quality. At the asset level, Cyc3D measures whether object identity remains semantically coherent across rendered viewpoints. At the model level, we propose View-Cycle Structural Consistency, a closed-loop render-regenerate-align protocol that repeatedly re-observes a generated asset from novel views and quantifies geometric, perceptual, and semantic drift across generations. To assess native asset usability beyond rendered appearance, Cyc3D further evaluates geometric structure, reference-image fidelity, mesh discretization and efficiency, and UV parameterization quality. Together, these diagnostics expose failures obscured by a single perceptual score and provide interpretable evidence of both model instability and representation defects. Experiments on five representative image-to-3D systems show that closed-source feed-forward models consistently outperform open-source optimization-based baselines in geometric fidelity, mesh quality, and cycle stability. Nevertheless, even the strongest methods achieve cycle-stability scores below 48, revealing a persistent gap between visually plausible generation and robust 3D object understanding.
Read the full abstract

Statistical Methodology

Parameter estimation in Conditional Sequential Monte Carlo algorithms through Particle Learning

In this work, we explore particle learning strategies for the joint estimation of static parameters and latent states within conditional sequential Monte Carlo (CSMC) algorithms. Building on this idea, we propose the p(parameter)-CSMC algorithm, which incorporates both parameter learning and ancestor sampling, leading to much better mixing properties compared to (particle) Gibbs sampling in settings where strong internal correlations may challenge effective exploration. We also include two applications in the context of a branching process model: one using synthetic data, where we estimate the infectivity profile while assuming the reproductive number to be known, and another using real data, where we address the joint inference of the reproductive number and the infectivity profile based on daily hospital incidence from the arrival of the SARS-CoV-2 lineage B.1.1.7 (Alpha) in Norway in February 2021. We show that, in these settings, performance is dramatically enhanced, with substantially faster mixing and markedly reduced autocorrelation compared with standard particle Gibbs.
Read the full abstract

Computer Vision

Task-State Adaptation with Prototype Memory for Multi-Task Dense Prediction

Vision foundation backbones provide strong representations for dense prediction, yet a single shared feature still needs to support tasks with different, image-dependent adaptation requirements. We propose MemMTL, a multi-task dense prediction framework that estimates a compact task state from global visual context and refines it through a learnable task-state prototype memory. The refined state is converted into task-conditioned expert logits and combined with token-level logits before sparse top-$k$ selection over a local expert bank shared by all tasks. A separate task-agnostic residual bank provides a common adaptation path, and both paths are added once to the backbone feature before task-specific prediction. We specify a matched evaluation protocol on NYUD-v2 and PASCAL-Context with SAM 3 and ViT-L backbones to measure predictive quality, computational cost, and the contributions of task-state conditioning, prototype retrieval, and sparse routing. The numerical record in the present working draft predates this canonical implementation and must be regenerated before it can support empirical claims.
Read the full abstract

All authors Yangyang Xu, Haobo Yuan, Yuzhu Wang, Duo Su, Xi Ye, Yibo Yang, Jun Zhu

Numerical Analysis

A Local Discontinuous Galerkin method for the modified Camassa–Holm equation

In this paper, we propose a local discontinuous Galerkin (LDG) method for the modified Camassa-Holm (mCH) equation that contains cubic nonlinearity and high-order derivative terms. Energy conservation and stability are obtained using the conservative and dissipative fluxes, respectively. The error estimate of the semi-discrete scheme is also established. Numerical examples verify that our theoretical findings are sharp and the proposed LDG method is capable of capturing the peakon solution of the mCH equation.
Read the full abstract

Mathematical Software

Performance Evaluation of Fast Fourier Transforms on Emerging RISC-V Hardware with Vector Extension Support

This manuscript presents a performance evaluation of Fast Fourier Transform (FFT) implementations on emerging processors supporting the RISC-V Vector Extension (RVV 1.0). By introducing juFFTe, a light-weight high-performance library for discrete Fourier transforms, it is demonstrated how effective vectorization of performance-critical FFT kernels can be achieved on RVV-enabled hardware. Comprehensive benchmarks on three RVV 1.0-ready processors, the SiFive X280, the X100 core of the SpacemiT K3 and the C920v2 core of the Sophon SG2044, reveal substantial performance improvements of juFFTe (https://github.com/FZJ-JSC/juFFTe) over the widely used FFTW3 library. Although RVV-enabled platforms show promising results at this stage of development, a comparison with AMD's Zen 5 architecture indicates that RISC-V needs further maturing to reach the performance of established micro-architectures.
Read the full abstract

All authors Daniel Seibel, Kaveh Haghighi Mood, Jayesh Badwaik, Prateek Chawla, Stepan Nassyr, Andreas Herten

Robotics

Deciding If, When, and Where to Replan for Robust Manipulation

Foundation-model (FM) based task and motion planning (TAMP) methods typically assume that the full scene is known before planning. In long-horizon manipulation, however, relevant objects may initially be hidden and only become observable as the robot interacts with the environment. We introduce Robust-TAMP, a task and motion planning framework that first decides whether a discovery needs a replan. If replanning is needed, the robot executes unaffected actions while the FM synthesizes corrective actions. These actions are inserted into the existing plan based on urgency, either executed immediately or deferred while preserving the remaining plan. We evaluate Robust-TAMP on 14 MuJoCo environments with hidden objects, blocked placements, articulated containers, and multi-step tasks, and on five real-world settings. Our proposed method completes 92.1% of simulated tasks, outperforming four baseline comparison architectures by 47.1 percentage points under the same settings. Ablations show that each component either raises success or lowers planner calls, planning time, and robot idle time. An extensive study across model sizes, text and vision inputs, reasoning modes, and prompting further shows that in-context examples help the planner follow multi-step procedures that zero-shot prompting struggles with. Our implementation code and project details are available at https://narendhiranv04.github.io/ROBUST-TAMP/.
Read the full abstract

All authors Narendhiran Vijayakumar, Puru Ojha, Nav Singhal, Girish Varma, Antony Thomas

Complex Variables

A Compactness Characterization of Strongly Symmetric Homeomorphisms

A self-homeomorphism $h$ of the unit circle $\mathbb{T}$ is strongly symmetric if it is absolutely continuous and $\log h'\in\text{VMO}(\mathbb{T})$. Let $P_h^-$ be the anti-analytic component of the pullback operator $P_h: F\mapsto F\circ h$ on $\text{BMOA}(\mathbb{D})$, where $\mathbb{D}$ is the unit disk. P. Jones proved $P_h$ is bounded on BMO if and only if $h$ is strongly quasisymmetric. Fan, Hu, and Shen showed that the strong symmetry of $h$ yields the compactness of $P_h^-$, and raised the question of whether the converse is true. We answer this question affirmatively, establishing that $P_h^-$ is compact if and only if $\log h'\in\text{VMO}(\mathbb{T}))$, which completes the VMO theory of the universal Teichmüller space.
Read the full abstract

Numerical Analysis

Conditioning and interpolation error bounds for second-order Stiefel retractions with closed-form inverses

Retractions provide a computationally efficient alternative to the Riemannian exponential and logarithm maps for practical data-processing tasks on manifolds. In particular, second-order retractions with closed-form inverse are well-suited for interpolation problems on manifolds. On the Stiefel manifold of orthogonal frames, there are only two retractions of this type: the Cayley retraction, which is second-order accurate under the canonical metric, and the recently proposed polar-light retraction, which is second-order accurate under the Euclidean metric. In this paper, we study the properties of these maps in the context of interpolation on the Stiefel manifold. To obtain explicit interpolation error bounds, we examine the conditioning of the retraction maps and their inverses. We show that the retractions are well-conditioned, and we derive interpolation error bounds similar to those of classical Euclidean interpolation. The inverse retractions are not well-conditioned in general, and we discuss how data can be mapped via an isometric group action to ensure stable computations. As with all retractions on compact manifolds, the inverse canonical Cayley retraction and the inverse polar-light retraction exist only locally, and we construct normal neighborhoods around any point in which either the inverse Cayley retraction or the invese polar-light retraction are guaranteed to be computable. As an application of the retraction maps, we consider Hermite interpolation, where the objective is to reproduce both sampled function values and derivative information. A numerical example demonstrates that retraction-based interpolation is competitive with classical methods based on Riemannian normal coordinates.
Read the full abstract

History and Overview of Mathematics

On the Egyptian knotted rope

The Egyptian knotted rope has been historically considered a measuring/geometric tool. A naive change in the way the rope is held to tighten it turns the rope into a primitive calculating tool — a sort of primitive abacus. The arithmetic skills of the knotted rope have a double interest. From an historical point of view, they fit perfectly with some of the basic ancient Egyptian computing techniques. From an educational point of view, they enhance the potential interest of the knotted rope as a useful manipulative in mathematical education.
Read the full abstract

Fluid Dynamics

How Surface Viscoelasticity Eliminates Satellite Drops

Satellite drops form widely during the breakup of liquid threads and constitute deleterious byproducts across a broad range of industrial technologies, yet their complete suppression has remained a longstanding challenge. Here, we experimentally report that surface viscoelasticity introduced by a small amount of bovine serum albumin can fully eliminate satellite drops, via modulating the localized spatiotemporal topology near pinch-off singularity. During the late thinning stage, surface shear viscosity counterbalances the capillary and stably anchors the thinning neck at the midpoint between the two primary beads, fundamentally precluding satellite droplet formation. We further propose a scaling law to describe the unique self-similar thinning behaviors dictated by surface viscosity. These results shed light on the thinning dynamics of liquid threads with surface rheology and offer a promising strategy to eliminate satellite drops in practical applications.
Read the full abstract

All authors Xiaocong Yang, Qingfei Fu, Lijun Yang, Bingqiang Ji

Computer Vision

CF-YOLO: Context-Aware Feature Refinement for Camouflaged Industrial Micro-Defect Detection

Automated detection of surface micro-defects on industrial components, such as copper tubes, is critically important for quality assurance but remains challenging due to the minute scale of anomalies and their visual camouflage against complex backgrounds. These factors lead to weak feature representations and high rates of false positives and missed detections. To address these issues, we propose a novel real-time detection framework designed for efficient context perception and feature refinement. Our method integrates a Context-Perception Aggregation Module (CPAM), which synergises large-kernel perception for macro-texture context and small-kernel aggregation for sharp boundary delineation, effectively breaking the background camouflage. Furthermore, a Feature Additive Refinement Module (FARM) employs a linear-complexity additive token mixer to globally verify and refine the representation of fine-grained anomalies, suppressing noise-induced errors. To support research in this domain, we introduce the Copper Tube Defect Dataset (CTDD), a manually annotated benchmark containing 1,847 images and 4,898 boundingbox defect instances from copper-tube inspection scenarios. Extensive experiments demonstrate that our detector achieves strong and consistent performance on CTDD, outperforming representative baseline detectors, including YOLOv11, by 2.2% in mAP@50 and 3.9% in Precision while maintaining real-time inference speed. This work provides a robust and efficient solution for high-precision industrial inspection, bridging the gap between contextual understanding and detailed feature analysis. Our code and model are available at: https://github.com/Yu-Xinda/CFYOLO-Context-Aware-Feature-Refinement-for-Camouflaged-Industrial-Micro-Defect-Detection
Read the full abstract

All authors Xinda Yu, Kunxin Zheng, Chunan Yu, Qingbo Song, Hao Xiao, Ying Zang, Jie Liu

Computer Vision

VersaGauss: A Versatile Framework for Generating Multiphase Dynamics with 3D Gaussians

Recent progress has been made in 3D Gaussian representation for reconstruction, generation, and physical simulation. However, current approaches mainly concentrate on physics-based dynamic generation of solid objects and only handle single-phase collision interactions. We introduce VersaGauss, a unified framework for generation, simulation, and rendering that supports versatile physics-based dynamic generation, particularly for multiphase interactions. Our system takes a few images as input and produces a realistic, physics-driven 3D dynamic scene with multiple objects. To optimize the Gaussian kernel distribution, we develop a particle pruning algorithm. We also propose the Coupled Multiphase Point Method (CMPM) to effectively model and generate multiphase interactions. Additionally, harmonic interpolation within CMPM and a Gaussian evolution strategy are introduced to achieve realistic fluid rendering. Extensive experiments demonstrate that our framework can simulate interactions among various materials such as fluid, rubber, sand, snow, and others. Code is available at https://github.com/Elowen-surj/VersaGauss.
Read the full abstract

All authors Ruijie Su, Lingxiao Yang, Xiaohua Xie, Jianhuang Lai

Information Theory

Finite Sample Bounds for Composite Hypothesis Testing

We investigate composite binary hypothesis testing in the finite sample regime under asymmetric error constraints. Using Rényi divergences, we derive explicit achievability and converse bounds for the optimal Type II error. When the Type I error is constrained to decay exponentially with sample size, the bounds identify a phase transition and yield a strong converse above it. In the composite problem, the phase transition threshold is given by the joint KL projection over the alternative and null classes. Achievability is obtained through a joint Rényi projection whose log likelihood ratio defines a single test with uniform error control over both hypothesis classes, without requiring the projected pair to be least favourable. For compact convex classes with full support on a finite alphabet, we determine the exact error exponents on both sides of the transition and show that the achievable exponent is attained at a unique Rényi order. The same framework recovers the fixed Type I composite Chernoff–Stein exponent and yields a polynomial refinement of the finite sample achievability result. We further identify conditions under which the projected pair is least favourable at finite sample size.
Read the full abstract

Artificial Intelligence

SEPO: Evidence-Grounded Prompt Optimization via Structural Editing

Existing API-only prompt optimisers are often described as interpretable, but in practice, this usually means only post-hoc inspectability: each iteration still rewrites the prompt as one opaque string, leaving a trace of full-prompt diffs rather than localisable, machine-readable edits. This paper introduces SEPO (Structural, Evidence-grounded Prompt Optimization), a multi-trajectory prompt optimiser centred on edit-effect lineage feedback. Rather than treating each iteration as an isolated whole-prompt rewrite, SEPO locally edits stable, typed units in a two-layer prompt schema, links the target and realised structural operations of each edit to the examples it newly fixes or breaks, and carries this edit-effect record forward to guide later architect calls on the same search branch. This makes prompt optimisation addressable, attributable, and actionable. Across a 14-task held-out suite, SEPO improves over the strongest baseline, GEPA, by 3.1 pp on Llama-3.1-8B-Instruct and 2.2 pp on Qwen3-8B, reaching 61.9% and 73.3% macro accuracy. SEPO also lies on both the optimisation-time and test-time Pareto frontiers, spending 2.9M optimisation tokens versus 4.1M for GEPA and producing prompts over 5x shorter.
Read the full abstract

All authors Xiaoyu Ma, Haoyue Liu, Yiwen Li, Jionghao Zhu, Zhichao Wang, Ye Chen, Xiaoying Tang

Solar and Stellar Astrophysics

Extremely Low Mass Ratio Contact Binaries. III. Photometric and Spectroscopic Investigations of Eleven Systems

We present photometric and spectroscopic investigations of 11 totally eclipsing contact binaries with mass ratios below 0.15, classifying them as extremely low mass ratio contact binaries. The ground-based multiband light curves were modeled with PHysics Of Eclipsing BinariEs to derive the photometric parameters of these systems. The TESS light curves of J011323 and J002747 show pronounced asymmetries and continuous variations. Markov Chain Monte Carlo modeling suggests that these variations are related to longitudinal migration of spots on the primary components. Spectral subtraction of the LAMOST spectra reveals excess chromospheric emission in six systems, while no detectable excess emission is found in the other five. The O$-$C analysis indicates secular period increases in six systems and secular decreases in five systems. We estimated their orbital angular momenta and performed a dynamical analysis. {Within our adopted semi-analytical framework without energy transfer, the formation of these observed systems requires additional angular momentum loss beyond saturated magnetic braking and gravitational radiation, but this requirement could be modified by different assumptions on mass transfer or radius evolution.
Read the full abstract

All authors Youmo Lai, Kai Li, Raul Michel Murillo, Difu Guo, Liheng Wang, Xiang Gao, Han-ning Zhang, Xing Gao, Guo-You Sun

Artificial Intelligence

Learning to Allocate Incentives for Incentivized Advertising via Offline Model-Based Reinforcement Learning

Complete your ad view and grab a 5-cent bonus! In incentivized advertising, a platform promises users a bonus before observing downstream ad revenue, encouraging them to click and complete ads. It must balance the incentive promised in advance against the revenue realized afterward: insufficient incentives forfeit monetization opportunities, whereas excessive incentives reduce net profit. Because current incentives may also shape user expectations and future engagement, incentive allocation is a sequential decision problem with delayed revenue, cost sensitivity, and carryover effects. Existing work has not studied decision-making algorithms for this setting. Auto-bidding assumes available ad opportunities, while targeted promotion optimizes incentives outside the ad monetization pipeline. We formulate the problem as an MDP and develop an offline model-based RL framework for cost-controllable sequential incentive allocation. It learns a world model of user feedback and ad revenue, then performs conservative policy optimization. An independent counterfactual scorer evaluates each learned policy on held-out logs, enabling pre-launch selection without costly online exposure. Experiments on large-scale industrial data and online A/B tests show that the scorer provides a stable offline signal. The deployment path from causal inference to offline RL and then Offline-MBRL further validates the framework: MB-IQL improves per-user net profit by 7.96% over TD3+BC, whereas reverting to plain IQL reduces it by 6.56% (both \(p<0.0001\)).
Read the full abstract

All authors Zilin Zhao, Han Yang, Tianpei Yang, Fangsheng Huang, Yanfei Cui, Kan Peng, Yi Li, Yiming Zong, Hao Zhang, Yinsong Xue

Human-Computer Interaction

User Preferences for UI Anchoring in MR: Effects of Task Mobility and Interface Properties

Anchoring - the choice of frame of reference for mixed reality (MR) interface elements - is a critical design decision involving trade-offs between accessibility, interaction comfort, and visual interference. Despite its importance, user preferences for anchoring across different mobility contexts and interface properties remain poorly understood, as prior work has largely focused on specific tasks or fixed interface configurations. We address this through a mixed-methods user study in which participants configure anchoring strategies across different mobility conditions and interface types. Combining behavioral analysis with structured qualitative inquiry, we analyze how participants select and reason about anchoring modes. Our results show a clear transition from world-anchored interfaces in stationary contexts to body-anchored interfaces during locomotion. However, no single body anchor consistently dominates, highlighting the personal nature of anchoring strategies. Our qualitative analysis reveals the factors users consider in their anchoring decision, including interface accessibility, stability during interaction, visual clutter, and individual mental models. These findings inform the design of adaptive and controllable MR interfaces and highlight the importance of supporting user customization.
Read the full abstract

Computer Vision

A Controlled Audit of Architectural Complexity in Uncertainty-Aware Multi-Organ Ultrasound Classification

Multi-organ ultrasound classifiers increasingly combine attention, mixture-of-experts routing, uncertainty gating, and evidential deep learning (EDL) objectives to address heterogeneous anatomy and acquisition. Yet a plausible design rationale does not by itself establish that an added component improves the trained system. We contribute a controlled complexity-audit framework, applied to the deployment decision between the maximal evidential candidate Full-EDL and simpler alternatives. Six candidates were evaluated on the primary dataset and three in an internal replication, using ten matched seeds, frozen image-level partitions, capacity- and optimisation-aware comparisons, symmetric temperature scaling, paired decision rules, and a separate out-of-distribution (OOD) veto. Retaining Full-EDL did not establish a reliable macro-F1 gain on either dataset, while the simplified alternatives remained inconclusive under the non-inferiority margin. Simple cross-entropy with temperature scaling (Simple-CE+TS) met the calibrated negative log-likelihood criterion on both datasets and showed favourable selective-risk ordering. The raw calibration advantage of evidential training disappeared after temperature scaling and did not recur on the second dataset. The gate had negligible observable influence at the audited checkpoints, and deleting the Full-only chain revealed no stable task or calibrated-loss benefit. Simple-CE nevertheless triggered the OOD veto against the fetal probe but not the lung probe, precluding an unconditional OOD-safety claim. We therefore selected Simple-CE+TS for the evaluated in-distribution objective while retaining Full-EDL as the maximal reference. Components should earn retention through functional and retraining-based evidence, and calibration and distribution-shift reliability should be evaluated separately.
Read the full abstract

All authors Yang Song, Pengbo Sun, Shichang Feng, Ye Zhu, Xin Xu, Ziran Wang

Artificial Intelligence

WeAgent-MMSearch: Native Text-Vision Interaction for Multimodal Search Agents

Multimodal search agents extend parametric knowledge with newly emerging and long-tail evidence from the open web. Yet many existing agentic search environments often expose retrieved evidence only as text and omit tool-returned images from subsequent context, reducing visually grounded trajectories to text-only reasoning. Long-horizon interaction also compounds tool-call, response-length, timeout, and budget failures, which can discard salvageable trajectories, waste rollout computation, and disturb policy updates. To address these issues, we introduce WeAgent-Harness, a multimodal agentic harness that supports native text-vision interaction and runtime recovery. Retrieved images receive persistent disk references, allowing the model to inspect, process, and cite them throughout the trajectory. Based on this harness, we develop WeAgent-MMSearch, an integrated system spanning data construction, agentic post-training, and multimodal rollout. For data construction, a strong MLLM uses WeAgent-Harness to discover, synthesize, and verify MMSearch-style tasks and collect expert trajectories. During post-training, our Failure-Aware GSPO (FA-GSPO) recovers salvageable abnormal rollouts and filters invalid ones to improve bounded multimodal planning and search. We also introduce VisTarget-Bench, a 150-task human-verified benchmark that pairs each question with a held-out target image, distinguishing image-retrieval failures from visual-perception failures. Evaluation on VisTarget-Bench and seven public benchmarks shows that agentic post-training improves the average score by 19.22 points, enabling our model to outperform similarly sized open-source models and rival models with roughly ten times its parameter count.
Read the full abstract

All authors Zongkai Liu, Hui Zhang, Liqiang Niu, Zhen Cao, Han Li, Juntao Liu, Wenchao Chen, Chengduo Zhao, Chao Yu, Fandong Meng

Analysis of PDEs

Large-diffusion dynamics for a planar Neumann heat equation with exponential nonlinearity

We study the Neumann problem $u_t-\varepsilon\Delta u=e^u-1-au\ (a>1)$ on a smooth bounded domain $\Omega\subset\mathbb{R}^2$. For the spatially homogeneous problem, $0$ is stable, the positive equilibrium $\xi_a$ is unstable, and solutions starting above $\xi_a$ blow up in finite time. Although finite-time blow-up persists at every diffusivity, we show that sufficiently large diffusion recovers this scalar trichotomy uniformly on every bounded $H^1$ ball, and that blow-up occurs precisely when the spatial mean crosses $\xi_a$. For initial data with $\|u_0\|_{H^1}\le R$ and spatial mean at most $\xi_a-\delta$, let $\varepsilon_{\mathrm{unif}}(R,\delta)$ denote the uniform diffusion threshold above which all such solutions are global and converge to $0$. We prove $\log \varepsilon_{\mathrm{unif}}(R,\delta)=R^2/(8\pi)+O(\log R)$ as $R\to\infty$. The domain-independent coefficient $1/(8\pi)$ arises from the sharp mean-zero Moser–Trudinger inequality. A matching lower bound is obtained from boundary-concentrating Moser profiles via a localized Kaplan argument.
Read the full abstract

Computational Engineering

A Compact Selective State-Space Model for Cross-Sectional Stock Return Ranking from Raw Intraday Bars

We present STRATA (Staggered-Timescale Residual Architecture), a 244,633-parameter sequence model that maps five trading days of raw five-minute bar and order-book data directly to a next-day cross-sectional return ranking, with no hand-crafted features. The raw-input setting has a structural obstacle: price series are non-stationary and differ across stocks by orders of magnitude, so a model easily latches onto price level rather than dynamics. STRATA addresses it with a stem of five branches–four learnable causal depthwise convolutions whose effective kernels are initialised to sum to zero, plus one cross-field linear contrast–followed by four selective state-space blocks whose decay biases are staggered across the stack and a four-path readout. Because a score that merely tilts toward common style factors scores well on raw rank correlations, every model's scores are residualised against eight price-volume style factors before any metric is computed. Trained on four years of data covering roughly one thousand mid-capitalisation Chinese A-shares and evaluated once on a held-out year, STRATA reaches a style-residualised rank information coefficient of 0.0728 (information ratio 1.128, signal long-short Sharpe 12.85), ahead of six parameter-matched sequence baselines on all four reported metrics; on rank IC the day-level paired gap against every baseline is significant at p < 0.001, and among the arms competitive on predictive power STRATA's scores are the least explained by the controls. The close-to-close target opens before the score exists: measured instead from the first executable price, the decile spread is indistinguishable from zero, while the ordering of the seven architectures is unchanged and STRATA's margin widens.
Read the full abstract

All authors Mingju Chen, Enze Zhang, Annan Li, Yui Lo, Xiaomin Yuan, Kaiming Yu, Jinhui Ren, Yuanhang Liu

Disordered Systems and Neural Networks

Landau theory of quenched criticality in linear in-context learning

In-context learning (ICL) allows a pretrained model to infer a new task from examples supplied in its prompt without updating its parameters. In linear models of ICL, the prediction error develops a double-descent singularity when the number of pretraining samples becomes comparable to the number of learnable parameters. We formulate this interpolation singularity as a critical phenomenon of a quenched disordered system. By comparing annealed and quenched descriptions of the same linear ICL model, we identify the connected sample-to-sample fluctuations of the learned parameters as the microscopic origin of the singular error. A Landau potential is constructed by integrating the cavity self-consistency equation for the renormalized ridge parameter $\xi$. The role of (magnetization) order parameter is played by $\xi$, while the bare ridge parameter $\lambda$ becomes its conjugate magnetic field. The normalized sample complexity $\tau$ acts as a temperature and the double-descent singularity occurs at the critical temperature $\tau_c =1$. The Landau susceptibility is precisely the quantity that diverges in the fluctuation contribution to the prediction error. The order parameter is closely related to the fraction of zero eigenvalues of the empirical relaxation matrix in the ridgeless limit, which define flat directions in the learning dynamics. The Landau theory is generically cubic in the order parameter with critical exponents $(\beta_{\rm cr},\delta_{\rm cr},\gamma_{\rm cr})=(1,2,1)$. In the large-context regime, there appears a pseudogap-like regime characterized by suppressed order parameter. Predictions of the Landau theory are independently confirmed from numerical solutions of the original learning problem with good quantitative agreement. Our results pave the way for solid statistical-physics understanding of the interpolation criticality in linear in-context learning.
Read the full abstract

All authors Daesik Kim, Sumin Choi, Hyojae Jeon, Jung Hoon Han