2/2 "We're used to making guarantees to within the limits of the assumptions of [our] models...How do we now think about using these state-of-the-art techniques in safety critical control?." Claire Tomlin at the Simons Institute's workshop on Theoretical Aspects of Trustworthy AI.

2/2 Multiplying 2 n x n matrices requires O(n^w) arithmetic operations, where w=3 for the brute force algorithm. Strassen's method was the first big improvement in '69 (w=2.81), followed by two big jumps in the '80s. The world record today is w=2.3714. simons.berkeley.edu/talks/virgin...

Also joining the consortium are Imperial College London, Institute for Advanced Study, Institut des Hautes Études Scientifiques (IHES), and Tata Institute of Fundamental Research (TIFR).

2/2 There are matrix multiplication algorithms that can do better than Strassen's but only for astronomically large matrices, making them impractical, said Oded Schwartz at the Simons Institute's workshop on Complexity and Linear Algebra Boot Camp. Video: simons.berkeley.edu/talks/oded-s...

2/2 For multiplying two n x n matrices, the arithmetic complexity of the standard method is of O(n^3); Strassen's method is of O(n^2.81). Prof. Olga Holtz spoke at the Simons Institute's workshop on Complexity and Linear Algebra Boot Camp. Video: simons.berkeley.edu/talks/olga-h...

2/2 One example showed a 1556x smaller carbon footprint using a better model, GPU, data center PUE and site, said UC Berkeley's David Patterson at the Simons Institute’s workshop on Algorithmic Foundations for Emerging Computing Technologies Boot Camp. simons.berkeley.edu/talks/david-...