Related papers: A new convergence proof for the higher-order power…
Low-rank tensor approximations have shown great potential for uncertainty quantification in high dimensions, for example, to build surrogate models that can be used to speed up large-scale inference problems (Eigel et al., Inverse Problems…
In this paper, we study the Kurdyka-{\L}ojasiewicz (KL) exponent, an important quantity for analyzing the convergence rate of first-order methods. Specifically, we develop various calculus rules to deduce the KL exponent of new (possibly…
The problem of symmetric rank-one approximation of symmetric tensors is important in Independent Components Analysis, also known as Blind Source Separation, as well as polynomial optimization. We analyze the symmetric rank-one approximation…
We consider relative error low rank approximation of $tensors$ with respect to the Frobenius norm: given an order-$q$ tensor $A \in \mathbb{R}^{\prod_{i=1}^q n_i}$, output a rank-$k$ tensor $B$ for which $\|A-B\|_F^2 \leq (1+\epsilon)$OPT,…
Currently, existing tensor recovery methods fail to recognize the impact of tensor scale variations on their structural characteristics. Furthermore, existing studies face prohibitive computational costs when dealing with large-scale…
We investigate whether eigenvectors, also known as critical rank-one approximations, of a symmetric tensor can be used to increase or decrease its Waring rank. First, we study the variety of degree-d rank-r forms which admit an eigenvector…
Source conditions of the type $x^\dag \in\mathcal{R}((A^\ast A)^\mu)$ are an important tool in the theory of inverse problems to show convergence rates of regularized solutions as the noise in the data goes to zero. Unfortunately, it is…
We prove a general finite convergence theorem for "upward-guarded" fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual…
We consider factoring low-rank tensors in the presence of outlying slabs. This problem is important in practice, because data collected in many real-world applications, such as speech, fluorescence, and some social network data, fit this…
This paper can be seen as an attempt of rethinking the {\em Extra-Gradient Philosophy} for solving Variational Inequality Problems. We show that the properly defined {\em Reduced Gradients} can be used instead for finding approximate…
We prove the closedness theorem over Henselian valued fields, which was established over rank one valued fields in one of our recent papers. In the proof, as before, we use the local behaviour of definable functions of one variable and the…
We introduce a new consistency-based approach for defining and solving nonnegative/positive matrix and tensor completion problems. The novelty of the framework is that instead of artificially making the problem well-posed in the form of an…
We consider a hierarchy of upper approximations for the minimization of a polynomial $f$ over a compact set $K \subseteq \mathbb{R}^n$ proposed recently by Lasserre (arXiv:1907.097784, 2019). This hierarchy relies on using the push-forward…
In this paper, we propose a Jacobi-type algorithm to solve the low rank orthogonal approximation problem of symmetric tensors. This algorithm includes as a special case the well-known Jacobi CoM2 algorithm for the approximate orthogonal…
Resummation methods using continued functions are implemented to converge divergent series appearing in perturbation problems related to continuous phase transitions in field theories. In some cases, better convergence properties are…
To describe the transverse momentum spectrum of heavy color-singlet production, the joint resummation of threshold and transverse momentum logarithms is investigated. We obtain factorization theorems for various kinematic regimes valid to…
In this paper, we discuss the acceleration of the regularized alternating least square (RALS) algorithm for tensor approximation. We propose a fast iterative method using a Aitken-Stefensen like updates for the regularized algorithm.…
We propose a novel proof technique that can be applied to attack a broad class of problems in computational complexity, when switching the order of universal and existential quantifiers is helpful. Our approach combines the standard min-max…
This paper shows that error bounds can be used as effective tools for deriving complexity results for first-order descent methods in convex minimization. In a first stage, this objective led us to revisit the interplay between error bounds…
The paper aims at analyzing the least squares ranking method for generalized tournaments with possible missing and multiple paired comparisons. The bilateral relationships may reflect the outcomes of a sport competition, product…