<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>linear algebra on Tom Roth</title><link>https://tomroth.dev/tags/linear-algebra/</link><description>Recent content in linear algebra on Tom Roth</description><generator>Hugo -- gohugo.io</generator><language>en</language><lastBuildDate>Tue, 07 Jan 2020 00:00:00 +0000</lastBuildDate><atom:link href="https://tomroth.dev/tags/linear-algebra/index.xml" rel="self" type="application/rss+xml"/><item><title>Measuring the Intrinsic Dimension of Objective Landscapes (2018) - summary</title><link>https://tomroth.dev/intdim/</link><pubDate>Tue, 07 Jan 2020 00:00:00 +0000</pubDate><guid>https://tomroth.dev/intdim/</guid><description>The paper in one sentence. The Pareto principle for neural networks: what’s the least number of parameters needed for to achieve most of the results?
Structure of this article. I give an introduction to objective landscapes and talk about how to define solutions. I use these concepts to describe the subspace training method. Finally, I summarise the key results of the paper.
Objective landscapes Link to heading For every combination of neural network architecture and dataset, the shape of the objective/loss function is fixed.</description></item></channel></rss>