11 citations · 21 across the 9 of their papers we have counts for
9 papers
Positive Moments Forever: Undecidable and Decidable Cases
Gemma De les Coves, Joshua Graf, Andreas Klingler +1
We investigate the generalized moment membership problem for matrices, a formulation equivalent to Skolem's problem for linear recurrence sequences. We show decidability for orthog…
Homotopy Methods for Convex Optimization
Andreas Klingler, Tim Netzer
Convex optimization encompasses a wide range of optimization problems that contain many efficiently solvable subclasses. Interior point methods are currently the state-of-the-art a…
Border Ranks of Positive and Invariant Tensor Decompositions: Applications to Correlations
Andreas Klingler, Tim Netzer, Gemma De les Coves
The matrix rank and its positive versions are robust for small approximations, i.e. they do not decrease under small perturbations. In contrast, the multipartite tensor rank can co…
Many bounded versions of undecidable problems are NP-hard
Andreas Klingler, Mirte van der Eyden, Sebastian Stengele +2
Several physically inspired problems have been proven undecidable; examples are the spectral gap problem and the membership problem for quantum correlations. Most of these results…
The d-separation criterion in Categorical Probability
Tobias Fritz, Andreas Klingler
The d-separation criterion detects the compatibility of a joint probability distribution with a directed acyclic graph through certain conditional independences. In this work, we s…
Polynomial decompositions with invariance and positivity inspired by tensors
Gemma De las Cuevas, Andreas Klingler, Tim Netzer
We present a framework to decompose real multivariate polynomials while preserving invariance and positivity. This framework has been recently introduced for tensor decompositions,…
Approximate Pythagoras Numbers on -algebras over
Paria Abbasi, Sander Gribling, Andreas Klingler +1
The Pythagoras number of a sum of squares is the shortest length among its sums of squares representations. In many algebras, for example real polynomial algebras in two or more va…
Approximate Completely Positive Semidefinite Factorizations and their Ranks
Paria Abbasi, Andreas Klingler, Tim Netzer
In this paper we show the existence of approximate completely positive semidefinite (cpsd) factorizations with a cpsd-rank bounded above (almost) independently from the cpsd-rank o…
Approximate tensor decompositions: disappearance of many separations
Gemma De las Cuevas, Andreas Klingler, Tim Netzer
It is well-known that tensor decompositions show separations, that is, that constraints on local terms (such as positivity) may entail an arbitrarily high cost in their representat…