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)

Tuesday 28 April

Statistics Theory · Cross-listed from stat.ME

Generalized Local Polynomial Regression with Decomposed Context-Aware Kernels

Local Polynomial Regression (LPR) is a powerful tool for nonparametric smoothing, yet it traditionally suffers from a "Euclidean tautology": the variables used to define the local neighborhood are identical to those used in the polynomial fit. This restricts its ability to handle complex domains where the regression function varies across non-Euclidean structures, such as graphs, manifolds, or discrete categories, while remaining locally smooth in the primary feature space. We propose Generalized Context-Aware LPR (GC-LPR), a framework that decouples the fitting coordinates ($Z$) from the weighting context ($C$). By adopting a modeling convention where the conditional mean depends jointly on $Z$ and $C$ ($Y = m_C(Z) + \varepsilon$), our estimator acts as a "projected smoother": it isolates a slice of the data on the manifold defined by $C$ via a compound product kernel, and performs polynomial fitting in the $Z$-coordinates within that slice. This enables practitioners to model responses that vary across graphs, networks, or categorical strata while retaining the interpretability and bias properties of LPR in a primary Euclidean feature space. Theoretical analysis clarifies the induced context-smoothed target of GC-LPR and shows that the method preserves the Euclidean bias-reduction properties of standard LPR while allowing arbitrary, non-Euclidean contexts to modulate the local estimation. We demonstrate the efficacy of this approach on geospatial and network-structured datasets.
Read the full abstract

Optimization and Control

Asymptotic Solution of a Cheap Control Game with Slow and Fast State Variables

A finite-horizon zero-sum linear-quadratic differential game is considered. Its features are: (i) the control cost of the minimizing player in the game's cost functional is much smaller than the control cost of the maximizing player and the state cost; (ii) the cost of the fast state variable in the integrand of the cost functional is a positive semi-definite (but non-zero) quadratic form. These features require developing a significantly novel approach to asymptotic analysis of the matrix Riccati differential equation associated with the considered game. Using this analysis, an asymptotic solution of the game is derived. An illustrative example is presented.
Read the full abstract

Optimization and Control

A Combinatorial Optimisation Approach to Multi-factorial Gap-filling in Genome-scale Metabolic Models (GEMs)

Genome-Scale Metabolic Models (GEMs) describe the interactions between genes, proteins, and the biochemical reactions that underpin an organism's metabolism aiming to computationally simulate functions at the cellular level. While many metabolic reactions can be inferred from genome analysis, constructing GEMs often involves incorporating reactions unsupported by genomic data to improve prediction accuracy. This is known as gap-filling, a process that can be performed manually (a time-consuming task) or computationally. Traditional computational gap-filling approaches aim to correct GEM predictions for a single environmental condition (medium) by solving a large Integer Linear Programming problem. Sequential application across multiple media can produce a more robust model, but often introduces unrealistic predictions in other media. They are also slow to run. In this paper, we study multi-factorial gap filling, which aims to gap-fill GEMs across typically 10 or more input media simultaneously, while improving their overall predictive accuracy and minimising unrealistic behaviour. We view the selection of the set of reactions as a combinatorial optimisation problem, and describe a method based on classic metaheuristic approaches which requires the solution of continuous Linear Programming problems only. This paper provides an introduction of this problem to an audience whose speciality lies outside biology, and suggests a practical first-cut solution method. We demonstrate the method gap-filling GEMs for three bacteria strains, selecting 3000 to 4000 reactions from a database of more than 11000 reactions, while attempting to match the empirically measured performance on 9 to 28 separate media conditions. We show that our method outperforms conventional approaches on multiple metrics, including Kendal Tau and RMS Error by an average of 7.3% and 13.3%, respectively.
Read the full abstract

All authors Philip Kilby, Sevvandi Kandanaarachchi, Matthew J. Morgan, Amy M. Paten, Mariana Velasque, Andrew C. Warden, Juan P. Molina Ortiz

Analysis of PDEs

The transmission problem with imperfect interfaces of small resistance

We consider the transmission problem in presence of interfaces with imperfect bonding. The imperfect bonding condition is characterized by the positive resistance along the interface, which causes discontinuity of the potential across the interface while the flux is continuous. If the interface resistance is zero, then the interface is of perfect bonding, where both the potential and the flux of the solution are continuous across the interface. In this paper, we first construct using layer potentials the solution to the transmission problem with imperfect interfaces. We then prove that the solutions converge in various Sobolev spaces to the solution to the transmission problem with perfect interfaces as the interface resistance tends to zero. In particular, it is shown that the gradient of the solution converges in the uniform norm if the boundary is sufficiently regular.
Read the full abstract

General Topology

Linear continuous operators with bounded supports

For any Tychonoff space $X$ let $D(X)$ be either the set $C(X)$ of all continuous functions on $X$ or the set $C^*(X)$ of all bounded continuous functions on $X$. When $D(X)$ is endowed with the point convergence topology, we write $D_p(X)$. Zakrzewski \cite[Theorem 3.12]{kz} proved that if $X$ and $Y$ are $\sigma$-compact spaces and there is a continuous linear map $T:C_p(X)\to C_p(Y)$ such that $T(C_p(X))$ is dense in $C_p(Y)$ and $|\supp(y)|\leq m$ for every $y\in Y$, then $\dim Y\leq m\cdot\dim X+m+m!-1$. Here, $\supp(y)$ denotes the support of the linear continuous map $l_y:C_p(X)\to\mathbb R$, defined by $l_y(f)=T(f)(y)$. In the present paper we improve the last inequality by showing that $\dim Y\leq m\cdot\dim X$ provided $X,Y$ are Tychonoff spaces and there is a continuous linear surjection $T:D_p(X)\to D_p(Y)$ with $|\supp(y)|\leq m$ for every $y\in Y$. This implies the following generalization of \cite[Theorem 1.4]{ev}: If $T:D_p(X)\to D_p(Y)$ is a continuous linear surjection with $X,Y$ Tychonoff spaces and $\dim X=0$, then $\dim Y=0$. Our proofs are obtained by refining the techniques developed in \cite{ev}.
Read the full abstract

Algebraic Geometry

The 3-divisibility of divisors on K3 surfaces in characteristic 3

We describe the possible 3-divisible $A_2^n$ configurations of smooth rational curves on K3 surfaces in characteristic 3 and fully classify the resulting triple covers.

Classical Analysis and ODEs

Weighted weak type $(1,1)$ estimates for oscillatory singular integrals with Dini kernels

We consider $A_1$-weights and prove weighted weak type $(1,1)$ estimates for oscillatory singular integrals with kernels satisfying a Dini condition.

Mathematical Physics · Cross-listed from physics.chem-ph

A density-functional perspective on force fields

Force fields are usually formulated directly in nuclear configuration space, whereas density functional theory is naturally formulated in terms of external potentials, densities, and variational duality. We show that exact force fields are variationally induced by DFT: the Born-Oppenheimer potential-energy surface is the pullback of the external-potential energy functional along the map from nuclear configurations to Coulomb potentials. In the Lieb formulation of density functional theory, the density is the first functional derivative of the energy with respect to the external potential, while the density-density response function is the second. Pulling these derivative objects back to nuclear configuration space yields the force and the nuclear Hessian, together with explicit terms induced by the nuclear-generated potential and the nuclear-nuclear repulsion. The resulting picture places force fields, density functional theory, and response theory within a single derivative hierarchy. The purpose of the present work is conceptual rather than algorithmic.
Read the full abstract

Combinatorics

Size-4 Counterexamples to the Sidon-Extension Conjecture

A finite set $S \subset \mathbb{Z}$ is a Sidon set if its pairwise differences are distinct. Recall that a perfect difference set (PDS) of order $n$ is a set $B \subset \mathbb{Z}_v$ ($v = n^2 - n + 1$) of size $n$ such that every nonzero residue arises exactly once as a difference of two elements of $B$. Erdős's \$1000 conjecture -- that every finite Sidon set extends to a finite PDS -- was disproved by Alexeev and Mixon (arXiv:2510.19804, October 2025), via the size-5 counterexamples $\{1,2,4,8,13\}$ and Hall's earlier $\{1,3,9,10,13\}$; they then asked: what is the smallest size $s$ of a non-extending Sidon set? The trivial bounds give $3 \le s \le 5$. Our evidence points to $s = 4$. We exhibit two integer Sidon sets, \[ A = \{0, 1, 3, 11\}, \qquad B = \{0, 1, 4, 11\}, \] together with the apparent infinite family of dilations $kA$, $kB$ and their reflections, all of which fail to extend for every prime power $q \le 317$ via the Singer affine-orbit check (rigorous under Hall's 1947 uniqueness for Desarguesian cyclic planes through $q \le 40$ and under the prime-power conjecture beyond that), and unconditionally for every modulus $v \le 133$ via brute-force depth-first search. We also report the exact density $N_{\text{ne}}(N) = 4 \lfloor N / 11 \rfloor$ of non-extending size-4 Sidon sets in $[0, N]$ for $N \le 50$ -- the match is exact, which suggests the $kA, kB$ family is complete in this range. A complete proof, perhaps in the spirit of Alexeev–Mixon's polarity argument or via a multiplier descent, remains open.
Read the full abstract

2604.25214 · 28 Apr · Withdrawing v1+v2. Peter Mueller's MathOverflow answer (MO 501983, Oct 2025) had already proved a strictly stronger result for both {0,1,3,11} and {0,1,4,11} and all their dilations / reflections, via Will Sawin's algebraic framework for size-4 Sidon sets. Apologies for the duplicate posting

Combinatorics

Noncrossing Duality and the Geometry of Positive Tropical Linear Spaces

While the positive Grassmannian is deeply understood through the rich combinatorics of plabic graphs and positroid cells, its tropical counterpart, the positive tropical Grassmannian Trop$_{>0}G(k,n)$, has lacked a comparable structural framework for general $k$. Both the global face structure of Trop$_{>0}G(k,n)$ and the internal metric geometry of the tropical linear spaces it parametrizes have remained largely uncharted. This paper develops a systematic algebraic and polyhedral foundation that resolves this gap. The engine of our framework is a fundamental tropical duality, analogous to the duality between cluster variables (or more precisely, their $u$-coordinates) and $\mathbf{g}$-vectors, pairing two families of objects introduced by the first author: the planar basis of tropical Plücker vectors and the planar cross-ratios on the positive configuration space. We prove that this duality links the fan structure of the positive tropical Grassmannian to the noncrossing fan of Santos, Stump, and Welker, yielding a global bijection between integer points of $Trop_{>0}G(k,n)$ and noncrossing tableaux. We then study how this discrete combinatorial data controls the continuous metric geometry of positive tropical linear spaces. We realize the bounded complex of an integer positive tropical linear space as the subdifferential of a central roof function on the hypersimplex, and use this realization to embed it into a dilate of the fundamental alcoved simplex. The dilation factor, and hence the geometric diameter of the complex, is governed by a single invariant, the planar kinematics ($K) weight, which we show equals the number of columns in the associated noncrossing tableau. The results of this work are applied in our parallel work on scaffolds for higher tropical Grassmannians.
Read the full abstract

Combinatorics

Scaffolds for Higher Tropical Grassmannians: Foundations

Scaffolds are the one-dimensional skeleta of high-dimensional flag simplicial complexes of nonpositive curvature. They generalize the phylogenetic trees of Trop G(2,n) to arbitrary $k$, drawing together SL(k)-web bases, affine buildings, the combinatorics of the positive tropical Grassmannian and low-dimensional topology. We prove that scaffolds model points in all tropical Grassmannians via a $k$-point distance function. In this paper, we study in detail CAT(0) planar graphs, which are positive scaffolds for the tropical Grassmannian of three-planes. CAT(0) planar graphs are directed versions of the diskoids of Fontaine-Kamnitzer-Kuperberg, planar dual to SL(3)-webs. Our main result is the construction of a unique representation of any given integer positive tropical Plucker vector by a normal CAT(0) planar graph. We show that any normal CAT(0) planar graph embeds into the tropical linear space as a Lam-Postnikov membrane, and embeds into the Keel-Tevelev membrane within the affine building. We show that Early's planar basis expansion can be computed directly from the strand combinatorics of the dual web, and connect this expansion to Petersen-Pylyavskyy-Speyer's noncrossing tableaux, explored further in our companion paper.
Read the full abstract

Combinatorics

Fractional clique decompositions of dense balanced multipartite graphs

This paper concerns fractional $K_s$-decompositions of multipartite graphs. For integers $r\ge s\ge 3$, we consider balanced $r$-partite graphs $G$ on $rn$ vertices. We establish necessary conditions for $G$ to admit a fractional $K_s$-decomposition, extending the notion of $s$-admissibility from the case $r=s$ to $r>s$. Using an association scheme on the edge set of a complete $r$-partite graph, we prove that if $r\ge s+2$ and the partite minimum degree of $G$ is at least $(1-c)n$ with $c\le 1/((s-2)(s+1)(s-1)^4)$, then $G$ has a fractional $K_s$-decomposition. For $r=s+1$, we show that under the condition $c\le 1/(3s^3(s-2)^2)$, every $s$-admissible balanced $(s+1)$-partite graph with partite minimum degree at least $(1-c)n$ admits a fractional $K_s$-decomposition. These results provide new degree thresholds for fractional $K_s$-decompositions of multipartite graphs with more than $s$ parts.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Geometry of tail allocation in conformal prediction intervals

Lower and upper errors of a two-sided conformal prediction interval can have different scientific consequences. The division of target miscoverage between the two endpoints determines the corresponding tail-specific guarantees and can alter interval length at first order when tail scales differ. We characterize this allocation-length relation after separate one-sided split calibration, which preserves the tail-specific guarantees and marginal coverage whenever the allocation is selected independently of the calibration sample. Tail-quantile response to proportional rescaling determines the resulting length geometry. For regularly varying tails, normalized length converges to $g_\gamma(c)=c^{-\xi}+\gamma(1-c)^{-\xi}$, where $c$ is the upper-tail allocation fraction, $\xi$ is the tail index, and $\gamma$ is the lower-to-upper tail-scale ratio. A dominant tail produces a boundary optimum and makes the equal-tail interval asymptotically $2^\xi$ times as long as the optimum. Comparable tails produce an interior optimum, with equal-tail allocation optimal only at matching scales. An empirical allocation rule attains the corresponding optimum without estimating tail parameters. In the de Haan class the effect moves to an additive scale. Calibration resolution determines whether ordinary ranks can realize these allocations. When calibration tail counts remain bounded, two-sided rank feasibility also constrains the allocation. Tail homogeneity transfers the length relation over covariates, while opposite dominant tails preclude one globally efficient allocation.
Read the full abstract

Representation Theory

The local Langlands correspondence of essentially unipotent supercuspidal representations for disconnected reductive groups

We construct the local Langlands correspondence of essentially unipotent supercuspidal representations under the framework of rigid inner forms and prove a certain functoriality and compatibilities. This is stronger than an analogous result of Solleveld, which did not care about rigidifications of inner twists. We also generalize this correspondence for disconnected reductive groups. We expect to use this result for extension of Kaletha's explicit local Langlands correspondence of non-singular supercuspidal representations.
Read the full abstract

Optimization and Control · Cross-listed from physics.optics

Adaptive Sensing beyond Non-Adaptive Information Limits: End-to-End Co-Design of Geometry, Policy, and Inference

Inverse design has transformed vast physical parameter spaces into a substrate for emergent functionality, raising the tantalizing prospect of relocating intelligence from the digital domain into the physical world itself. Nowhere is this prospect more consequential than in sensing, where the analog-to-digital interface imposes a fundamental bottleneck: information not captured by the hardware is irrevocably lost to any downstream algorithm. Existing approaches improve information capture through either sensor hardware optimization or adaptive measurement strategies operating on fixed hardware, but rarely both in concert. A principled migration of intelligence from digital to physical demands their joint optimization: the sensing geometry must be co-designed with a policy that determines what to measure next. We formulate this co-design as joint dynamic programming (joint-DP), a unified optimization over sensor geometry and a Bellman-optimal adaptive measurement policy. The outer hardware gradient is obtained through differentiable dynamic programming with a sharp Bellman maximum. A hierarchy of relaxations extends the framework from small discrete POMDPs to freeform photonic topologies with more than $10^5$ design pixels.
Read the full abstract

Optimization and Control

Reconfiguring flexibility in renewable power-to-ammonia systems using molten-salt thermal energy storage in the ammonia synthesis loop: A coordinated electro-hydrogen-thermal scheduling approach

In renewable power-to-ammonia (ReP2A) systems, the intermittency of wind and solar generation propagates through electrolytic hydrogen production and induces thermal instability in the ammonia synthesis reactor (ASR). The resulting temperature cycling accelerates fatigue and shortens service life, while reactor thermal inertia limits flexible start-up, shutdown, and load adjustment. To address this issue, this study integrates molten-salt thermal energy storage (MS-TES) into the Haber-Bosch synthesis loop and develops a coordinated electro-hydrogen-thermal scheduling framework. MS-TES decouples hydrogen supply fluctuations from reactor thermal dynamics by enabling hot standby operation and sustained thermal support during start-up and low-load conditions. A state-space model is established to capture the thermal dynamics of the ASR and MS-TES. Based on this model, an optimal scheduling program coordinates ammonia synthesis operation with hydrogen production, battery energy storage (BES), and hydrogen storage (HS). The problem is formulated as a mixed-integer linear program (MILP) and extended with information gap decision theory (IGDT) to address renewable uncertainty. Case studies based on an industrial-scale project in northern China show that MS-TES enhances reactor thermal stability and system-level flexibility, while diminishing the marginal benefit of large BES capacity. As a result, a configuration combining small BES, HS, and MS-TES achieves near-equivalent performance to large-BES systems, with lower investment and improved economic returns. Year-round simulations further show that MS-TES avoids ASR start-up and shutdown and delivers consistently higher net revenue under variable renewable conditions.
Read the full abstract

All authors Yiwei Qiu, Qingjie Sun, Yangjun Zeng, Ge Chen, Longjie Yang, Ge He, Xu Ji, Shi Chen, Buxiang Zhou, Kaigui Xie

Representation Theory

The category of Whittaker modules over the Cartan Type Lie algebra $\bar{S}_2$

The Lie algebra $\bar{S}_2$ of polynomial vector fields on $\mathbb{C}^2$ with constant divergence is an important Cartan type Lie algebra. In this paper, we study Whittaker $\bar{S}_2$-modules that are locally finite over $\text{span}\{\frac{\partial}{\partial t_1}, \frac{\partial}{\partial t_2}\}$. We first show that each block $\Omega^{\widetilde{S}_2}_{\mathbf{a}}$ of the category of $(A_2, \bar{S}_2)$-Whittaker modules with finite-dimensional Whittaker vector spaces is equivalent to the category of finite-dimensional modules over the parabolic subalgebra $\bar{S}_2^{\geq 0}$. Then we classify all simple Whittaker $\bar{S}_2$-modules in every block $\Omega^{\bar{S}_2}_{\mathbf{a}}$ . Finally, we establish an equivalence between $\Omega^{\bar{S}_2}_{\mathbf{1}}$ and the category $H_{\mathbf{1}}$-fmod of finite-dimensional modules over an associative algebra $H_{\mathbf{1}}$, whose generators are also determined.
Read the full abstract

Dynamical Systems

On a Keller-Segel type equation to model Brain Microvascular Endothelial Cells growth's patterns

This article presents a partial differential equation (PDE) of Keller-Segel (KS) type that reproduces patterns commonly observed during the growth of brain microvasculature. We provide mathematical insights into the mechanisms underlying the emergence of these patterns. In addition, we derive a data-driven equation that ensures a consistent temporal evolution of the chemoattractant associated with the observed microvascular dynamics. Beyond numerical simulations, the aim of this study is to advance a comprehensive mathematical modeling framework, spanning blood flow in cerebral arterial networks to biochemical processes, in order to better understand how vascular impairments may contribute to neurodegenerative diseases.
Read the full abstract

All authors B Ambrosio, A Garroudji, S. Fitzsimons, H Zaag, F.M. Elahi

Number Theory

Trilinear Kloosterman fractions I: partially fixed moduli and unbalanced convolutions

In this paper, we improve on Fouvry and Radziwiłł's results on unbalanced convolutions. In particular, we find that if $(\alpha_m)$ and $(\beta_n)$ are sequences supported on $m\sim M$ and $n\sim M$ where $\beta_n$ is equidistributed for small moduli, then \begin{gather*}\sum_{q\sim Q}\left|\mathop{\sum\sum}_{\substack{n\sim N,m\sim M \\ mn\equiv a\pmod q}}\alpha_m\beta_n-\frac{1}{\phi(q)}\mathop{\sum\sum}_{\substack{n\sim N,m\sim M \\ (mn,q)=1}}\alpha_m\beta_n\right|\ll \frac{X}{\log^A X}, \end{gather*} as long as $\exp((\log x)^{\varepsilon}) \leq N \leq Q^{-11/12} X^{17/36-\varepsilon}$ with $Q\leq X^{1/2+1/66-\delta}$, along with wider bounds for $N$ if $Q\leq X^{\frac{45}{89}-\epsilon}$. The former improves the allowable range of $N$, while the latter improves the range of $Q$. To prove these new bounds, we improve Bettin and Chandee's famous result on trilinear forms with Kloosterman fractions in the case where the denominator has a fixed factor.
Read the full abstract

Geometric Topology

Link homology and loop homology

We compute the $k$-colored $\mathfrak{sl}(N)$ homology of the torus knot $T(2,2m+1)$, and we show that it stabilizes as $m\to\infty$ to the integral homology of the free loop space of the complex Grassmannian $\mathrm{Gr}(k,N)$. In particular, when $k = 1$ and $N = 2$, we observe that the Khovanov homology of $T(2,2m+1)$ stabilizes to the homology of the free loop space of the $2$-sphere.
Read the full abstract

Combinatorics

Tiling of Hyperbolic Surface by Multiple Tiles

Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. We develop the algorithm for finding all the tilings for fixed number of tiles and present the calculation for tilings of surfaces of small genus by two tiles. We also discuss the number of distinct edge lengths in multiple tile tilings.
Read the full abstract

All authors Chunlin Li, Erxiao Wang, Wu Jie, Min Yan

Dynamical Systems

Quantitative Analyticity for Lyapunov Exponents of Random Products of Matrices with Explicit Polydiscs and Cauchy Coefficient Bounds

The top Lyapunov exponent $\lambda_+(A, p)$ of a random product of matrices in $\mathrm{GL}(d, \mathbb{R})$, $d \geq 2$, with simple top spectrum, depends real-analytically on the probability weights $p$ and the matrix coefficients $A$. We establish a quantitative form of this analyticity through a single Kato perturbation argument on the complexified Markov operator on Hölder functions on projective space, yielding seven main theorems with explicit closed-form constants: (i) an explicit polydisc of holomorphy for $p \mapsto \lambda_+(A, p)$ in $\mathbb{C}^N$, giving the quantitative form of the Peres and Bezerra-Sánchez-Tall analyticity theorem; (ii) closed-form Cauchy bounds on its Taylor coefficients; (iii) joint analyticity in the weights $p$ and the matrix entries $A$, with explicit radii in both; (iv) an extension to Markov-chain driven cocycles, with polydisc radius explicit in the chain spectral gap; (v) explicit polynomial boundary-decay rates as $p$ approaches $\partial \Delta_N$, conditional on a spectral-gap-decay hypothesis; (vi) extension to $\mathrm{GL}(d, \mathbb{R})$ for all $d \geq 2$ via the Fubini-Study metric; and (vii) a Grassmannian variant giving quantitative analyticity of the partial sums $\Lambda_k = \lambda_1 + \cdots + \lambda_k$ under strong $k$-irreducibility, hence of each individual sub-top Lyapunov exponent. The polydisc radius is method-optimal within the Kato class, and a Bernstein-type result shows the Cauchy growth $\alpha! \cdot M_*/r_*^{|\alpha|}$ is sharp up to constants. A two-matrix example with numerical values connects the bounds to the Hölder estimates of the companion paper Thiam (Nov. 2025).
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

Elite-Driven Support Vector Machines for Classification

Support vector machines (SVMs) are a standard tool for binary classification, but their classical formulations are purely data-driven and offer no direct way to encode trusted benchmark models or structured preferences on selected subsets of the data. We propose Elite-Driven Support Vector Machines (EDSVM), a general framework that augments regularized empirical risk minimization by guiding the slack variables for a curated set of elite observations (typically the union of support vectors from one or more reference SVMs). EDSVM combines the usual slack loss with a deviation penalty that shrinks new slacks toward benchmark slack values, defining a localized, margin-aligned notion of proximity to reference models, unlike global function penalties in knowledge distillation or teacher-student methods, and without requiring privileged features as in SVM+/LUPI. Within this framework we develop two concrete models, C-EDSVM and LS-EDSVM, based respectively on hinge-type and squared-slack losses. For both variants we derive dual quadratic programs that can be implemented with modest modifications of standard SVM solvers, and we give simple sufficient conditions under which the induced margin losses are classification calibrated. Simulation studies and experiments on several UCI benchmarks show that EDSVMs closely track the behaviour induced by reference SVMs while achieving predictive performance that is competitive with, and sometimes better than, C-SVM, LINEX-SVM, and LS-SVM.
Read the full abstract

Numerical Analysis

A Continuous-Time Ensemble Kalman-Bucy Smoother for Causal Inference and Model Discovery

Data assimilation (DA) integrates observational information with model predictions to improve state estimation in complex systems. While filtering provides the basis for online forecasts by using only past and present observations, it can exhibit delays and biases when the underlying dynamics evolve rapidly or undergo regime transitions. Smoothing, which additionally incorporates future observations, provides a natural pipeline for hindcasting and reanalysis that yields an uncertainty reduction beyond the filter. This paper introduces an ensemble Kalman–Bucy smoother (EnKBS) for continuous-time DA of nonlinear dynamical systems, where the smoother's conditional distributions are reconstructed using ensemble moments. The result is a derivative-free framework that does not require explicit computation of tangent-linear or adjoint models, which recovers the exact smoothing mean and covariance equations in the infinite-ensemble limit for linear–Gaussian systems. Incorporating standard regularization techniques for high-dimensional systems, such as covariance localization and inflation, the skill of the EnKBS is demonstrated in various important scientific problems. By integrating future observations, which reveal the underlying causal mechanisms for retrospective state updates, the EnKBS is used for Bayesian-based inference of causal relationships and their temporal influence range in a dyadic trigger-feedback model and the development of a causality-driven iterative learning algorithm that identifies the structure and recovers the hidden parameters of a nonlinear reduced-order model mimicking midlatitude atmospheric circulation. Notably, both tasks remain effective with an ensemble size of $O(10)$ under partial observations, suggesting that EnKBS can support the instantaneous discovery of high-dimensional complex systems over time.
Read the full abstract

All authors Zhang Jiang, Marios Andreou, Sebastian Reich, Nan Chen

Optimization and Control

On rates of convergence for sample average approximations without smoothness

Sample average approximation (SAA) replaces an intractable expected objective by an empirical average and is a basic device of modern stochastic optimization. We develop a rate theory for optimal values and empirical $\varepsilon$-minimizers that does not assume continuity, lower semicontinuity, or smooth perturbation structure of the sample objectives. Working on $\ell^{\infty}(X)$ with the Hoffmann–Jørgensen outer-probability formalism, we show that uniform control of the empirical objective process transfers deterministically to convergence rates for optimal values, excess risks of empirical $\varepsilon$-minimizers, and, under a sharp-growth condition, distances to the expected objective solution set. Combined with the directional differentiability of the infimum functional, this yields weak limits for empirical optimal values at the $n^{-1/2}$ scale. Combined with LILs and maximal inequalities, it yields outer almost-sure and outer-mean rates. The definability, envelope, and VC-subgraph hypotheses are verified for definable discontinuous or non-Lipschitz classes arising in direct $0$–$1$ classification, fixed-architecture neural networks, threshold regression, and non-Lipschitz $\ell_{p}$-type objectives with rational $0<p<1$. Practical sufficient conditions for measurability hypotheses are discussed. Together, the framework extends continuity-based SAA theory to a tame-topological setting.
Read the full abstract

Number Theory

Linear recurrences and rational Lambert series

For a sequence $\gamma=(\gamma_n)_{n\ge 1}$, define \[ L_\gamma(z):=\sum_{n\ge 1}\gamma_n\frac{z^n}{1-z^n} =\sum_{n\ge 1}\Bigl(\sum_{d\mid n}\gamma_d\Bigr)z^n. \] We prove a short rigidity theorem: if $\gamma$ is eventually linearly recurrent and $L_\gamma(z)$ is rational, then $\gamma$ is finitely supported. Equivalently, among sequences with rational ordinary generating function, the only ones whose Lambert series is rational are the finitely supported sequences. The proof specializes the data at a finite place of a finitely generated ring and then uses the periodicity of recurrences over finite fields.
Read the full abstract

Numerical Analysis

Encoded Forward Backward Stochastic Neural Network for High-Dimensional Backward Stochastic Differential Equations and Parabolic Partial Differential Equations

Backward stochastic differential equation (BSDE) provides probabilistic solutions for a class of parabolic partial differential equations (PDEs). DeepBSDE and FBSNN are two deep learning approaches for solving high-dimensional PDEs through approximating the solution of BSDEs. The conventional approach for learning functions defined on continuous domains is via fully-connected networks (FCNs) such that each input dimension is represented by a single neuron. In the current study, a new encoded FBSNN algorithm is proposed to enhance the efficiency and accuracy of approximating BSDEs using encoding and convolution. The input coordinates are encoded as tensors treated as images with multiple channels which can be processed efficiently by convolutional neural networks. The encoding mechanism enriches the input features such that the spatial and temporal features can be balanced. The encoded FBSNN algorithm provides a simple yet effective extension of the vanilla FBSNN algorithm such that BSDEs can be approximated more efficiently. The new algorithm is validated using the essentially high-dimensional Black-Scholes-Barenblatt and Hamilton-Jacobi-Bellman benchmark cases.
Read the full abstract

Differential Geometry

Sharp Spectral Bounds for the $p$-Laplacian and Polyharmonic Operators on Asymptotically Hyperbolic Manifolds

We derive sharp bounds for three types of eigenvalue problems. First, we derive an upper bound for the first $p$-Dirichlet eigenvalue on conformally compact (CC) spaces. As a consequence, we show that for a class of CC submanifolds of asymptotically hyperbolic spaces, the asymptotic sectional curvatures, the meeting angle at infinity, and the vanishing of the norm of the mean curvature are all determined by its first $p$-Dirichlet eigenvalue. Additionally, we derive sharp upper bounds for the first eigenvalue of polyharmonic operators under both clamped and buckling boundary conditions. Finally, we prove sharp lower bounds for all three types of eigenvalue problems on weakly Poincaré-Einstein spaces with $\text{Ric}_{g_+}\ge -ng_+$ and whose conformal infinity has nonnegative Yamabe constant, and on their submanifolds.
Read the full abstract

Optimization and Control

Accelerating Regularized Attention Kernel Regression for Spectrum Cartography

Spectrum cartography reconstructs spatial radio fields from sparse and heterogeneous wireless measurements, underpinning many sensing and optimization tasks in wireless networks. Attention mechanisms have recently enabled adaptive measurement aggregation via attention kernel-based formulations. However, the resulting exponential kernels exhibit severe spectral imbalance, inducing large condition numbers that render standard iterative solvers ineffective for regularized attention kernel regression. This paper proposes a Learning-based Attention Kernel Regression (LAKER) algorithm for accelerating regularized attention kernel regression in spectrum cartography. The key idea is to learn a data-dependent preconditioner that captures the inverse spectral structure of the attention kernel system, directly reducing the condition number bottleneck. The preconditioner is obtained by solving a regularized maximum-likelihood estimation problem via a shrinkage-regularized convex–concave procedure, and is integrated with a preconditioned conjugate gradient solver for efficient optimization, whose solution is used for radio map reconstruction. Extensive experiments demonstrate that LAKER significantly reduces condition numbers by up to three orders of magnitude, accelerates convergence by over twenty-fold compared to baselines, and maintains high reconstruction accuracy, establishing learning-based preconditioning as an effective approach for attention kernel regression in spectrum cartography.
Read the full abstract

Differential Geometry

Evolutes and involutes of framed curves in Euclidean 3-space

We investigated the evolute of a space curve with singular points. As smooth curves with singular points, we apply the theory of framed curves. However, the involute corresponding to the evolute in the sense of the locus of the centre of osculating spheres has not been defined as far as we know. In this paper, we directly define the evolutes and involutes of non-degenerate curves and framed curves using the theory of Bertrand type curves. We give conditions that the evolutes and involutes are inverse operations of these curves. Moreover, we investigate the other cases in which the evolutes and involutes are not inverse operations.
Read the full abstract