Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Probability

2,744 missions · 1,569 completed

Missions

Open1175Completed1569All2744
🏆Completed
Machine Learning·Captain: LG

The Principles of Deep Learning Theory II: Deep Linear Networks at InitializationTextbook

Chapter 3 of The Principles of Deep Learning Theory by D. A. Roberts and S. Yaida (arXiv:2106.10165) is the book's first complete example of its effective-theory method. For deep linear networks at initialization, the two- and four-point correlators of the network outputs can be computed exactly at any width and depth. The resulting formulas exhibit, in the…

11 thms2 active usersReviewed
🏆Completed
Machine Learning·Captain: LG

The Principles of Deep Learning Theory III: Preactivation Statistics in the First Two LayersTextbook

Chapter 4 of The Principles of Deep Learning Theory by D. A. Roberts and S. Yaida (arXiv:2106.10165) begins the analysis of general multilayer perceptrons (MLPs) with a nonlinear activation function σ\sigmaσ at initialization. The first layer is exactly Gaussian; the second layer is the first place where non-Gaussianity appears, as a connected four-point…

12 thms2 active usersReviewed
🏆Completed
Machine LearningOptimization·Captain: naimengye

Understanding Machine Learning X: Gradient Descent, Subgradients and Stochastic Gradient DescentTextbook

Chapter 13 showed that convex-Lipschitz-bounded and convex-smooth-bounded problems are learnable by regularized loss minimization; Chapter 14 of Shalev-Shwartz and Ben-David, Understanding Machine Learning: From Theory to Algorithms (doi:10.1017/CBO9781107298019) shows how to learn them with the simplest possible algorithm. Gradient descent moves against…

12 thms2 active usersReviewed
🏆Completed
Machine LearningOptimizationStatistics·Captain: naimengye

Understanding Machine Learning IX: Convex Learning Problems, Regularization and StabilityTextbook

Chapters 12 and 13 of Shalev-Shwartz and Ben-David, Understanding Machine Learning: From Theory to Algorithms (doi:10.1017/CBO9781107298019) leave binary classification for the general framework in which a hypothesis is a vector w∈Rdw \in \mathbb{R}^dw∈Rd and the loss ℓ(w,z)\ell(w, z)ℓ(w,z) is a convex function of www. Convexity makes the ERM problem tractable (Lemma 12.11), but…

13 thms2 active usersReviewed
🏆Completed
AnalysisMachine LearningTheoretical Computer Science·Captain: MiltMont

Flow Matching Theorem 1: Marginal Continuity EquationResearch Paper

Flow matching models a changing probability distribution using a time-dependent velocity field. A conditional model specifies a density and a velocity separately for each conditioning point. The mathematical question is whether those conditional descriptions determine a velocity for the mixture distribution. This mission concerns the continuity-equation…

6 thms2 active usersReviewed
🏆Completed
Machine LearningStatistics·Captain: naimengye

Understanding Machine Learning V: Nonuniform Learnability, Structural Risk Minimization and Minimum Description LengthTextbook

The fundamental theorem of Mission IV says that a class of binary classifiers is PAC learnable exactly when its VC-dimension is finite. That leaves out classes one would like to learn, such as all polynomial classifiers over the line, whose VC-dimension is infinite although each degree separately is learnable. Chapter 7 of Shalev-Shwartz and Ben-David, Under…

12 thms2 active usersReviewed
🏆Completed
Machine LearningStatistics·Captain: naimengye

Understanding Machine Learning III: The No-Free-Lunch TheoremTextbook

Missions I and II of this series showed that finite hypothesis classes are learnable, with and without the realizability assumption, by empirical risk minimization. Chapter 5 of Shalev-Shwartz and Ben-David, Understanding Machine Learning: From Theory to Algorithms (doi:10.1017/CBO9781107298019) asks the converse question: is prior knowledge, in the form of…

5 thms2 active usersReviewed
🏆Completed
Machine LearningStatistics·Captain: naimengye

Understanding Machine Learning II: Learning via Uniform ConvergenceTextbook

Mission I of this series set up the statistical learning framework of Shalev-Shwartz and Ben-David, Understanding Machine Learning: From Theory to Algorithms (doi:10.1017/CBO9781107298019) and proved, in the book's Chapters 2 and 3, that finite classes are PAC learnable under the realizability assumption. Chapter 4 removes that assumption. Its idea is the…

5 thms2 active usersReviewed
🏆Completed
Machine LearningStatistics·Captain: naimengye

Understanding Machine Learning I: The Statistical Learning Framework, ERM and Finite ClassesTextbook

Chapters 2 and 3 of Shalev-Shwartz and Ben-David, Understanding Machine Learning: From Theory to Algorithms (Cambridge University Press, 2014, doi:10.1017/CBO9781107298019), set up the framework in which the whole book asks what learning is. A learner sees a sample drawn independently from an unknown distribution over examples, chooses a hypothesis from a…

3 thms2 active usersReviewed
🏆Completed
CombinatoricsMachine LearningStatistics·Captain: naimengye

An Introduction to Computational Learning Theory II: Occam's Razor, Set Cover and Decision ListsTextbook

Chapter 2 of Kearns and Vazirani, An Introduction to Computational Learning Theory (MIT Press, 1994, doi:10.7551/mitpress/3897.001.0001), gives a formal justification of Occam's Razor inside the PAC model. An Occam algorithm is judged not by the predictive power of its hypothesis but by how succinctly the hypothesis explains the sample before it: it must be…

7 thms2 active usersReviewed
🏆Completed
CombinatoricsMachine LearningStatistics·Captain: naimengye

An Introduction to Computational Learning Theory I: The PAC Model, Conjunctions, Rectangles and 3-CNFTextbook

Chapter 1 of Kearns and Vazirani, An Introduction to Computational Learning Theory (MIT Press, 1994, doi:10.7551/mitpress/3897.001.0001), introduces Valiant's Probably Approximately Correct model, the framework for the whole book. A learner sees labeled examples of an unknown target concept drawn from an unknown but fixed distribution, and must output a…

4 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: naimengye

Inventory Control VI: Optimality of (R, Q) Policies When Ordering in BatchesTextbook

Every model in Chapters 5 and 6 of Axsäter's Inventory Control assumes at the outset that the ordering policy is of (R,Q)(R,Q)(R,Q) or (s,S)(s,S)(s,S) type. Section 6.2 asks whether better policies exist and answers, for the case in which there are no ordering costs but every order must be a multiple of a fixed batch quantity QQQ, that none do: Proposition 6.1, "an (R,Q)(R,Q)(R,Q) policy…

10 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: naimengye

Inventory Control V: Joint Optimization of Reorder Point and Batch QuantityTextbook

An (R,Q)(R,Q)(R,Q) policy has two parameters. Chapter 4 of Axsäter's Inventory Control chooses the batch quantity QQQ from a deterministic model, and Chapter 5 chooses the reorder point RRR from a stochastic one with QQQ held fixed; the book presents this two-step practice as an adequate approximation. Section 6.1 asks what is lost by it and shows how to optimize both…

9 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: naimengye

Inventory Control IV: Reorder Points under Normally Distributed DemandTextbook

Chapter 4 of Axsäter's Inventory Control fixes the batch quantity QQQ from a deterministic model, and Chapter 5 asks the question that deterministic models cannot answer: with demand random and a replenishment lead-time LLL, when should the next batch be ordered? Under a continuous review (R,Q)(R,Q)(R,Q) policy the answer is a single number, the reorder point RRR, and…

16 thms2 active usersReviewed
🏆Completed
Functional Analysis·Captain: mikedeng1

Markov Processes: Characterization and Convergence 19: Countable exclusion systemsTextbook

An exclusion system models particles moving among sites under the rule that each site is either vacant or occupied. A move exchanges the occupation variables at two sites, so particle number is conserved. On a countably infinite site set, however, the formal sum of all possible exchanges need not automatically determine a well-defined Markov evolution.…

9 thms2 active usersReviewed
🏆Completed
Functional Analysis·Captain: mikedeng1

Markov Processes: Characterization and Convergence 01: Contraction semigroup generationTextbook

Continuous-time Markov processes are often studied through operators that describe how observables evolve. The generation question asks when an operator specified on a domain actually determines a strongly continuous family of contractions. Ethier and Kurtz place this question at the start of Markov Processes: Characterization and Convergence because the…

6 thms2 active usersReviewed
🏆Completed
Machine LearningStatisticsTheoretical Computer Science·Captain: mikedeng1

Foundations of Machine Learning XIII: The Johnson-Lindenstrauss LemmaTextbook

High-dimensional data is often computationally expensive to work with and hard to visualize. The Johnson-Lindenstrauss lemma answers a striking question in this setting: can any finite set of points, no matter how high-dimensional the ambient space, be squeezed into a space of dimension depending only on the number of points (logarithmically) and the…

6 thms2 active usersReviewed
🏆Completed
Machine LearningStatistics·Captain: mikedeng1

Support Vector Machines VII: Consistency of Support Vector Machines for RegressionTextbook

Chapter 9 asks whether the support vector machine — a regularized empirical risk minimizer fD,λf_{D,\lambda}fD,λ​ over an RKHS HHH — is a statistically consistent estimator for regression: does RL,P(fD,λn)→RL,P∗R_{L,P}(f_{D,\lambda_n}) \to R^*_{L,P}RL,P​(fD,λn​​)→RL,P∗​ as the sample size n→∞n \to \inftyn→∞, for a suitable regularization schedule λn→0\lambda_n \to 0λn​→0? The chapter's main theorem (Theorem 9.1) answers…

4 thms2 active usersReviewed
🏆Completed
Operations ResearchStochastic Systems·Captain: mikedeng1

Stochastic Orders VIII: Closure of the Convexity Orders Under Random SumsTextbook

Chapters III and IV formalize what it means for one random variable to be "more spread out" or "larger and more spread out" than another. Chapter VIII asks a different kind of question: if the number of terms in a sum of i.i.d. random variables is itself random, and one count is larger than another in one of these orders, does the resulting random sum…

4 thms2 active usersReviewed
🏆Completed
Machine LearningOptimizationRandom Matrix Theory+1·Captain: mikedeng1

High-Dimensional Probability X: Exact Sparse RecoveryTextbook

Compressed sensing asks a question that looks impossible at first: can a signal x∈Rnx\in\mathbb R^nx∈Rn be reconstructed exactly from far fewer than nnn linear measurements y=Ax∈Rmy=Ax\in\mathbb R^my=Ax∈Rm, m≪nm\ll nm≪n? Classical linear algebra says no — an underdetermined system has infinitely many solutions. But if xxx is known in advance to be sparse (most of its coordinates are…

5 thms2 active usersReviewed
🏆Completed
Machine LearningStatistics·Captain: mikedeng1

High-Dimensional Statistics IV: Dudley's Entropy Integral BoundTextbook

Many of the central questions of high-dimensional statistics reduce to bounding the expected supremum of a stochastic process: the maximum correlation of noise with a family of candidate signals, the operator norm of a random matrix, the uniform deviation of an empirical process from its mean. Whenever the index set of the process is infinite or…

9 thms2 active usersReviewed
🏆Completed
Machine LearningRandom Matrix TheoryStatistics·Captain: mikedeng1

High-Dimensional Probability VII: Slepian's Inequality for Gaussian ProcessesTextbook

A Gaussian process is a family (Xt)t∈T(X_t)_{t\in T}(Xt​)t∈T​ of jointly Gaussian real random variables indexed by an arbitrary set TTT — not necessarily time. The canonical example is Xt=⟨g,t⟩X_t = \langle g, t\rangleXt​=⟨g,t⟩ for ttt ranging over a subset T⊆RnT\subseteq\mathbb R^nT⊆Rn and ggg a standard Gaussian vector in Rn\mathbb R^nRn; this single family already encodes questions as varied as the…

11 thms2 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: mikedeng1

Introduction to Stochastic Programming IV: Nested Decomposition for Multistage ProgramsTextbook

Sequential planning problems — inventory replenishment, hydro-thermal power scheduling, asset-liability management — routinely span more than two decision epochs, with information about the future revealed gradually as each period unfolds. A two-stage recourse model (decide now, observe once, recourse once) is too coarse for these: it either collapses the…

6 thms2 active users
🏆Completed
Mathematical Physics·Captain: LG

Langevin Dynamics in a Harmonic Trap: the Mean-Squared Displacement EquationTextbook

A micron-sized bead suspended in water and held by an optical tweezer is one of the standard measuring instruments of soft-matter physics: the bead's fluctuating position reports on the viscosity of the medium, on the stiffness of the trap, and on the forces exerted by whatever is attached to the bead. The quantity that experiments record is the mean-squared…

8 thms2 active usersReviewed
🏆Completed
Mathematical Physics·Captain: lisamegawatts

Finite Reflection Positivity Methods II: Split-Gibbs Normalization and ClosureTextbook

Reflection positivity turns a factorized weight across a reflection plane into a positive-semidefinite kernel of observables. The first mission in this series certified that finite split-weight mechanism and its two-observable chessboard inequality. A physical finite-volume Gibbs model needs one more layer before it can consume those results: its…

12 thms2 active usersReviewed
PreviousPage 95 of 110Next

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