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
Markov ChainOperations ResearchStatistics·Captain: mikedeng1

Learning Markov Models Via Low-Rank Optimization: KL Error Bound for the Rank-Constrained Maximum Likelihood Estimator of a Low-Rank Markov ChainResearch Paper

Many systems studied in operations research and reinforcement learning are modelled as finite Markov chains with a large number of states ppp: the stops of a taxi in a city, a random walk on a network, the conformations of a molecule. Estimating the p×pp\times pp×p transition matrix from one observed trajectory needs, in general, a trajectory long compared with the …

13 thms2 active usersReviewed
🏆Completed
EconomicsOperations Research·Captain: mikedeng1

“Un”Fair Machine Learning Algorithms: With Endogenous Learning Effort, Equal Treatment Accepts a Larger Share of the Protected Group's Good Candidates than Equal Opportunity in a Risky MarketResearch Paper

Lenders, employers and insurers increasingly screen applicants with learned scores, and regulators and the fair machine learning literature ask that such screening be fair across demographic groups. Two notions are standard. Equal treatment (ET) asks that the same decision rule be applied to everyone, regardless of group; the paper notes that it is what the…

10 thms2 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Interpretable Optimal Stopping: For Trees of Bounded Depth, the Optimal SAA Value of Tree Policies Converges Almost Surely to the Optimal Tree-Policy ValueResearch Paper

Optimal stopping asks when to halt a stochastic process so as to maximize an expected reward. Examples are exercising an American option, selling an asset, or ending a clinical trial. The optimal policy is the solution of a dynamic program over the whole state space. In high dimension it cannot be computed exactly, and the usual approximations (regression…

9 thms2 active usersReviewed
Operations ResearchStatistics·Captain: mikedeng1

Minimax-Optimal Policy Learning Under Unobserved Confounding: Minimizing the Worst-Case Empirical Regret Attains the Population Minimax Regret up to an Explicit n^(-1/2) TermResearch Paper

Personalized decisions in medicine, marketing and public policy are increasingly learned from observational data: records of who received which treatment and how it turned out. Standard policy-learning methods assume unconfoundedness, that treatment assignment depends only on observed covariates. When an unobserved factor influences both the treatment and…

10 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations ResearchOptimization·Captain: mikedeng1

Optimal Decision Making Under Strategic Behavior 3: A Three-Value Instance with General Costs Where No Optimal Policy Is Outcome MonotonicResearch Paper

When a decision rule is announced in advance, people may change the features on which the rule acts. A lender, for example, may offer loans with different probabilities to applicants with different reported characteristics. An applicant then weighs the greater chance of receiving a loan against the cost of changing those characteristics. The decision maker…

7 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations ResearchOptimization·Captain: mikedeng1

Optimal Decision Making Under Strategic Behavior 1: Under Additive Outcome Monotonic Costs Some Outcome Monotonic Binary Policy Is OptimalResearch Paper

A lender or other decision maker may publish a rule that assigns a positive decision to an individual with some probability. Once the rule is visible, individuals can change the features on which it acts. The decision maker must therefore evaluate a rule under the distribution it induces after individuals respond, rather than only under the original…

6 thms2 active usersReviewed
ProbabilityStatistics·Captain: mikedeng1

A Robust Spectral Clustering Algorithm for Sub-Gaussian Mixture Models with Outliers 1: Robust-LP Inlier Error ≤ Cn²·max{exp(−Δ²min/64σ²max), log nmin/nmin} with Probability ≥ 1 − 2r/nminResearch Paper

Clustering points drawn from a mixture of well-separated distributions is a basic problem of unsupervised learning. Practical data sets also contain outliers, points that belong to no cluster and may be placed anywhere. Srivastava, Sarkar and Hanasusanto (arXiv:1912.07546v3; Operations Research 71(1), 2023) propose a robust spectral clustering algorithm. It…

16 thms2 active usersReviewed
🏆Completed
Linear algebraStatistics·Captain: mikedeng1

A Robust Spectral Clustering Algorithm for Sub-Gaussian Mixture Models with Outliers 2: Spectral Rounding Without Outliers Gives Σ|S_k|/n_k ≤ 64(2+ε)‖X⁰ − X̂‖₁/n²minResearch Paper

Spectral clustering recovers group labels from a similarity matrix: compute its leading eigenvectors, embed each point as a row of the eigenvector matrix, and cluster the rows with k-means. It is a standard last step of convex-relaxation methods for clustering, which first estimate a clustering matrix XXX (with Xij=1X_{ij} = 1Xij​=1 when iii and jjj belong to the same…

8 thms2 active usersReviewed
Operations ResearchProbabilityStatistics·Captain: mikedeng1

Subset Selection with Shrinkage: Sparse Linear Modeling When the SNR Is Low V: When the SNR Is Low, Best Subset Selection Has Prediction Error at Least of Order σ²γ²k log(ep/k)Research Paper

Best subset selection fits a linear model by least squares using at most kkk of ppp available predictors. It is the classical ℓ0\ell_0ℓ0​-constrained estimator of sparse regression. Mixed-integer optimization now computes it for problems with thousands of variables (Bertsimas, King & Mazumder 2016), so its statistical behaviour matters in practice. Simulations in Has…

8 thms2 active usersReviewed
Reinforcement LearningStatistics·Captain: mikedeng1

Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model 3: Plug-In Policy Evaluation Is ε-Accurate w.p. 1−δ Once N ≥ c₀log(|S|log(e/(1−γ))/δ)/((1−γ)³ε²)Research Paper

Policy evaluation asks for the value of a fixed decision rule in a Markov decision process whose transition probabilities are unknown. It is the inner loop of policy iteration, the subroutine behind actor-critic methods, and the question an operator faces before deploying a policy in an inventory, queueing or routing system that can only be simulated. The…

17 thms2 active usersReviewed
Reinforcement LearningStatistics·Captain: mikedeng1

Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model 1: The Perturbed Model-Based Planner Is ε-Optimal w.p. 1−δ Once N ≥ c₀log(|S||A|/((1−γ)εδ))/((1−γ)³ε²)Research Paper

A generative model lets a planner request independent next-state samples for any state-action pair. This is a useful idealization for studying how many simulator calls are needed before a policy computed from an estimated model performs well in the true environment. Li, Wei, Chi, and Chen show that a small independent perturbation of the rewards lets a…

15 thms2 active usersReviewed
Reinforcement LearningStatistics·Captain: mikedeng1

Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model 4: Finite-Horizon Model-Based Planning Is ε-Optimal w.p. 1−δ Once N ≥ c₀H³log(H|S||A|/δ)/ε²Research Paper

Reinforcement learning with a generative model (a simulator) is a basic way to measure how many samples planning needs. A learner may query, for any state sss, action aaa and step hhh, a fresh next state drawn from the unknown transition law Ph(⋅∣s,a)P_h(\cdot\mid s,a)Ph​(⋅∣s,a), and must output a near-optimal policy. Model-based planning is the simplest approach: estimate each…

10 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryBandit AlgorithmsOperations Research·Captain: mikedeng1

Optimal No-regret Learning in Repeated First-price Auctions 3: Even with Full Information and v_t ≡ 1, Every Bidding Policy Has Worst-Case Expected Regret at Least c√TResearch Paper

Most online advertising inventory is sold one impression at a time in automated auctions, and since about 2019 the major ad exchanges have moved from second-price to first-price rules: the highest bidder wins and pays its own bid. A bidder in a first-price auction must trade off winning probability against the price paid, and that trade-off depends on the…

12 thms2 active usersReviewed
🏆Completed
Bandit AlgorithmsOperations Research·Captain: mikedeng1

Optimal No-regret Learning in Repeated First-price Auctions 5: With Adversarial Contexts and K = (α+1)M ≤ T^(1/3), Every Policy for Partially Ordered Contextual Bandits Has Regret ≥ √(KT)/(32e³)Research Paper

A bidder in repeated first-price auctions faces a learning problem with two kinds of side information. Their private value is a context that changes every round, and the outcome of one bid reveals something about other bids (graph feedback across actions) and about other values (cross learning across contexts). Han, Zhou and Weissman (arXiv:2003.09795v7)…

12 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryBandit AlgorithmsOperations Research·Captain: mikedeng1

Optimal No-regret Learning in Repeated First-price Auctions 6: If the HOB Law Switches at an Unknown Value Threshold, Every Bidding Policy Has Regret Ω(T)Research Paper

In a first-price auction the highest bidder wins and pays her own bid. Display advertising moved to first-price auctions around 2019, and a bidder who participates in millions of them faces a learning problem: at each round ttt she sees a private value vt∈[0,1]v_t\in[0,1]vt​∈[0,1] for the item, bids bt∈[0,1]b_t\in[0,1]bt​∈[0,1], and wins when btb_tbt​ is at least the highest other bid (HOB) mtm_tmt​,…

9 thms2 active usersReviewed
Bandit AlgorithmsOperations Research·Captain: mikedeng1

Optimal No-regret Learning in Repeated First-price Auctions 4: Arm Elimination with Graph Feedback and Cross Learning Has Regret Õ(T ∧ √(αMT) ∧ √(KT)) with High ProbabilityResearch Paper

In many sequential decision problems, playing one action reveals the outcome of other actions too. A bidder in a first-price auction who bids bbb and sees the winning price learns whether every bid at or above that price would have won. A recommender that shows one item learns something about related items. Two kinds of side information recur. Graph feedback a…

8 thms2 active usersReviewed
🏆Completed
Bandit AlgorithmsOperations ResearchProbability·Captain: mikedeng1

Thompson Sampling with Information Relaxation Penalties III: As T → ∞ the Action Laws of IRS.FH and IRS.V-Zero Converge to That of Thompson SamplingResearch Paper

Thompson sampling (TS) is the standard randomized heuristic for the Bayesian multi-armed bandit: at each decision it samples a parameter vector from the current posterior and pulls the arm that would be best if the sample were true. It ignores the remaining horizon. Min, Maglaras and Moallemi (arXiv:1902.04251, Management Science, 2025) obtain horizon-aware…

9 thms2 active usersReviewed
Bandit AlgorithmsHarmonic AnalysisOperations Research+1·Captain: mikedeng1

Learning and Optimization with Seasonal Patterns 1: Regret Upper Bound for the Two-Stage Period-Estimation and Confidence-Bound PolicyResearch Paper

Many demand, traffic and click-through series are seasonal: their mean repeats after a fixed number of periods (a week of days, a year of months), while the length of that cycle is not known in advance. A retailer choosing among KKK promotions, or a platform choosing among KKK recommendations, then faces a multi-armed bandit whose arms have time-varying but…

17 thms2 active usersReviewed
Bandit AlgorithmsOperations ResearchStatistics·Captain: mikedeng1

Online Learning and Decision-Making under Generalized Linear Model with High-Dimensional Data: The G-MCP-Bandit Algorithm Has Expected Cumulative Regret at Most Rmax(T0 + |K|) + C log(T + 1)Research Paper

Personalized decisions — which drug to prescribe, which product to recommend, which price to quote — are made one user at a time, from user features observed on arrival, and the effect of each decision is learned only from the users it was applied to. This is the contextual (covariate) bandit. In electronic records and online platforms the feature vector is…

10 thms2 active usersReviewed
🏆Completed
Bandit AlgorithmsOperations ResearchReinforcement Learning·Captain: mikedeng1

Corruption-Robust Exploration in Episodic Reinforcement Learning I: Regret of SuperVIsed.C Is Bounded by the Bonus Sums of Its Critically Tolerant and Robust Base LearnersResearch Paper

Reinforcement-learning algorithms with regret guarantees, such as UCBVI (Azar, Osband & Munos 2017), assume that every episode is generated by the same Markov decision process. In practice a fraction of episodes can be generated by something else: fraudulent users of a recommender, sensor faults, a strategic participant. Corruption-robust learning asks for…

14 thms2 active usersReviewed
🏆Completed
Quantum Information·Captain: Goku

A Survey of Quantum Learning Theory 5: Atıcı–Servedio: time-efficient quantum learning of k-juntas (corrected)Textbook

This mission develops Chapter 5 of A Survey of Quantum Learning Theory by Srinivasan Arunachalam and Ronald de Wolf. The chapter's selected results describe the mathematical guarantees below.

5 thms2 active usersReviewed
Bandit AlgorithmsProbabilityReinforcement Learning·Captain: mikedeng1

(More) Efficient Reinforcement Learning via Posterior Sampling: PSRL Has Bayesian Regret O(τS√(AT log(SAT))) in Episodic Finite MDPsResearch Paper

An agent that interacts repeatedly with an unknown Markov decision process must trade exploration against exploitation. The dominant design principle for provably efficient reinforcement learning has been optimism in the face of uncertainty: UCRL2 (Jaksch, Ortner & Auer, 2010) and REGAL (Bartlett & Tewari, 2009) build confidence sets around the unknown…

14 thms2 active usersReviewed
Bandit AlgorithmsProbabilityStatistics·Captain: mikedeng1

Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability: FALCON+ Has Regret ≤ 14.3·Σₘ√(K𝓔(τₘ₋₁−τₘ₋₂))(τₘ−τₘ₋₁) + τ₁ + √(8T log(2/δ)) w.p. 1−δResearch Paper

A contextual bandit is a sequential decision problem: in each round a learner sees a context (a user's features, a patient's covariates), picks one of KKK actions, and observes the reward of that action only. Applications include recommendation, dynamic pricing and adaptive clinical decisions. The difficulty is statistical and computational at once: the…

14 thms2 active usersReviewed
OptimizationProbabilityReinforcement Learning·Captain: mikedeng1

Global Convergence of Policy Gradient Methods to (Almost) Locally Optimal Policies: Random-Horizon Policy Gradient with Robbins–Monro Stepsizes Drives the Policy Gradient to Zero Almost SurelyResearch Paper

Policy gradient methods are the main family of reinforcement learning algorithms that search directly over a parameterized class of stochastic policies πθ\pi_\thetaπθ​, θ∈Rd\theta\in\mathbb R^dθ∈Rd, by stochastic gradient ascent on the expected discounted return. They underlie REINFORCE, actor-critic methods and their deep-learning descendants. The return is a nonconvex…

17 thms2 active usersReviewed
Convex OptimizationOptimizationProbability·Captain: mikedeng1

Distributed Stochastic Gradient Tracking Methods I: With a Constant Stepsize, DSGT's Limiting Mean-Square Error Is at Most (Γ+1)ασ²/(Γμn) Plus a Network TermResearch Paper

Many learning and estimation problems are solved by a network of agents: each agent holds part of the data, can talk only to its neighbours, and wants to compute the minimizer of the average of all agents' objectives. Examples are sensor networks, multi-robot systems, and data-parallel training without a central server (Nedić and Ozdaglar 2009; Lian et al.…

18 thms2 active usersReviewed
PreviousPage 26 of 36Next

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