相关论文: On some properties of contracting matrices

We investigate the connection between pseudo-Hermitian and Hermitian descriptions for a lattice, which consists of a set of isomorphic pseudo-Hermitian clusters. We show that such non-Hermitian systems can act as Hermitian systems. This is…

We reconsider randomized algorithms for the low-rank approximation of symmetric positive semi-definite (SPSD) matrices such as Laplacian and kernel matrices that arise in data analysis and machine learning applications. Our main results…

We study SU(2) Lattice Gauge Theory with dynamical fermions at non-zero chemical potential $\mu$. The symmetries special to SU(2) for staggered fermions on the lattice are discussed explicitly and their relevance to spectroscopy and…

Asynchronous distributed algorithms are a popular way to reduce synchronization costs in large-scale optimization, and in particular for neural network training. However, for nonsmooth and nonconvex objectives, few convergence guarantees…

We study necessary and sufficient conditions for contraction and incremental stability of dynamical systems with respect to non-Euclidean norms. First, we introduce weak pairings as a framework to study contractivity with respect to…

A matrix-compression algorithm is derived from a novel isogenic block decomposition for square matrices. The resulting compression and inflation operations possess strong functorial and spectral-permanence properties. The basic observation…

In this paper we study the effect of stochastic errors on two constrained incremental sub-gradient algorithms. We view the incremental sub-gradient algorithms as decentralized network optimization algorithms as applied to minimize a sum of…

We introduce and analyze an algorithm for the minimization of convex functions that are the sum of differentiable terms and proximable terms composed with linear operators. The method builds upon the recently developed smoothed gap…

We prove that every infinite sequence of skew-symmetric or symmetric matrices M_1, M_2, ... over a fixed finite field must have a pair M_i, M_j (i<j) such that M_i is isomorphic to a principal submatrix of the Schur complement of a…

This paper considers $N\times N$ matrices of the form $A_\gamma =A+ \gamma B$, where $A$ is self-adjoint, $\gamma \in C$ and $B$ is a non-self-adjoint perturbation of $A$. We obtain some monodromy-type results relating the spectral…

We consider a class of (possibly nondiagonalizable) pseudo-Hermitian operators with discrete spectrum, showing that in no case (unless they are diagonalizable and have a real spectrum) they are Hermitian with respect to a semidefinite inner…

The paper deals with the convergence properties of the products of random (row-)stochastic matrices. The limiting behavior of such products is studied from a dynamical system point of view. In particular, by appropriately defining a dynamic…

We introduce and study a non uniform hyperbolicity condition for complex rational maps, that does not involve a growth condition. We call this condition Backward Contraction. We show this condition is weaker than the Collet-Eckmann…

We introduce the Stochastic Monotone Aggregated Root-Finding (SMART) algorithm, a new randomized operator-splitting scheme for finding roots of finite sums of operators. These algorithms are similar to the growing class of incremental…

This is the first of two papers to describe a matrix sparsification algorithm that takes a general real or complex matrix as input and produces a sparse output matrix of the same size. The non-zero entries in the output are chosen to…

We establish an algorithm for a criterion of the diagonalisability of a matrix over a local field by a unitary matrix. For this sake, we define the notion of normality of a $p$-adic operator, and give several criteria for the normality. We…

The hypercontractivity is proved for the Markov semigroup associated to a class of finite/infinite dimensional stochastic Hamiltonian systems. Consequently, the Markov semigroup is exponentially convergent to the invariant probability…

The Koopman operator framework offers a way to represent a nonlinear system as a linear one. The key to this simplification lies in the identification of eigenfunctions. While various data-driven algorithms have been developed for this…

We prove a general quantitative theorem on the asymptotic behavior of stochastic quasi-Fej\'er monotone sequences in a broad metric context. Concretely, our result explicitly constructs a rate of convergence for such process, both in mean…

The Nystrom method is an efficient technique to speed up large-scale learning applications by generating low-rank approximations. Crucial to the performance of this technique is the assumption that a matrix can be well approximated by…