Information Theory
Learning to Decode Quantum LDPC Codes Via Belief Propagation
Mohsen Moradi, Vahid Nourozi, Salman Habib et al. (+1 more)
Belief-propagation (BP) decoding for
quantum low-density parity-check (QLDPC) codes is appealing due to its low complexity, yet it often exhibits convergence issues due to
quantum degeneracy and short cycles that exist in the Tanner graph. To overcome this challenge, this paper proposes a reinforcement-learning (RL) approach that learns (offline) how to decode QLDPC codes based on sequential decoding trajectories. The decoding is formulated as a Markov decision process with a local, syndrome-driven state representation of the underlying RL
agent. To enable fast inference, critical for practical implementation, we incrementally update our RL-based QLDPC decoder using second-order neighborhoods that avoid global rescans. Simulation results on representative QLDPC codes demonstrate the superiority of the proposed RL-based QLDPC decoders in terms of performance and convergence speed when compared to flooding and random sequential schedules, while achieving performance competitive with state-of-the-art BP-based decoders at comparable complexity.
Read the full abstract ▾
All authors Mohsen Moradi, Vahid Nourozi, Salman Habib, David G. M. Mitchell
Optimization and Control
Hoeffding-Type Concentration Bounds for Exchangeable Random Variables
Nina Maria Gottschling and Michele Caprio
We establish Hoeffding-type concentration inequalities for empirical means of bounded infinitely exchangeable sequences. Using the unique de Finetti mixing measure, we identify the appropriate concentration set as the collection of means of the component distributions in the support of the mixing law. The empirical mean concentrates exponentially around this set, with the same exponential rate as in the classical Hoeffding inequality. More sharply, the empirical mean concentrates directly around its random almost sure de Finetti limit. This also yields one sided bounds relative to the smallest and largest component means. When the mixing measure is concentrated at a single distribution, the sequence is independent and identically distributed, and our result recovers the classical Hoeffding inequality.
Read the full abstract ▾
Algebraic Geometry
Vector bundles over certain Koras-Russell threefolds of the third kind
Tariq Syed
Let $k$ be an algebraically closed base field of characteristic $0$ and let $\alpha_{1}, \alpha_{2}, \alpha_{3}, d \geq 2$ be integers such that $\alpha_{1}, \alpha_{2}, \alpha_{3}$ are pairwise coprime and $gcd (\alpha_{1},d-1) = 1$. Then consider the Koras-Russell threefold $Y := \{ x + x^d y^{\alpha_{1}} + z^{\alpha_{2}} + t^{\alpha_{3}} = 0\} \subset \mathbb{A}^{4}_{k}$. We prove that the Chow groups $CH^{i}(Y)$ are trivial for $i=1,2,3$ and therefore all algebraic vector bundles over $Y$ are trivial. If $\alpha_{1}$ is odd, we also prove that the Chow-Witt groups $\widetilde{CH}^{i}(Y, \mathcal{L})$ are trivial for $i=1,2,3$ and any line bundle $\mathcal{L}$ over $Y$.
Read the full abstract ▾
Combinatorics
Penrose P2 Tilings: A Study of Fully Leafed Induced Subtrees
Mathieu Cloutier, Alain Goupil and Alexandre Blondin Massé
We present new results about fully leafed induced subtrees in Penrose P2 tilings, also known as kites and darts tilings. We first determine the graph structure of these subtrees and show that they are caterpillars up to an appendix of at most six tiles. In other words, if we remove their degree one vertices, then they are path graphs up to an additional connected path of at most two tiles. We then study bi-infinite fully leafed induced caterpillars in P2 tilings and their
geometric properties. In particular, we refute the
conjecture proposed by C. Porrier, A. Goupil and A. Blondin Massé that there is a unique bi-infinite fully leafed caterpillar in Penrose P2 tilings.
Read the full abstract ▾
Analysis of PDEs
Development of Implosions of Solutions to the Three-Dimensional Degenerate Compressible Navier-Stokes Equations
Gui-Qiang G. Chen, Lihui Liu and Shengguo Zhu
A fundamental open problem in the theory of the multidimensional compressible Navier-Stokes equations is whether smooth solutions can develop singularities in finite time. For constant viscosity coefficients, recent remarkable results show that there exist smooth initial data for which the corresponding smooth solutions of the barotropic flow undergo finite-time implosion at the origin, with the density blowing up to infinity. In contrast, when the viscosity coefficients depend linearly on the density (as in the shallow water case), it has been established that, for general large spherically symmetric initial data, the solutions remain globally regular. These results indicate that the qualitative behavior of multidimensional solutions is sensitive to the structure of the viscosity coefficients. In this paper, we investigate the case of nonlinear viscosity coefficients with power-law density dependence. We identify a threshold value, depending on the adiabatic exponent, such that, for any power below this threshold, there exists a class of smooth initial data with strictly positive density for which the corresponding smooth solutions implode in finite time at the origin. The key issue is to show that, in this regime, the degenerate viscous terms are not sufficiently strong to suppress the convective mechanism driving the implosion. Establishing this rigorously is highly nontrivial due to the degenerate structure of the Navier-Stokes equations. To overcome this difficulty, we first derive a pointwise estimate for the density and then obtain spatial decay estimates for the velocity gradient via carefully constructed weighted high-order energy estimates and interpolation inequalities. The resulting decay rate is sufficiently rapid to compensate for the singular growth of the density, leading to uniform-in-time control of the viscous terms and ultimately to the formation of implosion.
Read the full abstract ▾
Combinatorics
Hook Length Biases in $t$-Core Partitions
Nayandeep Deka Baruah, Hirakjyoti Das, Pankaj Jyoti Mahanta et al. (+1 more)
Recently, the theory of hook length biases has emerged as a prominent research topic. Led by Ballantine, Burson, Craig, Folsom, and Wen [Res. Math. Sci., 2023], hook length biases are being explored for ordinary partitions, odd versus distinct partitions, self-conjugate versus distinct odd partitions. Lately, Singh and Barman [J. Number Theory, 2024] opened the door to hook length biases in $\ell$-regular partitions. In this work, we extend the theory of hook length biases to $t$-core partitions. For example, let $a_{t,k}(n)$ denote the number of hooks of length $k$ in all $t$-core partitions of $n$, then we find that $a_{3,1}(n)\ge a_{3,2}(n) \ge a_{3,4}(n)$ and $a_{4,1}(n)\ge a_{4,3}(n)$ for all $n$. The methods employed in this work are mainly combinatorial.
Read the full abstract ▾
All authors Nayandeep Deka Baruah, Hirakjyoti Das, Pankaj Jyoti Mahanta, Manjil P. Saikia
Statistics Theory · Cross-listed from cs.CV
Unbalanced Optimal Transport Dictionary Learning for Unsupervised Hyperspectral Image Clustering
Joshua Lentz, Nicholas Karris, Alex Cloninger et al. (+1 more)
Hyperspectral images capture vast amounts of high-dimensional spectral information about a scene, making labeling an intensive task that is resistant to out-of-the-box statistical methods. Unsupervised learning of clusters allows for automated
segmentation of the scene, enabling a more rapid understanding of the image. Partitioning the spectral information contained within the data via dictionary learning in Wasserstein space has proven an effective method for unsupervised clustering. However, this approach requires balancing the spectral profiles of the data, blurring the classes, and sacrificing robustness to outliers and noise. In this paper, we suggest improving this approach by utilizing unbalanced Wasserstein barycenters to learn a lower-dimensional representation of the underlying data. The deployment of spectral clustering on the learned representation results in an effective approach for the unsupervised learning of labels.
Read the full abstract ▾
All authors Joshua Lentz, Nicholas Karris, Alex Cloninger, James M. Murphy
Mathematical Physics · Cross-listed from nlin.SI
Invariant Reduction for Partial Differential Equations. IV: Symmetries that Rescale Geometric Structures
Kostya Druzhkov and Alexei Cheviakov
For a system of partial differential equations admitting point, contact, or higher
symmetries, the framework of invariant reduction systematically computes how invariant
geometric structures, such as conservation laws, presymplectic structures, variational principles, and Poisson brackets, are inherited by the systems governing
symmetry-invariant solutions. We extend this mechanism to
geometric structures that are not invariant but are $\textit{rescaled}$ by a
symmetry. Specifically, if $X$ is the
symmetry used for reduction, $X_s$ is a
symmetry satisfying $[X_s,X]=aX$, and the Lie derivative $\mathcal{L}_{X_s}$ acts on an $X$-invariant element of the Vinogradov $\mathcal{C}$-spectral sequence as multiplication by $b$, then the restricted
symmetry $X_s|_{\mathcal{E}_X}$ acts on the corresponding reduction as multiplication by $a+b$. This shift rule gives rise to two phenomena: the $\textit{emergence of invariance}$, where reductions acquire an invariance that was not present at the level of the original structure, and the $\textit{loss of invariance}$, where reductions of invariant structures are no longer invariant. As an application, we describe a class of exact solutions to systems possessing sufficiently many
symmetries and conservation laws subject to certain compatibility conditions. These solutions are invariant under pairs of
symmetries and are completely determined by explicitly constructed functions that are constant on them; the description is
geometric and does not require any integrability-related structures such as Lax pairs. The framework is illustrated by two examples: the Lin–Reissner–Tsien equation of potential nonstationary transonic gas flows, for which closed-form exact solutions are obtained and validated numerically, and the potential Boussinesq system, for which the inherited Poisson bracket is employed to describe solutions determined by algebraic equations.
Read the full abstract ▾
General Mathematics
Adaptive Filtering via Canonical Systems with Time-Varying Hamiltonians
Keshav Raj Acharya and Pitambar Acharya
In many practical applications, signals and environments are time- varying, which makes fixed filters unreliable. Adaptive filtering, on the other hand, updates in real time to suppress noise, track nonstationary signals, and identify unknown systems. This paper investigates an adaptive filtering frame- work based on canonical systems with time-varying symmetric positive semi- definite
Hamiltonian matrices. The proposed method adapts the
Hamiltonian matrix using a gradient-based scheme designed to minimize the squared er- ror between the system output and a desired reference signal. We establish theoretical stability guarantees via Lyapunov analysis, ensuring boundedness of system trajectories and convergence of the error signal under suitable as- sumptions. Furthermore, we present numerical integration schemes preserving the underlying
Hamiltonian structure and projective techniques to maintain positive semidefiniteness of the
Hamiltonian matrix. Extensive simulations on synthetic nonstationary signals illustrate the effectiveness and robustness of the proposed adaptive filter.
Read the full abstract ▾
Analysis of PDEs · Cross-listed from nlin.PS
How inertia affects autotoxicity-mediated vegetation dynamics: from close-to to far-from-equilibrium patterns
Giancarlo Consolo, Carmela Currò, Gabriele Grifò et al. (+3 more)
In this work, the influence of inertial effects on the formation and
evolution of vegetation patterns on sloped arid terrains is investigated from the onset of instability to far-from-
equilibrium. Analyses are carried out in a
hyperbolic extension of the one-dimensional Klausmeier model, where autotoxicity effects are also taken into account. As the system moves away from the wave bifurcation threshold, two classes of solutions arise: small-amplitude periodic migrating bands near onset and large-amplitude travelling pulses in far-from-
equilibrium conditions. For the first class, results of LSA reveal that inertia has a twofold role at onset: it acts as a destabilising mechanism, thereby enlarging the parameter region in which uphill migrating vegetation bands can emerge, and it reduces the pattern migration speed. Its role also manifests itself close to onset, as proved by the Stuart-Landau equation for the pattern amplitude deduced via multiple-scale WNA. Indeed, it is shown that inertial effects may reverse the dynamical regime, from supercritical to subcritical, thus leading to hysteresis. For the second class of solutions, the travelling vegetation pulses are first captured via numerical simulations and then investigated via
Geometric Singular Perturbation Theory (GSPT). In far-from-
equilibrium conditions, inertia is shown to increase pulse speed while preserving the intrinsic multiscale structure of the solution, in full agreement with the numerical findings. Overall, the proposed combined analytical-numerical investigations have depicted several ecological scenarios as a function of the distance from the instability threshold, elucidating that inertia does not exclusively act as a time lag.
Read the full abstract ▾
All authors Giancarlo Consolo, Carmela Currò, Gabriele Grifò, Annalisa Iuorio, Giovanna Valenti, Frits Veerman
Mathematical Physics · Cross-listed from gr-qc
Batalin-Fradkin-Vilkovisky quantization of Einstein gravity with off-diagonal solutions encoding Hořava type generating functions
Elşen Veli Veliev and Sergiu I. Vacaru
We develop and apply the Batalin-Fradkin-Vilkovisky (BFV) formalism for quantizing off-diagonal solutions of the Einstein equations in general relativity. In the quasi-classical limit of
quantum gravity, such solutions possess specific nonlinear
symmetries and encode Hořava - Lifshitz (HL) configurations with anisotropic scaling and effective cosmological constants. The
geometric constructions are performed on Lorentz
manifolds enabled with nonholonomic 2+2 and 3+1 fibration structures.
Read the full abstract ▾
Probability · Cross-listed from cs.LG
Large Spikes in Stochastic Gradient Descent: A Large-Deviations View
Benjamin Gess and Daniel Heydecker
Large loss spikes in
stochastic gradient descent are studied through a rigorous large-deviations analysis for a shallow, fully connected network in the NTK scaling. In contrast to full-batch gradient descent, the catapult phase is shown to split into inflationary and deflationary regimes, determined by an explicit log-drift criterion. In both cases, large spikes are shown to be at least polynomially likely. In addition, these spikes are shown to be the dominant mechanism by which sharp minima are escaped and
curvature is reduced, thereby favouring flatter solutions. Corresponding results are also obtained for certain ReLU networks, and implications for curriculum learning are derived.
Read the full abstract ▾
Probability · Cross-listed from cs.LG
Stochastic Port-Hamiltonian Neural Networks: Universal Approximation with Passivity Guarantees
Luca Di Persio, Matthias Ehrhardt and Youness Outaleb
Stochastic port-
Hamiltonian systems represent open dynamical systems with dissipation, inputs, and
stochastic forcing in an energy based form. We introduce
stochastic port-
Hamiltonian neural networks, SPH-NNs, which parameterize the
Hamiltonian with a feedforward network and enforce skew
symmetry of the interconnection
matrix and positive semidefiniteness of the dissipation
matrix. For Itô dynamics we establish a weak passivity inequality in expectation under an explicit generator condition, stated for a stopped process on a compact set. We also prove a universal approximation result showing that, on any compact set and finite horizon, SPH-NNs approximate the coefficients of a target
stochastic port-
Hamiltonian system with $C^2$ accuracy of the
Hamiltonian and yield coupled solutions that remain close in mean square up to the exit time. Experiments on noisy mass spring, Duffing, and Van der Pol oscillators show improved long horizon rollouts and reduced energy error relative to a multilayer perceptron baseline.
Read the full abstract ▾
General Mathematics
Betweenness relations and Fuzzy betweenness relations in fuzzy metric spaces
Yu Zhong
In this paper, we mainly discuss the constructions and the characteristics of betweenness relations and fuzzy betweenness relations in KM-fuzzy metric spaces. And the family of betweenness relations induced by a KM-fuzzy metric form a nest of betweenness relations.The main focus of this paper is to introduce two different construction methods for fuzzy betweenness relations induced by a KM-fuzzy metric.One of them is directly obtained by using the implication operator. The other is through the corresponding nest of metrics of KM-fuzzy metrics. Furthermore, we also show that the two types of fuzzy betweenness relations are the same, and they also satisfy the eight kinds of four-point transitivity properties and the six kinds of five-point transitivity properties.
Read the full abstract ▾
Statistics Theory
Minimax Binary Counting under Shuffle Privacy: Poisson Limits and Randomized-Response Optimality
Alex Shvets
We study estimation of a deterministic binary count from the shuffled outputs of a common single-message local channel.
Privacy is required for every neighboring composition at fixed global parameters $(\varepsilon,\delta)$, and
estimators may be biased. We obtain uniform critical Poisson and Skellam approximations and characterize the limiting minimax risk as an infimum over finite observed-mark Poisson experiments. Let $\Lambda$ be the noise intensity required by the boundary Poisson-shift profile and let $\lambda_{\min}$ be the intensity required by the full composition-maximized randomized-response profile. Binary randomized response is asymptotically minimax optimal if and only if $\Lambda=\lambda_{\min}$. When $\Lambda<\lambda_{\min}$, the minimax value lies strictly between $(\Lambda+\lambda_{\min})/2$ and $\lambda_{\min}$, and a randomized-response construction with observed rare marks strictly improves on binary randomized response. We give a finite-sample certified example. Binary randomized response is strictly suboptimal at $\varepsilon=0$ for every $0<\delta<1$, and this persists for sufficiently small positive $\varepsilon$ at each fixed target. For every fixed positive $\varepsilon$, strict suboptimality also occurs along a sequence of fixed
privacy targets tending to zero. The variational characterization permits approximation by finite marked channels; it does not assert that a finite optimizer exists.
Read the full abstract ▾
Geometric Topology
A Gap in Stanfield's Proof of Sachs' Linear Linkless Embedding Conjecture
Ramin Naimi
This is a short note describing what I believe is a serious gap in Stanfield's proof of Sachs'
conjecture that every linklessly embeddable graph has a linear linkless
embedding in $\mathbb{R}^3$.
Information Theory
The Epistemic Support-Point Filter: Jaynesian Maximum Entropy Meets Popperian Falsification
Moriba Kemessia Jah
This paper proves that the Epistemic Support-Point Filter (ESPF) is the unique optimal recursive
estimator within the class of epistemically admissible evidence-only filters. Where
Bayesian filters minimize mean squared error and are driven toward an assumed truth, the ESPF minimizes maximum
entropy and surfaces what has not been proven impossible – a fundamentally different epistemic commitment with fundamentally different failure modes. Two results locate this
theorem within the broader landscape of estimation theory. The first is a unification: the ESPF's optimality criterion is the log-
geometric mean of the alpha-cut volume family in the Holder mean hierarchy. The Popperian minimax bound and the Kalman MMSE criterion occupy the p=+inf and p=0 positions on the same curve. Possibility and probability are not competing frameworks: they are the same ignorance functional evaluated under different alpha-cut geometries. The Kalman filter is the Gaussian specialization of the ESPF's optimality criterion, not a separate invention. The second result is a diagnostic: numerical validation over a 2-day, 877-step Smolyak Level-3 orbital tracking run shows that possibilistic stress manifests through necessity saturation and surprisal escalation rather than MVEE sign change – a direct consequence of the Holder ordering, not an empirical observation. Three lemmas establish the result: the Possibilistic
Entropy Lemma decomposes the ignorance functional; the Possibilistic Cramer-Rao Bound limits
entropy reduction per measurement; the Evidence-Optimality Lemma proves minimum-q selection is the unique minimizer and that any rule incorporating prior possibility risks race-to-bottom bias.
Read the full abstract ▾
Analysis of PDEs
On a fractional nonlinear Schrödinger equation with irregular coefficients. case: d<2s
Arshyn Altyby, Michael Ruzhansky, Mohammed Elamine Sebih et al. (+1 more)
In the case when $d<2s$, where $d$ is the space dimension and $s$ is the fractional power of the
Laplacian, we study the well-posedness for a cubic nonlinear Schrödinger equation (CNLSE) generated by the fractional
Laplacian and involving distributional, or less regular, coefficients. We formulate our problem in the setting of the concept of so-called very weak solutions and prove that it has a very weak solution. Moreover, we prove the uniqueness in some adequate sense as well as the compatibility of the very weak solution with the classical one when the latter exists. Our results cover the classical case when: $d=1, s=1$. A second task in this paper is to conduct some numerical experiments where interesting behaviours of the very weak solution are observed. The obtained result is the first example of the very weak well-posedness in the setting of nonlinear partial differential equations.
Read the full abstract ▾
All authors Arshyn Altyby, Michael Ruzhansky, Mohammed Elamine Sebih, Niyaz Tokmagambetov
Mathematical Physics
A complete classification of 2d symmetry protected states with symmetric entanglers
Alex Bols, Wojciech De Roeck, Michiel De Wilde et al. (+1 more)
We consider
symmetry protected topological states of 2d
quantum spin systems, with a finite
symmetry group $G$. It has been conjectured that such states are classified by the
cohomology group $H^3(G,U(1))$, but the completeness of this classfication is an open problem. We restrict ourselves to
symmetry protected topological states that can be prepared from a product state by a symmetric entangler. For this class of states, we prove that the classification by $H^3(G,U(1))$ is complete.
Read the full abstract ▾
All authors Alex Bols, Wojciech De Roeck, Michiel De Wilde, Bruno de O. Carvalho
Numerical Analysis · Cross-listed from cs.LG
On the Width Scaling of Neural Optimizers Under Matrix Operator Norms I: Row/Column Normalization and Hyperparameter Transfer
Ruihan Xu, Jiajin Li and Yiping Lu
A central question in modern deep learning is how to design optimizers whose behavior remains stable as the network width $w$ increases. We address this question by interpreting several widely used neural-network optimizers, including AdamW and
Muon, as instances of steepest descent under
matrix operator norms. This perspective links optimizer geometry with the Lipschitz structure of the network forward map, and enables width-independent control of both Lipschitz and smoothness constants. However, steepest-descent rules induced by standard $p \to q$ operator norms lack layerwise composability and therefore cannot provide width-independent bounds in deep architectures. We overcome this limitation by introducing a family of mean-normalized operator norms, denoted $\pmean \to \qmean$, that admit layerwise composability, yield width-independent smoothness bounds, and give rise to practical optimizers such as rescaled AdamW, row normalization, and column normalization. The resulting learning rate width-aware scaling rules recover $\mu$P scaling~\cite{yang2021tensor} as a special case and provide a principled mechanism for cross-width learning-rate transfer across a broad class of optimizers. We further show that
Muon can suffer an $\mathcal{O}(\sqrt{w})$ worst-case growth in the smoothness constant, whereas a new family of row-normalized optimizers we propose achieves width-independent smoothness guarantees. Based on the observations, we propose MOGA (
Matrix Operator Geometry Aware), a width-aware optimizer based only on row/column-wise normalization that enables stable learning-rate transfer across model widths. Large-scale pre-training on GPT-2 and LLaMA shows that MOGA, especially with row normalization, is competitive with
Muon while being notably faster in large-
token and low-loss regimes.
Read the full abstract ▾
Quantum Algebra
On the structure of categorical duality operators
Corey Jones and Xinping Yang
We systematically study categorical duality operators on
spin (and anyon) chains with respect to an internal fusion category
symmetry C. We parameterize duality operators on the quasi-local
algebra in terms of data dependent on the associated
quantum cellular automata (QCA) on the symmetric subalgebra $B$. In particular, a QCA $\alpha$ on $B$ defines an invertible C-C bimodule category $M_{\alpha}$, and the duality operators extending $\alpha$ form a simplex, with extreme points in bijective correspondence with the simple object of $M_{\alpha}$. Then we consider the structure of external
symmetries generated by a family of duality operators, and show that if the UV models are all defined on tensor product
Hilbert spaces, these categories necessarily flow to weakly integral fusion categories in the IR.
Read the full abstract ▾
Dynamical Systems
A new approach to the Poincaré center problem
Isaac A. García and Jaume Giné
We address the classical (degenerate or non-degenerate) center problem posed by Poincaré in the 19th century for monodromic singularities of analytic families of planar vector fields $\mathcal{X}$. We prove that, generically, every analytic center admits a Laurent inverse integrating factor $V$ in weighted polar coordinates. Moreover, we show that when $\mathcal{X}$ has no local curves of zero angular speed, the Poincaré map is analytic. Based on this result, we derive a theoretical procedure to determine parameter constraints within the family that characterize centers without curves of zero angular speed. Applications to nontrivial families that have resisted other methods are also provided.
Read the full abstract ▾
Number Theory
The Hofstadter Consecutive-Sum Sequence Omits Infinitely Many Positive Integers
Quanyu Tang
We study Hofstadter's greedy self-generating sequence, which begins with 1 and 2 and repeatedly chooses the least integer larger than the preceding term that is a sum of at least two consecutive earlier terms. We prove that the excess of its $n$th term over its index is bounded below by a positive constant times $\log\log n$, up to an additive constant, and that the sequence satisfies a
polynomial upper bound. In particular, the sequence omits infinitely many positive integers.
Read the full abstract ▾
Numerical Analysis
Anchor-Based Function Extrapolation with Proven Bounds and Projection Guarantees
Guy Hay and Nir Sharon
Classical approximation and learning methods are typically optimized for interpolation over a sampled domain {\Omega}, with no guarantees on their behavior in an extrapolation region {\Xi}, where small in-domain errors may amplify. We develop a model-agnostic framework that recasts extrapolation as a feasibility and projection problem with rigorous guarantees. The approach is built around anchor functions, auxiliary constructions for which one can certify an upper bound on the {\Xi}-distance to the unknown target function. Such certificates define feasible sets that are proven to contain the true function. Given any baseline approximation (e.g., least-squares or regularized regression), we obtain a corrected extrapolation by projecting the baseline onto the feasible set; the resulting predictor is proven not to increase the error on {\Xi}, and we prove quantitative bounds on the improvement. We establish new stability constants governing extrapolation, including a tight spectral condition number and a numerically stable inner-domain bound that connects in-domain error to extrapolation risk. To reduce conservatism of worst-case certification, we also propose probabilistic anchor functions that yield high-confidence feasible sets. Numerical experiments, including geomagnetic field modeling and nonlinear oscillators, demonstrate substantial reductions in extrapolation error and corroborate the theoretical predictions.
Read the full abstract ▾
Analysis of PDEs
Complex Dynamics of Wave-Character Transitions in Radially Symmetric Isentropic Euler Flows: Theory and Numerics
Eduardo Abreu, Geng Chen, Faris El-Katri et al. (+1 more)
We investigate the qualitative dynamics of smooth solutions to the radially symmetric isentropic compressible Euler equations, focusing specifically on the
evolution of rarefactive and compressive wave characters across three distinct configurations: the outward supersonic, subsonic, and inward supersonic regimes. For each case, we establish structural restrictions on wave-character transitions and identify invariant sign domains for gradient variables under specific initial data conditions. While our findings refine existing invariance properties in the outward supersonic regime, they reveal novel asymmetric transition mechanisms in the subsonic and inward regimes that are absent in purely supersonic expanding cases. Consequently, we derive sufficient conditions for finite-time singularity formation. To complement the analytical results where closed-form solutions are unavailable, we provide numerical experiments using a Semi-Discrete Lagrangian-Eulerian (SDLE) formulation. These simulations reproduce the predicted wave-character dynamics and offer qualitative evidence that supports our theoretical findings, providing a unified description of wave transitions in radially symmetric isentropic gas dynamics.
Read the full abstract ▾
All authors Eduardo Abreu, Geng Chen, Faris El-Katri, Erivaldo Lima
Mathematical Physics
Intertwining Markov Processes via Matrix Product Operators
Rouven Frassek, Jan de Gier, Jimin Li et al. (+1 more)
Duality transformations reveal unexpected equivalences between seemingly distinct models. We introduce an out-of-
equilibrium generalisation of
matrix product operators to implement duality transformations in one-dimensional boundary-driven Markov processes on
lattices. In contrast to local dualities associated with generalised
symmetries, here the duality operator intertwines two Markov processes via generalised exchange relations and realises the out-of-
equilibrium duality globally. We construct these operators exactly for the symmetric simple exclusion process with distinct out-of-
equilibrium boundaries. In this case, out-of-
equilibrium boundaries are dual to
equilibrium boundaries satisfying Liggett's condition, implying that the Gibbs-Boltzmann measure captures out-of-
equilibrium physics when leveraging the duality operator. We illustrate this principle through physical applications.
Read the full abstract ▾
All authors Rouven Frassek, Jan de Gier, Jimin Li, Frank Verstraete
Numerical Analysis
Understanding and Resolving Singularities in 3D Dirichlet Boundary Problems
David Levin
We introduce a two-phase approximation method designed to resolve singularities in three-dimensional harmonic Dirichlet problems. The approach utilizes the classical Green's function representation, decomposing the function into its singular and regular components. The singular phase employs Green's formula with the singular part, for which we show that it induces the necessary singularities in the solution. The regular phase then introduces a smooth correction to recover the remaining regular part of the solution. The construction employs high-order quadrature rules in the first phase, followed by collocation with a suitable harmonic basis in the second.
Read the full abstract ▾
Numerical Analysis
Subspace decomposition with defect diffusion coefficient
Dilini Kolombage, Axel Målqvist and Barbara Verfürth
Elliptic diffusion problems with multiscale heterogeneous coefficients lead to poorly conditioned discrete systems and therefore require effective preconditioning strategies. While subspace decomposition preconditioners perform well for fixed realizations of the coefficient, their repeated construction becomes prohibitively expensive in uncertainty quantification settings, particularly in Monte-Carlo simulations, where a large number of fine-scale realizations must be treated. In this study, we propose an offline-online approximation of a subspace decomposition preconditioner that exploits the localized structure of the random defects. The preconditioner is constructed from local subspace solves that are precomputed offline for a small set of reference configurations and efficiently combined online for arbitrary realizations. We analyze the spectral properties of the resulting offline-online approximation operator and confirm its robustness and efficiency through numerical experiments.
Read the full abstract ▾
Numerical Analysis · Cross-listed from cs.LG
OptEMA: Adaptive Exponential Moving Average for Stochastic Optimization with Zero-Noise Optimality
Ganzhao Yuan
Exponential moving averages (EMAs) are a central component of widely used adaptive optimizers such as Adam. However, existing analyses of Adam-style methods often yield suboptimal guarantees in the zero-noise regime, rely on open-loop parameter schedules, or require prior knowledge of smoothness constants. Motivated by these limitations, we introduce OptEMA and analyze two complementary variants: OptEMA-M, which applies an adaptive, decreasing EMA coefficient to the first moment with a fixed second-moment decay, and OptEMA-V, which swaps these roles. At the heart of these variants is a Corrected AdaGrad-Norm coefficient schedule. This formulation renders OptEMA algorithmically closed-loop and Lipschitz-free, meaning its effective stepsizes are trajectory-dependent and require no parameterization via the Lipschitz constant. Under lower-boundedness, unbiasedness, bounded variance, average smoothness, and a bounded
stochastic-gradient condition used to control the adaptive normalizers, we prove that both variants achieve the unified noise-adaptive rate $\tilde{\mathcal{O}} \left(T^{-1/2}+\sigma^{1/2}T^{-1/4}\right)$ for the averaged gradient norm. In the zero-noise regime, these bounds automatically reduce to the nearly optimal deterministic rate $\widetilde{\mathcal{O}}(T^{-1/2})$ without manual hyperparameter retuning.
Read the full abstract ▾
Complex Variables
Quasiregular values from generalized manifold with controlled geometry
Deguang Zhong
The main aim of this paper is to establish the Reshetnyak's
theorem for quasiregualr values from generalized $n$-
manifold with suitable controlled geometry to Euclidean space $\mathbb{R}^{n}.$ This generalizes a previous result due to Kangasniemi and Onninen on the setting of Euclidean space [A single-point Reshetnyak's
theorem, Trans. Amer. Math. Soc., 378(2025): 3105-3128].
Read the full abstract ▾