Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Probability

2,743 missions · 1,549 completed

Missions

Open1194Completed1549All2743
🏆Completed
Machine LearningStatistics·Captain: mikedeng1

Adversarially Robust Generalization Requires More Data 1: A Robust-Error Lower Bound in the Gaussian ModelResearch Paper

Classifiers trained to high standard accuracy on image benchmarks can be made to fail by perturbations of the input that are small in the ℓ∞\ell_\inftyℓ∞​ norm (Szegedy et al., 2014; Goodfellow et al., 2015). Adversarial training reaches high robust accuracy on the training set, but on CIFAR10 the robust accuracy on held-out data is much lower than on the…

8 thms4 active usersReviewed
Operations ResearchStatisticsStochastic Systems·Captain: mikedeng1

Weak Convergence and Optimal Scaling of Random Walk Metropolis Algorithms: Langevin Diffusion Limit of the First CoordinateResearch Paper

The random walk Metropolis algorithm is one of the most widely used Markov chain Monte Carlo methods for sampling from a density known up to a constant. Its one tuning parameter is the variance of the Gaussian proposal. If the variance is too small, the chain accepts almost every move but barely moves. If it is too large, it proposes long jumps that are…

15 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Advance Demand Information, Price Discrimination, and Preorder Strategies: When Preorder Profit Increases with Demand CorrelationResearch Paper

Firms that sell new products (consoles, books, films) often take preorders before release. A preorder serves two purposes at once. It lets the firm charge early adopters a different price from later buyers, a form of price discrimination, and the number of preorders is advance demand information: an early signal of how large regular-season demand will be.…

10 thms4 active usersReviewed
🏆Completed
Information TheoryOperations ResearchOptimization·Captain: mikedeng1

Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach 2: Closed Form of the Entropy-Constrained Worst-Case VaRResearch Paper

Value-at-Risk (VaR) is the loss level that a portfolio exceeds with probability at most ε\varepsilonε. It is the standard risk measure of banking regulation, and its classical computation assumes Gaussian returns: for a Gaussian return vector with mean x^\hat xx^ and covariance Γ\GammaΓ it equals −Φ−1(ε)w⊤Γw−x^⊤w-\Phi^{-1}(\varepsilon)\sqrt{w^\top\Gamma w} - \hat x^\top w−Φ−1(ε)w⊤Γw​−x^⊤w, where …

9 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryMachine LearningStatistics·Captain: mikedeng1

Calibrated Learning and Correlated Equilibrium III: A Randomized Forecast Calibrated against Every OpponentResearch Paper

A forecaster who announces "70% chance of rain" is calibrated if, among the days on which that number was announced, it rained on about 70% of them. Dawid (The well-calibrated Bayesian, JASA 1982) proposed calibration as the minimal requirement of an honest probability forecaster. Oakes (Self-calibrating priors do not exist, JASA 1985) showed that no…

10 thms4 active usersReviewed
🏆Completed
Operations ResearchTheoretical Computer Science·Captain: mikedeng1

Competitive Paging Algorithms I: The Marking Algorithm Is 2H_k-CompetitiveResearch Paper

Paging is the problem of managing a two-level memory: a fast cache holds kkk pages out of an address space of nnn pages, requests to pages arrive one at a time, and a request to a page outside the cache (a page fault) forces the algorithm to bring that page in and, when the cache is full, to evict another. The cost is the number of faults. An on-line algorithm…

10 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryMechanism DesignOperations Research·Captain: mikedeng1

Bargaining under Incomplete Information I: Class A Equilibrium Offer Strategies Satisfy the Linked Differential EquationsResearch Paper

A buyer and a seller negotiate over a single indivisible good. Each knows how much the good is worth to them, but not how much it is worth to the other side. Whether the two will trade, and at what price, then depends on how each party shades its offer to exploit the other's uncertainty. Chatterjee and Samuelson (Bargaining under Incomplete Information,…

9 thms4 active usersReviewed
🏆Completed
Machine LearningOptimizationStatistics·Captain: mikedeng1

Simultaneous Analysis of Lasso and Dantzig Selector V: Estimation, Prediction and Sparsity Bounds for the LassoResearch Paper

In a linear regression with many more candidate variables than observations, least squares is not defined uniquely and does not estimate anything useful. The Lasso (Tibshirani, 1996) replaces it by an ℓ1\ell_1ℓ1​-penalised least-squares problem, which is convex, can be solved at scale, and returns sparse coefficient vectors. The question that a statistician, a…

10 thms4 active usersReviewed
🏆Completed
Machine LearningOptimizationStatistics·Captain: mikedeng1

Simultaneous Analysis of Lasso and Dantzig Selector IV: Estimation and Prediction Error Bounds for the Dantzig SelectorResearch Paper

In high-dimensional linear regression the number of unknown coefficients MMM may be much larger than the number of observations nnn, and the coefficient vector can only be recovered because it is assumed to be sparse: few of its entries are non-zero. Two convex estimators dominate this setting: the Lasso of Tibshirani (1996), an ℓ1\ell_1ℓ1​-penalized least-squares…

10 thms4 active usersReviewed
🏆Completed
Machine LearningOptimizationStatistics·Captain: mikedeng1

Simultaneous Analysis of Lasso and Dantzig Selector II: Approximate Equivalence of the Lasso and Dantzig Prediction LossesResearch Paper

Two estimators dominate sparse high-dimensional regression, where the number MMM of candidate regressors can far exceed the sample size nnn. The Lasso (Tibshirani, 1996) minimises a least-squares criterion plus an ℓ1\ell_1ℓ1​ penalty. The Dantzig selector (Candès and Tao, 2007) minimises the ℓ1\ell_1ℓ1​ norm of the coefficients subject to a bound on the correlation…

9 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Subjectivity and Correlation in Randomized Strategies I: Subjective Mixed Equilibria of Two-Person Games Have Objective PayoffsResearch Paper

Classical non-cooperative game theory randomizes with objective, independent devices: each player spins a private wheel whose odds everyone agrees on. Aumann's 1974 paper (doi:10.1016/0304-4068(74)90037-8) asks what changes when the randomizing events are ordinary events of the world, about which players may hold different subjective probabilities and may…

9 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

On Properties of Stochastic Inventory Systems III: Bounds between the Optimal Costs of the Stochastic (Q, r) Model and the EOQ ModelResearch Paper

The continuous-review (Q,r)(Q, r)(Q,r) policy — order a fixed quantity QQQ whenever the inventory position falls to the reorder point rrr — is the textbook policy for a single item with random demand and a positive replenishment leadtime (Hadley and Whitin 1963). Its optimal parameters have no closed form, so practice routinely falls back on the deterministic economic…

15 thms4 active usersReviewed
Bandit AlgorithmsMachine LearningOperations Research·Captain: mikedeng1

Stochastic Linear Optimization under Bandit Feedback 1: The Regret Bound of ConfidenceBallResearch Paper

In stochastic linear optimization under bandit feedback a learner repeatedly chooses a decision xtx_txt​ from a fixed set D⊆RnD\subseteq\mathbb R^nD⊆Rn and observes only the noisy cost of that one decision, whose expectation is a fixed but unknown linear function μ⊤xt\mu^\top x_tμ⊤xt​. The model covers online routing, ad and product selection with feature vectors, and any…

24 thms4 active users
🏆Completed
CombinatoricsOperations ResearchOptimization+1·Captain: mikedeng1

Approximation Techniques for Average Completion Time Scheduling I: Best-α on One Machine with Release DatesResearch Paper

Minimizing the average completion time of jobs that arrive over time is one of the basic objectives of machine scheduling: it measures how long, on average, a job waits in the system. On a single machine with release dates and no preemption (written 1∣rj∣∑Cj1|r_j|\sum C_j1∣rj​∣∑Cj​), the problem is strongly NP-hard, so research has focused on approximation algorithms whose…

9 thms4 active usersReviewed
🏆Completed
Machine LearningStatistics·Captain: mikedeng1

The Power of Convex Relaxation: Near-Optimal Matrix Completion III: No Method Recovers Incoherent Rank-r Matrices below the Sampling Rate (I.20)Research Paper

Matrix completion asks to recover a matrix from a small random subset of its entries. It models collaborative filtering (a ratings table with most entries missing), sensor-network localisation from partial distance data, and system identification. With no structure the task is hopeless, so one assumes the matrix has low rank rrr and that its information is…

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

Understanding Machine Learning XXV: PAC-BayesTextbook

The MDL and Occam principles of Chapter 7 rank hypotheses by description length and pay for a hypothesis according to its rank. Chapter 31 of Shalev-Shwartz and Ben-David, Understanding Machine Learning: From Theory to Algorithms (doi:10.1017/CBO9781107298019), generalizes this to the PAC-Bayesian approach of McAllester: prior knowledge is a prior…

6 thms4 active usersReviewed
🏆Completed
Machine Learning·Captain: LG

The Principles of Deep Learning Theory I: Wick's Theorem for Gaussian IntegralsTextbook

The book The Principles of Deep Learning Theory by D. A. Roberts and S. Yaida (arXiv:2106.10165) develops a perturbative, physics-style theory of wide deep neural networks. Every later computation in the book, from the statistics of preactivations at initialization to the neural tangent kernel, reduces to Gaussian expectations of polynomials. The single…

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

An Introduction to Computational Learning Theory III: The Vapnik-Chervonenkis Dimension, ε-Nets and Sample ComplexityTextbook

Chapter 3 of Kearns and Vazirani, An Introduction to Computational Learning Theory (MIT Press, 1994, doi:10.7551/mitpress/3897.001.0001), asks how many random examples suffice to learn a concept from an infinite class. The cardinality bound of Occam's Razor is useless there, yet the rectangle game of Chapter 1 shows that some infinite classes are learnable…

8 thms4 active usersReviewed
🏆Completed
Bandit AlgorithmsOperations ResearchOptimization·Captain: naimengye

Multi-armed Bandit Allocation Indices I: The Gittins Index, Optimal Stopping and MonotonicityTextbook

A decision-maker has nnn projects, each a Markov reward process, and at every decision time may advance exactly one of them; the others stay frozen. Which project to advance so as to maximize the expected total discounted reward? Posed as a dynamic program the problem has a state space that is the product of the nnn state spaces, and the size of that product…

12 thms4 active usersReviewed
🏆Completed
Operations Research·Captain: naimengye

Fundamentals of Supply Chain Theory VII: Multiechelon Inventory ModelsTextbook

A serial supply chain is the simplest multiechelon system: a retailer orders from a warehouse, which orders from a plant, which orders from an outside supplier with unlimited stock. Only the retailer sees customer demand, only the retailer pays a stockout penalty, and every stage pays to hold inventory. Choosing how much each stage should hold looks like a…

11 thms4 active users
🏆Completed
Stochastic Systems·Captain: mikedeng1

Markov Processes: Characterization and Convergence VII: Strong approximation of independent sumsTextbook

A sum of independent random increments is a basic model for accumulated noise. A continuous Gaussian process offers a different description of that noise, one that can be studied at every nonnegative time. To compare their individual trajectories, both objects must live on the same probability space. The question is whether their paths can remain close over…

29 thms4 active usersReviewed
🏆Completed
Captain: mikedeng1

Markov Processes: Characterization and Convergence 12: Strong approximation of independent sumsTextbook

Independent sums are a basic model for accumulated random fluctuation. A central limit theorem describes their distribution at one large time, and a functional limit theorem describes weak convergence of a rescaled path. Strong approximation asks for substantially more: construct the sums and a Brownian motion on one probability space so that their paths…

29 thms4 active usersReviewed
🏆Completed
Machine LearningOperations ResearchOptimization·Captain: mikedeng1

Wasserstein Distributionally Robust Optimization IV: Regularization by Robustification in Classification and RegressionTextbook

Regularization — adding a penalty on model complexity to an empirical risk minimization objective — is one of the oldest and most reliably effective tools in statistical learning: ridge regression, LASSO, and margin-based support vector machines all fit this template. For decades the regularization weight and penalty function were chosen heuristically or by…

15 thms4 active users
🏆Completed
Operations ResearchStatisticsStochastic Systems·Captain: mikedeng1

Stochastic Orders I: The Usual Stochastic Order and Its Coupling CharacterizationTextbook

Operations research and applied probability are full of questions of the shape "is X riskier, larger, or later than Y?" when X and Y are random: two queueing disciplines' waiting times, two inventory policies' shortfall, two insurance portfolios' claim size. Comparing their means answers a weaker question than the modeler usually wants, since two…

13 thms4 active users
🏆Completed
Machine LearningStatisticsTheoretical Computer Science·Captain: mikedeng1

Foundations of Machine Learning XI: Maximum Entropy Models and DualityTextbook

Maximum entropy (Maxent) models are a widely used family of density-estimation algorithms: given a sample and a set of features, they select the distribution that matches the empirical feature averages while being otherwise as "agnostic" (close to a prior, usually uniform) as possible — a principle that, notably, never requires specifying a parametric…

15 thms4 active usersReviewed
PreviousPage 22 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