Rings and Algebras
Localization, Local–Global Transfer, and Hull Theory for $C4^{\ast}$-Modules over Commutative Rings
Chandrasekhar Gokavarapu
Let \(R\) be a commutative ring and \(M\) an \(R\)-module. We develop a localization and local-global theory for \(C4\)-modules, \(C4^{\ast}\)-modules, strongly \(C4^{\ast}\)-modules, \(C4\)-hulls, and pseudo-continuous hulls over commutative rings. The problem is structural: these notions are defined through decompositions, summand conditions, and minimal extensions, while localization changes decomposition data, support, and hull minimality. We prove forward localization
theorems for the \(C4\), \(C4^{\ast}\), and strongly \(C4^{\ast}\) conditions under exact lifting hypotheses formulated through decomposition lifting, morphism lifting, and submodule lifting. We also prove converse local-global
theorems under descent and patching hypotheses, showing when primewise or maximal-local \(C4^{\ast}\) behavior implies global \(C4^{\ast}\) behavior. In addition, we establish obstruction results showing that no unrestricted local-global principle can hold. We compare the localization of a global \(C4\)-hull or pseudo-continuous hull with the hull formed after localization. We show that hull commutation requires both localization stability of the hull class and envelope-type axioms for hull minimality and uniqueness, and we prove conditional patching
theorems for reconstructing global hulls from compatible local hulls. Our method is purely algebraic and support-theoretic, based on summand descent, patching of local witnesses, support control, and dimension-stratified transfer on \(\operatorname{Spec} R\). As applications, we show that for commutative artinian rings these properties are detected exactly on the local factors, and that for finitely generated torsion modules over a Dedekind domain they are detected exactly on the primary components, equivalently on the localizations at maximal ideals in the support.
Read the full abstract ▾
Information Theory · Cross-listed from eess.SP
Continuous Algebraic Diversity: Unifying Spectral, Wavelet, and Time-Frequency Analysis via Lie Group Actions
Mitchell A. Thornton
We provide a computable criterion for selecting among
Fourier, wavelet, and time-frequency analysis by extending the algebraic diversity (AD) framework to Lie groups acting on $L^2(\mathbb{R})$. To our knowledge, there is no other criterion that provides this selection capability. The group-averaged
estimator generalizes from a finite sum over group elements to an integral with respect to Haar measure. A Continuous Replacement
Theorem establishes signal-noise separation under equivariance and ergodicity conditions, with a noise operator $\mathcal{N}_G = C_\rho^{-2}$ determined by the Duflo-Moore operator that explains the frequency-dependent noise floor in wavelet analysis as a consequence of the affine group's non-unimodularity. A Unification
Theorem shows that classical spectral analysis corresponds to the translation group, wavelet analysis to the affine group, time-frequency analysis to the Heisenberg-Weyl group, and spherical harmonics to SO(3). The commutativity residual $\delta$, extended to
Hilbert-Schmidt operator norms, provides a principled selection criterion among these groups. A double-commutator generalized
eigenvalue problem solves the blind group matching problem in
polynomial time. A Discretization Recovery
Theorem establishes that all discrete AD results are sampling approximations to the continuous theory, with $\mathbb{Z}_M \to (\mathbb{R},+)$ as $M \to \infty$.
Read the full abstract ▾
Combinatorics
Partial Petrial Polynomials of Ribbon Graphs
Xiaoxiang Yu, Rong-Xia Hao, Jianbing Liu et al. (+1 more)
Gross, Mansour, and Tucker [European J. Combin., 95 (2021): 103329] introduced the partial Petrial
polynomial of a ribbon graph $G$, denoted by $^{\partial}{\varepsilon^{\times}_{G}}(z)$. Beck and Mellor proved, in both orientable and non-orientable cases respectively, that the Euler genus of a bouquet equals the rank of a certain
matrix over $\mathbb{GF}(2)$. In this paper, we first generalize Beck and Mellor's results from bouquets to all ribbon graphs. Secondly, we give an equivalent representation of the partial Petrial
polynomial for all ribbon graphs. Specifically, the partial Petrial
polynomial of a ribbon graph $G$ with $n$ vertices is equal to the sum of this
polynomial for $2^{n-1}$ distinct bouquets. Moreover, we give the definition of a modified partial Petrial
polynomial by assigning coefficients $+1$ or $-1$ to the terms in the partial Petrial
polynomial such that the resulting
polynomial satisfies the four-term relation for graphs. Finally, we generalize the modified partial Petrial
polynomial from bouquets to all signed simple graphs and prove that this
polynomial is $4$-invariant, which provides an answer to the problem posed by Lando [J.~Combin.~Theory Ser.~B,~80~(1) (2000): 104-121]: Which of the known graph invariants are $4$-invariants?
Read the full abstract ▾
All authors Xiaoxiang Yu, Rong-Xia Hao, Jianbing Liu, Zhiguo Li
Numerical Analysis · Cross-listed from cs.CV
Medial Axis Aware Learning of Signed Distance Functions
Samuel Weidemaier, Christoph Norden-Smoch and Martin Rumpf
We propose a novel variational method to compute a highly accurate global signed distance function (SDF) to a given point cloud. To this end, the jump set of the gradient of the SDF, which coincides with the medial axis of the surface, is explicitly taken into account through a higher-order variational formulation that enforces linear growth along the gradient direction away from this discontinuity set. The eikonal equation and the zero-level set of the SDF are enforced as constraints. To make this variational problem computationally tractable, a phase field approximation of Ambrosio-Tortorelli type is employed. The associated phase field function implicitly describes the medial axis. The method is implemented for surfaces represented by unoriented point clouds using neural network approximations of both the SDF and the phase field. Experiments demonstrate the method's accuracy both in the near field and globally. Quantitative and qualitative comparisons with other approaches show the advantages of the proposed method.
Read the full abstract ▾
Information Theory · Cross-listed from cs.MA
InfoChess: A Game of Adversarial Inference and a Laboratory for Quantifiable Information Control
Kieran A. Murphy
We propose InfoChess, a symmetric
adversarial game that elevates competitive information acquisition to the primary objective. There is no piece capture, removing material incentives that would otherwise confound the role of information. Instead, pieces are used to alter visibility. Players are scored on their probabilistic inference of the opponent's king location over the duration of the game. To explore the space of strategies for playing InfoChess, we introduce a hierarchy of heuristic
agents defined by increasing levels of opponent modeling, and train a reinforcement learning
agent that outperforms these baselines. Leveraging the discrete structure of the game, we analyze gameplay through natural information-theoretic characterizations that include belief
entropy, oracle cross
entropy, and predictive log score under the action-induced observation channel. These measures disentangle epistemic uncertainty, calibration mismatch, and uncertainty induced by
adversarial movement. The design of InfoChess renders it a testbed for studying multi-
agent inference under partial observability. We release code for the environment and
agents, and a public interface to encourage further study.
Read the full abstract ▾
Statistics Theory
Tweedie Calculus
Santiago Torres
Tweedie's formula, which under Gaussian noise expresses the posterior mean of a latent variable directly from the observed-data density, is a cornerstone of empirical Bayes and measurement-error analysis. No general theory, however, explains when analogous identities hold, how they are structured, or how to derive them for non-Gaussian noise and for posterior functionals other than the mean. This paper develops such a framework for additive-noise models. I characterize when conditional expectations of an unobserved latent variable, given the observed signal, admit direct expressions in terms of the observed density – identities I call Tweedie representations – and show that they are governed by a linear map, the Tweedie functional. Under general conditions, I prove that this functional exists, is unique, and is continuous. I provide a constructive method for its computation based on
Fourier analysis: the functional is obtained by extending the inverse
Fourier transform of an explicit tempered distribution. The theory yields posterior-mean formulas for non-Gaussian noise and provides new representations for nonlinear posterior functionals. Applications include Laplace mechanisms in differential
privacy and heteroskedastic Gaussian sequence models in compound decision problems.
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.RO
Behavior Cloning Under PD Control: A Finite-Horizon Theory of Gain-Dependent Error Amplification
Junghoon Seo
Behavior cloning (BC) on position-controlled
robots is shaped by the PD loop that executes policy actions. We give a finite-horizon, nonasymptotic analysis of how controller gains affect BC failure. Independent sub-Gaussian action errors propagate through gain-dependent closed-loop dynamics into sub-Gaussian position errors. The resulting failure tail is controlled by controller amplification multiplied by validation loss and generalization slack, so validation loss alone can mis-rank gains. Under shape-preserving upper-bound assumptions, the analysis separates label difficulty, injection strength, and contraction, ranking compliant-overdamped gains as tightest and stiff-underdamped gains as loosest, with the mixed regimes system-dependent. In the canonical scalar second-order PD system, stationary position-error variance increases with stiffness and decreases with damping over the stable range, and exact zero-order-hold discretization inherits the ordering to leading order. This extends the error-attenuation explanation of bronars et al. (2026) to finite-horizon failure bounds.
Read the full abstract ▾
Number Theory
Arithmetic functions and learning theory
W. Burstein, A. Iosevich and A. Sant
We establish a connection between analytic number theory and computational learning theory by showing that the Möbius function belongs to a class of functions that is statistically hard to learn from random samples. Let $\mu_R$ denote the restriction of the Möbius function to the squarefree integers in $\{1,\dots,R\}$. Using a recent lower bound of Pandey and Radziwiłł for the $L^1$ norm of exponential sums with Möbius coefficients, we prove that \[ \FR(\mu_R) \gg R^{-1/4-\epsilon} \] for every $\epsilon>0$. We then show that, for a suitable absolute constant $c_0>0$, the class of $\{-1,1\}$-valued functions on the squarefree integers with
Fourier Ratio at least $c_0$ has Vapnik–Chervonenkis dimension at least $cR$. It follows that any distribution-independent learning
algorithm that succeeds uniformly on the class $\mathcal{H}_R(\eta_R)$ containing $\mu_R$, where $\eta_R \to 0$, requires at least $\Omega(R)$ samples. We also discuss a conditional improvement under a strong uniform bound for additive twists of the Möbius function, and we note that the same method applies to the Liouville function.
Read the full abstract ▾
Mathematical Physics · Cross-listed from gr-qc
Entropy considerations in Many-Body Gravity and General Relativity, and the impact on cosmic inflation
S Ganesh
Many body
gravity (MBG) is a novel modified theory of
gravity formulated in a 5-D space-time-temperature framework, in which the variation in temperature is recast as a variation in the 5-D metric. Previous work on MBG has shown that it can reproduce
galaxy rotation curves, radial acceleration relation and the weak gravitational
lensing of the bullet cluster, without the inclusion of dark matter. In this work we show that MBG can reproduce
cosmic inflation, and in the process, analyze fundamental relations between interaction, time and
gravity. To analyze
cosmic inflation using interacting massless scalar fields, we first analyze theoretically a hypothetical universe with a single massive particle, or a collection of non-interacting massive particles. A quantitative relation between time and interaction is developed using
Quantum Field Theory (QFT), which suggests that the notion of time becomes ill-defined for such a universe. The mass terms in MBG and General Relativity cause a discrepancy with the QFT results. An interacting massless scalar field then becomes a necessity to resolve the issue at the onset of inflation. However, the entropic terms in the MBG field equations are seen to be consistent with the QFT results and further accelerate inflation. The slow-roll condition is shown to be a natural consequence of the Euler-Lagrange equations of motion governing the massless scalar field in 5-D space-time-temperature, during the early phase of inflation. Finally, the MBG field equations are solved in the context of a Friedmann metric, leading to inflation. The matter era is also investigated.
Read the full abstract ▾
Numerical Analysis
Smooth perturbations of diagonally implicit Runge–Kutta methods
John Driscoll, Sigal Gottlieb, Zachary J. Grant et al. (+3 more)
A mixed accuracy framework for Runge–Kutta methods presented in [Grant, JSC 2022] has been shown to speed up the computation in diagonally implicit Runge–Kutta (DIRK) methods by using less expensive low accuracy approaches for the implicit stages. This theory included both smooth and nonsmooth perturbations, and subsequent work focused primarily on the case of nonsmooth perturbations that arise from mixed precision simulations. In this work the focus is on smooth perturbations that arise from using less accurate models or under-resolved iterative solvers to simplify the implicit computations. We develop an accuracy and stability analysis based on the framework in [Grant, JSC 2022] to design methods that strategically replace the original operator by a lower accuracy operator to reduce computational cost while mitigating the effect of the perturbations. In particular, we focus on designing novel methods that are high order for smooth perturbations that satisfy additional local consistency conditions. Finally, we verify the performance of the novel perturbed DIRK methods designed in this work and numerically study the impact of different types of smooth perturbations on the accuracy and stability of the methods.
Read the full abstract ▾
All authors John Driscoll, Sigal Gottlieb, Zachary J. Grant, César Herrera, Tej Sai Kakumanu, Monica Stephens
Commutative Algebra
Mixed linkage of numerical semigroup ideals
Ignacio Ojeda
We introduce principal and canonical linkage for relative ideals of a numerical
semigroup $S$ and study their interaction modulo translation. On normalized $S$-reflexive ideals, a principal link followed by a canonical link acts by addition of the canonical ideal $K$. The resulting mixed components have paths as their underlying simple graphs, and their even liaison classes are chains under inclusion. If $r(K)$ is the positive reduction number of $K$, every even class has at most $r(K)$ elements and every mixed component has at most $2r(K)$ vertices. For components with a loop, the bound improves to $r(K)$. For
semigroups of type two, we compute the even class of a given ideal from its occupied and gap blocks along arithmetic progressions and prove that the largest even class has exactly $r(K)$ elements. This equality can fail in type three. Both component bounds are sharp, and explicit families of
embedding dimension three give components of unbounded size with and without loops.
Read the full abstract ▾
Symplectic Geometry
A cord algebra for tori in three-space
Marián Poppr
Given a thin
torus $T_K$ around a
knot $K\subset \mathbb{R}^3$, we construct Morse models of cord
algebra $Cord(T_K)$ with $\mathbb{Z}$ and loop space coefficients. Using the Multiple time scale dynamics we identify $Cord(T_K; \mathbb{Z})$ with $Cord(K; \mathbb{Z})$. In combination with the works of Cieliebak-Ekholm-Latschev-Ng and Petrak this indirectly relates $Cord(T_K)$ to $0$-th degree Legendrian contact homology $LCH_0(\mathcal{L}^\ast_+ T_K)$ of one component of the unit conormal bundle over $T_K$. Our definition of $Cord(T_K)$ is motivated by $J$-holomorphic curves with boundary on the Lagrangian submanifold $L^\ast_+ T_K\cup\mathbb{R}^3$ with an arboreal singularity along the
torus $T_K$.
Read the full abstract ▾
Combinatorics
Noncrossing Partitions From Cones and Semicircles
Michael Dougherty, Kaiyi Fang, Yunting Jiang et al. (+4 more)
For each finite configuration of distinct points in the plane, there is an associated
lattice of noncrossing partitions. When these points form the vertices of a convex polygon, the result is the classical noncrossing partition
lattice, which is enumerated by the Catalan numbers and satisfies many other useful properties. In this article, we examine three variations of this
lattice which arise when the starting configuration is allowed to have points on the sides of a convex polygon rather than just the vertex set.
Read the full abstract ▾
All authors Michael Dougherty, Kaiyi Fang, Yunting Jiang, Edgar Lin, Lucas Lindenmuth, Eleanor Pokras, Gina Root
Logic
A rank function for Fraïssé classes and the rank property
Carlos López-Callejas and Jareb Navarro-Castillo
Given a hereditary class $\mathcal{F}$ of finite relational structures, the rank function $\mathsf{rk}:\sigma\mathcal{F}\to\omega_1\cup\{\infty\}$, introduced by Kubiś and Shelah, measures how far a countable structure is from being universal within its class: $\mathsf{rk}(X)=\infty$ if and only if the Fraïssé limit embeds into $X$. We say that $\mathcal{F}$ has the Rank Property (RP) if every countable ordinal is realized as the rank of some $X\in\sigma\mathcal{F}$. We develop the basic theory of the rank function and establish RP for three families of classes: those satisfying the free amalgamation property and the full extension property (covering graphs, hypergraphs, and many others); finite tournaments; and finite linear orders. For the latter, we compute the rank of every countable ordinal: if $\omega^{\beta_1}\cdot c_1$ is the leading Cantor normal form term of $\alpha\geq\omega$, then $\mathsf{rk}(\alpha)=\omega\cdot\beta_1+\lfloor\log_2 c_1\rfloor$.
Read the full abstract ▾
Combinatorics
Noncrossing Partitions From Hull Configurations
Michael Dougherty and Gina Root
Each finite configuration of points in the plane determines a corresponding
lattice of noncrossing partitions. When these points form the vertex set of a convex polygon, the associated
lattice is the classical noncrossing partition
lattice (introduced by Kreweras in 1972), which makes many appearances in combinatorics and
geometric group theory. If, on the other hand, all points of the configuration lie on a common line segment, the result is a Boolean
lattice. In this article, we examine the more general class of hull configurations, which we define to be those which lie either on a line segment or on the boundary of a convex polygon. We prove that the corresponding
lattices of noncrossing partitions are unions of maximal Boolean subposets and, under certain circumstances, have symmetric chain decompositions.
Read the full abstract ▾
Classical Analysis and ODEs
On the orthogonality of solutions for higher-order non-Hermitian difference equations
Sergey M. Zagorodnyuk
In this paper we study higher-order difference equations which can be written as follows: $$ \mathbf{J} (y_0,y_1,...)^T = \lambda^N (y_0,y_1,...)^T, $$ where $\mathbf{J}$ is a $(2N+1)$-diagonal bounded banded
matrix ($\mathbf{J}=(g_{m,n})_{m,n=0}^\infty$, $| g_{m,n} |< C$, $C>0$; and $g_{k,l}=0$ if $|k-l|>N$), $y_j$s are unknowns, $\lambda$ is a complex parameter, $N\in\mathbb{N}$. It is assumed that all $g_{k,k+N}$ and $g_{l-N,l}$ are nonzero. Two special cases are considered: \noindent Case A: The
matrix $\mathbf{J}$ is complex symmetric, i.e. $\mathbf{J} = \mathbf{J}^T$. \noindent Case B: The
matrix $\mathbf{J}$ is such that $g_{k,k+N}=1$, $k=0,1,2,...$. Notice that this condition can be attained by changing $y_j$s by their multiples. In both cases there exists a positive
matrix measure $M$ on a circle in the complex plane such that
polynomial solutions satisfy some orthogonality relations. Namely, in case~A this is related to a $J$-orthogonality in the
Hilbert space $L^2(M)$ ($J$ is a complex conjugation). In case~B we have a left $J$-orthogonality in $L^2(M)$. As a tool, a related
matrix moment problem is studied. A complex rank-one perturbation of a free Jacobi
matrix is discussed.
Read the full abstract ▾
Probability
A criterion for proving entropy chaos on path space
Luigi Borasi, Francesco Carlo De Vecchi and Stefania Ugolini
A criterion for proving a strong form of propagation of chaos on the path space, known as
entropy chaos, for a general interacting
diffusion system is proposed. Our analysis focuses on the class of conservative
diffusions introduced by Carlen, which are characterized by infinitesimal characteristic pairs, that is, a time-marginal probability density and a current velocity field. A key property of this broad class is that the processes remain
diffusions under time-reversal. We prove that, given a suitable bound on the relative
entropy (with respect to the Wiener measure) and the weak convergence of both drifts and fixed-time marginal densities, strong
entropy chaos at the process level is achieved in the infinite particle limit, provided the limit drift satisfies a specific regularity condition. This
stochastic framework encompasses various singular interacting particle systems and their related asymptotic scenarios.
Read the full abstract ▾
Rings and Algebras
Varieties of nilpotent Jordan superalgebras of dimension five
Isabel Hernández, Laiz Valim da Rocha and Rodrigo Lucas Rodrigues
The paper is devoted to the description of the varieties of complex 5-dimensional nilpotent Jordan superalgebras. We find all representatives for the isomorphism classes, using the Jordan normal form, results of simultaneous
matrix triangularization, the Jordan-Kronecker
theorem for a pair of skew-symmetric bilinear forms and similar arguments developed for $\Delta$-modules by Burde and Grunewald. We also provide a complete
geometric classification, determining the irreducible components of the corresponding varieties and describing all possible degenerations and non-degenerations between these superalgebras, in particular, applying some $\mathbb{Z}_2$-graded subspaces as invariants.
Read the full abstract ▾
Algebraic Geometry
Failure of Weak Approximation in Adjoint Groups
Chayansudha Biswas
Platonov in 1991 conjectured that adjoint groups are rational as varieties over arbitrary infinite fields, and as a consequence have weak approximation. The rationality part of the
conjecture was disproved by Merkurjev in 1996, but the question about weak approximation remained open. We settle this in the negative.
Read the full abstract ▾
Numerical Analysis
Subset selection for matrices by column exchange
Alexander Osinsky and Ivan Kozyrev
The paper considers the problem of finding a submatrix $X_{\mathcal{S}} \in \mathbb{R}^{m \times k}$ in a
matrix $X \in \mathbb{R}^{m \times n}$, such that the spectral or Frobenius norm of $X_{\mathcal{S}}^{\dag} X$ is limited, which guarantees it provides a good representation of the whole
matrix. Such bounds can be reached by applying greedy
algorithms, maximizing the submatrix volume. We suggest a modification of a greedy volume maximization, which performs column exchanges asymptotically faster for $n \gg m$ than the known alternatives, while guaranteeing the same bounds on $X_{\mathcal{S}}^{\dag} X$. In addition, we prove a new upper bound on the number of required exchanges, which is applicable to the new
algorithm as well as to other greedy volume maximization
algorithms.
Read the full abstract ▾
Combinatorics
Transfer Operators and Independence Polynomials for Strong Powers of Circulant Graphs
Todd Hildebrant
We study independent sets in strong powers of circulant graphs using a transfer
matrix formulation. The compatibility constraints separate into intra-layer and inter-layer components, yielding a transfer operator that is equivariant under the dihedral group action. The characteristic
polynomial of the transfer operator factors into an anomalous component (arising from the trivial isotypic component, with rational coefficients) and a cyclotomic component (arising from nontrivial
Fourier modes, splitting over the maximal real cyclotomic subfield). We show that the spectral radius is attained in the trivial isotypic component, so the dominant exponential growth is governed by a low-dimensional orbit-compressed operator. The independence
polynomial is computed exactly for strong cylinders and
tori, with the cyclotomic sector contributing a sparse correction confined to high-weight coefficients. All results are verified for $C_7$.
Read the full abstract ▾
Mathematical Physics
On the inverse scattering transform for the KdV equation with summable initial data
Alexei Rybkin
We consider the Cauchy problem for the Korteweg–de Vries equation with real initial data $q$ that is both $L^1$ and $L^2$ summable and supported on (0,\infty). Using the left reflection coefficient and Hankel operators on the Hardy space $H^2$, we derive a trace-type representation for the corresponding solution. The proof is based on approximation by compactly supported potentials, uniform convergence of the associated reflection coefficients away from the origin, and continuity properties of the resulting Hankel operators. This yields a rigorous inverse scattering construction for a class of summable half-line supported initial data beyond the standard short-range setting.
Read the full abstract ▾
Optimization and Control · Cross-listed from eess.SY
Integrated Investment and Policy Planning for Power Systems via Differentiable Scenario Generation
Robert Mieth
We formulate a method to co-optimize power system capacity planning decisions and policy investments that shape electricity load patterns. To this end, we leverage a gradient-based solution technique that enables the efficient solution of operation-aware planning models. To compute gradients with respect to the conditions that define daily electricity demand profiles, we introduce and formalize the concept of differentiable scenario generation and show that generative machine learning models satisfy the mathematical requirements needed to compute consistent gradients. We demonstrate the feasibility of the proposed approach through numerical experiments using a
diffusion model-based scenario generator and a stylized generation and capacity expansion planning model.
Read the full abstract ▾
Optimization and Control
Empirical Evaluation of Policy-Based Reinforcement Learning for Dynamic Service Control in an M/M/1 Queue
Joseph Walton and Gabriel Nicolosi
While reinforcement learning has been increasingly applied to
stochastic control, few studies have systematically examined policy-based methods in queuing environments modeled as a semi-Markov decision process (SMDP). To address this gap, we investigate how policy-based reinforcement learning (RL)
algorithms perform when applied to the control of service rates in an M/M/1 queue, a common queuing model for manufacturing, computing, and service systems. The problem is formulated as an SMDP in which decisions occur at each new service, allowing an
agent to select different service rates from a finite set of speeds, aiming to minimize an objective function that manages system congestion and energy costs. Three policy-based reinforcement learning
algorithms, namely REINFORCE, Actor-Critic (A2C), and Proximal Policy Optimization (PPO), are trained in a simulated environment using two state representations: the instantaneous queue length and an augmented state that includes a one-step queue history. Performance is evaluated in terms of convergence speed, sampling efficiency, policy quality, and pseudo-regret relative to the steady-state optimum.
Read the full abstract ▾
Combinatorics
Infinite graphs with finite metric dimension
Csaba Biró, Caroline E. Boone, Beth Novick et al. (+1 more)
We study the metric dimension (strong and weak) of infinite graphs. In particular, our main interest is characterizing infinite graphs with finite dimension. Our main results: (1) graphs with more than one end have infinite strong dimension; (2) for graphs with a finite number of cycles, the weak dimension is finite if and only if the graph has finitely many vertices of degree three, and the strong dimension is finite if and only if the graph has one end and finitely many vertices of degree three.
Read the full abstract ▾
All authors Csaba Biró, Caroline E. Boone, Beth Novick, Hazel Torek
Statistics Theory
Early-stopped aggregation: Adaptive inference with computational efficiency
Ilsang Ohn, Shitao Fan, Jungbin Jun et al. (+1 more)
When considering a model selection or, more generally, an aggregation approach for adaptive statistical inference, it is often necessary to compute
estimators over a wide range of model complexities including unnecessarily large models even when the true data-generating process is relatively simple, due to the lack of prior knowledge. This requirement can lead to substantial computational inefficiency. In this work, we propose a novel framework for efficient model aggregation called the early-stopped aggregation (ESA): instead of computing and aggregating
estimators for all candidate models, we compute only a small number of simpler ones using an early-stopping criterion and aggregate only these for final inference. Our framework is versatile and applies to both
Bayesian model selection, in particular, within the variational Bayes framework, and frequentist estimation, including a general penalized estimation setting. We investigate adaptive optimal property of the ESA approach across three learning paradigms. We first show that ESA achieves optimal adaptive contraction rates in the variational Bayes setting under mild conditions. We extend this result to variational empirical Bayes, where prior hyperparameters are chosen in a data-dependent manner. In addition, we apply the ESA approach to frequentist aggregation including both penalization-based and sample-splitting implementations, and establish corresponding theory. As we demonstrate, there is a clear unification between early-stopped Bayes and frequentist penalized aggregation, with a common "energy" functional comprising a data-fitting term and a complexity-control term that drives both procedures. We further present several applications and numerical studies that highlight the efficiency and strong performance of the proposed approach.
Read the full abstract ▾
All authors Ilsang Ohn, Shitao Fan, Jungbin Jun, Lizhen Lin
Numerical Analysis
Bivariate range functions with superior convergence order
Bingwei Zhang, Thomas Chen, Kai Hormann et al. (+1 more)
Range functions are a fundamental tool for certified computations in
geometric modeling, computer graphics, and robotics, but traditional range functions have only quadratic convergence order ($m=2$). For “superior” convergence order (i.e., $m>2$), we exploit the Cornelius–Lohner framework in order to introduce new bivariate range functions based on Taylor, Lagrange, and Hermite interpolation. In particular, we focus on practical range functions with cubic and quartic convergence order. We implemented them in Julia and provide experimental validation of their performance in terms of efficiency and efficacy.
Read the full abstract ▾
All authors Bingwei Zhang, Thomas Chen, Kai Hormann, Chee Yap
Probability
On the tails of Dickman-like perpetuities
Alexander Iksanov and Oleh Iksanov
Using a probabilistic technique based on exponential change of measure, we derive precise tail asymptotics of some perpetuities with distributions close to the Dickman distribution.
Statistics Theory · Cross-listed from econ.EM
Generalized Autoregressive Multivariate Models: From Binary to Poisson
Anna Bykhovskaya and Nour Meddahi
This paper presents a framework for binary autoregressive time series in which each observation is a Bernoulli variable whose success probability evolves with past outcomes and probabilities, in the spirit of GARCH-type dynamics, accommodating nonlinearities, network interactions, and cross-sectional dependence in the multivariate case. Existence and uniqueness of a stationary solution is established via a coupling argument tailored to the discontinuities inherent in binary data. A key theoretical result, further supported by our empirical illustration on S&P 100 data, shows that, under a rare-events scaling, aggregates of such binary processes converge to a Poisson autoregression, providing a micro-foundation for this widely used count model. Maximum likelihood estimation is proposed and illustrated empirically.
Read the full abstract ▾
Differential Geometry
Gradient estimates for the Green kernel under spectral Ricci bounds, and the stable Bernstein theorem in $\mathbb{R}^4$
Xavier Cabre, Giovanni Catino, Luciano Mari et al. (+2 more)
We describe a method to prove new integral inequalities for stable minimal hypersurfaces in Euclidean space. As an application, we give a simple proof that complete, two sided, stable minimal hypersurfaces in $\mathbb{R}^4$ are hyperplanes. A core part of the argument hinges on the fact that stable minimal hypersurfaces in non-negatively curved spaces are examples of
manifolds with a spectral
Ricci curvature lower bound; in particular, we prove a sharp pointwise gradient estimate for the Green kernel on non-
parabolic manifolds with spectral
Ricci lower bounds, extending previous work by Colding.
Read the full abstract ▾
All authors Xavier Cabre, Giovanni Catino, Luciano Mari, Paolo Mastrolia, Alberto Roncoroni