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
Machine LearningStatisticsTheoretical Computer Science·Captain: Shuze Chen

Distribution-Robust Halfspace TestingResearch Paper

A halfspace (linear classifier) x↦sign⁡(⟨w,x⟩−t)x\mapsto\operatorname{sign}(\langle w,x\rangle-t)x↦sign(⟨w,x⟩−t) is the simplest model for labelled data in Rn\mathbb R^nRn. Before training one, it is useful to know whether the labels are close to linearly separable. A property tester decides this from far less data than a learner needs, the "model selection" motivation of Goldreich,…

20 thms2 active usersReviewed
Control TheoryStochastic SystemsTheoretical Computer Science·Captain: iris

Exact Universality of Online DiscrepancyResearch Paper

In online vector balancing, vectors ξ1,…,ξN∈RM\xi_1,\dots,\xi_N\in\mathbb R^Mξ1​,…,ξN​∈RM arrive one at a time and an algorithm must fix a sign εk∈{−1,+1}\varepsilon_k\in\{-1,+1\}εk​∈{−1,+1} for each vector before the next one is revealed, so as to keep the signed sum small in every coordinate. The problem is a basic model of irrevocable decisions under uncertainty, and the same quantity governs the …

33 thms2 active usersReviewed
cryptographyDiscrete Geometry·Captain: iris

Asymptotics of Random-Lattice Enumeration: Beyond HKZ via Dense SublatticesResearch Paper

Lattice enumeration is the exact method for the shortest vector problem (SVP) used inside BKZ-style reduction, and BKZ is how the concrete security of lattice-based cryptography is estimated. Its cost on a basis BBB is the number of nodes T(B)T(B)T(B) of the full enumeration tree. For random lattices the tree size behaves like T(B)=ncn+o(n)T(B)=n^{cn+o(n)}T(B)=ncn+o(n), and the constant ccc deci…

44 thms2 active usersReviewed
CombinatoricsGraph Theory·Captain: iris

Universality in random graphs via optimal linking systems: trees and beyondResearch Paper

A graph GGG is universal for a family F\mathcal FF if it contains a copy of every member of F\mathcal FF as a subgraph. Sparse universal graphs for bounded-degree trees were first studied for circuit design (Friedman–Pippenger 1987; Bhatt, Chung, Leighton and Rosenberg 1989). The probabilistic question is how large ppp must be for the binomial random graph G(n,p)G(n,p)G(n,p) to…

40 thms2 active usersReviewed
Convex OptimizationRandom Matrix TheoryTheoretical Computer Science·Captain: Shuze Chen

Recovering Planted Subgraphs in Smoothed ModelsResearch Paper

A graph can contain a large structured region even when the rest of the graph is unreliable. Recovering that region asks for more than detecting that it exists: an algorithm must identify most of its vertices without selecting too many unrelated ones. Random models can make this task tractable, but fully random assumptions also remove the adversarial…

26 thms2 active usersReviewed
🏆Completed
cryptographyTheoretical Computer Science·Captain: iris

Correlated Group Actions: Founding Cryptography on S4 and SnResearch Paper

Oblivious transfer (OT) is a two-party primitive in which a sender holds two bits m0,m1m_0, m_1m0​,m1​, a receiver holds a selection bit sss, and the receiver learns msm_sms​ while the sender learns nothing about sss and the receiver learns nothing about the other bit m1−sm_{1-s}m1−s​. Kilian showed in 1988 that OT is complete for secure two-party computation: any function can be…

15 thms2 active usersReviewed
CombinatoricsComplexity TheoryOperations Research·Captain: Shuze Chen

The Movement Complexity of SortingResearch Paper

The comparison model counts comparisons and gives sorting its classical Θ(nlog⁡n)\Theta(n\log n)Θ(nlogn). On many machines that is not the whole cost: before two keys can be compared they must be brought within reach of the machine's read heads, and the heads travel. Head travel is already known to dominate in sequential models — on a Turing machine with one worktape and a…

24 thms2 active usersReviewed
Computational ComplexityTheoretical Computer Science·Captain: Shuze Chen

Exact Parallel Sampling without Maximal Independent SetsResearch Paper

A counting oracle for a distribution μ\muμ on [q]n[q]^n[q]n answers a query (S,y)(S,y)(S,y) with the marginal probability Pr⁡X∼μ[XS=y]\Pr_{X\sim\mu}[X_S=y]PrX∼μ​[XS​=y]. Any-order autoregressive and masked diffusion models provide exactly this access. With it, μ\muμ can be sampled coordinate by coordinate, but that takes nnn sequential rounds. The question of parallel sampling is how many adaptive rounds…

23 thms2 active usersReviewed
Complexity TheoryInformation TheoryTheoretical Computer Science·Captain: Shuze Chen

Tight Bounds for Rank Estimation in Turnstile StreamsResearch Paper

A rank query asks how much of a dataset lies below a threshold; together with its inverse, the select (quantile) query, it summarizes the empirical distribution of the data: medians, percentiles, tail behaviour, and selectivity estimates for database queries. When the data change through insertions and deletions (database records removed, network sessions…

24 thms2 active usersReviewed
CombinatoricsGraph Theory·Captain: mikedeng1

Adaptive Sparsifier Revisited: (1±ϵ)(1 \pm \epsilon)(1±ϵ)-Approximate, Fast, and SimpleResearch Paper

A spectral sparsifier replaces a graph by a smaller reweighted subgraph while approximately preserving the energy of every real vector on its vertices. This allows graph algorithms to use a smaller representation without losing the quadratic quantities they need. The source identifies Laplacian systems, random walks, and flow algorithms as applications. In…

20 thms2 active usersReviewed
CombinatoricsTheoretical Computer Science·Captain: mikedeng1

The Local Probe Complexity of Maximal Independent SetResearch Paper

A maximal independent set in a graph is a collection of vertices with no edge between two chosen vertices, such that every unchosen vertex has a chosen neighbor. A local computation algorithm answers whether a queried vertex belongs to one fixed solution while inspecting only part of the graph. Different queries must agree with that solution even though…

22 thms2 active usersReviewed
AnalysisFunctional Analysis·Captain: iris

An O(1)O(1)O(1) Bound for the KLS ConstantResearch Paper

The Kannan–Lovász–Simonovits (KLS) conjecture (Kannan, Lovász, Simonovits, 1995) asks whether isotropic log-concave probability measures satisfy an isoperimetric inequality with a constant independent of the dimension: up to a universal factor, halfspaces should be the sets with the smallest boundary relative to their measure. The conjecture sits at the…

19 thms2 active usersReviewed
Graph TheoryTheoretical Computer Science·Captain: iris

Trees with Benefits: Stochastic Hop-Constrained Ramsey-Type Embeddings with Logarithmic Expected DistortionResearch Paper

Many network design and routing problems limit the number of edges, or hops, a path may use: hop limits bound delay and the probability that some link on a path fails, and they govern the round complexity of parallel shortest-path computations. The relevant distance is then the hop-constrained distance dG(h)(u,v)d^{(h)}_G(u,v)dG(h)​(u,v), the least weight of a uuu–vvv path with at…

31 thms2 active usersReviewed
CombinatoricsTheoretical Computer Science·Captain: mikedeng1

The Query Cost of Certifying a RankingResearch Paper

A comparison system can produce a useful ranking while leaving substantial uncertainty about what its acquired answers justify. This matters when a released estimate must be defensible from a public record: a user who did not observe an estimator's private choices needs a guarantee that survives every plausible explanation of the comparisons. Persistent…

39 thms2 active usersReviewed
Harmonic AnalysisTheoretical Computer Science·Captain: mikedeng1

Sharp Limits of Time Invariance in Private Continual CountingResearch Paper

Continual counting releases an estimate of a running sum whenever another stream element arrives. The same person’s contribution must remain protected across the entire sequence of releases. Streams without a known stopping time make this a distinct design problem: a mechanism chosen for one horizon does not automatically define one mechanism that works…

23 thms2 active usersReviewed
CombinatoricsGraph Theory·Captain: mikedeng1

Approximating the Girth of an Undirected, Weighted Graph for Larger Approximation FactorsResearch Paper

The weighted girth of an undirected graph is the minimum total edge weight of a cycle. Computing this quantity asks for the least expensive closed route with no repeated intermediate vertex or edge. Approximation algorithms trade precision for running time: instead of finding the minimum exactly, they return a number within a specified multiplicative…

7 thms2 active usersReviewed
Convex OptimizationStatisticsTheoretical Computer Science·Captain: mikedeng1

An Exact-Radius Convex Characterization of Discrete Identity TestingResearch Paper

Identity testing asks whether observations follow a specified probability distribution or a distribution farther than a prescribed distance from it. For a known finite reference, the amount of data needed can depend on the distribution of mass across labels, including a dominant atom, a light tail, and labels with zero reference probability. A bound that…

24 thms2 active usersReviewed
Theoretical Computer Science·Captain: mikedeng1

The Online k-Taxi Problem Is Competitive on All MetricsResearch Paper

In the online k-taxi problem [FRR90], k taxis sit in a metric space and requests arrive one at a time, each an ordered pair of a pickup point and a drop-off point. An online algorithm must pick the serving taxi without knowing future requests. The classical k-server problem is the special case where every pickup equals its drop-off. The problem models…

22 thms2 active usersReviewed
Machine LearningTheory of Computation·Captain: mikedeng1

The Price of List Replicability: Tight Bounds for Bias EstimationResearch Paper

A statistical estimate can be accurate while changing from one independent sample to another. List replicability asks for more: for each underlying distribution there must be a small fixed list of accurate answers, and the algorithm must return one of them with high probability. The list depends on the distribution, rather than the observed samples or…

27 thms2 active usersReviewed
Machine LearningTheoretical Computer Science·Captain: mikedeng1

Lower Bounds for Parallel Diffusion SamplingResearch Paper

A diffusion sampler produces a random vector by repeatedly asking for information about a distribution after Gaussian noise has been added. Such queries are often the expensive part of generation. Parallel implementations can evaluate many proposed locations simultaneously, but the next batch can still depend on earlier answers. The question is how many…

25 thms2 active usersReviewed
CombinatoricsTheoretical Computer Science·Captain: mikedeng1

The Strong Secretary Conjecture is True for Linear MatroidsResearch Paper

In the Matroid Secretary Problem, introduced by Babaioff, Immorlica and Kleinberg (SODA 2007; J. ACM version), the elements of a matroid carry nonnegative weights and arrive in uniformly random order. On each arrival the algorithm learns the element's weight and must decide irrevocably whether to keep it, while the kept set stays independent. The model…

18 thms2 active usersReviewed
Complexity TheoryStatistics·Captain: mikedeng1

The Polynomial-Time Low-Degree Conjecture is FalseResearch Paper

The low-degree method studies whether a statistic given by a polynomial of bounded degree can distinguish a structured random observation from an unstructured one. In statistical inference and average-case complexity, failure of such tests is often used as evidence that efficient algorithms will also fail. The polynomial-time conjecture considered here adds…

18 thms2 active usersReviewed
🏆Completed
Operations ResearchTheoretical Computer Science·Captain: mikedeng1

Tight weighted paging with delay via mirror descentResearch Paper

A cache can avoid repeated downloads by retaining useful pages. When requests may wait, it can also batch several requests for the same page into one download. These two choices interact: waiting may save a fetch, but holding a page while waiting occupies space that another page needs. Weighted paging with delay asks for an online rule that balances these…

19 thms2 active usersReviewed
🏆Completed
Operations ResearchTheoretical Computer Science·Captain: mikedeng1

Tight Bounds for Randomized Generalized k-Server on Uniform MetricsResearch Paper

The generalized kkk-server problem was introduced by Koutsoupias and Taylor (KT04) as a model of kkk heterogeneous servers, each moving in its own metric space, that must jointly answer requests naming one location per server. It contains the classical kkk-server problem, weighted kkk-server, and paging with heterogeneous cache slots as special cases, and it is a…

12 thms2 active usersReviewed
CombinatoricsInformation Theory·Captain: mikedeng1

List Size of Random Linear Codes: Optimality and the Limits of Average-Radius List DecodingResearch Paper

A code is a collection of words used to distinguish messages after transmission errors. When errors make unique recovery impossible, list decoding permits several candidate messages. Its combinatorial requirement is that a ball around any received word contain only a limited number of codewords. Researchers in coding theory study how that list size grows as…

19 thms2 active usersReviewed
PreviousPage 59 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