Related papers: New rigorous perturbation bounds for the generaliz…
A theoretical framework for non-negative matrix factorization based on generalized dual Kullback-Leibler divergence, which includes members of the exponential family of models, is proposed. A family of algorithms is developed using this…
Chiral lagrangians describing the interactions of Goldstone bosons in a theory possessing spontaneous symmetry breaking are effective, non-renormalizable field theories in four dimensions. Yet, in a momentum expansion one is able to extract…
Multigrid methods are popular iterative methods for solving large-scale sparse systems of linear equations. We present a mixed precision formulation of the multigrid V-cycle with general assumptions on the finite precision errors coming…
In this paper, generalized aspects of least square homotopy perturbations are explored to treat the system of non-linear fractional partial differential equations and the method is called as generalized least square homotopy perturbations…
Correlation matrices are the sub-class of positive definite real matrices with all entries on the diagonal equal to unity. Earlier work has exhibited a parametrisation of the corresponding Cholesky factorisation in terms of partial…
In this paper, we adopt a componentwise perturbation analysis for $\star$-Sylvester equations. Based on the small condition estimation (SCE), we devise the algorithms to estimate normwise, mixed and componentwise condition numbers for…
We present an algorithm that can efficiently compute a broad class of inferences for discrete-time imprecise Markov chains, a generalised type of Markov chains that allows one to take into account partially specified probabilities and other…
This paper introduces new solvers for efficiently computing solutions to large-scale inverse problems with group sparsity regularization, including both non-overlapping and overlapping groups. Group sparsity regularization refers to a type…
This paper examines fundamental error characteristics for a general class of matrix completion problems, where the matrix of interest is a product of two a priori unknown matrices, one of which is sparse, and the observations are noisy. Our…
Training modern neural networks often relies on large learning rates, operating at the edge of stability, where the optimization dynamics exhibit oscillatory and chaotic behavior. Empirically, this regime often yields improved…
Kernel-based clustering algorithm can identify and capture the non-linear structure in datasets, and thereby it can achieve better performance than linear clustering. However, computing and storing the entire kernel matrix occupy so large…
Robust clustering of high-dimensional data is an important topic because clusters in real datasets are often heavy-tailed and/or asymmetric. Traditional approaches to model-based clustering often fail for high dimensional data, e.g., due to…
We propose a general error analysis related to the low-rank approximation of a given real matrix in both the spectral and Frobenius norms. First, we derive deterministic error bounds that hold with some minimal assumptions. Second, we…
Matrices with off-diagonal decay appear in a variety of fields in mathematics and in numerous applications, such as signal processing, statistics, communications engineering, condensed matter physics, and quantum chemistry. Numerical…
For a family of near banded Toeplitz matrices, generalized characteristic polynomials are shown to be orthogonal polynomials of two variables, which include the Chebyshev polynomials of the second kind on the deltoid as a special case.…
We study the factorization and monotonicity method for inverse acoustic scattering problems. Firstly, we give a new general functional analysis theorem for the monotonicity method. Comparing with the factorization method, the general…
We extend the theory of low-rank matrix recovery and completion to the case when Poisson observations for a linear combination or a subset of the entries of a matrix are available, which arises in various applications with count data. We…
Chernoff bounds are a powerful application of the Markov inequality to produce strong bounds on the tails of probability distributions. They are often used to bound the tail probabilities of sums of Poisson trials, or in regression to…
We extend the concept of Krylov complexity to include general unitary evolutions involving multiple generators. This generalization enables us to formulate a framework for generalized Krylov complexity, which serves as a measure of the…
The article is devoted to the study of mappings that distort the modulus of families of paths by the Poletsky inequality type. At boundary points of a domain, we have obtained the H\"{o}lder inequality for such mappings, provided that their…