Related papers: Matrix Concentration: Order versus Anti-order
We prove new Bernstein and Markov type inequalities in $L^p$ spaces associated with the normal and the tangential derivatives on the boundary of a general compact $C^\alpha$-domain with $1\leq \alpha\leq 2$. These estimates are also applied…
This paper is divided into two parts. In the first part, we develop a general method for expressing ranks of matrix expressions that involve Moore-Penrose inverses, group inverses, Drazin inverses, as well as weighted Moore-Penrose inverses…
We study the reverse triangle inequalities for suprema of logarithmic potentials on compact sets of the plane. This research is motivated by the inequalities for products of supremum norms of polynomials. We find sharp additive constants in…
Inexact Newton regularization methods have been proposed by Hanke and Rieder for solving nonlinear ill-posed inverse problems. Every such a method consists of two components: an outer Newton iteration and an inner scheme providing…
Initially motivated by the study of the non-asymptotic properties of non-parametric tests based on permutation methods, concentration inequalities for uniformly permuted sums have been largely studied in the literature. Recently, Delyon et…
This note describes non-asymptotic variance and tail bounds for order statistics of samples of independent identically distributed random variables. Those bounds are checked to be asymptotically tight when the sampling distribution belongs…
We introduce a framework for obtaining tight mixing times for Markov chains based on what we call restricted modified log-Sobolev inequalities. Modified log-Sobolev inequalities (MLSI) quantify the rate of relative entropy contraction for…
We present two sharp, closed-form empirical Bernstein inequalities for symmetric random matrices with bounded eigenvalues. By sharp, we mean that both inequalities adapt to the unknown variance in a tight manner: the deviation captured by…
Recently Wilson [Ann. Appl. Probab. 14 (2004) 274--325] introduced an important new technique for lower bounding the mixing time of a Markov chain. In this paper we extend Wilson's technique to find lower bounds of the correct order for…
For dynamical systems modeled by a Young tower with exponential tails, we prove an exponential concentration inequality for all separately Lipschitz observables of n variables. When tails are polynomial, we prove polynomial concentration…
We present an efficient method for computing dominant eigenvalues of large, nonsymmetric, diagonalizable matrices based on an adaptive block Lanczos algorithm combined with Chebyshev polynomial filtering. The proposed approach improves…
We introduce a class of Markov chains, that contains the model of stochastic approximation by averaging and non-averaging. Using martingale approximation method, we establish various deviation inequalities for separately Lipschitz functions…
We introduce a globally-convergent algorithm for optimizing the tree-reweighted (TRW) variational objective over the marginal polytope. The algorithm is based on the conditional gradient method (Frank-Wolfe) and moves pseudomarginals within…
We prove an inequality that complements the famous Araki-Lieb-Thirring (ALT) inequality for positive matrices $A$ and $B$, by giving a lower bound on the quantity $\trace[A^r B^r A^r]^q$ in terms of $\trace[ABA]^{rq}$ for $0\le r\le 1$ and…
Recently, the weak Drazin inverse and its characterization have been crucial studies for matrices of index k. In this article, we have revisited W-weighted DMP and MPD inverses and constructed a general class of unique solutions to certain…
The mean-field variant of the model of limit order driven market introduced recently by Maslov is formulated and solved. The agents do not have any strategies and the memory of the system is kept within the order book. We show that he…
We give H\"older's inequalities for integral and conditional expectation involving the infinite product. Moreover, a generalized Doob maximal operator is introduced and weighted inequalities for the operator are established.
Using the method of transportation-information inequality introduced in \cite{GLWY}, we establish Bernstein type's concentration inequalities for empirical means $\frac 1t \int_0^t g(X_s)ds$ where $g$ is a unbounded observable of the…
We give new characterizations for matrix monotonicity and convexity of fixed order which connects previous characterizations by Loewner, Dobsch, Donoghue, Kraus and Bendat--Sherman. The ideas introduced are then used to characterize matrix…
Let $\{W_t\}_{t=1}^{\infty}$ be a finite state stationary Markov chain, and suppose that $f$ is a real-valued function on the state space. If $f$ is bounded, then Gillman's expander Chernoff bound (1993) provides concentration estimates for…