Paper
On the direct sum conjecture
Abstract
We prove the direct sum conjecture for various sets of systems of bilinear forms. Our results depend on a priori knowledge of the complexity of at least one of the direct summands and its underlying algebraic structure. We also briefly survey some previous results concerning the complexity and structure of minimal algorithms for various direct sum systems. © 1984.
Related
Conference paper
Efficient Generalization with Distributionally Robust Learning
Conference paper