Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Numerical Analysis

254 missions · 180 completed

Missions

Open74Completed180All254
ProbabilityStochastic Systems·Captain: mikedeng1

A Numerical Scheme for BSDEs: The Step-Process Scheme Converges in L² at Rate |π| log(1/|π|), and at Rate |π| for L¹-Lipschitz or Markovian Terminal Values (Theorem 6.1)Research Paper

A backward stochastic differential equation (BSDE) prescribes the terminal value of a process instead of its initial value. Pardoux and Peng (1990) proved that a BSDE with Lipschitz driver has a unique adapted solution. Coupled with a forward diffusion it gives a forward–backward SDE (FBSDE), which represents the solution of a semilinear parabolic PDE…

19 thms2 active usersReviewed
Control TheoryFunctional AnalysisOptimization·Captain: mikedeng1

The Primal-Dual Active Set Strategy as a Semismooth Newton Method V: Local Superlinear Convergence in L² under a Norm GapResearch Paper

Optimal control problems with pointwise bounds on the control, such as

9 thms2 active usersReviewed
Optimization·Captain: mikedeng1

A Trust Region Method Based on Interior Point Techniques for Nonlinear Programming: Limit Points Are KKT Points Under LICQ, Unless Infeasibility or LICQ Failure Is DetectedResearch Paper

Interior-point methods transformed linear programming in the 1980s and 1990s. A natural question was whether the same ideas carry over to nonlinear programming, where the objective and the constraints are general smooth functions. Sequential quadratic programming (SQP) methods were then the method of choice for small and medium nonlinear problems, but each…

17 thms2 active usersReviewed
ProbabilityStochastic Systems·Captain: mikedeng1

Euler Approximations with Varying Coefficients III: Uniform Lq-Convergence with Order 1/2Research Paper

Stochastic differential equations whose coefficients grow faster than linearly (for instance stochastic volatility models such as the 3/2-model) cannot be simulated with the classical explicit Euler–Maruyama scheme: Hutzenthaler, Jentzen and Kloeden showed that its moments diverge when the drift or diffusion grows superlinearly (Proc. R. Soc. A, 2011).…

14 thms2 active usersReviewed
AlgebraProbabilityTheoretical Computer Science·Captain: Shuze Chen

Approximate Syzygies of Smoothed Polynomials and ApplicationsResearch Paper

Many algorithms for tensor decomposition, polynomial system solving and learning mixtures reduce to linear algebra on Macaulay matrices: given polynomials b1,…,bmb_1,\dots,b_mb1​,…,bm​, the matrix of the map (h1,…,hm)↦∑ibihi(h_1,\dots,h_m)\mapsto\sum_i b_ih_i(h1​,…,hm​)↦∑i​bi​hi​ at a fixed output degree. Whether such an algorithm is robust to noise depends on how far this map is from losing rank, beyond the…

12 thms1 active userReviewed
Computational GeometryMachine LearningTheoretical Computer Science·Captain: iris

Softmax Attention with Any Temperature in Fixed Dimension: Matching the Best Known Maximum-Inner-Product BoundsResearch Paper

Softmax attention is the basic operation of Transformers (Vaswani et al., 2017). Direct evaluation compares every query with every key, so a context of length nnn costs n2n^2n2 exponentials even when the dimension is fixed. A question for theory is whether this quadratic cost is necessary, and how attention relates to the classical batch maximum inner product prob…

30 thms1 active userReviewed
Complexity TheoryDynamical SystemsTheoretical Computer Science·Captain: iris

One Polynomial Field for Every Euler Step and the Flow: Polynomial Dynamics for PTIME and PSPACEResearch Paper

Ordinary differential equations with polynomial right-hand sides are a model of analog computation: chemical reaction networks, the General Purpose Analog Computer and continuous-time recurrent networks all reduce to them. Since Graça, Campagnolo and Buescu (2008) and Bournez, Graça and Pouly (2017) it is known that polynomial ODEs simulate Turing machines…

32 thms1 active userReviewed
Harmonic AnalysisProbability·Captain: iris

Quasi-Monte Carlo Beyond Hardy–Krause II: (1+ε)n(1 + \varepsilon) n(1+ε)n Samples SufficeResearch Paper

Numerical integration estimates fˉ=∫[0,1)df(z) dz\bar f = \int_{[0,1)^d} f(z)\,dzfˉ​=∫[0,1)d​f(z)dz by the average of fff over an nnn-point set AAA, with error err⁡(A,f)=∣A∣−1∑z∈Af(z)−fˉ\operatorname{err}(A,f) = |A|^{-1}\sum_{z\in A} f(z) - \bar ferr(A,f)=∣A∣−1∑z∈A​f(z)−fˉ​. Monte Carlo (independent uniform points) has mean-squared error σ2(f)/n\sigma^2(f)/nσ2(f)/n, where σ(f)\sigma(f)σ(f) is the standard deviation of fff. Quasi-Monte Carlo uses deterministic…

25 thms1 active userReviewed
Differential GeometryOptimization·Captain: mikedeng1

Active-Set Newton Methods and Partial Smoothness: Transversal C² Manifolds with a Constant-Rank Map Between Them Yield a Quadratically Convergent Active-Set Newton IterationResearch Paper

Active-set methods for optimization and variational problems run in two phases. A globally convergent first phase identifies which constraints are active at the solution; once they are identified the problem simplifies locally, and a second phase converges fast, typically by linearizing the simplified problem. Sequential quadratic programming for nonlinear…

9 thms1 active userReviewed
Markov ChainProbabilityStatistics·Captain: mikedeng1

Multilevel Langevin Pathwise Average for Gibbs Approximation III: C² Strongly Contractive Drift, 𝔞 = 2 — L²-Error ≲ [f]₁ε at Cost ((½+√2)/(√2−1))Υ₂²log(γ₀⁻¹)ε⁻²/(γ₀α)Research Paper

Sampling from a Gibbs distribution πU∝e−U dλd\pi_U\propto e^{-U}\,d\lambda_dπU​∝e−Udλd​ on Rd\mathbb R^dRd is a basic task in Bayesian statistics, statistical physics and machine learning. A standard approach simulates the Langevin diffusion dXt=−∇U(Xt) dt+2 dBtdX_t=-\nabla U(X_t)\,dt+\sqrt2\,dB_tdXt​=−∇U(Xt​)dt+2​dBt​, whose invariant distribution is πU\pi_UπU​, through its Euler scheme, and averages a test function fff along…

16 thms1 active userReviewed
Markov ChainProbabilityStatistics·Captain: mikedeng1

Multilevel Langevin Pathwise Average for Gibbs Approximation II: Strongly Contractive Drift, 𝔞 = 1 — L²-Error ≲ [f]₁ε at Cost (5log γ₀⁻¹/2αγ₀)Υ₁²ε⁻²⌈log₂(Υ₁²ε⁻²)⌉³Research Paper

Sampling from a Gibbs distribution πU∝e−U dλd\pi_U \propto e^{-U}\,d\lambda_dπU​∝e−Udλd​ on Rd\mathbb R^dRd, or computing integrals π(f)\pi(f)π(f) against it, is a basic task of Bayesian statistics, statistical physics and stochastic optimization. A standard route is to simulate a diffusion whose invariant law is the target, for instance the overdamped Langevin equation …

15 thms1 active userReviewed
Harmonic AnalysisProbability·Captain: mikedeng1

Isotropic Gaussian Random Fields on the Sphere: Regularity, Fast Simulation and Stochastic Partial Differential Equations III: Karhunen–Loève Truncation Error ≤ κ^{−β} a.s. for β < (α−2)/2Research Paper

An isotropic Gaussian random field is a spatial random quantity whose probability law is unchanged when the sphere is rotated. Such fields model spatially distributed uncertainty when no direction is preferred. The question in this mission is concrete: if a field is simulated by retaining only finitely many spherical harmonic frequencies, how rapidly does…

7 thms1 active userReviewed
Partial Differential EquationsProbability·Captain: mikedeng1

Isotropic Gaussian Random Fields on the Sphere: Regularity, Fast Simulation and Stochastic Partial Differential Equations IV: Heat-Equation Spectral Truncation Error ≤ κ^{−β} a.s. for β < α/2Research Paper

Stochastic partial differential equations on the sphere model quantities that live on the surface of the Earth or of the sky and are perturbed by spatially correlated noise: temperature anomalies, geophysical fields, fluctuations of the cosmic microwave background. The simplest such model is the stochastic heat equation on the unit sphere S2\mathbb S^2S2 with…

6 thms1 active userReviewed
Optimization·Captain: mikedeng1

Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods IV: For Prox-Regular Compositions h∘c, Subregularity of the Subdifferential and of the Prox-Gradient Map CoincideResearch Paper

Linear convergence of first-order methods is usually proved through an error bound: near a solution, the distance to the solution set is controlled by the size of a computable residual, such as the length of a proximal-gradient step. For the prox-linear method, which minimizes a composition h(c(x))h(c(x))h(c(x)) of a nonsmooth outer function hhh with a smooth map ccc by…

8 thms1 active userReviewed
Differential GeometryOptimization·Captain: mikedeng1

Riemannian Proximal Gradient Methods II: The Riemannian Proximal Gradient Method Converges at Rate O(1/k) under Retraction ConvexityResearch Paper

Many problems in statistics, signal processing and machine learning minimize a smooth loss plus a nonsmooth regularizer over a set with manifold structure: sparse principal component analysis over the Stiefel manifold, sparse blind deconvolution over the sphere, and clustering and dictionary-learning models with orthogonality constraints. In Euclidean space…

10 thms1 active userReviewed
Differential GeometryOptimization·Captain: mikedeng1

Riemannian Proximal Gradient Methods I: Every Accumulation Point of the Riemannian Proximal Gradient Method Is Stationary, with an Explicit Iteration BoundResearch Paper

Many problems in statistics, signal processing and machine learning minimize a smooth loss plus a nonsmooth regularizer over a set that is a manifold rather than a vector space: sparse principal component analysis over the Stiefel manifold, sparse blind deconvolution over the sphere, low-rank recovery over fixed-rank matrices. In Euclidean space the…

9 thms1 active userReviewed
ProbabilityStochastic Systems·Captain: mikedeng1

On a Perturbation Theory and on Strong Convergence Rates for Stochastic Ordinary and Partial Differential Equations with Nonglobally Monotone Coefficients: Stopped-Tamed Euler Converges at Rate 1/2Research Paper

Stochastic differential equations (SDEs) dXt=μ(Xt) dt+σ(Xt) dWtdX_t=\mu(X_t)\,dt+\sigma(X_t)\,dW_tdXt​=μ(Xt​)dt+σ(Xt​)dWt​ model physical, biological and financial systems whose drift μ\muμ often grows superlinearly: the stochastic Lorenz equation, the stochastic van der Pol and Duffing–van der Pol oscillators, Langevin dynamics. Solutions are rarely explicit, so they are simulated by time-stepping…

14 thms1 active userReviewed
Differential GeometryOptimization·Captain: mikedeng1

Optimization Methods on Riemannian Manifolds and Their Application to Shape Space 1: Riemannian BFGS with Isometric Vector Transport Converges R-Linearly under Uniform ConvexityResearch Paper

Many optimization problems in shape analysis, computer vision, numerical linear algebra and statistics have a feasible set that is not a vector space but a Riemannian manifold: spaces of curves modulo reparametrization, the Stiefel and Grassmann manifolds, fixed-rank matrices. On such a set the classical recipe "add a multiple of the search direction to the…

8 thms1 active userReviewed
Linear algebraOptimization·Captain: mikedeng1

The Primal-Dual Active Set Strategy as a Semismooth Newton Method III: Global Convergence under the Norm and Cone ConditionsResearch Paper

Obstacle problems, contact problems and control-constrained optimal control problems lead, after discretization, to complementarity systems of the form "find y≤ψy \le \psiy≤ψ and λ≥0\lambda \ge 0λ≥0 with Ay+λ=fAy + \lambda = fAy+λ=f and λi(yi−ψi)=0\lambda_i(y_i - \psi_i) = 0λi​(yi​−ψi​)=0". The primal-dual active set strategy solves such systems by guessing which constraints are active, solving one linear…

10 thms1 active userReviewed
Optimization·Captain: mikedeng1

Truncated-Newton Algorithms for Large-Scale Unconstrained Optimization 1: Truncated-Newton CG Iterates Have ‖g(x_k)‖ → 0 and Converge to Any Limit Point with Positive Definite HessianResearch Paper

Large scale unconstrained optimization often makes an exact Newton step expensive. At each iterate, Newton's method asks for a solution of a linear system involving the Hessian, and the cost of solving that system can dominate the cost of evaluating the objective. Dembo and Steihaug's 1983 truncated Newton method uses conjugate gradients to stop the linear…

8 thms1 active userReviewed
Linear algebraOptimization·Captain: mikedeng1

Projection-like Retractions on Matrix Manifolds IV: Within σ_r(X̄)/2 of a Rank-r Matrix, the Truncated SVD Is the Unique Nearest Matrix of Rank Exactly rResearch Paper

Optimization over sets of matrices of fixed rank comes up in low-rank matrix completion, model reduction, and the low-rank approximation of solutions of large matrix equations. A standard approach treats the constraint set as a Riemannian manifold and runs gradient or Newton-type methods on it (Absil, Mahony & Sepulchre 2008). Each iteration takes a step in…

8 thms1 active userReviewed
Operations ResearchOptimization·Captain: mikedeng1

Minimization Methods for Non-Differentiable Functions IX: Convergence of the r-Algorithm with Exact Directional MinimizationTextbook

The r-algorithm of N. Z. Shor is a variable-metric method for minimizing functions that are not differentiable everywhere, such as maxima of smooth functions, penalty functions and Lagrangian dual functions of integer and decomposition problems. It combines a subgradient step with a space dilation along the difference of two successive almost-gradients, and…

7 thms1 active userReviewed
ProbabilityStochastic 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
ProbabilityStochastic 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
PreviousPage 3 of 3Next

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