Peer Revenue Publish or profit

Papers

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

All of arXiv

Sunday 6 September

Analysis of PDEs

A quantitative convergence rate for torsional creep to the distance function as p tends to infinity

We prove that the Dirichlet $p$-torsion function $u_p$ converges to the distance to the boundary $d$ at the rate $O(1/p)$ in the uniform norm, on every bounded domain and with a constant depending only on the dimension and the diameter. The upper bound comes from a radial barrier with its pole at a boundary point, which is an admissible comparison function for $p>n$ and needs no boundary regularity; the lower bound comes from an inscribed ball. On the ball the error equals $(1+\log n)/p+O(p^{-2})$, so the order $1/p$ cannot be improved in general. Under a uniform exterior ball condition an annular barrier gives $u_p\le K_\Omega^{1/(p-1)}d$ for every $p>1$, with $K_\Omega$ explicit in the dimension, the diameter and the exterior radius; on convex sets the constant is the diameter, and a multiple of $d$ is a supersolution whenever $-\Delta d$ has a positive distributional lower bound. On $C^2$ domains, the same barrier and the classical gradient maximum principle give $\norm{\nabla u_p}_{L^\infty}^{p-1}\le K_\Omega$. When $-\Delta d$ is a measure of finite total variation, which we prove for $C^1$ domains with a uniform exterior ball, the gradients converge in $L^q$ at the rate $O(p^{-1/2})$ for $q\le2$ and $O(p^{-1/q})$ for $q\ge2$; these exponents are not claimed to be sharp. The explicit ball profile shows that the gradients do not converge uniformly.
Read the full abstract

Differential Geometry

A Counterexample to Yau's Conjectured Asymptotic Scalar-Curvature Integral Bound

A complete one-ended three-manifold with strictly positive Ricci curvature is constructed such that $$ \limsup_{R\to\infty}\frac1R\int_{B(p,R)} Scal\,dV=+\infty. $$ The construction combines an explicit toric lens carrying a large scalar-curvature integral with a three-dimensional angular pair of pants and an adaptive sequence of hybrid blocks.
Read the full abstract

Mesoscale and Nanoscale Physics

Emergent Chiral Metal Phase in Compressible Quantum Hall Fluids

We report transmitted conductance measurements between a source and reflection-less contacts connected to a compressible quantum Hall fluid with filling fraction $\nu$. We observe that total sum of transmitted conductances universally approaches Hall conductance $\nu(e^2/h)$. The universality of this sum rule is established experimentally across integer and fractional quantum Hall regimes, remaining invariant under variation in temperatures, sample geometries, material qualities and quasi-particle interactions. Chiral transport in compressible quantum Hall fluids, characterized by suppressed dissipative transport with a distinct handedness, is confirmed by floating contact measurements. Consequently, this sum rule emerges as a conduction law of the chiral metal phase. Theoretically, we argue that time-reversal-symmetry breaking under a strong magnetic field within this chiral metal gives rise unidirectional trajectories of carriers in a nearly flat potential landscape with point-like disorder potentials, a regime realized when the screening length is smaller than the magnetic length. Within this chiral framework, longitudinal resistance does not originate from bulk dissipation but primarily from the equilibration of electrochemical potentials at the contacts. Our study introduces a new paradigm of chiral transport across a broad class of gapless two-dimensional systems characterized by short-range screening and broken time-reversal symmetry.
Read the full abstract

All authors Suparna Sahoo, Suvankar Purkait, Pooja Agarwal, Tanmay Maiti, Sourin Das, Vladimir Umansky, Biswajit Karmakar

Classical Analysis and ODEs

A counterexample to the Gowers $U^k$ uncertainty conjecture for $k\ge 6$

The Donoho–Stark uncertainty principle asserts $N^d\le|E|\,|\Sigma|$, and the additive energy uncertainty principle of Aldahleh–Iosevich–Iosevich–Jaimangal–Mayeli–Pack refines it to $1\le|E|\cdot\|1_\Sigma\|_{U^2}^{4/3}$. It has been conjectured that the natural higher-order analogue \[ 1\le |E|\cdot\|1_\Sigma\|_{U^k}^{2^k/(k+1)} \] holds for every $k\ge 2$, the coset case giving equality. We show that this fails for every $k\ge 6$. The counterexample is the two-point signal $f=\delta_0-\delta_1$ on $\mathbb{Z}_3$, for which the left-hand quantity equals $2/3(2(k+1))^{1/(k+1)}$; this is $<1$ precisely when $k\ge 6$, and tends to $2/3$.
Read the full abstract

Computer Vision

Selective Knowledge Control for Continual GUI Agent Learning over Application Streams

Continual learning is a crucial capability for Graphical User Interface (GUI) agents to adapt to evolving applications while retaining knowledge acquired from previous applications. Such application streams pose a challenging knowledge modeling problem: new applications often share underlying knowledge with past ones, yet also introduce specific knowledge that must not interfere with historical knowledge. In this paper, we propose activation-conditioned selective knowledge control, a lightweight method that achieves selective knowledge retention via neuron-level gradient manipulation. Our method maintains a compact historical knowledge state to protect highly activated MLP neurons that preserve previous knowledge. When a new application arrives, it performs real-time gradient surgery conditioned on forward activation. Concretely, the protected neurons are categorized into two types: unactivated neurons holding specific knowledge, whose gradients are truncated to prevent interference; and activated neurons holding shared knowledge, whose gradients are orthogonally projected to preserve stability while enabling adaptation. After each application stage, newly identified critical neurons are merged into the historical state for future learning. Empirical evaluations on multi-app sequential benchmark demonstrate that our method effectively mitigates catastrophic forgetting on prior applications while sustaining robust adaptation to new ones.
Read the full abstract

All authors Zirui Shang, Xin Shu, Yang Liu, Zhi Gao, Xinxiao Wu, Lifeng Fan

Statistics Theory

Bergsma–Dassios sign covariance with ties: a nonnegative decomposition and sharp bounds

We construct tie-symmetrised extensions $\widetilde D$ and $\widetilde R$ of the unnormalised Hoeffding and Blum–Kiefer–Rosenblatt functionals $D$ and $R$ and prove, for every real-valued bivariate law, the exact nonnegative decomposition $ \tau^{*}(X,Y)=12\widetilde D(X,Y)+24\widetilde R(X,Y), \qquad \widetilde D,\widetilde R\geq0, \qquad \widetilde R(X,Y)=0\quad\Longleftrightarrow\quad X\perp\!\!\!\perp Y. $ For atomless margins the components reduce to $D$ and $R$, whereas in the presence of ties the corresponding classical identity $\tau^{*}=12D+24R$ can fail. The components arise from the Hoeffding projections of a symmetrised pair kernel. For the four strict/non-strict boundary versions $D_{\epsilon,\eta}$ and $R_{\epsilon,\eta}$, we establish the sharp comparisons $ 9\widetilde D\geq\sum_{\epsilon,\eta}D_{\epsilon,\eta}, \qquad 9\widetilde R\geq\sum_{\epsilon,\eta}R_{\epsilon,\eta}. $ Consequently, $\tau^{*}\geq0$ for every bivariate law, and the Bergsma–Dassios conjecture is settled: $\tau^{*}=0$ if and only if $X\perp\!\!\!\perp Y$. The boundary comparisons also yield the universal bound $\tau^{*}\geq(8/3)R$. Finite-table arguments, including an exact sum-of-squares certificate, establish the boundary inequalities, and weak-order quantisation transfers them to arbitrary laws. The factor $9$ in each comparison and the coefficient $24$ in $\tau^{*}\geq24\widetilde R$ are sharp. The usual permutation test is consistent against every fixed dependent alternative, without assumptions on the margins.
Read the full abstract

Quantum Physics

Low-Depth Random Unitaries without Ancillae

Random unitaries are fundamental to quantum information and many-body physics, with widespread applications ranging from quantum learning and metrology to device benchmarking. A central pursuit is to minimize the space and circuit depth required to generate them. However, existing methods for generating low-depth random unitaries rely heavily on an extensive number of ancillary qubits, imposing severe spatial overhead. In this work, we prove that random unitaries can be generated in optimal depth without ancillae. For multiplicative-error approximate $k$-designs on $n$ qubits, our circuits achieve a depth of $\widetilde{O} (k) (\log n)^{1/\delta}$ on $\delta$-dimensional architectures and $\widetilde{O}(k) \log \log n$ with all-to-all connectivity. Furthermore, by introducing a general exactification lemma, we lift our construction to optimal-depth exact $k$-designs, yielding an exponential resource reduction over state-of-the-art exact constructions. Our results minimize the space-time costs for a wide range of quantum protocols.
Read the full abstract

Computation and Language

ProcArena: A Multi-Scenario Benchmark for LLMs on Direct and Interactive PL/SQL Development from Natural Language

Large language models (LLMs) have shown strong potential for translating natural-language (NL) requirements into PL/SQL programs, attracting increasing attention from the database community. However, existing NL-to-PL/SQL efforts primarily focus on directly generating PL/SQL from complete NL requirements. In practice, PL/SQL development involves diverse scenarios, such as from-scratch development, code modification, debugging, and optimization, and may require either direct generation or multi-turn interaction. Yet, no comprehensive benchmark evaluates multi-scenario, direct and interactive, and multi-dialect NL-to-PL/SQL development. In this paper, we present ProcArena, an execution-based benchmark covering both Direct and Interactive modes. ProcArena comprises 3,998 executable tasks over 157 databases, spanning nine development subscenarios in PostgreSQL and Oracle. We construct challenging Direct tasks through Iterative Logic Enhancement and scenario-specific adapters, and derive paired Interactive tasks through Knowledge Integration and Requirement Perturbation while preserving executable targets. We further design a controlled Solver-User Simulator protocol that allows models to clarify user intent and inspect the database environment without exposing hidden execution feedback. Evaluating seven language models, we find that the best average scores are only 62.2% and 57.8% in Direct and Interactive, respectively, demonstrating that realistic NL-to-PL/SQL development remains challenging, particularly in interactive settings.
Read the full abstract

All authors Hang Zhang, Chaokun Wang, Yuzhi Pan, Ziyao Zhong, Shuo Cao, Yue Xue, Zeyu Huang, Xingwei Zhou, Fang Niu, Bofan Xie, Guanchen Ge, Leqi Zheng, Ziyang Liu, Xiannian Cao, Pengcheng Ge

Probability

Shifted Anticoncentration for Real Gram Hafnians and Symmetric Gaussian Hafnians

We prove a uniform shifted anticoncentration theorem for the hafnian of a real Gaussian Gram matrix under an explicit condition on the row dimension. After normalization by its root mean square, the law has a bounded continuous density, maximal at zero, and every interval has probability bounded by an explicit coefficient times its radius. Under suitable growth conditions on the row dimension, this coefficient grows at most polynomially in the hafnian order, meaning half the dimension of the Gram matrix. We also compute the exact second moment. The proof exploits the perfect matching structure, combining conditional Gaussian representations, row suspension, and bilinear interpolation to control an inverse moment of the conditional variance. At fixed hafnian order, a rescaled limit as the row dimension grows yields corresponding bounds for the hafnian of a real symmetric Gaussian matrix with independent entries above the diagonal.
Read the full abstract

Functional Analysis

Density and Spectral Criteria for Universal Nonuniform Sampling of Positive Operator Orbits

We characterize locally finite sets \(T\subset[0,\infty)\) that preserve exact observability from nonnegative integer times for every bounded positive operator \(A\) and bounded observation operator \(C\). The Stein identity reduces universality to uniform upper and lower bounds on radial Stein–Pick cones over all finite spectral models. Writing \(N_T(R)=\#(T\cap[0,R])\), we prove that universal Bessel preservation is equivalent to \(N_T(R)=O(R)\). The conditions \(0\in T\) and \(N_T(R)\asymp R\) characterize universal observability preservation under \([A,C^*C]=0\), as well as uniform bound preservation for each fixed number of spectral values. However, we construct a clustered set satisfying these conditions whose optimal sampled lower bounds tend to zero as the spectral count grows, despite fixed integer observability bounds. The same set destroys the frame property of a singly generated positive diagonal Carleson frame while preserving its Bessel property. When natural density exists, universality is equivalent to \(0\in T\) and \(0<d(T)<\infty\). More generally, containing zero and a subset of positive finite natural density suffices under linear upper counting. For sets containing zero, universality is invariant under sublinear differences of counting functions. For general normal operators, universal Bessel preservation is instead equivalent to uniformly bounded counts on unit intervals; under a fixed logarithmic sector condition, it is again characterized by linear upper counting.
Read the full abstract

Computational Physics

A Sparsity-Promoting Electromagnetic Inversion Method Regularized by $\ell_1 / \ell_2$-Norm of the Model Gradient

A nonlinear EM inversion method regularized by $\ell_1 / \ell_2$-norm of the model gradient is proposed. The $\ell_1 / \ell_2$-norm, defined as the ratio of $\ell_1$-norm to $\ell_2$-norm, exhibits a scale-invariant property that enables it to more accurately characterize sparsity in the solution compared with the conventional $\ell_1$-norm. To address the nonconvexity and nonsmoothness introduced by the quotient structure of $\ell_1 / \ell_2$-norm, the inversion problem is reformulated and solved using the alternating direction method of multipliers, resulting in an efficient optimization algorithm comprising five sub-steps. The Gauss–Newton method is incorporated into the first sub-step to linearize the nonlinear inversion. The proposed method is validated by a series of numerical examples using both synthetic and experimental datasets, and is compared against standard regularization methods such as Tikhonov and total variation. The results demonstrate that the proposed method yields superior reconstructions of permittivity profiles, particularly in preserving sharp edges and suppressing artifacts, without incurring additional computational cost. Furthermore, the method exhibits strong robustness to measurement noise and reduced sensitivity to the choice of the regularization weight.
Read the full abstract

Analysis of PDEs

On solutions of the modified Helmholtz equation in a planar domain

A criterion for the convexity of a two-dimensional domain is proved in terms of the solution of a boundary value problem for the modified Helmholtz equation.

Robotics

Knowledge-Guided Hierarchical Policy Learning for High-Precision Cylindrical Assembly under Tight Tolerances

A hybrid hierarchical learning framework is proposed to achieve high-precision assembly of 170mm cylindrical components with tolerance of 0.1mm. The lower-level network integrates expert experience through Behavior Cloning (BC), giving the robot human-like intuition, and incorporates the Twin Delayed Deep Deterministic Policy Gradient (TD3) algorithm to enhance training stability and robustness. The upper-level network dynamically adjusts the lower-level decisions based on heuristic rules, ensuring flexibility in operations. A simulated model is constructed to learn before transferring to real world. An efficient and safe training is allowed. Comparisons show that the reward curve converges within 500 episodes, indicating high learning efficiency. It also demonstrates better adaptability to initial conditions and pose errors, achieving satisfactory success rates even under extreme conditions. Moreover, the method exhibits good stability under Gaussian noise interference. In the real world, the assembly trajectory of the cylindrical segment shows smoother motion and less fluctuation.
Read the full abstract

Machine Learning

Not Just Oversmoothing: Detecting the Echo Chamber Effect in Graph Neural Networks

Oversmoothing is a well-known failure mode of Graph Neural Networks (GNNs). However, most existing diagnostics rely on global aggregation measures that fail to capture the heterogeneous dynamics of message passing. Real-world graphs exhibit pronounced community structure, and message passing operates on two timescales, with representations collapsing rapidly within communities and slowly across them. This creates a critical gap in which intra-community representations can become indistinguishable while inter community separation persists, a failure mode that we refer to as the Echo Chamber Effect. To quantify this effect, we introduce the Echo Chamber Index (ECI), which stratifies pairwise distances by community membership and reveals when global energy diminishes while inter-community separation persists. ECI further shows that feature retention mechanisms can preserve the echo chamber under the conditions of our theoretical analysis. The consequences depend on label structure: when communities align with classes, the echo chamber can sharpen node classification, whereas when they do not, the same collapse makes classification provably harder. Motivated by this analysis, we propose Community-Aware Split Propagation (CASP), a lightweight plugin that decouples intra- and inter-community aggregation and learns their balance from label structure. CASP improves diverse backbone GNNs across most evaluated homophilic and heterophilic settings.
Read the full abstract

All authors Asela Hevapathige, Ahad N. Zehmakan, Asiri Wijesinghe, Saman Halgamuge

Systems and Control

Dynamic System Emulation: Fixed Wing Dynamics on a Multicopter

This work presents a control framework that enables a multicopter equipped with a two-axis gimbal to emulate the flight dynamics of a fixed-wing aircraft. The goal is to provide an operationally simple platform for training and simulation that avoids the aerodynamic constraints of fixed-wing vehicles, such as minimum airspeed and nonholonomic constraints. A state-input mapping between the two platforms is derived using dynamic feedback linearization. The framework is evaluated on representative fixed-wing manoeuvres. Results show high-fidelity emulation under nominal conditions. While evaluations are conducted in simulation, the approach establishes a practical path toward hardware deployment for pilot training, autonomy research, and controller benchmarking.
Read the full abstract

Machine Learning

Role-Specific Predictive Geometries for Nonstationary Multivariate Graph-Signal Forecasting

Forecasting multivariate graph signals is challenging when node-level trajectories are nonstationary but stable relations persist across nodes and features. In an error-correction representation, long-run equilibrium restoration and short-run transient propagation represent different predictive roles and need not share a common cross-feature geometry. We introduce role-specific predictive geometries in which directed Long relations act on estimated equilibrium coordinates, whereas directed Short relations act on lagged differences. Matrix-valued Long responses mix equilibrium coordinates before graph propagation, while Short responses use graph-filtered transient designs; a direct multi-horizon estimator couples forecast corrections across adjacent horizons. Temporal cross-fitting and Frisch-Waugh-Lovell partialling-out give selected edges a conditional predictive interpretation relative to a graph-temporal backbone. The Long operator remains right-factorized through the equilibrium subspace and therefore annihilates source common-trend directions. Controlled experiments recover all planted Long relations (20/20), all planted Short relations (20/20), and both role families in every Dual realization (10/10). Across four real-world benchmarks, the proposed predictor improves on the G-VARMA backbone in three datasets, with all 25 fold-horizon comparisons favorable on the five-fold financial benchmark.
Read the full abstract

Algebraic Topology

Homotopical Nilpotency and Homology Nilpotency: A Dimension–Connectivity Bound

Let $X$ be a $(q-1)$-connected rational space of finite type, where $q\ge2$, with homotopical nilpotency $nil_h(X)=n\ge1$. If $H^{>N}(X;Q)=0$ and $N\le q(n+3)-3$, we prove that $Hnil(X)=n$. More precisely, the sufficient bound is $N\le a_n(M_X)+2q-3$, where $a_n(M_X)$ is the first nonzero internal cohomology degree of $(M_X^+)^{n+1}$ in the minimal model. A family of examples proves that the constant $-3$ in this refined bound is optimal; optimality of the uniform bound is not asserted. The proof uses two stages of adjoining primitives to an ideal of the fixed minimal model.
Read the full abstract

Graphics

Skinned Motion Retargeting via Artifact-driven Kinematic Prior Refinement

Motion retargeting aims to transfer a source motion to target characters with different skeletal structures, proportions, and body shapes. Although recent neural retargeting methods have improved flexibility across diverse skeletons, target-side geometric artifacts such as self-penetration remain difficult to resolve. Specifically, existing geometry-aware approaches often rely on fixed skeleton templates or implicit geometry-conditioned prediction, requiring a single network to account for target geometry deformation, detect target-side artifacts, and predict the corresponding correction from target geometry alone, which limits their ability to generalize across diverse skeleton structures and body shapes. In this paper, we present a geometry-aware motion retargeting framework that explicitly connects artifacts observed in the posed character geometry to motion refinement while preserving the flexibility of skeleton-agnostic neural retargeting. Our method first learns a motion embedding shared across different skeletons using a transformer-based retargeting autoencoder that transfers motion across arbitrary source–target skeleton pairs. Building on this kinematic motion prior, we introduce an artifact-driven refinement module that observes self-penetration on the posed target mesh and converts it into a corrective cue through a motion-to-vertex Jacobian. We further condition motion decoding on target geometry using skinning weight-based joint-aligned geometry features derived from the rest pose mesh. This design combines explicit target-side artifact reasoning with flexible geometry-aware decoding in a unified framework. Experiments on both fixed and arbitrary skeleton structure settings show that our method improves kinematic retargeting accuracy and reduces geometric artifacts, producing plausible motions across seen and unseen target characters.
Read the full abstract

All authors Seokhyeon Hong, Chaelin Kim, Inseo Jang, Soojin Choi, Junyong Noh

Group Theory

Group having 13 cyclic subgroups

In [Finite groups with a small number of cyclic subgroups. Czechoslovak Mathematical Journal 75.3 (2025): 839-851], the authors classified all the groups having 13 cyclic subgroups. In this paper, we give a new proof for the classification of all finite groups having exactly 13 cyclic subgroups.
Read the full abstract

Quantum Gases

Superfluidity in active quantum flocks

Active quantum matter has very recently emerged at the intersection between bio- and quantum many-body physics, combining the self-organization of living systems with the coherence of the quantum world. Active quantum systems have been shown to exhibit flocking - a collective phenomenon with no precedent in equilibrium quantum physics. In this work we uncover an unexpected layer of quantum order in active quantum flocks: they can become superfluid. We show that, in addition to the symmetry breaking associated with their directed motion, these flocks can also break an additional U(1) symmetry, giving rise to off-diagonal long-range order. For a microscopic model of active hard-core bosons governed by Lindblad dynamics, we derive an effective long-wavelength description of the single-particle density matrix and demonstrate that the flocking phase develops an instability toward off-diagonal long-range order characteristic of superfluid behavior. Our findings reveal active quantum matter as a promising research direction for discovering exotic nonequilibrium phases of quantum matter.
Read the full abstract

All authors Byjesh N. Radhakrishnan, Reyhaneh Khasseh, Thomas Schmidt, Markus Heyl

Machine Learning

Model-Adaptive and Risk-Constrained Frequency Hopping Against Predictive Jammers

Adaptive frequency hopping against predictive jamming must address both model uncertainty and policy exposure: the context-loss relationship may vary across operating regimes, while persistent hopping patterns may expose high-probability channels to attack. We propose D-PACT-AFH, a model-adaptive and risk-constrained adversarial contextual-bandit framework in which a Tsallis-FTRL master combines a global linear learner with a partitioned local learner and selects the model class online. D-PACT-Hit incorporates channel-wise marginal hit risk into model selection, while D-PACT-Safe applies a minimum-Kullback-Leibler projection to enforce a per-slot risk budget. We establish estimator validity under non-anticipating attacks, an oracle decomposition relative to the better fixed base, and an exact conditional-risk guarantee for the Safe projection. Experiments across diverse channel regimes and jammer types demonstrate effective model adaptation and a controllable goodput-risk tradeoff: D-PACT-AFH recovers 95.5% of the local learner's gain under observable switching while avoiding 77.7% of its degradation in a negative-control regime.
Read the full abstract

Soft Condensed Matter

Exact Analytic Solution for the Time-Fractional Hunter-Saxton Equation with Caputo derivative

A time fractional extension of the Hunter Saxton equation is examined, in which the temporal derivative of u_x is replaced by a Caputo derivative of order 0 < alpha <= 1. This modification introduces memory effects into a model traditionally associated with director field dynamics in nematic liquid crystals. By employing a fractional separation of variables strategy together with the exponential spatial profile phi(x) = exp(b+x), which cancels the nonlinear structure exactly, the governing nonlinear partial differential equation is reduced to a fractional relaxation ODE, whose closed form solution is the one-parameter Mittag Leffler function. The exact analytic solution is derived algebraically from the separation process. This appears to be the first exact closed form solution of the Caputo time fractional Hunter Saxton equation. The result is validated symbolically using the MathHandbook computer-algebra system. Quantitative analysis in both the fractional (0 < alpha < 1) and classical (alpha -> 1) limits demonstrates how fractional-order memory slows temporal relaxation relative to the exponential baseline. The solution provides a reliable benchmark for numerical schemes and clarifies how fractional dynamics influence nonlinear wave propagation in orientationally ordered fluids.
Read the full abstract

Data Structures and Algorithms

A Near-Linear Element-Kernel for \(d\)-Hitting Set

In \(d\)-Hitting Set, the input consists of a finite universe \(U\), a family \(\mathcal S\) of subsets of \(U\) with size at most \(d\), and an integer \(k\). The task is to decide whether at most \(k\) elements of \(U\) can intersect every set in \(\mathcal S\). Previously known kernels contain \(O(k^{d-1})\) elements and \(O(k^d)\) sets. Whether the number of elements can be reduced to \(O(k^{d-1-\varepsilon})\) for some constant \(\varepsilon>0\) is a longstanding open problem in kernelization. In this paper, we answer this question affirmatively by giving a near-linear randomized element-kernel and a subquadratic deterministic element-kernel through a re-encoding of the instance. For every fixed \(d\geq3\), we give a one-sided randomized kernel with \(O_d(k\log^3k)\) elements and a deterministic kernel with \(O_d(k^{7/4}\log^{3/2}k)\) elements. Our kernels may still contain \(k^{O(d)}\) sets and the parameter \(k\) may grow polynomially.
Read the full abstract

Machine Learning

Bi-HYCO: Bi-Objective Cooperative Learning for PDE Parameter Identification under Fragmented Observations

Physical and synthetic models may describe complementary aspects of the same PDE-governed system while receiving different, possibly fragmented, observations. We propose Bi-Objective HYCO (Bi-HYCO), a cooperative framework that retains both representations and their local observational objectives while coupling their predicted states at unlabeled interaction points. These points contain no measurements and do not augment the data; they provide a communication mechanism in the common state space. The two criteria form a vector-valued objective, and weighted scalarizations provide computational realizations. For the deterministic shared-observation algorithm with fixed interaction points, we prove sufficient decrease and finite length of the whole alternating sequence, which converges to a mixed critical point under the stated Kurdyka-Lojasiewicz-type assumptions. Elliptic transmission and two-dimensional Navier-Stokes experiments assess parameter and state reconstruction, noise and scalarization effects, and PINN/XPINN references. Ablations show that removing state interaction while retaining aggregation deteriorates parameter recovery in the tested configurations, particularly for Navier-Stokes.
Read the full abstract

All authors Umberto Biccari, Jun Chen, Roberto Morales, Enrique Zuazua

Algebraic Topology

Central Limit Theorems for Persistent Betti Numbers

Various persistent invariants have been developed in recent years. In this paper, we develop a method based on homological algebra for deriving central limit theorems for persistent Betti numbers associated with $\mathbb{R}$-indexed chain complexes constructed from a homogeneous Poisson point process of unit intensity on $\mathbb{R}^d$. Our method also applies to Gibbs point processes. This algebraic method reduces the verification of the required conditions to checking properties of the kernels and cokernels of add one maps between chain complexes. As an application, we recover the known central limit theorem for persistent Betti numbers arising from simplicial complex filtrations. In addition, we prove a central limit theorem for persistent Betti numbers of $\ell_p$-Vietoris-Rips simplicial homology, including blurred magnitude homology of random geometric graphs. We also establish central limit theorems for relative $\ell_p$-Vietoris-Rips homology and, in particular, for magnitude Betti numbers of random geometric graphs. These results suggest that our algebraic method can be applied more broadly to derive central limit theorems for persistent Betti numbers.
Read the full abstract

Statistical Methodology

Revisiting dependence in multiple testing: empirical distribution approaches for FDP control

Large-scale multiple hypothesis testing is central to the analysis of high-throughput data, where controlling false discoveries is critical. Classical procedures typically rely on theoretical null distributions and often adjust for dependence among test statistics, but these approaches may be misleading when the empirical distribution of null statistics deviates from theoretical assumptions. Motivated by this observation, we investigate the role of the empirical cumulative distribution function (c.d.f.) of null test statistics in controlling the false discovery proportion (FDP). We first show that, under an oracle scenario where the empirical c.d.f. of the test statistics for all null hypotheses is known, FDP control can be achieved optimally regardless of the dependence structure, highlighting that explicit modeling of dependence may be unnecessary. Building on this insight, we propose an empirical c.d.f.-based FDP control (eFDP) method, implemented via a multivariate mixture model framework and a nonparametric estimation procedure for the empirical c.d.f.s, establish its asymptotic convergence, and construct an FDP control procedure that achieves asymptotic FDP control. Extensive simulations demonstrate that eFDP attains more accurate FDP control and higher power than existing approaches, particularly under strong dependence, and analysis of a high-dimensional breast cancer gene expression dataset confirms its practical utility.
Read the full abstract

All authors Fangyong Zheng, Pengfei Li, Yuan Jiang, Tao Yu

Robotics

VLA-Corrector: Stage-Aware Observable State Understanding for Prompt-Based Closed-Loop Recovery of Vision-Language-Action Policies

Long-horizon robot manipulation with Vision-Language-Action (VLA) policies remains vulnerable to execution-time deviations, as final task success provides little information for diagnosing and correcting failures caused by action noise, object displacement, or goal misalignment. We introduce a stage-aware failure verification and Prompt Recovery framework that enables closed-loop correction of a fixed VLA policy without parameter updates or privileged simulator states. The framework introduces an observable-history-based Learned Verifier that jointly estimates manipulation progress and execution risk by temporally modeling multi-view visual observations, proprioceptive states, and executed actions. To provide interpretable task understanding, we represent manipulation execution through semantic progress stages, including approach, alignment, grasp, transport, and placement, and identify stage-specific failure patterns. Upon detecting abnormal execution, the framework preserves the original instruction and generates a stage-conditioned recovery prompt, allowing the same frozen VLA policy to produce corrective actions. Extensive multi-round evaluations on LIBERO and LIBERO Plus demonstrate that the proposed approach substantially improves closed-loop reliability under diverse perturbations. Without access to privileged object or goal coordinates, the Learned Verifier achieves recovery performance close to that of the privileged rule-based verifier in the evaluated settings. These results show that observable visual-proprioceptive-action history is sufficient to infer latent task states and enable practical failure recovery for existing VLA policies.
Read the full abstract

All authors Chang Song, Bin Qian, Yan Feng, Zhijie Song

Computer Vision

A Cloud-Based Hybrid Model for Real-Time Detection of BRTA-Approved Licence Plates Using YOLO Tiny and Haar Cascade

Accurate vehicle license plate detection is essential for applications such as intelligent transportation systems, toll collection, parking management, and law enforcement. In Bangladesh, this task presents distinct challenges due to the complexity of localized license plates and environmental factors like lighting, occlusion, motion blur, and obstructions such as dirt or mud. These challenges often render conventional methods ineffective. This paper introduces a novel hybrid approach, combining the YOLO Tiny deep learning model with the Haar-Cascade classifier, for enhanced detection and localization of Bengali license plates. A key innovation of our system is the integration of a dynamic retraining pipeline, which allows the model to adapt to evolving real-world conditions. This retraining mechanism significantly boosts performance in low-confidence scenarios by continuously improving the model's accuracy as new data is encountered. Additionally, a publicly accessible dataset of BRTA-compliant license plates, captured under diverse and challenging conditions, has been developed to support this approach. Experimental results demonstrate that our approach not only achieves superior detection accuracy and computational efficiency over conventional models but also ensures consistent performance in resource-constrained environments, particularly in Bangladesh.
Read the full abstract

Distributed Computing

Sharing a Fabric with Collective Communication: Two Storage Penalties in Deep Learning Training

Distributed DL training on HPC systems often shares one network fabric between NCCL/RCCL collective communication and parallel-filesystem I/O. Using a real GNN training workload on a Slingshot-11 system, we show that this sharing imposes two distinct costs. The primary cost is heavy-tailed DataLoader stalls: the typical DataLoader wait is just 15 ms at steady state, yet spikes to multiple seconds in 28% of Lustre iterations and 12% of VAST iterations. The secondary cost is traffic-class contention on collective communication: Lustre I/O stalls the all-reduce by up to 145$\times$ in an isolated benchmark. The two costs arise from different mechanisms. I/O stall latency affects any storage path that traverses the shared fabric, whereas all-reduce network contention occurs only when storage and collective communication share the same traffic class. Their common root cause is that storage I/O traverses the shared fabric. This work shows that node-local NVMe staging via DYAD (Our code is publicly available at https://github.com/flux-framework/dyad) eliminates both effects by keeping storage I/O off that path. Across a full training epoch, DYAD achieves a 7.4 times speedup over direct Lustre reads and a 1.06 times speedup over VAST. By the second epoch, once the local cache is fully warmed, DataLoader stalls are eliminated entirely, allowing DYAD to reach a 1.31 times speedup over VAST.
Read the full abstract

All authors Chen Wang, Wenzhao Wu, Hyojin Kim, Jae-Sung Yeom

Optimization and Control

Lie bracket approximations of RMSprop for Extremum Seeking Control

This paper presents novel extremum seeking algorithms inspired by RMSProp dynamics and based on Lie bracket approximation techniques. To inherit the behavior of the classical continuous-time RMSProp algorithm, we introduce an extremum seeking scheme that exploits second-order Lie brackets, allowing the excitation of squared gradient terms in the resulting Lie bracket system. Moreover, we propose two modified RMSProp-type algorithms that can be implemented using only first-order Lie bracket approximations, thereby reducing the complexity of the extremum seeking control design. The three resulting extremum seeking algorithms are compared through numerical simulations.
Read the full abstract