相关论文: Stein kernels and moment maps
We establish self-norming central limit theorems for non-stationary time series arising as observations on sequential maps possessing an indifferent fixed point. These transformations are obtained by perturbing the slope in the…
Kernel methods are successful approaches for different machine learning problems. This success is mainly rooted in using feature maps and kernel matrices. Some methods rely on the eigenvalues/eigenvectors of the kernel matrix, while for…
On a two dimensional Stein space with isolated, normal singularities, smooth finite type boundary, and locally algebraic Bergman kernel, we establish an estimate on the type of the boundary in terms of the local algebraic degree of the…
One of the central objects in the theory of optimal transport is the Brenier map: the unique monotone transformation which pushes forward an absolutely continuous probability law onto any other given law. A line of recent work has analyzed…
Kernel matrices are a key quantity in kernel-based approximation, and important properties such as stability and algorithmic convergence can be analyzed with their help. In this work we refine a multivariate Ingham-type theorem, which is…
We investigate stability of invariant measures of diffusion processes with respect to $L^p$ distances on the coefficients, under an assumption of log-concavity. The method is a variant of a technique introduced by Crippa and De Lellis to…
This paper derives exponential tail bounds and polynomial moment inequalities for the spectral norm deviation of a random matrix from its mean value. The argument depends on a matrix extension of Stein's method of exchangeable pairs for…
We present an alternative way of solving the steerable kernel constraint that appears in the design of steerable equivariant convolutional neural networks. We find explicit real and complex bases which are ready to use, for different…
We introduce an integral representation of the Monge-Amp\`ere equation, which leads to a new finite difference method based upon numerical quadrature. The resulting scheme is monotone and fits immediately into existing convergence proofs…
We provide counterexamples to regularity of optimal maps in the classical Monge problem under various assumptions on the initial data. Our construction is based on a variant of the counterexample in \cite{LSW} to Lipschitz regularity of the…
We study positive kernels on $X\times X$, where $X$ is a set equipped with an action of a group, and taking values in the set of $\mathcal A$-sesquilinear forms on a (not necessarily Hilbert) module over a $C^*$-algebra $\mathcal A$. These…
We present a rather general method for proving local limit theorems, with a good rate of convergence, for sums of dependent random variables. The method is applicable when a Stein coupling can be exhibited. Our approach involves both…
We prove that the norm-square of a moment map associated to a linear action of a compact group on an affine variety satisfies a certain gradient inequality. This allows us to bound the gradient flow, even if we do not assume that the moment…
Notions of convergence and continuity specifically adapted to Riesz ideals I of the space of continuous real-valued functions on a Lindel\"of locally compact Hausdorff space are given, and used to prove Stone-Weierstra{\ss}-type theorems…
This article is devoted to developing a theory for effective kernel interpolation and approximation in a general setting. For a wide class of compact, connected $C^\infty$ Riemannian manifolds, including the important cases of spheres and…
Much of machine learning relies on comparing distributions with discrepancy measures. Stein's method creates discrepancy measures between two distributions that require only the unnormalized density of one and samples from the other. Stein…
We derive an explicit formula for factorizing an $n$-point closed string amplitude into open string amplitudes. Our results are phrased in terms of a momentum kernel which in the limit of infinite string tension reduces to the corresponding…
We introduce a new framework that yields spectral bounds on norms of functions of transition maps for finite, homogeneous Markov chains. The techniques employed work for bounded semigroups, in particular for classical as well as for quantum…
We consider the Minimum Coverage Kernel problem: given a set $B$ of $d$-dimensional boxes, find a subset of $B$ of minimum size covering the same region as $B$. This problem is $\mathsf{NP}$-hard, but as for many $\mathsf{NP}$-hard problems…
Connectivity problems like k-Path and k-Disjoint Paths relate to many important milestones in parameterized complexity, namely the Graph Minors Project, color coding, and the recent development of techniques for obtaining kernelization…