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,571 completed

Missions

Open1173Completed1571All2744
Machine LearningStatistics·Captain: mikedeng1

Optimal Rates for the Regularized Least-Squares Algorithm III: Against Every Algorithm, a Single Distribution in P(b, c) Keeps the Expected Excess Risk above ℓ^(−cB/(cB+1)) for B > b (Theorem 3)Research Paper

Regularized least squares (RLS) in a reproducing kernel Hilbert space is a basic estimator of nonparametric regression and of kernel-based learning. Its learning rate is the speed at which the expected excess risk goes to zero as the sample size ℓ\ellℓ grows. A rate is useful only if it is known to be optimal, and optimality is a lower-bound statement about…

8 thms1 active userReviewed
Machine LearningStatistics·Captain: mikedeng1

Optimal Rates for the Regularized Least-Squares Algorithm II: No Learning Algorithm Converges Faster than ℓ^(−bc/(bc+1)) Uniformly over P(b, c) — the Minimax Lower Rate (Theorem 2)Research Paper

Regularized least squares (RLS), also called kernel ridge regression, is one of the standard estimators of statistical learning: given a sample of input–output pairs, it fits a function from a reproducing kernel Hilbert space by minimizing the empirical squared error plus a multiple of the squared norm. Caponnetto and De Vito (FoCM 2007) proved that, over a…

7 thms1 active userReviewed
Functional AnalysisMachine LearningStatistics·Captain: mikedeng1

Optimal Rates for the Regularized Least-Squares Algorithm I: With λ Tuned to the Effective Dimension, Regularized Least Squares Attains the Rate ℓ^(−bc/(bc+1)) Uniformly over P(b, c) (Theorem 1)Research Paper

Regularized least squares (RLS, also called kernel ridge regression or Tikhonov regularization) is the simplest learning algorithm built on a reproducing kernel Hilbert space. Given ℓ\ellℓ examples (xi,yi)(x_i,y_i)(xi​,yi​) drawn independently from an unknown distribution ρ\rhoρ, it returns the function in a hypothesis space H\mathcal HH that minimizes the empirical squared…

9 thms1 active userReviewed
Control TheoryDynamic Programming·Captain: mikedeng1

Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey 5: Canonical Triplets Are Exactly the Solutions of the Coupled Optimality EquationsResearch Paper

A controlled Markov process run under the long-run average cost criterion asks for a policy minimizing the asymptotic cost per stage. When every stationary policy induces a single recurrent class, the optimal average cost is a constant and is characterized by one equation, the average cost optimality equation (ACOE). In general it is not: under some…

6 thms1 active userReviewed
Control TheoryMathematical PhysicsOptimization+2·Captain: mikedeng1

Optimization of Mean-field Spin Glasses III: The Lagrangian Value of the Stochastic Control Problem Equals the Parisi FunctionalResearch Paper

The ground-state energy of a mixed ppp-spin spin glass, OPTN=max⁡σ∈{±1}NHN(σ)/N\mathsf{OPT}_N=\max_{\sigma\in\{\pm1\}^N}H_N(\sigma)/NOPTN​=maxσ∈{±1}N​HN​(σ)/N, converges almost surely to the infimum of the Parisi functional over non-decreasing order parameters (Auffinger–Chen 2017). El Alaoui, Montanari and Sellke (arXiv:2001.00904v1) study algorithms that find near-optimal configurations. They introduce…

14 thms1 active userReviewed
Mathematical PhysicsOptimizationPartial Differential Equations·Captain: mikedeng1

Optimization of Mean-field Spin Glasses II: Under No Overlap Gap, the Monotone Parisi Minimizer Also Minimizes the Extended FunctionalResearch Paper

The mixed ppp-spin model is a random polynomial on the hypercube {−1,+1}N\{-1,+1\}^N{−1,+1}N: a centered Gaussian process HN(σ)H_N(\boldsymbol\sigma)HN​(σ) with covariance E{HN(σ)HN(σ′)}=Nξ(⟨σ,σ′⟩/N)\mathbb E\{H_N(\boldsymbol\sigma)H_N(\boldsymbol\sigma')\} = N\xi(\langle\boldsymbol\sigma,\boldsymbol\sigma'\rangle/N)E{HN​(σ)HN​(σ′)}=Nξ(⟨σ,σ′⟩/N). Its maximum OPTN=max⁡σHN(σ)/N\mathrm{OPT}_N = \max_{\boldsymbol\sigma} H_N(\boldsymbol\sigma)/NOPTN​=maxσ​HN​(σ)/N is a canonical…

11 thms1 active userReviewed
Stochastic Systems·Captain: mikedeng1

Convergence in law of the minimum of a branching random walk: The Minimum Centred at (3/2) ln n Converges to a Gumbel Law Shifted by the Derivative MartingaleResearch Paper

A branching random walk is the simplest model of a population that both reproduces and moves: every particle dies and leaves a random cloud of children displaced relative to it. Its extreme particles control the speed of travelling waves in reaction–diffusion equations (the KPP/Fisher equation), the free energy of directed polymers on trees, the cover and…

13 thms1 active userReviewed
Dynamic ProgrammingLinear OptimizationOperations Research+1·Captain: mikedeng1

On the Choice-Based Linear Programming Model for Network Revenue Management I: The CDLP Is Asymptotically Optimal under Proportional ScalingResearch Paper

Airlines, hotels and railways sell a fixed stock of perishable capacity (seats on flight legs, room-nights) to customers who arrive over a finite selling horizon. Network revenue management decides, at each moment, which products to keep open for sale. In the classical independent-demand model each product has its own demand stream. In practice customers…

7 thms1 active userReviewed
Dynamic ProgrammingMarkov ChainOperations Research·Captain: mikedeng1

Stochastic Dynamic Programming and the Control of Queueing Systems V: The Average Cost Optimality Equation and Value Iteration for Finite State SpacesTextbook

Average cost Markov decision chains model systems that run indefinitely and are judged by their long-run cost per step: admission and routing control in queues, inventory replenishment, machine maintenance. For a finite state space the classical tool is the average cost optimality equation (ACOE)

13 thms1 active userReviewed
Operations ResearchOptimization·Captain: mikedeng1

Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies: Expected Discounted Cost Is Convex in the Base-Stock LevelResearch Paper

In many inventory systems, demand that cannot be met from stock is lost rather than backordered: a customer who finds the shelf empty buys elsewhere. For such lost-sales systems with positive lead times the optimal replenishment policy is known to be complex and to depend on the whole pipeline of outstanding orders (Karlin and Scarf, 1958; Morton, 1969). In…

10 thms1 active userReviewed
Numerical AnalysisStochastic Systems·Captain: mikedeng1

Euler Approximations with Varying Coefficients II: Strong Order 1/2 in Lp for Superlinearly Growing Diffusion CoefficientsResearch Paper

Stochastic differential equations with superlinearly growing coefficients appear throughout applied probability: population models with cubic damping, Langevin dynamics with polynomial potentials, and stochastic volatility models such as the 3/2-model used for pricing VIX options, whose diffusion coefficient grows like ∣x∣3/2|x|^{3/2}∣x∣3/2. For such equations the…

13 thms1 active userReviewed
Numerical AnalysisStochastic Systems·Captain: mikedeng1

Euler Approximations with Varying Coefficients I: Lp-Convergence of Explicit Euler Schemes under Local MonotonicityResearch Paper

Stochastic differential equations (SDEs) whose coefficients grow faster than linearly appear throughout applied probability: population and epidemic models with cubic damping, Langevin dynamics with non-quadratic potentials, and stochastic volatility models such as the 3/2-model used for pricing VIX options (Goard–Mazur 2013). Their solutions are almost…

12 thms1 active userReviewed
Control TheoryDynamical SystemsOperations Research+1·Captain: mikedeng1

Stabilization of Hybrid Systems by Feedback Control Based on Discrete-Time State Observations II: Mean-Square and Almost Sure Exponential StabilityResearch Paper

Many engineered systems switch between a finite number of operating modes at random times: a power grid after a line failure, a networked controller whose links drop, a manufacturing plant whose machines break down and are repaired. A standard model for such systems is a hybrid stochastic differential equation, also called an SDE with Markovian switching:…

13 thms1 active userReviewed
Dynamic ProgrammingOperations ResearchStochastic Systems·Captain: mikedeng1

Exit Problems for Spectrally Negative Lévy Processes and Applications to (Canadized) Russian Options II: Optimal Stopping for the Perpetual Russian OptionResearch Paper

A Russian option is a perpetual American-type claim that pays, when the holder exercises at time τ\tauτ, the maximum of the asset price seen so far, discounted by e−ατe^{-\alpha\tau}e−ατ. It was introduced by Shepp and Shiryaev for the Black–Scholes market (Shepp–Shiryaev 1993), where the underlying log-price is a Brownian motion with drift. Empirical work on asset…

17 thms1 active userReviewed
Dynamical SystemsReinforcement LearningStochastic Systems·Captain: mikedeng1

The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning II: Mean-Square Error under Bounded StepsizesResearch Paper

Stochastic approximation is the family of recursive algorithms that locate a zero of a vector field hhh from noisy evaluations of it. Temporal-difference learning, Q-learning, actor–critic methods and stochastic gradient descent are all instances. In practice these algorithms are often run with a constant or bounded, non-vanishing stepsize: the iterate keeps…

7 thms1 active userReviewed
Dynamic ProgrammingOperations ResearchStochastic Systems·Captain: mikedeng1

On the Optimal Dividend Problem for a Spectrally Negative Lévy Process II: Optimality of the Double-Barrier Strategy at d* with Bail-Out LoansResearch Paper

An insurance company's surplus in the Cramér–Lundberg model grows linearly with premiums and falls by claims arriving as a compound Poisson process. When premium income exceeds the expected claims, the surplus drifts to infinity. De Finetti (1957) proposed that the surplus above a barrier should instead be paid to shareholders as dividends, and the…

15 thms1 active userReviewed
🏆Completed
Linear algebraMachine Learning·Captain: Minghui

Fine-Tuning Can Distort Pretrained Features: Perfect-Feature LP-FT SeparationResearch Paper

Transfer learning starts with a representation learned on an earlier task and adapts it to a new one. Two common choices are linear probing, which changes only the final linear predictor, and fine-tuning, which changes the representation as well. These procedures optimize related training objectives, but their behavior away from the training data can…

9 thms1 active userReviewed
Control TheoryDynamical SystemsOperations Research+1·Captain: mikedeng1

Stabilization of Hybrid Systems by Feedback Control Based on Discrete-Time State Observations I: Almost Sure Asymptotic StabilityResearch Paper

Many engineered systems switch between a finite number of operating modes at random times: a power grid after a line failure, a networked controller whose links drop, a manufacturing plant whose machines break down and are repaired. A standard model for such systems is a hybrid stochastic differential equation, also called an SDE with Markovian switching:…

13 thms1 active userReviewed
Control TheoryOperations ResearchOptimization+1·Captain: mikedeng1

A General Stochastic Maximum Principle for Optimal Control Problems: The Maximum Principle with First- and Second-Order Adjoint ProcessesResearch Paper

Pontryagin's maximum principle gives necessary conditions for optimality in deterministic optimal control: along an optimal trajectory, the optimal control maximizes (or minimizes) a Hamiltonian built from an adjoint process. For a system driven by Brownian noise the analogous statement was open in full generality for two decades. The difficulty appears…

12 thms1 active userReviewed
🏆Completed
Machine Learning·Captain: Minghui

Neural Tangent Kernel: The Infinite-Width Initialization LimitResearch Paper

A neural network is nonlinear in its parameters, but a small change in those parameters changes its predictions through a Jacobian. The neural tangent kernel is the Gram kernel of that Jacobian: it records which changes in predictions can be produced by common parameter updates. An initialization limit identifies a deterministic object behind this random…

4 thms1 active userReviewed
🏆Completed
Machine LearningOptimization·Captain: Minghui

Optimization Methods for Large-Scale Machine Learning: Stochastic Gradient ConvergenceResearch Paper

Training a machine-learning model often means choosing a vector of parameters to minimize an average loss. Evaluating the full gradient can require processing an entire dataset. A stochastic-gradient method instead updates the parameters using a random direction obtained from a smaller amount of information. Its computational appeal raises a mathematical…

6 thms1 active userReviewed
🏆Completed
Numerical Analysis·Captain: shivm

Randomized Kaczmarz: Exponential Convergence in ExpectationResearch Paper

Solve a consistent system Ax=bAx=bAx=b, with A∈Cm×nA\in\mathbb{C}^{m\times n}A∈Cm×n of full rank and m≥n≥1m\ge n\ge 1m≥n≥1. Kaczmarz's method (1937) projects the current iterate onto the solution hyperplane of one equation at a time. The cyclic version converges, but its rate depends on the order of the rows and has no clean bound in terms of a condition number.

12 thms1 active userReviewed
🏆Completed
Active InferenceBehaviorDynamical Systems+4·Captain: ActiveInference

Free Energy Principle I: the variational free-energy boundResearch Paper

The free energy principle (FEP) proposes that a self-organizing system — a brain, an organism, an agent — persists by minimizing one quantity: the variational free energy of its sensory states under an internal generative model. Introduced by Karl Friston as a principle of brain function [Friston 2006] and stated in its unified form [Friston 2010], the…

8 thms1 active userReviewed
🏆Completed
Machine LearningOptimization·Captain: Minghui

SCAFFOLD: Convergence with Client SamplingResearch Paper

Federated optimization trains one model using objectives held by many clients. Performing several local updates between communication rounds saves communication, but clients with different objectives can move in different directions. SCAFFOLD maintains a correction for each client to address this disagreement, including when only some clients participate.…

6 thms1 active userReviewed
🏆Completed
Convex OptimizationMachine Learning·Captain: Minghui

A Field Guide to Federated Optimization: Convex FedAvg ConvergenceResearch Paper

Federated optimization studies learning when data and computation are spread across clients. Communicating after every stochastic gradient step can be costly, so clients often take several steps before averaging their models. The difficulty is that different clients can optimize different objective functions. Their models then move apart between…

5 thms1 active userReviewed
PreviousPage 109 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