Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Machine Learning

886 missions · 536 completed

The science of systems that learn from data and experience. Its scope runs from the statistical and mathematical foundations of learning, including generalization, expressivity, and computational limits, through the design of learning algorithms, deep learning, reinforcement learning, and probabilistic methods, to the empirical study of large models and the trustworthiness, interpretability, and societal impact of learned systems.

Missions

Open350Completed536All886
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Logarithmic Regret Algorithms for Online Convex Optimization 4: Logarithmic Regret of Exponentially Weighted Online OptimizationResearch Paper

In online convex optimization a player repeatedly chooses a point xtx_txt​ from a convex set P⊆RnP \subseteq \mathbb{R}^nP⊆Rn, after which an adversary reveals a convex cost function ftf_tft​ and the player pays ft(xt)f_t(x_t)ft​(xt​). The player's regret after TTT rounds is its total cost minus the cost of the best fixed point in hindsight. The model covers online portfolio selection,…

9 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Logarithmic Regret Algorithms for Online Convex Optimization 3: Logarithmic Regret of Follow the Approximate LeaderResearch Paper

Online convex optimization models repeated decision making against an adversary: in each round a player chooses a point of a convex set, and only then learns the convex cost of that round. It covers online portfolio selection, online regression and routing, and it is the standard lens for analysing learning algorithms that must commit before seeing data.…

9 thms3 active usersReviewed
🏆Completed
ProbabilityStatistics·Captain: mikedeng1

The Optimal Sample Complexity of PAC Learning: The Optimal Realizable Sample Complexity BoundResearch Paper

The sample complexity of a learning problem is the number of labelled examples needed to learn to a prescribed accuracy with a prescribed confidence. In Valiant's probably approximately correct (PAC) model it is the basic quantity of statistical learning theory: it says how much data is necessary and sufficient, as a function of the complexity of the…

12 thms3 active usersReviewed
🏆Completed
CombinatoricsProbability·Captain: naimengye

Understanding Machine Learning XXI: Covering NumbersTextbook

Chapter 26 bounded the rate of uniform convergence by the Rademacher complexity; Chapter 27 of Shalev-Shwartz and Ben-David, Understanding Machine Learning: From Theory to Algorithms (doi:10.1017/CBO9781107298019), introduces a second, metric measure of the size of a set of vectors, its covering numbers N(r,A)N(r, A)N(r,A), the smallest number of Euclidean balls of…

7 thms3 active usersReviewed
🏆Completed
ProbabilityStatistics·Captain: naimengye

Understanding Machine Learning XIX: Generative ModelsTextbook

The book is discriminative almost throughout: it learns predictors, not distributions, following Vapnik's advice not to solve a more general problem as an intermediate step. Chapter 24 of Shalev-Shwartz and Ben-David, Understanding Machine Learning: From Theory to Algorithms (doi:10.1017/CBO9781107298019), presents the generative alternative: assume a…

11 thms3 active usersReviewed
🏆Completed
OptimizationProbability·Captain: naimengye

Understanding Machine Learning XVIII: Dimensionality ReductionTextbook

Dimensionality reduction maps data in Rd\mathbb{R}^dRd to Rn\mathbb{R}^nRn, n≪dn \ll dn≪d, by a linear map x↦Wxx \mapsto Wxx↦Wx, for computational reasons, for generalization (Chapter 19's curse of dimensionality) and for interpretability. Chapter 23 of Shalev-Shwartz and Ben-David, Understanding Machine Learning: From Theory to Algorithms (doi:10.1017/CBO9781107298019), studies…

7 thms3 active usersReviewed
🏆Completed
CombinatoricsOptimization·Captain: naimengye

Understanding Machine Learning XVII: ClusteringTextbook

Clustering is the most widely used tool of exploratory data analysis and, at the same time, the least well defined: similar points should share a cluster and dissimilar points should not, but similarity is not transitive while cluster membership is, and without labels there is no ground truth against which to evaluate a proposed grouping. Chapter 22 of…

7 thms3 active usersReviewed
🏆Completed
Probability·Captain: LG

Les Houches Lectures on Deep Learning at Large & Infinite Width III: Input–Output Jacobian of Random ReLU NetworksTextbook

Lecture 5 of the Les Houches lectures on deep learning at large and infinite width (arXiv:2309.01592, Section 5, lectures by B. Hanin) shows that a random ReLU network evaluated at a single input can be solved exactly. The statistics of the network depend on depth LLL and width nnn through the inverse temperature β=5∑ℓ=1L1/nℓ≈5L/n\beta = 5\sum_{\ell=1}^{L} 1/n_\ell \approx 5L/nβ=5∑ℓ=1L​1/nℓ​≈5L/n.…

7 thms3 active usersReviewed
🏆Completed
Probability·Captain: LG

Les Houches Lectures on Deep Learning at Large & Infinite Width II: Finite-Width Four-Point Function RecursionTextbook

At infinite width a randomly initialized network is a Gaussian process (Mission I of this series). Real networks have finite width nnn, and the leading departure from Gaussianity is measured by the connected four-point function κ4\kappa_4κ4​. It captures both correlations between neurons and non-Gaussian fluctuations. Lecture 4 of the Les Houches lectures (arXiv:23…

7 thms3 active usersReviewed
🏆Completed
Probability·Captain: LG

Les Houches Lectures on Deep Learning at Large & Infinite Width I: Gaussian-Process Limit of Wide Networks and Wick's TheoremTextbook

A fully connected neural network with random Gaussian weights defines a random function of its input. Lecture 1 of the Les Houches lectures on deep learning at large and infinite width (arXiv:2309.01592, lectures by Y. Bahri) explains that, when the hidden layers become infinitely wide, this random function becomes a Gaussian process (the "neural network…

9 thms3 active usersReviewed
🏆Completed
CombinatoricsProbabilityStatistics·Captain: naimengye

An Introduction to Computational Learning Theory V: Classification Noise and Statistical QueriesTextbook

Chapter 5 of Kearns and Vazirani, An Introduction to Computational Learning Theory (MIT Press, 1994, doi:10.7551/mitpress/3897.001.0001), asks what happens to PAC learning when the labels are unreliable. In the classification noise model of Angluin and Laird, each label returned by the oracle is flipped independently with a fixed probability η<1/2\eta < 1/2η<1/2. The…

7 thms3 active usersReviewed
🏆Completed
CombinatoricsProbabilityStatistics·Captain: naimengye

An Introduction to Computational Learning Theory IV: Weak and Strong Learning, Boosting and Chernoff BoundsTextbook

Chapter 4 of Kearns and Vazirani, An Introduction to Computational Learning Theory (MIT Press, 1994, doi:10.7551/mitpress/3897.001.0001), asks whether the PAC model's demand for arbitrarily small error and confidence is essential. A weak learning algorithm need only, with some fixed positive probability, output a hypothesis that beats random guessing by a…

7 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryBandit AlgorithmsOperations Research+1·Captain: naimengye

Introduction to Multi-Armed Bandits XI: Bandits and Agents, Incentivized Exploration via Hidden ExplorationTextbook

A recommendation system learns from the users it serves: the diner who tries a restaurant produces the review the next diner reads. Each user would rather exploit what is already known than explore for the benefit of those who come later, so a population of self-interested agents under-explores, and an alternative that looks bad on sparse early evidence may…

10 thms3 active usersReviewed
🏆Completed
Operations ResearchProbabilityStatistics+1·Captain: mikedeng1

Foundations of Machine Learning XIV: Finite Markov Decision Processes and Bellman's EquationsTextbook

Reinforcement learning formalizes a scenario supervised learning cannot: an agent that actively interacts with an environment, choosing actions that change both the state it observes next and the reward it receives, rather than passively receiving an i.i.d. labeled sample. Every practical treatment of this scenario — from classical dynamic programming to…

13 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

First-Order and Stochastic Optimization Methods for Machine Learning I: The Separation Theorem, Strong Duality and the KKT ConditionsTextbook

Every convex optimization algorithm in machine learning — from projected gradient descent to support vector machines to the mirror-descent methods of later chapters of this book — is justified by a small set of optimality certificates: a checkable condition on a candidate solution that guarantees it actually solves the problem, without searching the whole…

11 thms3 active users
🏆Completed
ProbabilityRandom Matrix TheoryStatistics·Captain: mikedeng1

High-Dimensional Probability XI: Dvoretzky-Milman's TheoremTextbook

A striking fact discovered by Dvoretzky in the 1960s (conjectured by Grothendieck, and sharpened into its modern quantitative form by Milman in 1971) is that every high-dimensional convex body, however irregular, contains a round slice: a random low-dimensional section (or projection) of any bounded convex set in Rn\mathbb R^nRn is, with high probability, close…

9 thms3 active usersReviewed
🏆Completed
ProbabilityStatistics·Captain: mikedeng1

Support Vector Machines V: Bernstein's Inequality for Independent Hilbert-Space-Valued Random VariablesTextbook

Every statistical guarantee for a learning algorithm ultimately rests on a concentration inequality: a bound on how far an empirical average can stray from its expectation. For real-valued averages, Bernstein's inequality (1924, refined through the 20th century) is the classical tool — sharper than Hoeffding's inequality whenever the summands' variance is…

5 thms3 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

Introduction to Online Convex Optimization V: RFTL and the Regret Bound of Follow-the-Regularized-LeaderTextbook

Online convex optimization (OCO) asks a learner to repeatedly pick a point in a convex set KKK, pay a cost that an adversary reveals only after the choice is made, and be judged against the best fixed point in hindsight. Chapter III of this series formalized the simplest general-purpose answer, online gradient descent (OGD): take a gradient step, project back…

6 thms3 active users
🏆Completed
Bandit AlgorithmsOperations Research·Captain: Shuze Chen

Bandit Algorithms I: Concentration of MeasureTextbook

How quickly does the empirical mean of independent random variables concentrate around the true mean? This question is the analytic engine of the entire theory of stochastic bandits: every optimistic algorithm (Explore-Then-Commit, UCB and its relatives) is calibrated by a tail bound on the sample mean. This mission formalizes the subgaussian framework of…

2 thms3 active usersReviewed
🏆Completed
Combinatorics·Captain: mikedeng1

The Optimal Sample Complexity of Multiclass and List LearningResearch Paper

In multiclass classification, a prediction rule assigns one label to each data point, and the set of possible labels may be infinite. Learning theory asks how much labeled data suffices to predict accurately on new points. The number of labels alone does not describe the difficulty of a hypothesis class. A useful complexity parameter must also distinguish…

12 thms2 active usersReviewed
🏆Completed
ProbabilityStatistics·Captain: Shuze Chen

The Higher-Order Identifiability Paradox: Learning and Certifying Hypergraph OrderResearch Paper

Predictors built on coarse views of a hypergraph — features that keep only interactions up to some order and discard the rest — are cheaper and more stable than full-order models, but discarding the higher-order part is safe only when that part carries little signal. Zhang, Yan, Qiao and Yu (The Higher-Order Identifiability Paradox: Learning and Certifying…

15 thms2 active usersReviewed
🏆Completed
ProbabilityStatistics·Captain: mikedeng1

Calibrated Multiaccuracy: Deterministic and Randomized Sample ComplexityResearch Paper

Multiaccuracy asks that a predictor's residuals be uncorrelated with every test in a fixed class: subpopulations or features that an auditor can compute should not reveal systematic over- or under-prediction. The condition was introduced by Hébert-Johnson, Kim, Reingold and Rothblum (2018) under the name multi-AE, alongside multicalibration. Calibration asks…

25 thms2 active usersReviewed
🏆Completed
Theoretical Computer Science·Captain: mikedeng1

Dense Language Generation Made Simple: Deterministic, Randomized, and Multi-Order AlgorithmsResearch Paper

Language generation in the limit asks whether a generator can eventually produce only new members of an unknown language after observing positive examples. This is a mathematical model of generation from examples; it imposes no computational resource bound. Eventual validity alone allows outputs to occupy a sparse part of the target. On the positive…

18 thms2 active usersReviewed
🏆Completed
Computational Complexity·Captain: mikedeng1

Depth Lower Bounds for ReLU Networks with Binary InputsResearch Paper

A ReLU network repeatedly forms affine combinations of available values and applies the function ReLU⁡(t)=max⁡(0,t)\operatorname{ReLU}(t)=\max(0,t)ReLU(t)=max(0,t). Its depth measures the number of computational layers, while its width measures the largest number of computed units in one layer. Researchers studying neural-network expressiveness ask how much width is needed when depth is…

10 thms2 active usersReviewed
🏆Completed
CombinatoricsModel Theory·Captain: mikedeng1

Encoding orders and trees in real-valued functionsResearch Paper

A bounded real-valued function can encode both branching choices and an ordered sequence of comparisons. Relating these two patterns matters in model theory, where the absence of long order patterns expresses stability, and in learning theory, where branching patterns measure sequential complexity. Conant and Terry study this relationship for functions…

16 thms2 active usersReviewed
PreviousPage 15 of 22Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me