Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Friday 1 May

Statistics Theory

Profile Likelihood Inference for Anisotropic Hyperbolic Wrapped Normal Models on Hyperbolic Space

We study likelihood-based inference for the anisotropic hyperbolic wrapped normal distribution on standard hyperbolic space. The model has a manifold-valued location parameter and a full positive definite covariance matrix in tangent coordinates. For independent observations from this family, we analyze the profile maximum likelihood estimator obtained by optimizing the likelihood over the location after profiling out the covariance. To guarantee finite-sample existence, we formulate the estimator on a covariance shell that bounds eigenvalues away from zero and infinity. We prove that this constrained likelihood is well posed, that the anisotropic wrapped normal family is identifiable, and that the estimator is strongly consistent when the true covariance lies in the interior of the shell. In global normal coordinates for the location and log-covariance coordinates for the nuisance parameter, we establish joint asymptotic normality and derive efficient profile inference for the location parameter through the Schur-complement information. We further prove local asymptotic normality of the experiment and obtain the Hájek–Le Cam local asymptotic minimax lower bound under squared geodesic loss. The profile estimator attains this bound for truncated squared loss, and for ordinary squared loss under a uniform-integrability condition. We also give an explicit computational form of the estimator based on spectral clipping of the empirical tangent covariance, and present a Monte Carlo calibration study showing that the finite-sample scaled location risk and Wald coverage agree with the asymptotic theory.
Read the full abstract

Algebraic Geometry

Torsion Trajectories from Local Discriminants to Global Obstructions

For a normal surface singularity, the discrepancy between the ordinary and dual middle-perversity intersection complexes over \(\mathbb Z\) is measured by a finite group \(E\). In previous work, \(E\) was identified with link torsion, the exceptional-lattice discriminant group \(\Lambda^\vee/\Lambda\), a resolution-neighborhood boundary quotient, and, in the hypersurface case, \(\operatorname{coker}(T-\mathrm{id})_{\mathrm{tors}}\). This paper tracks the trajectory of this torsion from local singularity data to global obstruction theory. We follow the discriminant package \((E,q)\) through support cohomology, excision, global torsion, Brauer comparison, Bloch–Ogus residues, and rationalization. The method is example-driven: trajectory tables are computed for \(A_1\), \(A_k\), \(D_4\), \(E_8\), a non-ADE Brieskorn singularity, the threefold ordinary double point, nodal threefolds, nodal quintics, and the Benoist–Ottem benchmark. The computations reveal a sharp distinction: a surface \(A_1\) singularity has local \(\mathbb Z/2\)-torsion, whereas a threefold ordinary double point has torsion-free link \(S^2\times S^3\) and contributes free vanishing-cycle data instead. Thus finite discriminant torsion is naturally a codimension-two phenomenon, not a generic feature of nodes. The resulting pattern motivates a specialization problem: whether the Enriques \(2\)-torsion in Benoist–Ottem integral Hodge counterexamples is genuinely global, or can arise after degeneration from transverse \(A_1\)-type discriminant data along codimension-two strata.
Read the full abstract

Geometric Topology

Aspherical $PD_3$-pairs

We extend two results known for aspherical 3-manifolds to $PD_3$-pairs $(P,\partial{P})$ with aspherical ambient space $P$. Every such $PD_3$-pair may be assembled by attaching 1-handles to $PD_3$-pairs with aspherical; ambient space and $\pi_1$-injective boundary. (Thus the study of such pairs reduces to the study of $PD_3$-pairs of groups.) If $\pi$ is a group of type $FP$ whose indecomposable factors $G$ each have $\chi(G_i)=0$ then there are only finitely many such $PD_3$-pairs with $\pi_1(P)\cong\pi$.
Read the full abstract

Numerical Analysis · Cross-listed from stat.ME

Beyond Independence: on Jointly Normal Priors in Bayesian Inversion

We consider joint inversion for two or more unknown parameters from observational data in the Bayesian framework. Standard approaches often either treat the parameters as independent or impose structural similarity through regularisation terms that can be difficult to interpret statistically. We instead construct jointly Gaussian prior models with prescribed Gaussian marginals, so that correlation between the parameters can be incorporated without altering the marginal prior distributions. We propose a joint covariance construction that preserves the marginals, allows spatially varying cross-correlation, and supports uncertainty and inference in the correlation itself. The construction is valid for any strict contraction encoding the desired cross-correlation and is optimal in a canonical correlation sense under the principal square root factorisation. We demonstrate the method using prior sampling and several inference examples: a low-dimensional illustrative example and two higher-dimensional examples, including a PDE-constrained problem. The examples highlight both the potential pitfalls of ignoring or neglecting uncertainty in the correlation as well as reinforcing a key principle of the Bayesian paradigm: unknown quantities included in a model should be treated as random variables.
Read the full abstract

All authors Ruanui Nicholson, Matti Niskanen, Oliver J. Maclaren, Jari P. Kaipio

Numerical Analysis

A new approach for the model updating of $(\star,\epsilon)$-palindromic systems with no spill-over

In this paper, model updating problem of the $(\star, \epsilon)$-palindromic system with no spill-over (PMUP) is considered. First, we drive the spectral decomposition of $(\star, \epsilon)$-palindromic quadratic matrix polynomial $P(\lambda)$ by a standard pair $(X,\ J)$ and a parameter matrix $\Gamma$. And the structures of $\Gamma$ are provided when $J$ is assumed to be a block diagonal matrix. Using the spectral decomposition of $P(\lambda)$, a new sufficient solvable condition of the PMUP is provided and a set of analytical solutions is characterized. Finally, two algorithms are developed to address the cases of both simple and multiple eigenvalues. and the performance of our proposed method is illustrated by several numerical examples.
Read the full abstract

Mathematical Physics

Unraveling the Bott spiral

We construct and compute a homotopy-theoretic model for the Bott spiral of symmetry-protected topological phases (SPTs) studied by Queiroz–Khalaf–Stern. We model free and interacting fermionic SPTs using K-theory and reflection-positive invertible field theories (IFTs), resp., and define a twisted generalization of the Atiyah–Bott–Shapiro orientation to produce a free-to-interacting map. We also define and compute spiral maps of IFTs to model dimensional reduction in this context, answering a question of Hason–Komargodski–Thorngren. Our analysis highlights two general aspects of homotopical free-to-interacting maps. First, IFTs are more sensitive than K-theory is to the input symmetry data; in particular, the specification of an Altland–Zirnbauer class is insufficient information to define symmetry type for an IFT. Second, the remnant of Bott periodicity on the interacting side relies on an isomorphism of two extraspecial groups of order 32. Our computations use a novel 4-periodic description of a sector of the twisted ko-homology of elementary abelian 2-groups.
Read the full abstract

Optimization and Control

A Unified Regularity Condition for Optimal Control: Bridging LICQ, MFCQ, and Subdifferentials

This paper presents a unified derivation of transversality conditions in optimal control problems using exact penalty functions. The key regularity condition is that the origin is uniformly separated from the subdifferential of the penalty function in a neighborhood of the admissible set. This condition, hereafter referred to as the Unified Separation Condition (USC), generalizes the classical Mangasarian–Fromovitz condition for inequalities and linear independence of gradients for equalities: in the smooth case, LICQ and MFCQ imply USC (for inequalities, the implication follows from Gordan's theorem). Unlike classical regularity conditions, which require differentiability of the active constraints, USC remains applicable when the terminal constraints are nondifferentiable, where LICQ and MFCQ are not defined; the converse implication does not hold in general. Assuming exactness, we derive transversality conditions for all major cases: fixed and free terminal time, equality and inequality constraints, moving manifolds, and free left endpoint. The approach yields these classical results in a concise and transparent manner, avoiding the need for constructing cones of endpoint variations or applying separation theorems. From the computational perspective, the exact penalty formulation allows the differential constraints to be eliminated from the optimization entirely, so that only the cost functional and the terminal constraints are penalized. A numerical implementation for the time-optimal control of a harmonic oscillator confirms the practical applicability of the approach: the computed optimal time agrees with the analytical value obtained via Pontryagin's maximum principle to high accuracy. This establishes USC as a unifying regularity concept encompassing classical LICQ and MFCQ and extending naturally to nonsmooth settings.
Read the full abstract

Algebraic Geometry

The GIT Boundary of Quintic Threefolds

We determine the strictly semistable boundary of the GIT compactification of quintic threefolds for the natural $\mathrm{SL}(5)$-action on $\mathbb{P}(\mathrm{Sym}^5\mathbb{C}^5)$. Using the Hilbert–Mumford criterion and exact integer linear algebra, we enumerate thirty-eight maximal strictly semistable monomial supports up to coordinate permutation. After taking S-equivalence into account, their images in the GIT quotient reduce to twenty-one families, and we prove that these are precisely the irreducible components of the GIT boundary, with dimensions ranging from $1$ to $24$. Version 1 incorrectly identified the thirty-eight maximal supports with thirty-eight irreducible boundary components by overlooking S-equivalence; that claim is withdrawn and replaced by the twenty-one-component classification proved here. Four components recover Lakhani's first-level families and seventeen are additional components. For each component we construct a general polystable normal form and determine its generic connected projective stabilizer. Pairwise nonconjugacy of the resulting one-dimensional tori, together with Luna's etale slice theorem, excludes containments between distinct components. We also describe the singularities of general closed-orbit representatives. Their isolated singularities fall into exactly eleven weighted-homogeneous local families whose normalized weights occur in Yonemura's list, and every component has global minimal exponent $1$, the critical value $(n+1)/d$ for quintic hypersurfaces in $\mathbb{P}^4$.
Read the full abstract

Numerical Analysis

Adaptive anisotropic composite quadratures for residual minimisation in neural PDE approximations

We study the role of numerical quadrature in residual-minimisation methods for neural network approximation of partial differential equations. We first present an abstract error framework that separates approximation, quadrature and optimisation errors, and derive a nonlinear Strang-type estimate quantifying how inaccuracies in the discrete loss affect the final approximation. Motivated by this analysis, we propose an anisotropic adaptive composite quadrature strategy that controls the relative quadrature error of the residual loss using richer reference quadratures and bisection-based refinement. We then introduce a refresh-based training methodology that rebuilds the quadrature only when an online error indicator exceeds a prescribed threshold, balancing accuracy and computational cost. Numerical experiments on a range of benchmark problems show that the proposed approach narrows the gap between training and reference losses, uses quadrature points more efficiently and delivers strong approximation accuracy relative to non-adaptive quadrature strategies.
Read the full abstract

Information Theory

Artificial-Noise Aided Design for Movable-Antenna Enabled Physical-Layer Service Integration

This paper pioneers a novel scheme for artificial-noise (AN)-aided movable-antenna (MA)-enabled physical-layer service integration (PLSI) to harmonize the simultaneous delivery of multicast and confidential messages. By jointly exploiting the spatial reconfiguration capability of MAs and the interference shaping capability of AN, we aim to enhance secrecy performance while guaranteeing multicast reliability. The joint design of MA positions and transmit variables results in a highly coupled and non-convex optimization problem. To address this, we first provide key insights into the role of spatial degrees of freedom in AN design. We then characterize the AN direction under a structured transmission design and derive a closed-form expression for the AN-to-confidential power allocation ratio, which significantly simplifies the overall design. To solve the resulting problem, we further develop a low-complexity block coordinate ascent (BCA)-based scheme that alternates between transmit design and MA position optimization. Numerical results demonstrate that the proposed scheme achieves significant secrecy performance gains with low computational complexity and fast convergence, highlighting its effectiveness for MA-enabled PLSI systems.
Read the full abstract

All authors Zhifeng Tang, Guangchen Wang, Nan Yang, Xiangyun Zhou, Salman Durrani

Dynamical Systems

On Aubry's completeness conjecture

In this paper, we prove Aubry's completeness stating conjecture that for a twist map the graph of rotation numbers as a function of the cohomology classes is a purely singularly continuous function (called complete devil's staircase by Aubry) when the set of all minimal configurations is uniformly hyperbolic. Such a phenomenon is crucial for characterizing the chain of atoms being an insulator for the Frenkel-Kontorova model, and can be considered as the analogue of the phase locking phenomenon in critical circle maps as well as the fractional quantum Hall effect. In contrast, in the presence of a positive measure set of KAM tori, we prove that the devil's staircase is incomplete.
Read the full abstract

Number Theory

Primitive sets and von Mangoldt chains: Erdős Problem #1196 and beyond

A set of integers is primitive if no number in the set divides another. We introduce a new method for bounding Erdős sums of primitive sets, suggested from output of GPT-5.4 Pro, based on Markov chains with von Mangoldt weights. The method leads to a host of applications, yet seems to have been overlooked by the prior literature since Erdős's seminal 1935 paper. As applications, we prove two 1966 conjectures of Erdős-Sárközy-Szemerédi, on primitive sets of large numbers (#1196) and on divisibility chains (#1217). The method also provides a short proof of the Erdős Primitive Set Conjecture (#164), as well as the related claim that 2 is an ”Erdős-strong” prime. Moreover, the method resolves a revised form of the Banks-Martin conjecture, which has long been viewed as a unifying `master theorem' for the area.
Read the full abstract

All authors Boris Alexeev, Kevin Barreto, Yanyang Li, Jared Duker Lichtman, Liam Price, Jibran Iqbal Shah, Quanyu Tang, Terence Tao

Metric Geometry

On convex bodies with constant non-central sections

We prove that if $C$ is a symmetric convex body of revolution in $\mathbb R^4$ containing the unit Euclidean ball $\mathbb B_4$, such that the sections of $C$ by hyperplanes tangent to $\mathbb B_4$ have constant area $A>0$, then $C$ is a Euclidean ball, provided $\frac 1{\pi} \arctan((\frac{3A}{4\pi})^{1/3})$ satisfies certain arithmetic properties that can be read from its expansion as a continued fraction. We show that the set of values $A$ satisfying these properties has positive Hausdorff dimension.
Read the full abstract

Thursday 30 April

Optimization and Control

Route Based Map Matching via a Structured Codebook and Token Sequence Decoding

This study proposes an efficient and computationally light route based map matching method for GPS track data on urban expressway networks. The key idea is to exploit a symbolic structure of named lines and named junctions that link level map matching leaves unused. We represent each candidate route as a sequence of line and junction names, take the set of such sequences as a route codebook, and formulate map matching as scored alignment of a probe trajectory against members of the codebook. Probes become token sequences via a mesh quantizer, a precomputed grid mapping each coordinate to a line or junction token, and the decoder returns a member of the codebook by construction. The codebook is indexed by a DAFSA $\times$ Levenshtein automaton, a fuzzy lookup technique from approximate string matching and speech recognition; the per query decoding cost is orders of magnitude lower than a brute force scan. We evaluate the method on a deformed replica of the Tokyo Metropolitan Expressway topology. The method recovers the exact route at moderate GPS noise and continues to identify the line and junction sequence under heavy noise; a sensitivity analysis maps the mesh resolution operating range. Real probe evaluation, channel model calibration, and a head to head HMM comparison are left to a forthcoming version.
Read the full abstract

Rings and Algebras

Study of Rota-Baxter Operators in Matrix $C^*$-Algebras Motivated by Toeplitz Structures, and Applications to Sliding Mode Control

This paper studies Rota-Baxter operators on the matrix $C^*$-algebra $M_n(\mathbb{C})$, motivated by the discrete Toeplitz algebra (whose role is purely heuristic; see Remark~\ref{rem:toeplitz_scope}). We provide a structural classification of such operators compatible with the $C^*$-norm, analyze their induced Lie brackets, and apply them to deform system matrices in discrete-time delayed systems under sliding mode control. Lyapunov-based Bilinear Matrix Inequality conditions, together with a tractable linear reformulation via $Q=X^{-1}$, guarantee asymptotic stability on the sliding manifold and $\mathcal{L}_2$-gain stability. The effective gain from uncertainty $\delta$ to state $x$ is $\gamma/\sqrt{\mu}$ with $\mu=\lambda_{\min}(-\mathcal{M})>0$ determined a posteriori; minimizing $\gamma$ alone does not minimize this bound, which holds under zero extended initial conditions ($V_0=0$). We work under the standing assumption $m=n$ (square actuation); a supplementary non-degenerate example with $m=1$, $n=2$ illustrates LMI feasibility with $\Pi\neq0$. All algebraic results are proved directly in $M_n(\mathbb{C})$; no infinite-dimensional reduction is used.
Read the full abstract

Optimization and Control · Cross-listed from cs.CE

Scenario-driven optimization of passive vehicle suspensions: explaining the effectiveness of asymmetric damping

Asymmetric damping is widely used in passive vehicle suspensions, with rebound damping often recommended to exceed compression damping by a factor of two to three. Despite its prevalence, this guideline remains largely empirical and lacks a systematic derivation based on vehicle dynamics and excitation conditions. This paper presents a scenario-driven optimization framework that provides a principled explanation for the effectiveness of asymmetric damping. A minimal quarter-car model is employed to isolate the key mechanisms governing the trade-off between ride comfort, road holding, and transient response, using standardized ISO~8608 road excitations. Rebound and compression damping ratios are treated as independent design variables, and optimal configurations are identified via a stochastic Cross-Entropy algorithm applied to a non-convex, simulation-based objective function. Performance is assessed through ISO~2631 weighted RMS acceleration, tire–ground contact force variability, and settling time. The results show that symmetric damping is often sufficient under moderate excitation, whereas asymmetric damping becomes necessary under severe conditions, with commonly cited rebound-to-compression ratios emerging as scenario-dependent near-optimal solutions rather than universal constants.
Read the full abstract

Mathematical Physics

Quantum Dynamics: A Dilation-Based Approach

In the study of open quantum systems, one commonly describes the evolution of a system of interest through reduced dynamics, obtained by treating the environment indirectly rather than as a part of the full model. This thesis presents an expository account of an alternative, dilation-based viewpoint in the finite-dimensional setting, where a family of reduced dynamics is represented through unitary evolution on a larger system consisting of the original system together with an ancillary environment. After reviewing the reduced-dynamics perspective and the language of quantum channels, we formulate finite-dimensional quantum dynamics as channel-valued dynamical curves and use this framework to discuss Stinespring dilations of such curves. We then present exact dilation results for analytic dynamical curves, explain the singular behavior that can arise at t=0, and describe approximation results showing that Lipschitz-continuous dynamical curves admit approximate finite-dimensional Stinespring dilations. The thesis therefore provides a mathematically focused introduction to dilation-based modeling of quantum dynamics and argues that a change of perspective can lead to new ways of formulating problems in the theory of open quantum systems.
Read the full abstract

Probability · Cross-listed from cs.LG

A Review of the Receiver Operating Characteristic Curve and a Proof About the Area Beneath It

The Receiver Operating Characteristic (ROC) curve of a binary classifier has often been utilized to measure the performance of the classifier. The area beneath this curve is used in particular because of its quoted probabilistic interpretation as being equal to the probability that the classifier will rank a random positive observation above a random negative observation. This paper formalizes this claim, produces a bound on how far away from the truth it is if a hypothesis is not met, and gives a small literature review of the ROC curve.
Read the full abstract

Numerical Analysis

Exploring physics-dynamics coupling using moist shallow water equations

One of the key choices for numerical models of geophysical fluids is how parametrisations of physical processes interact with the numerical methods that handle the resolved flow, known in the atmospheric community as the dynamical core. As both the dynamical core and parametrisations of physics processes continue to evolve and improve, the issue of physics-dynamics coupling - how these two different parts of the model interact - becomes ever more important. In this paper we use two variations of the moist shallow water equations to develop a simplified framework that can be used to investigate some of the questions associated with physics-dynamics coupling. The shallow water equations act as a simplified dynamical core that is computationally cheap but still retains pertinent features of the atmosphere, and the introduction of moisture means the addition to the model of a physical parametrisation. This study uses 'split-physics' moist thermal shallow water equations which couple moisture to the shallow water equations via a parametrisation, and also develops a new 'integrated-physics' formulation of the moist thermal shallow water equations which re-formulates the model so that all the moist processes are captured in the dynamics. This integrated-physics model thus requires no physics-dynamics coupling and acts as a ground-truth to compare coupling strategies in the split-physics formulation against. We use both models to examine the effect of varying the approach to how physics is coupled to the dynamics in the semi-implicit quasi-Newton timestepping scheme. The results demonstrate the usefulness of the integrated-physics moist shallow water equations and provide insights into how best to deal with physics in a model's timestep.
Read the full abstract

Combinatorics

Visibility cliques, cubic containers, and dense orchard cores

The Big-Line-Big-Clique Conjecture of Kara, Por and Wood asserts that, for every fixed $k$ and $\ell$, every sufficiently large finite planar point set contains either $k$ collinear points or $\ell$ pairwise visible points. We prove a quantitative form in two structured regimes and isolate the precise ambient obstruction to the full conjecture. The main result is a deterministic cubic-container theorem. If $A \subset \mathbb{R}^2$ has $n$ points, no $k$ collinear points, and all but $s$ points of $A$ lie on a real cubic, then the cubic-supported part of $A$ has a visible clique cover of size $O_k(s+1)$; in particular $V(A)$ contains a clique of size $\Omega_k(n/(s+1))$, unless the cubic is the excluded three-line case containing only $O_k(1)$ points. Combining this with the Green-Tao structure theorem, we obtain that every $n$-point set with no $k$ collinear points and at most $Kn$ ordinary lines contains a visible clique of size $\Omega_{k,K}(n)$; more strongly, all but $O_K(1)$ points can be partitioned into $O_{k,K}(1)$ mutually visible sets. We also combine the cubic-container theorem with the Elekes-Szabo theorem on triple lines and cubic curves to prove the Big-Line-Big-Clique conclusion for point sets contained in any fixed irreducible algebraic curve. Finally, we prove a dense-orchard core lemma showing that the absence of a visible $K_\ell$ forces a positive-density subset in which every point lies on linearly many 3-rich lines, and we give a sharp one-blocker example showing why ambient blockers cannot be ignored.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Data Deletion Can Help in Adaptive RL

Deploying reinforcement learning policies in the real world requires adapting to time-varying environments. We study this problem in the contextual Markov Decision Process (cMDP) framework, where a family of environments is indexed by a low-dimensional context unknown at test time. The standard approach decomposes the problem: train a so-called "universal policy" which assumes knowledge of the true context, then pair it with a context estimator which approximates context using the observed trajectory. We identify a simple, counterintuitive trick that substantially improves the estimator: randomly delete a fraction of the training buffer after each round. This works because data is collected across multiple rounds using progressively better policies, and older trajectories come from a different distribution than what the estimator will face at deployment time; random deletion creates an implicit exponential decay on older data while preserving diversity without requiring any explicit identification of which samples are stale. This reduces robustness gap by 30% for MLPs and by 6% on average for recurrent networks. Strikingly, it allows a narrow MLP with 5x fewer parameters to outperform a wide MLP trained without deletion. To understand when and why deletion helps, we analyze regularized empirical risk minimization with a mismatch between the train distribution and the distribution at deployment; in this idealized setting, we prove that removing a single uniformly random training point decreases expected test loss in expectation under mild conditions. For ridge regression we make this quantitative: deletion helps when the regularization coefficient is moderate and the signal-to-noise ratio (SNR) is sufficiently low, and, crucially, this SNR threshold gives a direct measure of how large the distribution mismatch between training and deployment must be for deletion to be beneficial.
Read the full abstract

All authors Param Budhraja, Aditya Gangrade, Alex Olshevsky, Venkatesh Saligrama

Algebraic Geometry

The logarithmic leaf complex and foliated d-semistability

We study holomorphic foliations on normal crossings varieties arising as semistable degenerations. We do so by we exploring the notion of foliated d-semistability using the language of logarithmic structures in the sense of Fontaine-Illusie. First, we identify both local and global obstructions to d-semistability. In order to analyze the existence of smoothings, we develop a logarithmic deformation theory of foliations and show that the corresponding moduli functor admits a versal hull.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

A Dirac-Frenkel-Onsager principle: Instantaneous residual minimization with gauge momentum for nonlinear parametrizations of PDE solutions

Dirac-Frenkel instantaneous residual minimization evolves nonlinear parametrizations of PDE solutions in time, but ill-conditioning can render the parameter dynamics non-unique. We interpret this non-uniqueness as a gauge freedom: nullspace directions that leave the time derivative unchanged can be used to select better-conditioned parameter velocities. Building on Onsager's minimum-dissipation principle, we introduce a history variable – interpretable as momentum – and inject it only along the nullspace directions. The resulting Dirac-Frenkel-Onsager dynamics preserve instantaneous residual minimization, in contrast to standard regularization that can introduce bias, while promoting temporally smooth parameter evolutions. Examples demonstrate that the approach leads to increased robustness in singular and near-singular regimes.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

High-Probability Convergence in Decentralized Stochastic Optimization with Gradient Tracking

We study high-probability (HP) convergence guarantees in decentralized stochastic optimization, where multiple agents collaborate to jointly train a model over a network. Existing HP results in decentralized settings almost exclusively focus on the Decentralized Stochastic Gradient Descent ($\mathtt{DSGD}$) algorithm, which requires strong assumptions, such as bounded data heterogeneity, or strong convexity of each agent's cost. This is contrary to the mean-squared error (MSE) results, where methods incorporating bias-correction techniques are known to converge under relaxed assumptions and achieve better practical performance. In this paper we provide the first step toward bridging the gap, by studying HP convergence of $\mathtt{DSGD}$ incorporating the gradient tracking technique, in the presence of noise satisfying a relaxed sub-Gaussian condition. We show that the resulting method, dubbed $\mathtt{GT-DSGD}$, achieves order-optimal HP convergence rates for both non-convex and Polyak-Łojasiewicz costs, of order $\mathcal{O}\Big(\frac{\log(1/\delta)}{\sqrt{nT}}\Big)$ and $\mathcal{O}\Big(\frac{\log(1/\delta)}{nT}\Big)$, respectively, where $n$ is the number of agents, $T$ is the time horizon and $\delta \in (0,1)$ is the confidence parameter. Our results establish that $\mathtt{GT-DSGD}$ converges in the HP sense under the same conditions on the cost as in the MSE sense, while achieving comparable transient times. To the best of our knowledge, these are the first HP guarantees for decentralized optimization methods incorporating bias-correction. Numerical experiments on real and synthetic data verify our theoretical findings, underlining the superior performance of $\mathtt{GT-DSGD}$ and highlighting that the benefits of incorporating bias-correction are also maintained in the HP sense.
Read the full abstract

Commutative Algebra

Elimination Templates in Macaulay2

We introduce the package EliminationTemplates for the Macaulay2 computer algebra system, which provides tools for constructing automatic solvers for families of zero-dimensional radical ideals depending on algebraically independent parameters. This article provides a self-contained description of how elimination templates are constructed for such families and their specialization properties. Additionally, we describe the main functionality and datatypes provided by our package, and illustrate its usage on several examples, including applications from computer vision from which elimination templates originated.
Read the full abstract

All authors Manav Batavia, Cheng Chen, Anna Natalie Chlopecki, Timothy Duff, William Huang, Aolong Li, Wanchun Shen

Logic

Uniformity of Consistency in Arithmetic and Gödel's Second Incompleteness Theorem: Ein Märchen

In much discussed work Artemov has recently argued that, for $\mathrm{PA}$, the consistency schema admits a form of uniform verification via selector-proofs, despite the unprovability of the corresponding uniform consistency sentence $\mathrm{Con}(\mathrm{PA})$. In this note, we show that this phenomenon extends to all sufficiently strong, uniformly reflexive arithmetizable theories, including $\mathrm{ZF}$ and many of their extensions: For such theories $T$, there exists a primitive recursive selector which, given a derivation code $d$, extracts a finite fragment $T_d\subseteq T$ containing the non-logical axioms occurring in $d$, uses a reflexivity proof of $\mathrm{Con}(T_d)$, and produces a $T$-proof that $d$ is not a derivation of $0=1$. As a dictum, one obtains a $T$-verification of the consistency of $T$ in a uniform way, despite the fact that it cannot be internalized as the single universal consistency sentence prohibited by Gödel's Second Incompleteness Theorem. We further analyze this latter discrepancy and locate selector-proofs within the broader framework of provability and reflection.
Read the full abstract

2605.00266 · 30 Apr · Substantially revised version. The paper now incorporates the finite-fragment consistency step in the analysis of selector-proofs and proves a corresponding selector-proof theorem for uniformly reflexive theories. Sections 2 and 3 have been rewritten, with examples including extensions of PA and ZF and a revised discussion of Gödel's 2. UVS, reflection and Hilbert's program

Geometric Topology

Smoothing of singular intersections of ellipsoids: pyramitoid

The goal of this work is to continue the study the smoothings of 3-dimensional manifolds with singularities obtained as small covers of non simple right-angle Coxeter polyhedral orbifolds. They appear in the study of coaxial intersections of ellipsoids. In particular we introduce the concept of $n$-pyramitoid generalizing the $n$-pyramid.
Read the full abstract

Information Theory

Joint Accuracy and Confidentiality in Semantic-Aware Secure Remote Reconstruction

In this paper, we consider remote reconstruction over wireless networks when simultaneous accuracy at the legitimate receiver and confidentiality against eavesdropping are required. These two objectives are often treated separately, even though they arise from the same update process and are marginals of a joint reconstruction event. This paper introduces confidential reconstruction accuracy (CRA), a metric to capture the joint event in which the legitimate receiver reconstructs correctly while the eavesdropper fails. Under randomized stationary policies, we develop a three-dimensional stationary analysis and derive closed-form expressions for the long-term average CRA and the optimal transmission probability. The results show that conventional marginal analysis can misidentify the optimal policy and misestimate the achievable simultaneous accuracy-confidentiality performance. They also reveal nontrivial behaviors: more frequent transmissions or better legitimate channels do not necessarily improve joint accurate and confidential reconstruction, and when the eavesdropping channel is strong, improving the legitimate channel alone may be insufficient. Finally, the framework induces the spatial safety boundary in a geofencing setting for secure remote reconstruction.
Read the full abstract

Information Theory

Sequential Automorphism Ensemble Decoding with Early Stopping

In this paper, a low-complexity approach for the automorphism ensemble decoder (AED) using successive cancellation (SC) as constituent decoders is proposed. The approach sequentially activates sub-decoders and terminates the decoding process based on pre-optimized parameters, derived from the strong correlation observed between the decoding outcome and the SC path metric. An algorithm is proposed to find a list of early termination thresholds that minimize average decoding complexity subject to a block-error rate (BLER) constraint. For various code parameters and a BLER below $10^{-3}$, simulation results show that average decoding complexity is reduced by a factor of at least $6 \times$, and up to $22 \times$, compared to the original AED complexity, with a negligible degradation in BLER.
Read the full abstract

All authors Charles Pillet, Pascal Giard, Bassant Selim, François Leduc-Primeau

Information Theory · Cross-listed from eess.SP

The Resurrection of Spectrum Spreading for 6G and Beyond: From Sinusoids to Chirps

Orthogonal frequency-division multiplexing (OFDM) and its sinusoidal subcarriers have underpinned the 4G and 5G eras, delivering high spectral efficiency and resilience to multipath fading through an efficient multicarrier architecture. However, as future systems move toward doubly dispersive environments driven by high-mobility applications and migration to mmWave/sub-THz bands, the time-invariance assumption underlying OFDM becomes increasingly difficult to maintain, and Doppler-induced degradation becomes prominent. While enhancements such as MIMO, advanced coding, and scheduling provide incremental remedies, they introduce additional overhead, because the sinusoidal subcarrier itself offers no inherent waveform-level robustness to Doppler impairments. Accordingly, two time-frequency spreading philosophies have emerged to improve Doppler resilience by distributing each symbol's energy across both dimensions of the time-frequency plane: (i) 2D isotropic spreading via the delay-Doppler (DD) domain, exemplified by the orthogonal time frequency space (OTFS) family, and (ii) sheared spreading via parameterizable chirps, exemplified by the affine frequency-division multiplexing (AFDM) family. In this article, we examine key considerations for future waveform design across these paradigms and argue that transitioning from the sinusoidal subcarriers of OFDM to the chirp-based subcarriers offers a viable design direction for improving Doppler robustness while retaining much of the mature OFDM infrastructure. This perspective also highlights the suitability of chirp-based waveforms for integrated sensing and communications (ISAC) and their extensibility to emerging physical-layer techniques. Overall, we argue that the transition from sinusoids to chirps is a technically motivated, compelling evolutionary direction for future wireless physical layer design.
Read the full abstract

All authors Hyeon Seok Rou, Giuseppe Thadeu Freitas de Abreu, Emil Björnson, Sunwoo Kim, Marios Kountouris