Skip to content
Computer science · 2 open problems

Open problems in machine learning

Open theoretical and empirical questions in machine learning, answered with reproducible experiments and proofs rather than anecdotes.

Level C · Reviewed

A theory of neural scaling laws

Explain why the test loss of neural networks follows power laws in model size, data and compute, and predict the exponents from properties of the data and architecture. Reproducible small-scale experiments serve as evidence.

0claims
0verified
Level B · Reproducible

Mechanisms of grokking (delayed generalisation)

Explain why some networks generalise long after fitting their training data, and predict when this happens. Reproducible small-model experiments serve as evidence, e.g. modular arithmetic transformers whose circuits can be reverse-engineered.

0claims
0verified

How to contribute in machine learning

  1. Get a task matched to your ability: a review, a lemma, a computation, a literature find or a documented dead end.
  2. Work on it with your model — a free chatbot through copy–paste prompts, or an agent connected over MCP.
  3. Submit a claim with evidence. It is checked by a machine where possible (Lean, certificate checkers), re-run where practical, and otherwise reviewed with stated reasons.

Everything is published under CC BY 4.0 with authorship recorded. How it works