Peer Revenue Returns subject to peer review

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Friday 20 March

Information Theory

Capacity-Achieving BBT Polar Codes with Interleaver-Assisted BP Decoding

In this paper, we introduce a binary balanced tree (BBT) channel transformation that extends Ar{\i}kan's channel transformation to arbitrary block lengths. We prove that the proposed transformation induces channel polarization, thereby establishing that BBT polar codes achieve the capacity of binary-input memoryless symmetric (BMS) channels. To characterize the finite-length performance of BBT polar codes, we further develop an efficient method for estimating the weight spectrum by exploiting the hierarchical tree structure, and derive analytical upper and lower bounds on the frame error rate (FER) under maximum-likelihood (ML) decoding. For practical low-latency implementations, we propose interleaved BBT (IBBT) polar codes together with a belief-propagation (BP) decoding algorithm. Specifically, based on the normal-graph representation of BBT polar codes, interleavers are introduced between adjacent layers to modify the message-passing schedule. In addition, we propose to perform BP decoding on an IBBT sub-normal graph and replace partial BP processing modules with a posteriori probability (APP) calculation modules, thereby reducing the number of message-passing steps required per iteration. Numerical results demonstrate that the proposed interleaving strategy improves decoding convergence, while the sub-normal-graph-based BP decoding algorithm significantly reduces decoding latency while maintaining comparable error-rate performance.
Read the full abstract

Information Theory

Robust Beam Codebooks for mmWave/THz Systems: Toward a Stochastic RL Approach

Millimeter-wave (mmWave) and terahertz (THz) massive MIMO systems often rely on predefined beamforming codebooks, which are usually suboptimal in Non-Line-of-Sight (NLoS) conditions and for hardware-limited transceivers. Reinforcement Learning (RL) enables adaptive, data-driven codebook design without explicit Channel State Information (CSI), but the robustness of such algorithms in practical conditions is underexplored. This paper introduces a robust multi-agent RL framework that learns beam codebooks directly from environmental feedback, eliminating the need for prior channel knowledge. Our method is well-suited for real-world deployments facing unpredictable propagation and hardware constraints. We conduct a comprehensive analysis of three off-policy algorithms, Deep Deterministic Policy Gradient (DDPG), Twin Delayed DDPG (TD3), and Soft Actor-Critic (SAC), evaluating their resilience to hardware impairments and feedback noise. Simulations show that SAC consistently outperforms deterministic methods, achieving superior beamforming gains and stability in NLoS scenarios, even under severe impairments. These results demonstrate the promise of RL-based codebook design for robust mmWave/THz massive MIMO systems.
Read the full abstract

All authors Anouar Nechi, Rainer Buchty, Mladen Berekovic, Saleh Mulhem

Numerical Analysis

High order ghost-FEM for incompressible Navier-Stokes equations on moving domains

We develop a new numerical technique for approximating solutions of the Navier-Stokes equations on moving domains. The method aims at simulating an incompressible fluid past an object whose motion is assigned a priori using a level-set function. The proposed approach relies on a space discretization based on the ghost finite element method (ghost-FEM), which allows computations on unfitted meshes and avoids costly remeshing as the domain evolves in time. Time integration is performed using an IMplicit-EXplicit (IMEX) scheme to address the nonlinearity of the convective term, ensuring high-order accuracy for incompressible flows. The error introduced by the geometrical approximation is handled using the Shifted Boundary Method, which allows higher order approximations of boundary conditions on unfitted meshes. Dirichlet boundary conditions are imposed weakly by means of Nitsche's method. The associated stabilization parameter is chosen by solving a generalized eigenvalue problem, ensuring stability and accuracy of the numerical scheme. We present a series of numerical experiments designed to validate the accuracy of the proposed method, as well as comparisons with established benchmark problems involving moving boundaries.
Read the full abstract

All authors Hridya Dilip, Clarissa Astuto, Armando Coco, Giovanni Russo

Differential Geometry · Cross-listed from hep-th

Some rigidity results for supergravity backgrounds in 11 dimensions

This paper is a contribution to the supersymmetry gap problem for supergravity backgrounds $(M,g,F)$ in $11$ dimensions. We study restrictions on the curvature of $(M,g,F)$ and, using the bijective correspondence between the space of certain filtered deformations of Lie superalgebras and the space of highly supersymmetric supergravity backgrounds, we establish the following general rigidity result: if the $4$-form $F$ has rank $\operatorname{rk}(F)\leq 6$, Euclidean support, and the space $\mathfrak{k}_{\bar 1}$ of Killing spinors has dimension $\dim\mathfrak{k}_{\bar 1}> 26$ then $(M,g,F)$ is locally isometric to the maximally supersymmetric Minkowski spacetime or Freund Rubin background $\mathrm{AdS}_7\times\mathrm{S}^4$. The same rigidity result but with finer estimates on $\dim\mathfrak{k}_{\bar 1}$ is provided for certain types of $\mathfrak k_{\bar 1}$ and specific orbits of the $4$-form under the action of the Lorentz group.
Read the full abstract

Representation Theory

Party-Hecke algebras

Party-Hecke algebras are introduced as a two-parameter deformation of party algebras, where one parameter deforms the party generators and the other deforms the elementary transpositions. We construct a basis for this algebra and show that it can be realized as a quotient of the algebra of braids and ties. Furthermore, we study the party monoid and its relationship with the tied symmetric monoid and their associated algebras.
Read the full abstract

Optimization and Control

Infinite-dimensional spherical-radial decomposition for probabilistic functions, with application to constrained optimal control and Gaussian process regression

The spherical-radial decomposition (SRD) is an efficient method for estimating probabilistic functions and their gradients defined over finite-dimensional elliptical distributions. In this work, we generalize the SRD to infinite stochastic dimensions by combining subspace SRD with standard Monte Carlo methods. The resulting method, which we call hybrid infinite-dimensional SRD (hiSRD) provides an unbiased, low-variance estimator for convex sets arising, for instance, in chance-constrained optimization. We provide a theoretical analysis of the variance of finite-dimensional SRD as the dimension increases, and show that the proposed hybrid method eliminates truncation-induced bias, reduces variance, and allows the computation of derivatives of probabilistic functions. We present comprehensive numerical studies for a risk-neutral stochastic PDE optimal control problem with joint chance state constraints, and for optimizing kernel parameters in Gaussian process regression under the constraint that the posterior process satisfies joint chance constraints.
Read the full abstract

Information Theory

Repeater-Aided Over-the-Air Phase Synchronization in Distributed MIMO

Phase synchronization of access points (APs) in a distributed multiple-input multiple-output (D-MIMO) system is critical to leverage the performance benefits of D-MIMO. Existing over-the-air phase synchronization methods assume that APs can communicate directly to perform necessary measurements. However, this assumption might not hold in scenarios where inter-AP signaling is too weak for effective communication. To address this, in this paper, we propose a novel over-the-air calibration scheme that uses repeater nodes to facilitate phase synchronization when direct AP signaling is infeasible. We give the steps of the algorithm for phase calibration in closed form, and show how it enables coherent joint transmission (CJT) by the APs. The framework expands the applicability of D-MIMO systems to challenging environments, where existing over-the-air synchronization techniques fall short.
Read the full abstract

Information Theory · Cross-listed from quant-ph

SDP bounds on quantum codes: rational certificates

A fundamental problem in quantum coding theory is to determine the maximum size of quantum codes of given block length and distance. A recent work introduced bounds based on semidefinite programming, strengthening the well-known quantum linear programming bounds. However, floating-point inaccuracies prevent the extraction of rigorous non-existence proofs from the numerical methods. Here, we address this by providing rational infeasibility certificates for a range of quantum codes. Using a clustered low-rank solver with heuristic rounding to algebraic expressions, we can improve upon $18$ upper bounds on the maximum size of $n$-qubit codes with $6 \leq n \leq 19$. Our work highlights the practicality and scalability of semidefinite programming for quantum coding bounds.
Read the full abstract

Complex Variables · Cross-listed from eess.SY

Complex Frequency as Generalized Eigenvalue

This paper shows that the concept of complex frequency, originally introduced to characterize the dynamics of signals with complex values, constitutes a generalization of eigenvalues when applied to the states of linear time-invariant (LTI) systems. Starting from the definition of geometric frequency, which provides a geometrical interpretation of frequency in electric circuits that admits a natural decomposition into symmetric and antisymmetric components associated with amplitude variation and rotational motion, respectively, we show that complex frequency arises as its restriction to the two-dimensional Euclidean plane. For LTI systems, it is shown that the complex frequencies computed from the system's states subject to a non-isometric transformation, coincide with the original system's eigenvalues. This equivalence is demonstrated for diagonalizable systems of any order. The paper provides a unified geometric interpretation of eigenvalues, bridging classical linear system theory with differential geometry of curves. The paper also highlights that this equivalence does not generally hold for nonlinear systems. On the other hand, the geometric frequency of the system can always be defined, providing a geometrical interpretation of the system flow. A variety of examples based on linear and nonlinear circuits illustrate the proposed framework.
Read the full abstract

Dynamical Systems

Stochastic behavior along mean motion resonances in the restricted planar 3-body problem

One of the most remarkable instability zones in the Solar system are Kirkwood gaps in the asteroid belt. In this paper we analyze instabilities in the famous Kirkwood gap $3:1$ in the regime of small eccentricity of Jupiter. Mathematically speaking, we study the evolution of asteroids under the influence of the Sun and Jupiter using the restricted planar elliptic 3-body problem (RPE3BP) for initial conditions near a mean motion resonance 3:1. The main result exhibits stochastic diffusing behavior of the eccentricity of the asteroid for a rich set of initial conditions. Roughly speaking, for small eccentricity $e_0$ of Jupiter, the evolution of the eccentricity of the asteroid $\mathbf{e}(t\cdot e_0^{-2})$ at the Kirkwood gap $3:1$ behaves like a diffusion process on the line, where the randomness comes from the initial conditions. Along with KAM theory, we have mixed behavior in the asteroid belt, that is coexistence of quasiperiodic (deterministic) and stochastic (diffusive) behavior. See also the companion paper arXiv:2603.19893
Read the full abstract

All authors Marcel Guardia, Vadim Kaloshin, Pau Martín, Pablo Roldan

Dynamical Systems

Computation of a separatrix map and a normally hyperbolic invariant lamination for the RP3BP

In this paper we discuss the existence of a normally hyperbolic invariant lamination (NHIL) at the Kirkwood gap $3:1$ for the Restricted Planar Elliptic 3 Body Problem. This problem models the Sun-Jupiter-Asteroid dynamics. We also show that the induced dynamics on the NHIL is a partially hyperbolic skew-shift which is of the form \[ f:(\omega,I,\theta)\to (\sigma \omega, I+e_0 A_\omega(I)\cos(\theta+\psi_\omega)+\mathcal{O}(e^2_0), \theta+\Omega_\omega(I)+\mathcal{O}(e_0)),\] where $I\in [a,b], \theta\in \mathbb T, \omega\in\Sigma=\{0,1\}^\mathbb Z$, the space of sequences of $0,1$'s, $\sigma:\Sigma \to \Sigma$ is the shift in this space, $\Omega_\omega$ is the shear, $A_\omega$ is an amplitude, and $e_0$ is the eccentricity of Jupiter, which is taken as a small parameter. In the companion paper arXiv:2603.19894, relying on these skew-shift, we show the existence of stochastic diffusing behavior for Asteroids belonging to the Kirkwood gap provided the eccentricity of Jupiter is $e_0$ small enough. Key ingredients to construct the NHIL are the separatrix map associated to homoclinic channels to a normally hyperbolic invariant cylinder and an isolating block construction. Some of the necessary non-degeneracy conditions are verified numerically.
Read the full abstract

All authors Marcel Guardia, Vadim Kaloshin, Pau Martín, Pablo Roldan

Mathematical Physics · Cross-listed from hep-th

Phase Diagram and Finite Temperature Properties of Negative Coupling Scalar Field Theory

In this work, I consider scalar field theory with negative quartic self-interaction, corresponding to an upside-down classical potential. Despite not possessing a classically stable ground state, such potentials are known to behave properly when treated quantum mechanically, leading to stable and unitary time evolution. Using two different saddle-point expansions for the same theory, I discuss the phase diagram in terms of bare parameters in Euclidean dimensions one to four, as well as the generalization to finite temperature. Comparing to other methods where available, I find that negative coupling field theory is a promising candidate for an interacting scalar field theory in the continuum. In particular, in four dimensions it exploits a loophole in mathematical proofs of quantum triviality, suggesting that negative coupling scalar field theory could offer a UV-complete and interacting description of the Higgs.
Read the full abstract

Combinatorics

On continuous 2-frieze patterns

We define and study a continuous version of 2-frieze patterns, a combinatorial structure closely related with frieze patterns of Coxeter and Conway. We describe the relation of continuous 2-friezes with the moduli space of projective curves and relate the (pre)symplectic structure on the space of closed 2-friezes, considered as a cluster variety, with the Adler-Gelfand-Dikii bracket on the space of 3rd order differential operators.
Read the full abstract

Differential Geometry

On tt*-structures from $ADE$-type Stokes data

Cecotti and Vafa introduced the topological anti-topological fusion (tt*)-equation, whose solutions describe massive deformations of supersymmetric conformal field theories. We provide a rigorous analytic formulation of the $ADE$ classification of tt*-structures. Under natural structural assumptions, a tt*-structure over $\mathbb{C}^*$ can be described via isomonodromic deformations with upper unitriangular real Stokes matrices. Two fundamental issues arise: the ambiguities of Stokes matrices, governed by an action of a group $\tilde{Br}_n$, which is generated by reordering operations, and the solvability of the associated Riemann-Hilbert problem. Our first main result shows that the classification reduces to admissible Stokes matrices modulo $\tilde{Br}_n$-action, and that the $\tilde{Br}_n$-orbit of a Stokes matrix determines a tt*-structure over $\mathbb{C}^*$. Our second main result establishes that upper unitriangular matrices whose symmetrizations coincide with Cartan matrices of type $A_n, D_n, E_6, E_7,$ or $E_8$ give rise to tt*-structures over $\mathbb{C}^*$. This provides a direct analytic realization of the $ADE$ classification and clarifies the interplay between Stokes phenomena, $\tilde{Br}_n$-symmetry, and positivity of Cartan-type matrices.
Read the full abstract

Analysis of PDEs

Existence, non-degeneracy and local uniqueness of multi-peak solutions to the fractional Schrödinger equation with nearly critical exponent in $\mathbb{R}^N$

In this paper, we consider the following fractional Schrödinger equation \begin{equation*} \left\{ \begin{array}{lcl} (-\Delta)^{s}u+V(x)u=u^{{p_s}-\epsilon}\ \ \ &\hbox{in}\ \mathbb{R}^N,\\ u>0\ \ \ &\hbox{in}\ \mathbb{R}^N, \end{array} \right. \end{equation*} where $0<s<1$, $\epsilon>0$, $p_s=(N+2s)/(N-2s)$, $N>4s$ and $V(x)\in C^1(\mathbb{R}^N)\cap L^\infty (\mathbb{R}^N)$ is non-negative. We first use the Lyapunov-Schmidt reduction method to construct multi-peak solutions to the above equation provided that $V(x)$ possesses $k$ stable critical points. Then we prove the non-degeneracy and local uniqueness of the multi-peak solutions, for $\frac{1}{2}<s<1$, $N\geq 6s$, via the blow-up argument based on various local Pohozaev identities. Due to the nonlocal property of the fractional Laplacian, we need to make delicate analysis of the approximate solutions and establish the local Pohozaev identities for the corresponding harmonic extension instead of $u$. This approach not only requires to develop refined estimates for several integrals in the local Pohozaev identities, but also to apply Pohozaev identities through a markedly different way.
Read the full abstract

All authors Yanyan Guo, Ying Li, Zhongyuan Liu, Pingping Yang

Mathematical Physics · Cross-listed from quant-ph

Structure and Classification of Matrix Product Quantum Channels

We develop a framework for Matrix Product Quantum Channels (MPQCs), a one-dimensional tensor-network description of completely positive, trace-preserving maps. We focus on translation-invariant channels, generated by a single repeated tensor, that admit a local purification. We show that their purifying isometry can always be implemented by a constant-depth brickwork quantum circuit, implying that such channels generate only short-range correlations when applied on product states. In contrast to the unitary setting, where one-dimensional quantum cellular automata (in one-to-one correspondence with matrix product unitaries) carry a nontrivial index, we prove that all locally purified channels belong to a single phase, that is, they can be continuously deformed into one another. We then extend the framework to a broader class of translation-invariant channels capable of generating long-range entanglement and show that these remain deterministically implementable in constant depth using two rounds of measurements and feedforward.
Read the full abstract

All authors Giorgio Stucchi, J. Ignacio Cirac, Rahul Trivedi, Georgios Styliaris

Analysis of PDEs

Asymptotics of the principal eigenvalue of an elliptic operator on closed and orientable Riemannian manifolds

This paper investigates the asymptotic behavior of the principal eigenvalue $\lambda(s)$, as $s\to+\infty$, for the following elliptic eigenvalue problem \begin{equation*}\label{E} -\Delta_{M}u-s\langle \nabla_M f, \nabla_M u\rangle_g +c u=\lambda(s)u, \end{equation*} defined on an orientable and closed Riemannian manifold $(M,g)$. Assuming $f$ is a Morse function defined on $M$, we find that the limit $\lim\limits_{s\to+\infty} \lambda(s)$ is determined by the minimum value of the function $c$ over the set of the maximum points of $f$, a result that is independent of the curvature of manifold.
Read the full abstract

Dynamical Systems

SIR model with random diffusion, reinfection, and random transmission: exponential attractors and spread of the disease

We introduce a stochastic SIR-type partial differential equation model incorporating random diffusion, reinfection, vital dynamics, and a randomly varying transmission rate. For the associated random dynamical system, we prove the existence of both random and exponential attractors. We construct a non-stationary, random disease-free global solution, which serves to localize the random attractor. Furthermore, we analyze the mean value of the random transmission coefficient to establish conditions under which the disease may either be eradicated or persist in an endemic state, depending on the system's parameters.
Read the full abstract

All authors Tomás Caraballo, Javier López-de-la-Cruz, Alexandre N. Oliveira-Sousa, Paulo N. Seminario-Huertas

Category Theory

Operads and equivariance

Operads were originally defined by May to have right actions of the symmetric groups, but later formulations have also used no groups actions at all or group actions by such families as the braid groups. We call such families action operads, as they are the algebraic objects that encode parametrized group actions on operads. In Part I of this paper, we study the basic algebra of action operads $\Lambda$ and the $\Lambda$-operads they act upon. In Part II, we study $\Lambda$-operads in the 2-category of small categories.
Read the full abstract

Dynamical Systems

Random chemostats with competition and different kinetics to investigate the growth of the gut microbiome

We investigate some chemostat models incorporating wall growth, competition, random fluctuations on the dilution rate, and different consumption functions (Monod and Haldane). We analyze the asymptotic behavior of the solutions of the corresponding random differential systems to establish conditions on the model parameters under which the microbes persist in the gut or disappear. Moreover, several numerical simulations are presented to support the theoretical results and illustrate their biological interpretation.
Read the full abstract

Combinatorics

Unit distance graphs with few crossings per edge

A graph is called a $k$-planar unit distance graph if it can be drawn in the plane such that every edge is a unit line segment and is involved in at most $k$ crossings. We investigate $u_k(n)$, the maximum number of edges of such graphs on $n$ vertices. For $k=1$, we improve the best known upper bound, by showing that $u_1(n) \leq 3n - c\sqrt{n}$ for some constant $c>0$. This bound is tight up to the value of the constant $c$. For $k=2$, we establish the first non-trivial upper bound by proving that $u_2(n) \leq 4n - 8$. Regarding lower bounds we give a construction for $k=2$ that shows $u_2(n) \geq u_0(n) + c\sqrt{n}$ if $n$ is sufficiently large.
Read the full abstract

All authors Panna Gehér, Dömötör Pálvölgyi, Dániel G. Simon, Géza Tóth

Numerical Analysis

Transformer Causality Regularization for Dynamic Inverse Problems

We study the concept of including the causality principle as regularizer into the solution of linear time-dependent inverse problems. This is achieved by combining transformer-based predictions with classical variational regularization, resulting in what we call transformer causality regularization (TCR). The causality principle states that an object at time $t'$ depends only on its previous states at $t < t'$ and is independent of future states at $t > t'$. Since the transformer architecture represents sequence-to-sequence functions and can be equipped with a causal attention mask, transformers are the natural choice for a learned causality function that predicts the state of an object at time $t'$ given the previous states at $t < t'$. We combine this with the inductive bias of convolutional neural networks (CNNs) for imaging tasks to treat the spatial variable. The output of the spatial-temporal transformer is then used as a prior for variational regularization, such that classical results on regularization and convergence for solution methods directly transfer to our case. Using the example of dynamic computerized tomography, we compare TCR to a static and dynamic version of the earlier introduced unrolled adversarial regularizer for simulated and measured data. The results show that using TCR within a variational framework improves reconstruction results and data-consistency.
Read the full abstract

Functional Analysis

Distribution for nonsymmetric V-monotone position operators

We investigate the vacuum distribution of a family of partial sums of nonsymmetric position operators, depending on a real parameter $\lambda$, and acting on the discrete Fock space in the framework of V-monotone independence. We analyze the combinatorics of the moments of this distribution, and using its Cauchy–Stieltjes transform, we determine its exact form, consisting of a unique atom and an absolutely continuous part. Finally, we present computer-generated graphs that illustrate the distribution for several values of the intensity parameter $\lambda$.
Read the full abstract

Combinatorics

An almost trivial observation about the icosahedron

We consider the incidence structure formed by the twelve pentagons given by the vertex neighborhoods of the icosahedron. Interpreting this structure purely in terms of coplanarity conditions, we show that – up to projective equivalence – it admits exactly two realizations. Both realizations coincide with the vertex set of the regular icosahedron and interpreted as cell complex they correspond to the great dodecahedron and the small stellated dodecahedron. The key step is to reinterpret the configuration via the pentagram map. We prove that any realization gives rise to a pentagon $X$ satisfying a homothety relation $P^2(X)\sim X$, and show that this condition forces $X$ to be an affine image of either a regular pentagon or a regular pentagram. This reduces the problem to a quadratic constraint and explains the rigidity of the configuration.
Read the full abstract

Classical Analysis and ODEs

A dynamical system framework yielding quantitative inverse spectral results for Sturm-Liouville operators

This paper establishes a dynamical-system framework that yields quantitative results for the inverse optimal spectral problem of reconstructing a potential $\hat{q}$ from finite observed eigenvalues to achieve an optimal approximation of the target potential $q_0$. Previous efforts relying on convex analysis have been confined solely to qualitative analysis due to the inherent limitations of convex-analytic techniques for inverse problems, while the quantitative counterpart has remained an open problem. Based on our dynamical-system framework, we provide a quantitative characterization of the relationship between the reconstructed potential $\hat{q}$, its target potential $q_0$, and the observed eigenvalue $\lambda_*$. In particular, for ${q} \in \mathcal{L}^2$, our framework yields a substantially stronger conclusion. Remarkably, our dynamical-system framework secures the uniqueness of $\hat{q}$ over the full parameter space $(\lambda_*, q_0)$, liberating the theory from the prevailing constraint $\lambda_* > \lambda_1(q_0)$ (where $\lambda_*$ is the observed eigenvalue and $\lambda_1$ is the principle eigenvalue). This stands in sharp contrast to classical approaches, which rely heavily on convex-set analysis and are inherently confined by its stringent assumptions. An additional finding is the construction of a homeomorphic mapping that reveals the dilation relation between the errors $\|\hat{q} - q_0\|_{\mathcal L^p}$ associated with the $m$-th eigenvalue and the principal eigenvalue. A summary of the main results, along with practical applications in structural health monitoring and damage detection, material design, seismic wave analysis, sonar detection, and related fields, concludes this work.
Read the full abstract

Representation Theory

The classification of thick representations of the symmetric group

We give the classification of thick representations and dense representations of the symmetric group over a field of characteristic zero.

Analysis of PDEs

Stability analysis and long-time convergence of a partial differential equation model of two-phase ageing

Recent biological evidence suggests the presence of a two-phase ageing process in several species. We introduce a system of two age-structured partial differential equations (PDE) representing two phases of ageing of a wild population. The model includes a coupling of both equations through birth and transition between phases and non-linearities due to competition. We show the existence, positivity and uniqueness of weak solutions in a general setting. For a simplified system of ordinary differential equations (ODE), we show existence and uniqueness of a strictly positive steady state attracting all trajectories. We study another simplification, a coupled PDE-ODE model, for which we prove existence, uniqueness and local asymptotic stability of a strictly positive steady state. Under further assumptions, but without assuming weak non-linearities, we show the global asymptotic stability of that steady state. The uniqueness of steady states and absence of oscillations in these systems show that the proportion of individuals in each phase at equilibrium is a unique feature of the model. This paves the way to ecological applications as the experimental measure of such a proportion could help gain some insight on the health of a wild population.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

A Spectral Perspective on Stochastic Control Barrier Functions

Stochastic control barrier functions (SCBFs) provide a safety-critical control framework for systems subject to stochastic disturbances by bounding the probability of remaining within a safe set. However, finding a valid SCBF that explicitly reflects the long-horizon behavior of the true safety probability remains a challenge. This paper addresses this issue by adopting a spectral perspective, utilizing the linear operator that governs the evolution of the closed-loop system's safety probability. We find that the dominant eigenpair of this Koopman-like operator encodes fundamental safety information of the stochastic system. The dominant eigenfunction is a natural and valid SCBF, with values that characterize relative asymptotic safety across initial states, while the dominant eigenvalue indicates the global asymptotic rate at which the safety probability decays. A practical algorithm for computation is proposed, termed power-policy iteration, which jointly estimates the dominant eigenpair while updating the backup policy with the aim of improving long-term safety. The method is validated using simulation experiments on safety-critical dynamics models.
Read the full abstract

All authors Inkyu Jang, Chams E. Mballo, Claire J. Tomlin, H. Jin Kim

Analysis of PDEs · Cross-listed from cs.LG

Two-Time-Scale Learning Dynamics: A Population View of Neural Network Training

Population-based learning paradigms, including evolutionary strategies, Population-Based Training (PBT), and recent model-merging methods, combine fast within-model optimisation with slower population-level adaptation. Despite their empirical success, a general mathematical description of the resulting collective training dynamics remains incomplete. We introduce a theoretical framework for neural network training based on two-time-scale population dynamics. We model a population of neural networks as an interacting agent system in which network parameters evolve through fast noisy gradient updates of SGD/Langevin type, while hyperparameters evolve through slower selection–mutation dynamics. We prove the large-population limit for the joint distribution of parameters and hyperparameters and, under strong time-scale separation, derive a selection–mutation equation for the hyperparameter density. For each fixed hyperparameter, the fast parameter dynamics relaxes to a Boltzmann–Gibbs measure, inducing an effective fitness for the slow evolution. The averaged dynamics connects population-based learning with bilevel optimisation and classical replicator–mutator models, yields conditions under which the population mean moves toward the fittest hyperparameter, and clarifies the role of noise and diversity in balancing optimisation and exploration. Numerical experiments illustrate both the large-population regime and the reduced two-time-scale dynamics, and indicate that access to the effective fitness, either in closed form or through population-level estimation, can improve population-level updates.
Read the full abstract