2 citations · 3 across the 4 of their papers we have counts for
6 papers
Going deep, reaching further: What can Boltzmann machines efficiently represent?
Tobias Reinhart, Gemma De les Coves
While universal approximation theorems theoretically underpin the representation capabilities of machine learning models, they have two shortcomings: They do not focus on efficient…
The Structure of Emulations in Classical Spin Models: Modularity and Universality
Tobias Reinhart, Benjamin Engel, Gemma De les Coves
The theory of spin models intersects with condensed matter physics, complex systems, graph theory, combinatorial optimization, computational complexity and neural networks. Many en…
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…
Beyond Operator Systems
Gemma De les Coves, Mirte van der Eyden, Tim Netzer
Operator systems connect operator algebra, free semialgebraic geometry and quantum information theory. In this work we generalize operator systems and many of their theorems. While…
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…
The grammar of the Ising model: A new complexity hierarchy
Tobias Reinhart, Gemma De les Coves
How complex is an Ising model? Usually, this is measured by the computational complexity of its ground state energy problem. Yet, this complexity measure only distinguishes between…