Old Problem About Mathematical Curves Falls to Young Couple
quantamagazine.org
quantamagazine.org
Here's a link to the pre-print: https://arxiv.org/abs/2201.09445
They defined every possible curve in infinite dimensions based on 5 characteristics, essentially drawing the problem from an infinite space to an abstracted 5 dimensional space. Think: all black holes can be defined, so far as we understand them today, in an abstracted 3 dimensional space, that is [mass, electric charge, angular momentum](i)
Then started proving the theorem for subsets of that 5-d space. Think: proving a theorem for infinitely many integers by first proving for 0, then all even integers, then all odd integers, then proving for a small handful of odd integers that your odd integer proof fail on, then proving that negatives can be modified to the positives you have already proved.
It's really great seeing this practical approach laid bare.
Also, at the bottom, the paper includes code for "Section 11: Most of the Sporadic Cases", so if you're unfamiliar with the math but are familiar with standard python then you both gain further understanding by seeing the code process, but also by comparing the code to the included corresponding, highlighted as comments, theoretical proofs' propositions.
For example, from the paper(ii):
def can_induct(d, g, r, l, m):
# Proposition 8.4
if d >= g + 2 * r - 1 and good(d - (r - 1), g, r, l, m):
return True
(i) https://en.wikipedia.org/wiki/No-hair_theoremIf we consider a specific example, say GPT-3 training, and look at a dataset as a collection of paths on a curve (in a word embeddings space, so perhaps it's a graph that could be interpolated into a curve), then the training is trying to map a bunch of these paths (word sequences) to a single downward path somewhere on the loss surface. Currently, this process is random - we randomly sample paths on the dataset graph, trying to build a path of small steps on the loss surface. But what if we could analyze the dataset as a whole, and extract some properties that would constrain the search in the parameter space? Or at least choose the training sequences more carefully to improve learning efficiency.
A more promising path is to regularize the loss function so that SGD can optimize it quickly, rather than switching to a second order method.
No. I'm asking for a new kind of math for ML, inspired by the paper in this post. I would like to treat a dataset as a curve, which maps to another curve (loss landscape), under the model architecture constraints, and then find the minima on that landscape in one shot. There might be some kind of interpolation possible which has nothing to do with SGD optimization (of any order).
When I learn something new, for example a difficult topic like functional programming, or signal processing, the process feels nothing like SGD. At first I gather some background information, motivation, goals, etc. Then I unpack the concept/formula, and try to understand how it works, how the pieces fit together. Could be bottom up, or top-down. The information is accumulated until it reaches critical mass, and then boom - I get it. That stage happens quickly, it's an "aha" moment. This learning process involves both statistical pattern matching, and some other mechanism, perhaps referring to a rule based system like a decision tree, or accessing some facts in my long term memory database. I have no idea how a brain does it, but clearly I don't need a thousand examples to get Fourier transform, or monads, or whatever it is I'm learning about. Often just one example is sufficient to form new patterns and rules in my mind. I'm guessing this is because we are not randomly probing the loss landscape in the dark. We might be interpolating it, filling in the blanks. I do, however, need a thousand examples/repetitions to learn a new motor skill, like playing tennis or a piano, or even learning a new language - training my ear for many hours until I start recognizing the right sound patterns, so there are types of learning I do which might be similar to SGD. But most mental concepts are not learned like that.
Not trying to argue, just to specify the type of result.
its a crab bucket situation
A STEM professor once told me he needed a Masters in math before they would let him in. They doubted an American with just an undergrad degree could handle the technical challenge. This was almost 2 decades ago, since then the gap may have widened a bit.
The EU has had the BMD reform in the past where education systems were standardized to a bachelor-master-doctorate three-party system.
To get to a PhD, you need first a bachelor (the name usually varies depending on the country, e.g., it is called a license in France), then a master.
That's the very common pipeline there. Doing a PhD without a master is a rare thing.