Searcharxiv⌕ Search

SEARCH · Searcharxiv

Search Searcharxiv

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 recordsLinked to original sources

Gaussian Approximation in Wasserstein-p: Markovian Martingale Differences and Stochastic Approximation

We establish nonasymptotic Gaussian approximation bounds in higher-order Wasserstein distance $W_p$, $p\geq2$, for deterministic matrix-weighted sums of multivariate Poisson martingale differences generated by uniformly ergodic Markov chains. Under an $L^{(2+η)p}$-moment condition, $η>0$, we obtain the explicit bound $$O\left(p^3\|A\|_4^2+pd^{1/4}\|A\|_2^{1/2}\|A\|_4^2\right),$$ where $A\in\mathbb{R}^n$ collects the moment sizes of the weighted increments. When these sizes are of order $n^{-1/2}$, the bound achieves the first optimal $O(n^{-1/2})$ rate for fixed $p$ and $d$. Consequently, we also obtain the first optimal $O(n^{-1/2})$ $W_p$ Gaussian approximation rate for multivariate additive functionals of uniformly ergodic Markov chains. Our analysis develops two techniques for addressing the interplay between higher-order Wasserstein distance and temporal dependence. First, building on the Ornstein--Uhlenbeck relative-score approach of Fang and Koike (2023), we formulate the bound in terms of antisymmetric Stein couplings while retaining the conditional tensor structure. Second, we develop a refresh-then-maximal coupling that combines an independent first-step resampling, which preserves the desired Stein identity, with a subsequent maximal coupling that provides effective control of the coupling increment. We apply these bounds to nonlinear Markovian stochastic approximation by decomposing normalized errors into matrix-weighted Poisson martingale sums and remainders. This yields the first sharp $W_p$ Gaussian approximation rates for both last iterates and Polyak--Ruppert averages. In particular, the optimized rates are $O(n^{-1/3})$ for polynomial-stepsize last iterates and $O(n^{-1/4})$ for Polyak--Ruppert averages, with an $O(n^{-1/2})$ rate for harmonic-stepsize last iterates under an additional spectral condition.

math.PR↗

Overcoming the spatial order barrier for nonlinear SPDEs with additive space-time white noise

We introduce a fully discrete numerical scheme for semilinear SPDEs with additive space-time white noise that overcomes the previous order barrier for the spatial convergence rate. The scheme, which we refer to as the doubly accelerated exponential Euler scheme, achieves a strong convergence rate of $M^{-1+ε}$ in time and $N^{-3/2+ε}$ in space for any $ε>0$, where $M^{-1}$ and $N^{-1}$ are the temporal, respectively the spatial, meshsizes. This substantially improves the standard spatial error bounds of order $N^{-1/2}$ in the literature. Numerical simulations support the findings.

math.NA↗

On the Optimality of Gaussian Code-books for Signaling over a Two-Users Weak Gaussian Interference Channel

This article establishes that the capacity region of the two-user weak Gaussian interference channel can be achieved using single-letter Gaussian codebooks. The converse is established by showing that successive decoding can be employed for at least one of the receivers. It is further shown that the upper concave envelope of the achievable rate region can be attained using at most two time-sharing phases. In one phase, both users transmit simultaneously, while in the second phase, when present, only one user is active. Furthermore, the boundary of the capacity region can be traversed continuously through incremental reallocations of power between the two messages transmitted by each user. Finally, it is proven that the Han-Kobayashi achievable rate region with single-letter Gaussian codebooks attains the optimal boundary of the capacity region.

cs.IT↗

Multiplicative comparisons of Rényi entropies for weighted Bernoulli sums

We establish multiplicative comparisons between Rényi entropies of different orders for weighted sums of independent Bernoulli random variables. In particular, we prove a logarithmic comparison between the zeroth- and infinity-order Rényi entropies, which yields a polynomial improvement over the square-root bound of Jain, Sah, and Sawhney. As an application, this leads to an improved parameterized running time for the randomized bin-packing algorithm of Nederlof, Pawlewicz, Swennenhuis, and Wȩgrzycki. We also obtain explicit dimension-free, constant-factor comparisons between Rényi entropies of positive orders.

math.PR↗

Oracle-free Boltzmann Sampling for Powersets

We propose an approach for sampling powersets under the Boltzmann distribution in an oracle-free way, i.e. without numerically evaluating the associated generating function. Our approach relies on a Poissonised infinite occupancy model and thinning. It yields an explicit sampler for bounded counting sequences and extends under mild growth conditions. We implement the sampler and find runtimes comparable to existing Boltzmann samplers.

cs.DM↗

Constant-Stepsize Stochastic Approximation: Finite-Time Convergence, Gaussian Approximation, and Tail Bounds

Constant-stepsize stochastic approximation (SA) is widely used in learning for computational efficiency, yet the distribution of the iterates is typically intractable. Classical asymptotics results give $X_k^{(α)} \approx X^{(α)} \approx x^\star+\sqrtαY$, where $X^{(α)}$ is the steady state and $Y$ is an appropriate Gaussian limit, by progressively taking the time $k\uparrow\infty$ and stepsize $α\downarrow0$. Such limit results, however, do not quantify finite-time, finite-stepsize errors. We develop an explicit pre-limit characterization for SA with i.i.d.\ and Markovian noise. We establish existence and uniqueness of the stationary law, a geometric Wasserstein convergence to stationarity, and almost-sure and $L^3$ convergence of the steady state to the root $x^\star$, identifying the scale $\sqrtα$ as first-order fluctuation. At this scale, we derive a higher-order quantitative Gaussian approximation with a Wasserstein error, using Stein's method and Poisson equation techniques. We further obtain non-uniform Berry--Esseen-type tail bounds, incorporating both steady-state approximation and finite-time convergence errors. We instantiate the theory for strongly convex smooth SGD, linear SA, and nonlinear contractive SA. Beyond strong convexity, for general convex SGD, we identify a Gibbs limiting law and prove a pre-limit Wasserstein approximation error under stability and Stein-equation hypothesis, which are validated numerically.

cs.LG↗

Eigenvalue stability and new perturbation bounds for the extremal eigenvalues of a matrix

Let $A$ be a full ranked $ n\times n$ matrix, with singular values $σ_1 (A) \ge \dots \ge σ_n (A) >0$. The condition number $κ(A):= σ_1(A)/σ_n(A)=\|A\|\cdot \|A\|^{-1}$ is a key parameter in the analysis of algorithms taking $A$ as input. In practice, matrices (representing real data) are often perturbed by noise. Technically speaking, the real input would be a noisy variant $\tilde A =A +E$ of $A$, where $E$ represents the noise. The condition number $κ(\tilde A)$ will be used instead of $κ(A)$. Thus, it is of importance to measure the impact of noise on the condition number. In this paper, we focus on the case when the noise is random. We introduce the notion of regional stability, via which we design a new framework to estimate the perturbation of the extremal singular values and the condition number of a matrix. Our framework allows us to bound the perturbation of singular values through the perturbation of singular spaces. We then bound the latter using a novel contour analysis argument, which, as a co-product, provides an improved version of the classical Davis-Kahan theorem in many settings. Our new estimates concerning the least singular value $σ_n(A)$ complement well-known results in this area, and are more favorable in the case when the ground matrix $A$ is large compared to the noise matrix $E$.

math.NA↗

Generalized Sequential Monte Carlo Sampling for Redistricting Simulation

Simulation methods have become important tools for quantifying partisan and racial bias in redistricting plans. We generalize the Sequential Monte Carlo (SMC) algorithm of McCartan and Imai (2023), one of the commonly used approaches. First, our generalized SMC (gSMC) algorithm can split off regions of arbitrary size, rather than a single district as in the original SMC framework, enabling the sampling of multi-member districts with a varying number of representatives. Second, the gSMC algorithm can operate over various sampling spaces, providing additional computational flexibility. Third, we derive optimal-variance incremental weights and show how to compute them efficiently for each sampling space, leading to more efficient sampling. Finally, we propose a hybrid gSMC-MCMC algorithm by incorporating Markov chain Monte Carlo (MCMC) steps to handle large-scale redistricting applications without changing the target distribution. We demonstrate the effectiveness of the proposed methodology through analyses of the Irish Parliament, which uses multi-member districts of varying sizes, and the Pennsylvania House of Representatives, which has more than 200 single-member districts.

stat.AP↗

On the Capacity of Distinguishable Synthetic Identity Generation under Face Verification

Synthetic face generators can produce many nominal identities, but nominal count does not determine how many are jointly distinguishable under a specified verification rule. We define finite-dimensional capacity as the supremum of codebook sizes over distinct latent identity codes whose induced identity-conditional embedding distributions satisfy per-identity genuine acceptance and pairwise impostor non-match constraints. For deterministic view-invariant pipelines, fixed-code capacity equals the spherical-code cardinality over the realizable embedding set and reduces to the classical spherical-code cardinality when every sphere direction is realizable. For stochastic identity-conditional embedding distributions concentrated with probability at least $1-η$ in spherical caps of angular radius $ρ$, we derive a sufficient center-separation condition, spherical-code capacity lower bounds under full angular expressivity, and positive asymptotic lower-bound exponents for dimension-indexed pipeline families. We also derive prior-constrained random-code lower bounds from pairwise center-separation failure probabilities. When each identity-conditional embedding distribution has support equal to a spherical cap of angular radius $ρ$, we derive necessary zero-error geometric conditions and, for $2ρ<\arccos(τ)$ under full $ρ$-cap angular expressivity, show that the restricted zero-error capacity equals the classical spherical-code cardinality at minimum angle $\arccos(τ)+2ρ$. For finite repeated-view samples, a maximum clique in the resulting compatibility graph identifies the largest sampled subset satisfying all empirical genuine and pairwise impostor constraints. We evaluate this sample-restricted quantity on a deterministically selected DigiFace-1M subset under three fixed recognizers with identity-disjoint in-domain threshold calibration.

cs.IT↗

Any-Dimensional Learning by Sampling

Many machine learning models are defined for inputs of different sizes, such as point clouds containing different numbers of points, sequences of tokens of different lengths, and graphs on different numbers of nodes. Such models are trained on finitely many examples of necessarily limited sizes. How well do these models generalize from inputs of small size to larger inputs of size not seen during training? Furthermore, evaluating such models on large inputs is often expensive. How can we sketch large inputs to obtain smaller ones on which the model takes similar values? At the heart of both questions is the need to compare inputs of different sizes and to approximate large inputs by small ones. We present a unified approach to address these questions by using random sampling maps to compare inputs of different sizes. The sampling maps we consider are generalizations of sampling with replacement, random binning, and species sampling. We characterize the application domains in which each type of sampling is appropriate in terms of the symmetries and relations between problem instances of different sizes in the domain. Our framework yields explicit generalization and sketching rates for function classes continuous with respect to a chosen notion of sampling, encompassing large families of functions defined on sequences, graphs, and tensors of different sizes. Specific examples include moment polynomials on measures, homomorphism densities and numbers of graphs, permutation-invariant transformers, and graph neural networks.

math.ST↗

Sharp Normalized Covariance Bounds and Constant-Stretch Correlated Sampling on the Hypersimplex

We establish the normalized covariance bound conjectured by Anari et al. (2026, Conjecture 3) for fixed-rank external-field measures. Let $d\ge2$ and $m\in[d-1]$. For $w\in(0,+\infty)^d$, let $\mathsf S$ be an $m$-subset of $[d]$ with rank-$m$ external-field law $\mathbb P(\mathsf S=S)=\frac{\prod_{i\in S}w_i}{e_m(w)},S\subseteq[d],|S|=m,$ where $e_m(w):=\sum_{T\subseteq[d], |T|=m}\prod_{\ell\in T}w_\ell$ is the $m$th elementary symmetric polynomial in $w_1,\dots,w_d$. Let $X:=(X_1,\dots,X_d)^\top$ be its indicator vector, i.e., $X_i=\mathbb I\{i\in\mathsf S\},i\in\{1,\dots,d\}.$ Let $Σ:=\mathrm{Cov}(X)$, put $v_i:=Σ_{ii}$ for each $i\in[d]$, and define $v:=(v_1,\dots,v_d)^\top,D:=\mathrm{diag}(v),V:=\sum_{i=1}^dv_i.$ We prove $Σ\succeq D-\frac{vv^\top}{V}.$ This improves the coefficient $1/2$ in the first version of our work (Cesari and Colomboni, 2026, Corollary 1.3) to the optimal universal value $1$. As a first corollary, we improve the coefficient in the pseudoinverse bound of Bacchiocchi et al. (2026, Lemma 2) from $2$ to the optimal value $1$. Specializing this bound to coordinate differences gives an alternative proof of our effective-resistance theorem from the first version of our work (Cesari and Colomboni, 2026, Theorem 1.1). The framework of Anari et al. (2026, Theorem 1 and Corollary 2) also yields unconditional correlated-sampling guarantees with stretch $6$ on the hypersimplex and $12$ on its at-most variant. Unconditional constant-stretch guarantees were first established in the first version of our work (Cesari and Colomboni, 2026, Corollaries 1.4 and 1.5), with constants $16$ and $32$, which we improve here to $6$ and $12$. These improved constants strengthen the positive resolution, established in the first version of our work, of the constant-stretch question posed by Naor et al. (2026, Theorem 2 and Section 5).

math.PR↗

A concentration result for multilayer feedforward neural networks

We consider for an arbitrary fixed $ρ$ and for each positive integer $n$ a multilayer feedforward artificial neural network with $ρ$ layers, $n$ neurons in the first layer (the input layer) and only one neuron, the output neuron, in the last layer. Very roughly formulated, the main result is that if the distribution of weights of connections from a layer to the next are, for all large $n$, approximated well by a fixed continuous (but otherwise arbitrary) curve which does not depend on $n$, and if the values of the $n$ input neurons are independently and identically distributed with a continuous probability density function, then there is a number $ψ$ such that for all $\varepsilon > 0$ the probability that the value of the output neuron is in $[ψ- \varepsilon, ψ+ \varepsilon]$ tends to 1 as $n$ tends to infinity.

cs.AI↗

Degenerating orbits of the Longest Edge Bisection process

We study the Longest Edge Bisection (LEB) process as a dynamical system on the projective shape space of simplices. A long-standing conjecture going back to Adler and Rivara-Levin and motivated by finite-element mesh refinement, often taken as a standing assumption, is that this procedure is non-degenerate and, in fact, in a certain way periodic. We prove: \begin{itemize} \item There are 3-dimensional simplices such that the longest edge-bisection algorithm degenerates. \item There is an open set of 4-dimensional simplices on which the longest edge-bisection algorithm degenerates. \item If parametrizing the space of $d$-dimensional simplices by independent standard Gaussian vectors, then as $d$ increases, a random simplex degenerates asymptotically almost surely. \end{itemize} This is realized through exhibiting hyperbolic behaviour of the LEB process. We also exhibit elliptic behaviour that is nonperiodic.

math.DS↗

Strong convergence rates of tamed exponential Euler schemes for superlinear hyperbolic SPDEs

In this paper, we prove pathwise uniform convergence at rates up to $1/2$ for tamed exponential Euler schemes for semilinear hyperbolic stochastic evolution equations with superlinearly growing nonlinearities and multiplicative noise. We take the term hyperbolic to mean that the leading operator generates a contractive $C_0$-semigroup but no parabolic smoothing occurs. Under local Lipschitz, polynomial growth, coercivity, and monotonicity conditions on the nonlinearities, we establish pathwise uniform strong error estimates of the form \begin{equation*} \Big(\mathbb{E}\max_{0\le j \le N} \|U(t_j)-U^j\|_X^p\Big)^{1/p} \lesssim \sqrt{k} \end{equation*} on a Hilbert space $X$ for $p\in [2,\infty)$. Here, $U$ is the mild solution and $U^j$ is the tamed exponential Euler approximation at time $t_j=jk$ with step size $k>0$. This extends previous convergence results for non-parabolic SPDEs from globally to locally Lipschitz nonlinearities, allowing both drift and diffusion to grow polynomially. In a stochastic Kato framework, we further establish local and global well-posedness as well as uniform a priori estimates for the mild solution and its approximation. Applications to nonlinear stochastic transport, Airy, wave-type, and dissipatively damped nonlinear Schrödinger equations are included, covering different nonlinearities-stopped and fractionally tamed schemes. For the Klein-Gordon equation with cubic velocity damping, this complements previous results obtained for additive noise.

math.NA↗

High-Magnetization Sampling at Low Temperatures: Ising Models and Bayesian Sparse Linear Regression

Sparsity is a powerful structural resource in optimization and statistics. We develop frameworks for leveraging sparsity in sampling problems over the Hamming slice $\mathcal{X}_k^d:=\{\mathbf{x}\in\{\pm 1\}^d:|\{i:\mathbf{x}_i=1\}|=k\}$, in high-dimensional regimes where $k\ll d$ (i.e., where $\mathcal{X}_k^d$ is \emph{highly magnetized}). We use our frameworks to design improved samplers for canonical problems in the study of \emph{Ising models} and \emph{Bayesian sparse linear regression}. Our first main result considers the \emph{Sherrington--Kirkpatrick} (SK) model restricted to fixed-magnetization slices $\mathcal{X}_k^d$. We give a polynomial-time sampler for fixed-magnetization SK models at any inverse temperature $β>0$, under arbitrary external fields, provided that $k\le c_βd$ for an appropriate constant $c_β$. By combining this result with an annealing strategy for estimating normalizing constants, we obtain polynomial-time samplers for the SK model at arbitrarily low temperatures under a sufficiently strong external field of strength $h$. In the large-$β$ limit, our framework permits sampling at field strengths within constant factors of the \emph{Almeida--Thouless line} delineating the replica-symmetric and replica-symmetry-breaking regions ([dAT78]), improving polynomially over the field strength $h(β)$ required by the recent work of [BAR26]. Our second main result concerns the measurement complexity of polynomial-time Bayesian sparse linear regression. Recent work by [KSTZ25] shows how to sample from the canonical \emph{Gaussian spike-and-slab posterior} with expected sparsity $k$, at any signal-to-noise ratio, given $n\gtrsim k^3\log^3 d$ Gaussian measurements. We improve this requirement to $n\gtrsim k^{3/2}\log^2 d+k\log^3 d$, using a common sparsity-aware framework underlying both our results.

cs.DS↗

Quadratic Point Estimate Method for Uncertainty Quantification with Dependent Non-Gaussian Inputs

As an extension of the Point Estimate Method (PEM) to evaluate probabilistic moments of quantities of interest (QoI) in general $n$-dimensional spaces, the Quadratic Point Estimate Method (QPEM) has been recently developed. This new method is defined to fully represent up to fifth-order input moments in the Gaussian space, providing general analytical expressions for sample locations and weights, without requiring any numerical optimization. The QPEM can significantly improve the estimation accuracy of the output QoI moments, in relation to PEM-based methods whose numbers of sigma points grow linearly with the problem dimension, while at the same time having an affordable and competitive computational cost up to a considerable number of dimensions. The QPEM is further enhanced in this work by enabling copula integration into the framework, which enables effective modeling of the joint input probability density function by estimating marginals and the dependence structure of the involved random variables. The validity and efficient performance of the copula-based QPEM are showcased against numerous other sampling methods in various examples considering two practical scenarios: (i) when the joint dependence structure can be inferred from data, and (ii) when only marginal distributions and correlation matrices are known.

math.NA↗

Stability of Fork-Join Systems with Redundancy and Heterogeneous Servers

We consider the stability problem of fork-join systems with redundancy (FJR) and heterogeneous servers under both static and dynamic capacity-allocation policies. In an $(n,k)$ FJR system, each arriving job is split into $n$ independent tasks, with one task assigned to each of $n$ parallel servers. Once $k \le n$ tasks have been processed, they are joined and the corresponding job departs the system; the remaining $n-k$ unprocessed tasks are then removed and are therefore termed redundant. We first identify the nominal traffic intensity and characterize the maximal stability region, defined as the set of traffic intensities for which there exists an admissible policy that stabilizes the system. We then establish conditions under which this maximal stability region is attained for two classes of policies: static and dynamic. Specifically, we show that for static allocation policies, in which service capacities remain fixed over time, maximality is achieved whenever the fastest server is allocated no more than $1/k$ of the total service capacity. For dynamic allocation policies, in which a fixed total service capacity may be repeatedly reallocated among the servers, we show that maximality is achieved whenever the cumulative capacity allocated to the $j$ shortest queues does not exceed $j/k$ of the total capacity for every $j=1,\ldots,k-1$. Our analysis is based on a projection of the $(n,k)$ FJR system onto a simpler $(k,k)$ system that has no redundancy, together with a novel sample-path comparison argument for multidimensional processes based on the generalized Schur-convex order.

cs.IT↗

Tensor Network Moral Graph Recovery of Discrete Probability Distributions

We present a method for recovering the moral graph of a causal DAG from a probability distribution over discrete variables, using fully connected tensor networks (FCTNs) with nuclear-norm-regularized bond corrections. Each bond matrix is parameterized as a baseline all-ones matrix plus a low-rank correction $C_{ij} = U_{ij}V_{ij}^\top$, and the nuclear norm of the correction implemented via the variational Frobenius norm penalty on the factors drives unnecessary bonds to zero. We prove that under faithfulness, positivity, and a no-implicit-rerouting assumption on the local tensor architecture, \textbf{every} optimal FCTN with zero reconstruction error $\varepsilon = 0$ has effective graph exactly equal to the moral graph. For the approximate regime ($\varepsilon > 0$), we provide explicit recovery bounds using the Fannes-Audenaert continuity of conditional mutual information, and derive a sufficient condition on the regularization parameter $β$. The effective graph is read directly from the optimized bond matrices.

stat.ML↗