<title>optimization on Kyle Roth</title>

<description>Recent content in optimization on Kyle Roth</description>

<generator>Hugo -- gohugo.io</generator>

<atom:link href="https://kylrth.com/tags/optimization/index.xml" rel="self" type="application/rss+xml"/>

<item>

<title>Parallel training of deep networks with local updates</title>

<guid>https://kylrth.com/paper/parallel-training-with-local-updates/</guid>

<description>This post was created as an assignment in Irina Rish’s neural scaling laws course (IFT6167) in winter 2022. The post contains no summarization, only questions and thoughts. Once I learned how the loss functions worked for each chunk, my first question was whether the earlier chunks were going to be able to learn the low-level features that later chunks would need. Figure 7 seems to show that they do, although their quality apparently decreases with increasingly local updates.</description>

...

</item>

<item>

<title>SpanBERT: improving pre-training by representing and predicting spans</title>

<guid>https://kylrth.com/paper/spanbert/</guid>

<description>BERT optimizes the Masked Language Model (MLM) objective by masking word pieces uniformly at random in its training data and attempting to predict the masked values. With SpanBERT, spans of tokens are masked and the model is expected to predict the text in the spans from the representations of the words on the boundary. Span lengths follow a geometric distribution, and span start points are uniformly random. To predict each individual masked token, a two-layer feedforward network was provided with the boundary token representations plus the position embedding of the target token, and the output vector representation was used to predict the masked token and compute cross-entropy loss exactly as in standard MLM.</description>

...

</item>

<item>

<title>Overcoming catastrophic forgetting in neural networks</title>

<guid>https://kylrth.com/paper/overcoming-catastrophic-forgetting/</guid>

<description>In the paper they use Bayes’ rule to show that the contribution of the first of two tasks is contained in the posterior distribution of model parameters over the first dataset. This is important because it means we can estimate that posterior to try to get a sense for which model parameters were most important for that first task. In this paper, they perform that estimation using a multivariate Gaussian distribution.</description>

...

</item>

<item>

<title>A disciplined approach to neural network hyperparameters: part 1</title>

<guid>https://kylrth.com/paper/disciplined-approach-to-hyperparameters/</guid>

<description>The goal of hyperparameter tuning is to reach the point where test loss is horizontal on the graph over model complexity. Underfitting can be observed with a small learning rate, simple architecture, or complex data distribution. You can observe underfitting decrease by seeing more drastic results at the outset, followed by a more horizontal line further into training. You can use the LR range test to find a good learning rate range, and then use a cyclical learning rate to move up and down within that range.</description>

...

</item>

<item>

<title>Forward and reverse gradient-based hyperparameter optimization</title>

<guid>https://kylrth.com/paper/gradient-based-hyperparameter-optimization/</guid>

<description>In the area of hyperparameter optimization (HO), the goal is to optimize a response function of the hyperparameters. The response function is usually the average loss on a validation set. Gradient-based HO refers to iteratively finding the optimal hyperparameters using gradient updates, just as we do with neural network training itself. The gradient of the response function with respect to the hyperparameters is called the hypergradient. One of the great things about this work is that their framework allows for all kinds of hyperparameters.</description>

...

</item>

...