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
Convex OptimizationOptimization·Captain: mikedeng1

Universal Barrier is n-Self-Concordant: The Universal Barrier of Every Proper Convex Domain in ℝⁿ Is an n-Self-Concordant BarrierResearch Paper

Interior-point methods minimize a linear function over a convex set K⊆RnK\subseteq\mathbb R^nK⊆Rn by following the minimizers of t cTx+φ(x)t\,c^{\mathsf T}x+\varphi(x)tcTx+φ(x), where φ\varphiφ is a self-concordant barrier for KKK. The number of Newton steps the path-following method needs to reach accuracy ϵ\epsilonϵ is O(νlog⁡(1/ϵ))O(\sqrt{\nu}\log(1/\epsilon))O(ν​log(1/ϵ)), where ν\nuν is the barrier's self-concord…

16 thms3 active usersReviewed
Algorithmic Game TheoryBandit AlgorithmsOperations Research·Captain: mikedeng1

Game of Thrones: Fully Distributed Learning for Multiplayer Bandits: Without Communication, the Game of Thrones Algorithm Has Expected Total Regret O(log^{1+δ} T)Research Paper

In a multiplayer multi-armed bandit, several agents repeatedly choose among the same finite set of arms, and two agents that choose the same arm collide and receive nothing. The model comes from cognitive radio and wireless networks: users share channels, a channel used by two users at once carries neither transmission, and the quality of a channel differs…

13 thms3 active usersReviewed
Quantum InformationRandom Matrix Theory·Captain: mikedeng1

Asymptotics of random density matrices: The Rescaled Empirical Spectral Measure of an Induced Random Density Matrix Converges Almost Surely to the Marchenko–Pastur LawResearch Paper

In quantum mechanics, a system that interacts with an environment is described by a density matrix: a positive semidefinite complex matrix of trace one. When nothing is known about the joint state of the system and its environment, a natural model is to take that joint state to be a uniformly random pure state and to trace out the environment. The resulting…

12 thms3 active usersReviewed
Dynamical SystemsMathematical PhysicsStatistical Mechanics·Captain: mikedeng1

Entropic Fluctuations in Statistical Mechanics I. Classical Dynamical Systems: Finite-Time Green–Kubo Formula and Onsager Reciprocity from the Generalized Evans–Searles SymmetryResearch Paper

In a system driven away from equilibrium, a force changes a reference state and a dynamics, while a corresponding flux records the transported quantity. Statistical mechanics asks how the mean flux changes under a small force. A second question is whether the matrix of these changes is symmetric when the underlying dynamics admit time reversal. Jakšić,…

9 thms3 active usersReviewed
EconomicsFunctional Analysis·Captain: mikedeng1

Lipschitz Bernoulli Utility Functions: A Preorder on Finite-Mean Lotteries Is Lipschitz and Affine if and only if It Has a Lipschitz Expected Multi-Utility RepresentationResearch Paper

Expected utility theory describes a decision maker who ranks risky prospects (probability distributions over outcomes) by the expected value of a Bernoulli utility function on the outcomes. The classical von Neumann–Morgenstern theorem, extended by Grandmont to separable metric outcome spaces, says that a complete preference over lotteries has a continuous…

11 thms3 active usersReviewed
Operations ResearchStochastic Systems·Captain: mikedeng1

Stationary Waiting Time in Parallel Queues with Synchronization: For Jobs of Fixed Size, the Waiting Time Converges with All Moments to the Endogenous Solution of a High-Order Lindley EquationResearch Paper

Parallel computing systems split each incoming job into pieces that are processed simultaneously on several servers. When the pieces of one job must also start together, each server keeps the order of arrival, and a job cannot begin until every server it needs has finished its earlier work, the result is a synchronized parallel queue. Waiting times in this…

12 thms3 active usersReviewed
EconomicsOperations Research·Captain: mikedeng1

Systemic Portfolio Diversification: With Two Heterogeneous Banks and Two Assets, Equilibrium Portfolios Raise the Probability That Some Bank Liquidates and Lower the Probability That Both DoResearch Paper

When a leveraged financial institution suffers a loss, a leverage constraint can force it to sell assets. If several institutions hold the same assets, their simultaneous sales depress prices and impose losses on everyone holding those assets. These fire-sale spillovers were a central amplification channel in the 2007–2009 financial crisis (Greenwood,…

10 thms3 active usersReviewed
EconomicsOperations Research·Captain: mikedeng1

How Endogenization of the Reference Point Affects Loss Aversion: A Study of Portfolio Selection: The Partially Endogenous PPE Is the Exogenous-Reference Optimum with a Lower Degree of Loss AversionResearch Paper

Loss aversion, the tendency to weigh a loss more heavily than a gain of the same size, is the central ingredient of reference-dependent preferences. Measured degrees of loss aversion vary widely across experiments and markets. One explanation is that the reference point is not fixed. People form it partly from their own expectations about what they will…

12 thms3 active usersReviewed
Dynamic ProgrammingOperations ResearchOptimization·Captain: Shuze Chen

Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models: The Sampled Upper Base-Stock Policy Costs at Most (1 + ε) Times the Optimum with Probability 1 − δResearch Paper

The periodic-review inventory problem asks how much stock to order in each of TTT periods when demand is random, unmet demand is backlogged, and both leftover stock and shortages are charged. When the demand distributions are known, a backward dynamic program computes an optimal policy, and the optimal policy is a base-stock policy: in each period, order up…

15 thms3 active usersReviewed
Control TheoryOperations ResearchStochastic Systems·Captain: mikedeng1

Infinite Horizon Stochastic Impulse Control with Delay and Random Coefficients: The Strategy Built from Iterated Snell Envelopes Is Optimal over All Admissible Delayed Impulse StrategiesResearch Paper

Impulse control models a decision maker who acts on a system by discrete interventions rather than continuously: a central bank adjusting a rate, a firm switching production capacity, a portfolio manager rebalancing with fixed transaction costs. Each intervention has a fixed cost, so the controller chooses both when to act and how much. In many applications…

17 thms3 active usersReviewed
Control TheoryEconomicsOperations Research·Captain: mikedeng1

Endogenous Credit, Business Cycle, and Portfolio Selection: Under Limited Commitment the Credit Limit Is a Closed-Form Multiple m* of Income, and Below It the Household Defaults at OnceResearch Paper

A household can borrow against expected future income only while repayment remains preferable to default. In the baseline model of Choi, Koo, Lim and Yoo, this choice is imposed through a participation condition at every date: the household's remaining utility from its planned consumption must be at least its remaining utility after default. The constraint…

14 thms3 active usersReviewed
Actuarial ScienceOperations Research·Captain: mikedeng1

On the Profitability of Selfish Blockchain Mining Under Consideration of Ruin: Closed-Form Expected Surplus of a Selfish Miner under Ruin up to an Exponential Time HorizonResearch Paper

A blockchain miner pays for electricity and equipment while block rewards arrive at irregular times. A strategy that raises the average reward can still expose a miner with limited capital to ruin before those rewards arrive. Albrecher and Goffard study this tension for a simplified selfish mining strategy in which the miner temporarily withholds a…

8 thms3 active usersReviewed
Dynamical SystemsGroup Theory·Captain: dbenbenn

Is the group IET of interval exchange transformations amenable?Open Problem

This mission formalizes the question whether the group IET\mathrm{IET}IET of interval exchange transformations is amenable, Question 1.6 of Juschenko, Matte Bon, Monod and de la Salle, Extensive amenability and an application to interval exchanges, Ergodic Theory Dynam. Systems 38 (2018) 195–219, p. 4 (doi:10.1017/etds.2016.32), together with the landmark results…

33 thms3 active usersReviewed
Calculus of VariationsOperations ResearchStochastic Systems·Captain: mikedeng1

Large Deviations for the Single-Server Queue and the Reneging Paradox: The Long-Time Decay Rate of Atypical Reneging Is an Explicit C(γ) Independent of the Reneging RateResearch Paper

Customer abandonment, or reneging, is a basic feature of service systems: call centres, emergency departments and online platforms all lose customers who give up waiting. The number of reneging customers is a natural performance measure, and in many-server and single-server models alike it is the quantity managers monitor and are penalised for. Typical…

18 thms3 active usersReviewed
Bandit AlgorithmsMachine Learning·Captain: mikedeng1

Online Learning over a Finite Action Set with Limited Switching: An Algorithm for Prediction From Experts Whose Regret and Number of Switches Are Both O(√(T log n log(1/δ))) with Probability 1 − δResearch Paper

In prediction from experts (PFE), an online learner chooses one of nnn actions in each of TTT rounds, and an adversary assigns each action a loss in [0,1][0,1][0,1]. Performance is measured by regret, the learner's total loss minus that of the best single action in hindsight. In many applications changing the action is itself costly: re-routing traffic, re-balancing a…

10 thms3 active usersReviewed
Operations ResearchStochastic Systems·Captain: mikedeng1

Heavy-Traffic Insensitive Bounds for Weighted Proportionally Fair Bandwidth Sharing Policies: Under Phase-Type File Sizes the Weighted Mean Flow Count Lies Between Ls·min κ/ε and Ls·max κ/εResearch Paper

In a communication network, file transfers ("flows") share the capacity of the links on their routes, and the bandwidth-sharing policy decides how much rate each flow receives. The connection-level model of Massoulié and Roberts (2000) treats flows as customers that arrive at random, carry a random amount of data, and leave once it is transferred. Under weig…

18 thms3 active usersReviewed
Operations ResearchOptimal TransportStatistics·Captain: mikedeng1

Sample Out-of-Sample Inference Based on Wasserstein Distance: The Rescaled SOS Profile Function for Means Converges in Distribution to an Explicit Dimension-Dependent LimitResearch Paper

Stress testing and data-driven decision making often combine two samples: observations X1,…,XnX_1,\dots,X_nX1​,…,Xn​ of the quantity of interest and additional scenarios Y1,…,YmY_1,\dots,Y_mY1​,…,Ym​ (stress scenarios supplied by a regulator, or unlabeled data). Blanchet and Kang (arXiv:1605.01340v4, 2020; later in Operations Research, 2021) propose to measure how far the empirical…

14 thms3 active usersReviewed
Bandit AlgorithmsOperations ResearchStatistics·Captain: mikedeng1

Bayesian Sequential Learning for Clinical Trials of Multiple Correlated Medical Interventions: The cPDE Allocation Policy Is Asymptotically ConsistentResearch Paper

A clinical trial that compares several treatments for the same condition must decide, patient by patient, which treatment the next patient receives. When the treatments are related (doses of one drug, drugs of one class), an outcome observed on one arm is informative about the others, and a good allocation rule should exploit that correlation. Chick, Gans…

20 thms3 active users
Algorithmic Game TheoryEconomicsOperations Research·Captain: mikedeng1

Information Design for Congested Social Services: Optimal Need-Based Persuasion 4: Signaling Achieves the First-Best Admission Policy for All Welfare Weights Above a ThresholdResearch Paper

Social services such as public health clinics, legal aid offices and food banks are congested: users wait in a queue whose length they cannot see. Some users have no alternative (high need) and others have an outside option (low need). A provider cannot price access, but can decide what to tell arriving users about the queue. Anunrojwong, Iyer and Manshadi…

15 thms3 active usersReviewed
Operations ResearchOptimizationStochastic Systems·Captain: mikedeng1

Asymptotic Optimality of Base-Stock Policies for Perishable Inventory Systems 3: Under FIFO Issuance the Heuristic Base-Stock Policy Is Asymptotically Optimal as the Unit Penalty Cost GrowsResearch Paper

Perishable products, among them fresh food, blood platelets and pharmaceuticals, lose their value after a fixed number of periods. Their inventory control has been studied since the 1970s (Nahmias, Perishable inventory theory: a review, Operations Research 1982). The optimal policy of the standard lost-sales model depends on the whole age profile of the…

14 thms3 active usersReviewed
Graph TheoryLinear OptimizationOperations Research+1·Captain: mikedeng1

Linear Programming and Community Detection 6: The LP Relaxation Fails w.h.p. in the Very Dense and Dense SBM Above Explicit ThresholdsResearch Paper

Community detection asks for a hidden partition of the nodes of a graph from its edges. Its simplest probabilistic benchmark is the two-community stochastic block model (SBM), in which the minimum bisection problem is the maximum a posteriori estimator. That problem is NP-hard, so convex relaxations are used in its place, and the question is when a…

15 thms3 active usersReviewed
Differential GeometryMachine LearningOptimization·Captain: mikedeng1

Stochastic Zeroth-Order Riemannian Derivative Estimation and Optimization 2: ZO-RSGD Has Average Expected Squared Riemannian Gradient Norm at Most 4L(f(x₀) − f(x*))/(N+1) + 2μ²L²(d+6)³ + 16(d+4)σ²/mResearch Paper

Many optimization problems are posed over a manifold rather than a vector space: orthogonality constraints (the Stiefel manifold), unit-norm constraints (the sphere), fixed-rank matrices. In some of them the objective can only be evaluated, not differentiated. Black-box adversarial attacks on a neural network with a norm-constrained perturbation,…

13 thms3 active usersReviewed
Differential GeometryMachine LearningOptimization·Captain: mikedeng1

Stochastic Zeroth-Order Riemannian Derivative Estimation and Optimization 1: ZO-RGD Has Average Expected Squared Riemannian Gradient Norm at Most 8(d+4)L(f(x₀) − f(x*))/(N+1) + 8(d+4)L·C(μ)Research Paper

Many optimization problems in statistics and machine learning constrain the variable to a smooth manifold: orthonormal frames in sparse PCA and dictionary learning (the Stiefel manifold), unit vectors in phase retrieval (the sphere), fixed-rank matrices in matrix completion. Riemannian optimization handles these problems directly on the manifold. A step is…

13 thms3 active usersReviewed
Algorithmic Game TheoryLinear Optimization·Captain: mikedeng1

Quantum Algorithms for Zero-Sum Games 1: With Step ε/4, Grigoriadis–Khachiyan Sampling Play Yields ε-Optimal Strategies After ⌈16 ln(nm/δ)/ε²⌉ Iterations with Probability ≥ 1 − δResearch Paper

Two-player zero-sum matrix games are the simplest model of strict competition, and computing their value is equivalent to linear programming. Many algorithms in optimization and learning (boosting, online learning with experts, approximate LP and SDP solvers) are, at their core, procedures that approximately solve such a game. For large games the cost of…

10 thms3 active usersReviewed
AnalysisOperations ResearchOptimization·Captain: mikedeng1

Sample-Driven Optimal Stopping: From the Secretary Problem to the i.i.d. Prophet Inequality II: The Optimal Competitive Ratio Tends to the i.i.d. Prophet Constant as p Tends to 1Research Paper

Optimal stopping with samples sits between two classical problems. In the secretary problem a decision maker sees items in random order, knows nothing about their values, and must stop on one; the best guarantee is 1/e1/e1/e. In the i.i.d. prophet inequality the values are independent draws from a known distribution, and the best guarantee against the expected…

14 thms3 active usersReviewed
PreviousPage 15 of 48Next

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