Probability
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Friday 20 February
Let $S_n$ be a random walk with i.i.d. increments which have zero mean and finite variance. For every $x\ge0$ we define the stopping time $\tau_x:=\inf\{n\ge1:x+S_n\le0\}$ and consider the probabilities $\mathbb{P}(x+S_n\ge y,\tau_x>n)$. We study the quality of the normal approximation for these probabilities and derive a Berry-Esseen-type inequality for $\mathbb{P}(x+S_n\ge y|\tau_x>n)$. Our Theorem 1 is an extension of the results in our previous paper (arXiv:2412.08502) where we have considered the special case $x=0$. It is also worth mentioning that Theorem 1 complements the results of Siegmund and Yuh (1982) on the corrected diffusion approximation.
Optimization and Control · Cross-listed from cs.LG
Non-Stationary Online Resource Allocation: Learning from a Single Sample
We study online resource allocation under non-stationary demand with a minimum offline data requirement. In this problem, a decision-maker must allocate multiple types of resources to sequentially arriving queries over a finite horizon. Each query belongs to a finite set of types with fixed resource consumption and a stochastic reward drawn from an unknown, type-specific distribution. Critically, the environment exhibits arbitrary non-stationarity – arrival distributions may shift unpredictably-while the algorithm requires only one historical sample per period to operate effectively. We distinguish two settings based on sample informativeness: (i) reward-observed samples containing both query type and reward realization, and (ii) the more challenging type-only samples revealing only query type information. We propose a novel type-dependent quantile-based meta-policy that decouples the problem into modular components: reward distribution estimation, optimization of target service probabilities via fluid relaxation, and real-time decisions through dynamic acceptance thresholds. For reward-observed samples, our static threshold policy achieves $\tilde{O}(\sqrt{T})$ regret. For type-only samples, we first establish that sublinear regret is impossible without additional structure; under a mild minimum-arrival-probability assumption, we design both a partially adaptive policy attaining the same $\tilde{O}({T})$ bound and, more significantly, a fully adaptive resolving policy with careful rounding that achieves the first poly-logarithmic regret guarantee of $O((\log T)^3)$ for non-stationary multi-resource allocation. Our framework advances prior work by operating with minimal offline data (one sample per period), handling arbitrary non-stationarity without variation-budget assumptions, and supporting multiple resource constraints.
Read the full abstract
Mathematical Physics
Conditional thinning and multiplicative statistics of Laguerre-type orthogonal polynomial ensembles
We study the local statistics of orthogonal polynomial ensembles near a hard edge, subject to a multiplicative deformation of the measure. Probabilistically, this deformation corresponds to a position-dependent conditional thinning of the particles. We prove that, under critical hard edge scaling and for a large class of potentials and deformation symbols, the correlation kernel of the conditional ensemble converges to a universal limit, which we identify as the conditional thinned Bessel point process. We derive an explicit expression for this limiting kernel in terms of the solution to a nonlocal integrable system depending on a parameter. For a special choice of the parameter, this system was recently identified in the study of multiplicative statistics of the Bessel point process. Our results establish that this system governs the full correlation structure of the conditional Bessel point process, extending the classical connection between the standard Bessel kernel and the Painlevé V equation.
Read the full abstract
Representation Theory
Degenerations of CoHAs of 2-Calabi-Yau categories
By work of Davison and Meinhardt, the cohomological Hall algebra of a symmetric quiver with potential admits a geometrically defined filtration (the perverse filtration) whose associated graded is a supercommutative algebra. In the case of the triple quiver of a quiver with the canonical cubic potential, which corresponds to the preprojective algebra of the quiver via dimensional reduction, there is an additional filtration (the less perverse filtration), which is defined more generally for cohomological Hall algebras of suitably geometric $2$-Calabi-Yau categories in work of Davison. In this paper, we show that the degenerations of the cohomological Hall algebras of preprojective algebras and more generally $2$-Calabi-Yau categories with respect to the less perverse filtration is isomorphic to the enveloping algebra of the current Lie algebra of the BPS Lie algebra. This result applies in particular to CoHAs of local systems on Riemann surfaces and Higgs bundles on smooth projective curves. We extend this description to deformations of the cohomological Hall algebra obtained via torus actions on the arrows of the quiver and deformed canonical cubic potentials via the deformed dimensional reduction of Davison-P\u adurariu. We prove all our results at the level of sheafified CoHAs, which allows us to deduce similar statements for all versions of nilpotent CoHAs. Last, we use our results to compare the less perverse filtration on CoHAs of preprojective algebras with the order filtration on the Maulik-Okounkov Yangian, via the comparison isomorphism of Botta-Davison and Schiffmann-Vasserot.
Read the full abstract
Information Theory · Cross-listed from eess.SP
Gap-Induced Sidelobes in Multiband Wi-Fi CSI and Their Impact on Multipath Delay Estimation
Leveraging channel state information from multiple Wi-Fi bands has the potential to improve delay resolution for ranging and sensing when wide contiguous spectrum is unavailable. However, non-contiguous spectrum access reshapes the spectral window, producing sidelobes and secondary peaks that can mask closely spaced multipath components. Prior work either designs the bands, which fixed Wi-Fi channelization does not allow, or addresses only the first multipath component. To characterize these secondary peaks, multipath delay estimation is studied in Wi-Fi-compliant multiband settings using channel state information. For a two-path model with unknown complex gains and delays, the Cramér-Rao lower bound for delay separation is derived and analyzed, confirming the benefit of larger frequency aperture at every separation considered, while revealing pronounced, separation-dependent oscillations driven by gap geometry and coupling of the two multipath components. Increasing aperture sharpens the mainlobe but also intensifies sidelobes and multipath interference, yielding competing peaks and a dominant peak shifted from the true delay. For the single-path matched filter, this shift is a deterministic offset governed by the slope of the autocorrelation function (ACF) of the allocation at the separation. A closed-form expression is derived for this offset, predicting it to within 21 ps for the analyzed channel combinations. Since the spectrum allocation enters both the bound and the offset, the impact of its gaps can be assessed for any legal aggregation before a measurement is taken.
Read the full abstract
Probability
Fluctuations of Discrete-Time Random Walks
These notes are devoted to fluctuations of one-dimensional random walks. We discuss various approaches to first-passage times and to the corresponding conditional distributions. After discussion of some classical methods, such as reflection principle for simple random walks and Wiener-Hopf factorisation, we proceed to the universality approach, which has been developed in recent past. Considering one-dimensional case allows us to avoid some technical obstacles and to present the core of this method in a more transparent way. It turns out that the universality method is much more robust than the Wiener-Hopf factorisation and allows one to consider walks with non-identically distributed or even dependent increments.
Read the full abstract
Information Theory
Optimality Analysis of RSMA Degenerating to SDMA Under Imperfect SIC
This document serves as supplementary material for our journal submission, providing detailed mathematical proofs and derivations that support the results presented in the main manuscript. Specifically, under a modeling framework that jointly considers transceiver hardware impairments and imperfect successive interference cancellation (SIC), we systematically derive and prove from an optimality perspective that: when the residual interference coefficient approaches 1 (i.e., SIC becomes severely ineffective), there exists an optimal solution such that the common stream beamformer satisfies $\bm w_c^\star=\bm 0$, and hence the optimal rate-splitting multiple access (RSMA) transmission structure degenerates into space division multiple access (SDMA). This conclusion provides a verifiable theoretical justification for the convergence phenomenon observed in simulations, namely that "the RSMA performance gradually approaches that of SDMA as SIC degrades", and can also serve as a reference for multiple-access selection and system design in SIC-limited scenarios.
Read the full abstract
Metric Geometry
Geometric analysis of Bennett's spherical 8-bar linkage and its spatial counterpart
We provide a geometric approach to two combinatorically symmmetric overconstrained spatial linkages. Both contain eight bodies and twelve revolute joints and collapse in aligned poses. The first one is spherical and the union of six spherical isograms. It is the spherical image of a Bricard octahedron of type~3 and was already analysed 1912 by Bennett. The second linkage is the dualized version and composed from six Bennett isograms. Our approach via line reflections discloses some symmetries at spatial poses.
Read the full abstract
Optimization and Control · Cross-listed from astro-ph.EP
Probabilistic Methods for Initial Orbit Determination and Orbit Determination in Cislunar Space
In orbital mechanics, Gauss's method for orbit determination (OD) is a popular, minimal assumption solution for obtaining the initial state estimate of a passing resident space object (RSO). Since much of the cislunar domain relies on three-body dynamics, a key assumption of Gauss's method is rendered incompatible, creating a need for a new, minimal assumption method for initial orbit determination (IOD). In this work, we present a framework for short and long term probabilistic target tracking in cislunar space which produces an initial state estimate with as few assumptions as possible. Specifically, we propose an IOD method involving the kinematic fitting of several series of noisy, consecutive ground-based observations. Once a probabilistic initial state estimate in the form of a particle cloud is formed, we apply the powerful Particle Gaussian Mixture (PGM) Filter to reduce the uncertainty of our state estimate over time. This combined IOD/OD framework is demonstrated for several classes of trajectories in cislunar space and compared to better-known filtering frameworks.
Read the full abstract
Statistics Theory · Cross-listed from stat.ML
On the Generalization and Robustness in Conditional Value-at-Risk
Conditional Value-at-Risk (CVaR) is a widely used risk-sensitive objective for learning under rare but high-impact losses, yet its statistical behavior under heavy-tailed data remains poorly understood. Unlike expectation-based risk, CVaR depends on an endogenous, data-dependent quantile, which couples tail averaging with threshold estimation and fundamentally alters both generalization and robustness properties. In this work, we develop a learning-theoretic analysis of CVaR-based empirical risk minimization under heavy-tailed and contaminated data. We establish sharp, high-probability generalization and excess risk bounds under minimal moment assumptions, covering fixed hypotheses, finite and infinite classes, and extending to $\beta$-mixing dependent data; we further show that these rates are minimax optimal. To capture the intrinsic quantile sensitivity of CVaR, we derive a uniform Bahadur-Kiefer type expansion that isolates a threshold-driven error term absent in mean-risk ERM and essential in heavy-tailed regimes. We complement these results with robustness guarantees by proposing a truncated median-of-means CVaR estimator that achieves optimal rates under adversarial contamination. Finally, we show that CVaR decisions themselves can be intrinsically unstable under heavy tails, establishing a fundamental limitation on decision robustness even when the population optimum is well separated. Together, our results provide a principled characterization of when CVaR learning generalizes and is robust, and when instability is unavoidable due to tail scarcity.
Read the full abstract
Analysis of PDEs
Nonlocal eigenvalue problems and superposition operators
We study the spectral theory of mixed local and nonlocal operators with lower-order terms in the right-hand side of the equation. This kind of problems is motivated by the analysis of superposition operators of mixed order and with the "wrong sign" of the lower-order terms with respect to the classical elliptic theory. Our results include: -convergence to classical cases when the right-hand side of the eigenvalye equations "localizes", recovering the simplicity and sign-definiteness of eigenfunctions in the limit; -a detailed analysis of disconnected domains, showing that, unlike the classical case, any eigenfunction associated with the first eigenvalue must change sign, and that the first eigenvalue of a union of disconnected domains is strictly smaller than that of its individual components; -examples in which the first eigenvalue is either simple or non-simple in disconnected domains; -a regularity theory that underpins these results.
Read the full abstract
Category Theory
On the Category-Theoretic Independence of Meaning, Object, Name and Existence
We prove a category-theoretic independence theorem for four fundamental notions: meaning, object, name, and existence. Working in a Lawvere-style categorical semantics and in particular in toposes, we show that these notions occupy distinct structural levels (object, morphism, element, and internal logical level) and are not uniformly recoverable from one another. The key separation arises between internal existence and global naming. Using a concrete example in the topos $\mathbf{Sh}(S^1)$-the sheaf of local sections of a nontrivial covering-we exhibit an object that is internally inhabited but admits no global element. These results provide a precise structural basis for treating geometric universes as foundational frameworks for information networks.
Read the full abstract
Group Theory
Refined conjugate generation in sporadic groups
Given an automorphism $x$ of order bigger than $2$ of a sporadic simple group $S$, we show that there are at most $3$ conjugates of $x$ required to generate a subgroup of order divisible by a fixed prime divisor $r$ of $|S|$. The only exception is the case where $S=Suz$, $x$ is in class $3A$, $r=11$, and then the required number of generators is $4$.
Read the full abstract
Numerical Analysis
Strong convergence of finite element schemes for the stochastic Landau–Lifshitz–Bloch equation
The dynamics of magnetisation in a bounded ferromagnet in $\mathbb{R}^d$ ($d=1,2$) at high temperatures can be described by the stochastic Landau–Lifshitz–Bloch (sLLB) equation, which is a vector-valued quasilinear stochastic partial differential equation. In this paper, assuming adequate regularity of the initial data, we establish strong convergence in $L^2(\Omega)$ of several semi-implicit and implicit fully discrete finite element schemes for the sLLB equation, together with explicit convergence rates. The analysis relies on localised error estimates and new exponential moment bounds for the exact solution. As a by-product, these moment bounds yield mean-square exponential stability of solutions and uniqueness of the invariant measure in one spatial dimension under a small noise assumption. We also sharpen existing convergence-in-probability results for the numerical schemes. Numerical experiments are presented to illustrate and support the theoretical findings.
Read the full abstract
Information Theory · Cross-listed from eess.SP
Joint Multi-User Tracking and Signal Detection in Reconfigurable Intelligent Surface-Assisted Cell-Free ISAC Systems
This paper investigates the cell-free multi-user integrated sensing and communication (ISAC) system, where multiple base stations collaboratively track the users and detect their signals. Moreover, reconfigurable intelligent surfaces (RISs) are deployed to serve as additional reference nodes to overcome the line-of-sight blockage issue of mobile users for accomplishing seamless sensing. Due to the high-speed user mobility, the multi-user tracking and signal detection performance can be significantly deteriorated without elaborated online user kinematic state updating principles. To tackle this challenge, we first manage to establish a probabilistic signal model to comprehensively characterize the interdependencies among user states, transmit signals, and received signals during the tracking procedure. Based on the Bayesian problem formulation, we further propose a novel hybrid variational message passing (HVMP) algorithm to realize computationally efficient joint estimation of user states and transmit signals in an online manner, which integrates VMP and standard MP to derive the posterior probabilities of estimated variables. Furthermore, the Bayesian Cramer-Rao bound is provided to characterize the performance limit of the multi-user tracking problem, which is also utilized to optimize RIS phase profiles for tracking performance enhancement. Numerical results demonstrate that the proposed algorithm can significantly improve both tracking and signal detection performance over the representative Bayesian estimation counterparts.
Read the full abstract
Number Theory
Modules of Jacobi forms of degree two of small levels
The purpose of this paper is to describe explicitly the modules of (Siegel-)Jacobi forms of degree two of index one of any scalar valued weight with respect to some congruence subgroups of small levels $N\leq 4$. Such a structure for the full Siegel modular group as a module over scalar valued Siegel modular forms of even weight has been explicitly given by T.~Ibukiyama. There we used an explicit structure theorem of rings of scalar valued Siegel modular forms by Igusa and that of vector valued Siegel modular forms of weight $\det^k\, \Sym^2$ by T. Satoh and T. Ibukiyama. On the other hand, for levels $N=2$, $3$, $4$, ring structures of scalar valued case have been also known by H. Aoki and T. Ibukiyama and $\det^k \Sym^2$-valued case by H. Aoki. In this paper, by merging these results, we give the same sort of simple structure theorems on modules of Jacobi forms of degree of two of index one for level $2$, $3$ and $4$.
Read the full abstract
Analysis of PDEs
On Counterexamples to Interior $C^2$ Estimates for Monge-Ampère Type Equations
We modify Pogorelov's classic construction to demonstrate the absence of a priori $C^2$ estimates for the equations $\det(D^2 u \pm Du \otimes Du) = f(x)$ in dimension $n \ge 3$. We construct a sequence of solutions $z_\varepsilon$ with second derivatives blowing up at the origin as $\varepsilon \rightarrow 0$, while the corresponding right-hand sides $f_\varepsilon$ admit uniform $C^2$ estimates. Specifically, the counterexamples are given by $z_\varepsilon(x_1, \dots, x_n) = (1+x_1^2)(1+x_2^2)(\varepsilon^2 + \eta^2)^{\alpha/2},$ where $\eta = \sqrt{x_3^2 + \dots + x_n^2}$ and $\alpha = 2 - \frac{2}{n}$.
Read the full abstract
Optimization and Control
Policy Gradient Algorithms in Average-Reward Multichain MDPs
While there is an extensive body of research analyzing policy gradient methods for discounted cumulative-reward MDPs, prior work on policy gradient methods for average-reward MDPs has been limited, with most existing results restricted to ergodic or unichain settings. In this work, we first establish a policy gradient theorem for average-reward multichain MDPs based on the invariance of the classification of recurrent and transient states. Building on this foundation, we develop refined analyses and obtain a collection of convergence and sample-complexity results that advance the understanding of this setting. In particular, we show that the proposed $\alpha$-clipped policy mirror ascent algorithm attains an $\epsilon$-optimal policy with respect to positive policies.
Read the full abstract
Analysis of PDEs
A Carleman Semi-Discrete Convexification Method Combined With Deep Learning for Electrical Impedance Tomography
In this paper, a new semi-discrete version of the Carleman estimate-based convexification globally convergent numerical method is developed. It is used for the delivery of the starting point for the training procedure of deep learning. An important feature of the continuous version of the convexification method is that its convergence to the true solution is independent on the availability of a good first guess about this solution. A new concept of the h-strong convexity is introduced, where h is the grid step size in the semi-discrete version of the convexification method. The h -strong convexity allows to obtain an a priori accuracy estimate of the starting point for the training step of the deep learning procedure. This approach is demonstrated for a highly nonlinear problem of Electrical Impedance Tomography. Results of numerical experiments for complicated media structures demonstrate the computational feasibility of this procedure.
Read the full abstract
Number Theory
A function field analogue of Ligozat's theorem for Drinfeld modular units
Fix a nonzero level $\mathfrak{n} \in \mathbb{F}_q[T]$. In this paper, we first establish a function field analogue of Ligozat's theorem, which serves as our main result and provides a criterion for Drinfeld modular units on the Drinfeld modular curve $X_0(\mathfrak{n})$. We further conjecture that this criterion characterizes all Drinfeld modular units; we verify the conjecture in the cases of prime power level and of level equal to the product of two primes. Second, as an application of Drinfeld modular units, we investigate the rational cuspidal divisor class group $\mathcal{C}(\mathfrak{n})$ of $X_0(\mathfrak{n})$. We construct an injective map $g$ from the group of degree $0$ rational cuspidal divisors on $X_0(\mathfrak{n})$ to the group of Drinfeld modular units on $X_0(\mathfrak{n})$ tensored with $\mathbb{Q}$ over $\mathbb{Z}$. As a result, we establish an explicit upper bound for the exponent of $\mathcal{C}(\mathfrak{n})$ for general level $\mathfrak{n}$.
Read the full abstract
Probability
Convergence of Half-Space Last Passage Percolation Away from the Boundary to the Directed Landscape
In this note, we prove convergence of the half-space exponential last passage percolation (LPP) model, away from the boundary, to the directed landscape. Our approach couples the half-space and full-space LPP models and constructs two barrier events based on the monotonicity of last passage paths. Combining this coupling with moderate deviation estimates for both models and the known convergence of full-space LPP to the directed landscape, we establish the desired convergence.
Read the full abstract
Mathematical Physics
Superintegrability and choreographic obstructions in dihedral $n$-body Hamiltonian systems
We study planar $n$-body Hamiltonians with quadratic pair interactions whose coupling pattern is invariant under the dihedral group $D_n$. After the center of mass is removed, the dynamics separates into label-Fourier modes. This makes it possible to distinguish three notions that are often conflated: commensurability of the normal frequencies, maximal superintegrability of the full relative Hamiltonian, and realization of choreographic space–time symmetry. We prove that a periodic configuration is $C_n$-equivariant if and only if every label-Fourier coefficient acquires under the time shift $T/n$ the character phase prescribed by cyclic relabeling. For harmonic motion this criterion determines the complete equivariant subspace of initial data and its codimension. Thus, a resonant orbit may be periodic without being a choreography. The cases $n=4,5,6$ illustrate the obstruction. In particular, $n=6$ is the first case with three inequivalent internal branches: the nondegenerate $1{:}2{:}3$ resonance admits a phase-matched three-branch choreography, whereas the exactly degenerate $1{:}2{:}2$ spectrum is incompatible with simultaneous $m=2$ and Nyquist $m=3$ excitation. A choreography on the latter surface survives only in a compatible invariant subspace. Resonant data outside the equivariant subspace can instead organize into synchronized multi-trace fragments.
Read the full abstract
Group Theory
From Trees to Tripods: Proof of $K(\pi,1)$ for Artin groups with $ABI$-type spherical parabolics
We describe contractibility criteria for typed simplicial complexes modeled on Coxeter diagrams. Such complexes include buildings and also arise as coset complexes of groups with strongly admissible parabolic systems, including Shephard groups, which generalize both Artin and Coxeter groups. Our result applies to a large class of complexes modeled on tree Coxeter diagrams and implies deformation retraction onto a nonpositively curved subcomplex. As an application, we reduce the $K(\pi,1)$-conjecture for all Artin groups with tree Coxeter diagrams to properties of Artin groups with tripod-shaped Coxeter diagrams. Combining this reduction theorem and properties of braid groups in previous works of Charney, Crisp-McCammond, Haettel and the second named author, we deduce that the $K(\pi,1)$-conjecture holds for every Artin group whose spherical parabolic subgroups avoid type $D_n$ ($n \ge 4$) and the exceptional types. We give an analogous tree to tripod reduction for Shephard groups. Our proof relies on two ingredients of independent interest: a notion of combinatorial convexity and a Bestvina-type inequality in certain injective orthoscheme complexes. These ingredients further rely on the use of structural properties of bi-Helly graphs developed in joint work of the first named author with Munro.of bi-Helly graphs (also known as absolute bipartite retracts) developed in joint work of the first named author with Munro.
Read the full abstract
Group Theory
Bestvina metric and tree reduction for $K(\pi,1)$-conjecture
We reduce the $K(\pi,1)$-conjecture for all Artin groups to properties of Artin groups whose Coxeter diagrams are trees, from which we deduce new classes of Artin groups satisfying the $K(\pi,1)$-conjecture. This relies on constructing actions of Artin groups on Bestvina complexes of suitable Garside groupoids.
Read the full abstract
Numerical Analysis · Cross-listed from quant-ph
Recursive Sketched Interpolation: Efficient Hadamard Products of Tensor Trains
The Hadamard product of two tensors in the tensor-train (TT) format is a fundamental operation across various applications, such as TT-based function multiplication for nonlinear differential equations or convolutions. However, conventional methods for computing this product typically scale as at least $\mathcal{O}(\chi^4)$ with respect to the TT bond dimension (TT-rank) $\chi$, creating a severe computational bottleneck in practice. By combining randomized tensor-train sketching with slice selection via interpolative decomposition, we introduce Recursive Sketched Interpolation (RSI), a “scale product” algorithm that computes the Hadamard product of TTs at a computational cost of $\mathcal{O}(\chi^3)$. Benchmarks across various TT scenarios demonstrate that RSI offers superior scalability compared to traditional methods while maintaining comparable accuracy. We generalize RSI to compute more complex operations, including Hadamard products of multiple TTs and other element-wise nonlinear mappings, without increasing the complexity beyond $\mathcal{O}(\chi^3)$.
Read the full abstract
Analysis of PDEs
Weakly-singular formulation of the Fractional Laplacian operator
This paper presents a new formulation of the fractional Laplacian operator $(-\Delta)^s$ in $n$-dimensional space ($n \ge 1$). The proposed formulation expresses $(-\Delta)^s$ as a composition of the classical Laplace differential operator and a weakly singular integral operator – which can be used to reduce e.g. the Dirichlet problem for the fractional Laplacian to a weakly singular integral equation involving both volumetric and boundary integral operators. This reformulation is well suited for efficient and accurate numerical implementation. Although a full description of the associated high-order algorithm is deferred to a subsequent contribution, several numerical examples are included in this paper to demonstrate the high accuracy and computational efficiency achieved by the proposed approach.
Read the full abstract
Optimization and Control
Exploiting block triangular submatrices in KKT systems
We propose a method for solving Karush-Kuhn-Tucker (KKT) systems that exploits block triangular submatrices by first using a Schur complement decomposition to isolate the block triangular submatrices then performing a block backsolve where only diagonal blocks of the block triangular form need to be factorized. We show that factorizing reducible symmetric-indefinite matrices with standard 1$\times$1 or 2$\times$2 pivots yields fill-in outside the diagonal blocks of the block triangular form, in contrast to our proposed method. While exploiting a block triangular submatrix has limited fill-in, unsymmetric matrix factorization methods do not reveal inertia, which is required by interior point methods for nonconvex optimization. We show that our target matrix has inertia that is known a priori, letting us compute inertia of the KKT matrix by Sylvester's law. Finally, we demonstrate the computational advantage of this method on KKT systems from optimization problems with neural network surrogates in their constraints. Our method achieves up to 15$\times$ speedups over state-of-the-art symmetric indefinite matrix factorization methods MA57 and MA86 in a constant-hardware comparison.
Read the full abstract
Statistics Theory
Minimax optimal adaptive structured transfer learning through semi-parametric domain-varying coefficient model
Transfer learning aims to improve inference in a target domain by leveraging information from related source domains, but its effectiveness critically depends on how cross-domain heterogeneity is modeled and controlled. When the conditional mechanism linking covariates and responses varies across domains, indiscriminate information pooling can lead to negative transfer, degrading performance relative to target-only estimation. We study a multi-source, single-target transfer learning problem under conditional distributional drift and propose a semiparametric domain-varying coefficient model (DVCM), in which domain-relatedness is encoded through an observable domain identifier. This framework generalizes classical varying-coefficient models to structured transfer learning and interpolates between invariant and fully heterogeneous regimes. Building on this model, we develop an adaptive transfer learning estimator that selectively borrows strength from informative source domains while provably safeguarding against negative transfer. Our estimator is computationally efficient and easy to implement; we also show that it is minimax rate-optimal and derive its asymptotic distribution, enabling valid uncertainty quantification and hypothesis testing despite data-adaptive pooling and shrinkage. Our results precisely characterize the interplay among domain heterogeneity, the smoothness of the underlying mean function, and the number of source domains and are corroborated by comprehensive numerical experiments and two real-data applications.
Read the full abstract
Dynamical Systems
Statistical Ensemble Deviation Estimates for Nearly Integrable Hamiltonian Systems
This paper studies quantitative deviation bounds for statistical ensembles evolving under the one-parameter flow of a nearly integrable Hamiltonian system. Combining Nekhoroshev-type stability estimates with phase-mixing arguments, we obtain, for any observable $G$, an explicit upper bound on the deviation of the ensemble average $\langle G\rangle_t$ from its angular average $\langle \left\langle G \right\rangle_{\theta}\rangle_{0}$ over exponentially long time scales. The bound separates contributions from the resonant neighborhood via a probability-mass term, and from the nonresonant region via a traceable $1/t$ mixing constant $C_G$, a high-frequency Fourier tail, and an explicit normal-form remainder error.
Read the full abstract
Probability
Anisotropic local law for non-separable sample covariance matrices
We establish local laws for sample covariance matrices $K = N^{-1}\sum_{i=1}^N \g_i\g_i^*$ where the random vectors $\g_1, \ldots, \g_N \in \R^n$ are independent with common covariance $\Sigma$. Previous work has largely focused on the separable model $\g = \Sigma^{1/2}\w$ with $\w$ having independent entries, but this structure is rarely present in statistical applications involving dependent or nonlinearly transformed data. Under a concentration assumption for quadratic forms $\g^*A\g$, we prove an optimal averaged local law showing that the Stieltjes transform of $K$ converges to its deterministic limit uniformly down to the optimal scale $\eta \geq N^{-1+\eps}$. Under an additional structural assumption on the cumulant tensors of $\g$ – which interpolates between the highly structured case of independent entries and generic dependence – we establish the full anisotropic local law, providing entrywise control of the resolvent $(K-zI)^{-1}$ in arbitrary directions. We discuss several classes of non-separable examples satisfying our assumptions, including conditionally mean-zero distributions, the random features model $\g = \sigma(X\w)$ arising in machine learning, and Gaussian measures with nonlinear tilting. The proofs introduce a tensor network framework for analyzing fluctuation averaging in the presence of higher-order cumulant structure.