Related papers: Nonlinear Matrix Concentration via Semigroup Metho…
Regularized nonnegative low-rank approximations, such as sparse Nonnegative Matrix Factorization or sparse Nonnegative Tucker Decomposition, form an important branch of dimensionality reduction models known for their enhanced…
The concentration inequality approach for normal approximation by Stein's method is generalized to the multivariate setting. We use this approach to prove a non-smooth function distance for multivariate normal approximation for standardized…
Consider the standard nonparametric regression model and take as estimator the penalized least squares function. In this article, we study the trade-off between closeness to the true function and complexity penalization of the estimator,…
In this paper, we prove an Azuma-Hoeffding-type inequality in several classical models of random configurations, including the Erd\H{o}s-R\'enyi random graph models $G(n,p)$ and $G(n,M)$, the random $d$-out(in)-regular directed graphs, and…
We are concerned with an approximation problem for a symmetric positive semidefinite matrix due to motivation from a class of nonlinear machine learning methods. We discuss an approximation approach that we call {matrix ridge…
This paper develops a general concentration inequality for the suprema of empirical processes with dependent data. The concentration inequality is obtained by combining generic chaining with a coupling-based strategy. Our framework…
We characterize all real matrix semigroups satisfying a mild boundedness assumption, without assuming continuity. Besides the continuous solutions of the semigroup functional equation, we give a description of solutions arising from…
We consider two methods to establish log-Sobolev inequalities for the invariant measure of a diffusion process when its density is not explicit and the curvature is not positive everywhere. In the first approach, based on the Holley-Stroock…
An exact renormalization group equation is derived for the free energy of matrix models. The renormalization group equation turns out to be nonlinear for matrix models, as opposed to linear for vector models. An algorithm for determining…
This paper studies inference in linear models with a high-dimensional parameter matrix that can be well-approximated by a ``spiked low-rank matrix.'' A spiked low-rank matrix has rank that grows slowly compared to its dimensions and nonzero…
We apply the density matrix renormalization group (DMRG) method to a non-equilibrium problem: the asymmetric exclusion process in one dimension. We study the stationary state of the process to calculate the particle density profile…
This work shows how exponential concentration inequalities for additive functionals of stochastic processes over a finite time interval can be derived from concentration inequalities for martingales. The approach is entirely probabilistic…
In this paper, a restricted memory quasi-Newton bundle method for minimizing a locally Lipschitz continuous function over a Riemannian manifold is proposed. The curvature information of the objective function is approximated by applying a…
A generalization of the Bernstein matrix concentration inequality to random tensors of general order is proposed. This generalization is based on the use of Einstein products between tensors, from which a strong link can be established…
Based on earlier work by Carlen-Maas and the second- and third-named author, we introduce the notion of intertwining curvature lower bounds for graphs and quantum Markov semigroups. This curvature notion is stronger than both Bakry-\'Emery…
We derive Concentration of Measure (CoM) inequalities for randomized Toeplitz matrices. These inequalities show that the norm of a high-dimensional signal mapped by a Toeplitz matrix to a low-dimensional space concentrates around its mean…
Let $M$ be a complete connected Riemannian manifold with boundary $\partial M$, and let $P_t$ be the Neumann semigroup generated by $\frac{ 1}{ 2} L$ where $L=\Delta+Z$ for a $C^1$-vector field $Z$ on $M$. We establish Bismut type formulae…
This paper presents a synthesis approach aiming to guarantee a minimum upper-bound for the time taken to reach a target set of non-zero measure that encompasses the origin, while taking into account uncertainties and input and state…
We consider a random variable $X$ that takes values in a (possibly infinite-dimensional) topological vector space $\mathcal{X}$. We show that, with respect to an appropriate "normal distance" on $\mathcal{X}$, concentration inequalities for…
Matrix concentration inequalities, intimately connected to the Non-Commutative Khintchine inequality, have been an important tool in both applied and pure mathematics. We study tensor versions of these inequalities, and establish…