Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Collections

ACM STOC 2027

Formalizations of theorems from papers submitted to ACM STOC 2027 (the 59th Annual ACM Symposium on Theory of Computing). Paper list: https://sigact-stoc.github.io/stoc2027/ . Missions here state a main result of a STOC 2027 paper in Lean 4 with Mathlib; each mission's title begins with the paper title.

1499 missions

Missions

1201–1225 of 1499
Open1321Completed178All1499
Graph TheoryMarkov ChainProbability+1·Captain: iris

Local-to-Global Theorems Based on Cones with Applications to Graph ColoringResearch Paper

A proper list coloring of a graph assigns to every vertex a color from its own list so that adjacent vertices get different colors. Sampling a uniformly random proper coloring is a benchmark problem for Markov chain Monte Carlo, for approximate counting, and for the statistical physics of the antiferromagnetic Potts model. The standard sampler is the Glauber…

30 thms2 active usersReviewed
Markov ChainMathematical PhysicsProbability+1·Captain: iris

Simulated annealing and Weak Poincaré inequalities with inverse-polynomial accuracy for the Sherrington-Kirkpatrick modelResearch Paper

The Sherrington–Kirkpatrick (SK) model is the mean-field spin glass: nnn binary spins coupled pairwise by independent Gaussian interactions of both signs (SK75). Its equilibrium theory (replica symmetry breaking, the Parisi formula, the cavity method and the Thouless–Anderson–Palmer (TAP) equations) is a central part of the probability of disordered systems (T…

32 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryMachine LearningOptimization·Captain: iris

Optimal Alternating Regret for Online Learning and GamesResearch Paper

In a repeated two-player game, the players can update simultaneously (both see only the past) or alternately (the second player sees the first player's current move before choosing). Alternating updates are known to speed up learning dynamics in zero-sum games (Wibisono, Tao, Piliouras, NeurIPS 2022; Cevher et al., NeurIPS 2023; Katona, Wang, Wibisono, JMLR…

21 thms2 active usersReviewed
CombinatoricsOptimizationTheoretical Computer Science·Captain: iris

Improved Integrality Gap for Multicommodity Flow on TreesResearch Paper

Unit-demand multicommodity flow on trees is a basic routing problem in approximation algorithms. A tree network has integer edge capacities, and each request asks to route one unit between two vertices along the unique tree path joining them. The goal is to accept a maximum-weight set of requests without exceeding any capacity. The problem is NP-hard and…

42 thms2 active usersReviewed
Convex OptimizationMachine LearningOptimization·Captain: iris

The First-Order Oracle Complexity of Lipschitz Convex Optimization in Nondual SettingsResearch Paper

Minimizing a convex function from first-order information is the basic model of large-scale optimization: an algorithm queries points xtx_txt​ and receives the value f(xt)f(x_t)f(xt​) and a subgradient gtg_tgt​. Its oracle complexity is the error it can guarantee after TTT queries, uniformly over a class of functions. When the feasible set is the unit ball of a norm ∥⋅∥p\|\cdot\|_p∥⋅∥p​ an…

55 thms2 active usersReviewed
Bandit AlgorithmsMachine LearningOperations Research·Captain: iris

Decoupling Corruption and Horizon in Robust Contextual PricingResearch Paper

In dynamic pricing a seller repeatedly posts a price to an arriving buyer and learns only whether the buyer bought. In the contextual version, each buyer comes with an observable feature vector, and the buyer's valuation is a fixed but unknown linear function of it. The seller must learn that linear function from yes/no answers while losing as little…

15 thms2 active usersReviewed
Bandit AlgorithmsMachine LearningOperations Research·Captain: iris

Square-Root Regret for Adversarial Multiplayer Bandits without Collision Information or Shared RandomnessResearch Paper

Consider mmm devices sharing KKK wireless channels. In each time slot every device transmits on one channel, two devices on the same channel both fail, channel qualities change arbitrarily, and a device learns only what it transmitted itself. A device that transmitted nothing cannot tell a bad channel from a collision. This is the multiplayer bandit problem…

43 thms2 active usersReviewed
Markov ChainQuantum Error CorrectionQuantum Information·Captain: iris

Autonomous Quantum Memories from Classical Stochastic ProcessesResearch Paper

A quantum memory stores a qubit for a long time under noise. Passive or autonomous memories do this without measurements and classical feedback: the protection is built into the physical dynamics, typically a Lindblad master equation combining a stabilizer Hamiltonian, local dissipative corrections and noise. The best-known example is the four-dimensional…

51 thms2 active usersReviewed
Convex OptimizationOptimization·Captain: iris

Improved Gradient Complexity for Quasi-Newton Proximal Extragradient Methods via Certified Curvature ReuseResearch Paper

Quasi-Newton methods build a curvature model from gradients alone and use it to take steps that are longer than those of a first-order method. Their classical theory is local. A line of work by Jiang, Jin and Mokhtari embedded quasi-Newton models in the hybrid proximal extragradient (HPE) framework of Monteiro and Svaiter and obtained global, non-asymptotic…

52 thms2 active usersReviewed
Convex OptimizationOperations ResearchOptimization+1·Captain: iris

Single-Machine Guarantees on Unrelated Machines and Beyond: Proportional Fairness for Nonclairvoyant Polytope SchedulingResearch Paper

Many computing and production systems share resources among jobs whose sizes are unknown when they arrive: a cluster splits processors among tasks, a network splits link capacity among flows, a factory splits machines among orders. A scheduler that never learns a job's size until the job finishes is called nonclairvoyant. On a single machine the right…

23 thms2 active usersReviewed
ProbabilityStochastic Systems·Captain: iris

Concentration Inequalities for Branching Random Walks with Applications to Phase Transitions in CSPsResearch Paper

Many random processes in the analysis of algorithms and random structures are sums Sn=X1+⋯+XnS_n=X_1+\dots+X_nSn​=X1​+⋯+Xn​ whose increments are neither independent, nor martingale differences, nor bounded. The sequential generation of random KKK-SAT and qqq-colouring instances is the example that drives Liu and Zhang: each step applies random clauses to the current formula, and…

18 thms2 active usersReviewed
Markov ChainMathematical PhysicsProbability·Captain: iris

Sampling from the Sherrington–Kirkpatrick Model up to CriticalityResearch Paper

The Sherrington–Kirkpatrick (SK) model is the mean-field spin glass: an Ising model on NNN spins in which every pair interacts through an independent Gaussian coupling. It is a standard testbed in statistical physics, probability and the analysis of algorithms, and sampling from its Gibbs measure in the high-temperature regime 0≤β<10\le\beta<10≤β<1 has been a central…

23 thms2 active usersReviewed
🏆Completed
Linear OptimizationTheoretical Computer Science·Captain: hypercube

Approximate Dual Separation for the Cluster LP: a 1.3871.3871.387-approximation for Correlation ClusteringResearch Paper

Suppose every pair of vertices comes with a positive or negative judgment. A partition agrees with a positive judgment when the vertices lie in the same block and with a negative judgment when they lie in different blocks. MinDisagree asks for a partition with as few disagreements as possible. The number of blocks is unrestricted. This mission concerns…

29 thms1 active userReviewed
🏆Completed
Complexity TheoryTheoretical Computer Science·Captain: WizardOfMenlo

Nearly Optimal Hardness for CVP and NCP with PreprocessingResearch Paper

In the nearest codeword problem (NCP) one is given a linear code C⊆FM\mathcal C \subseteq \mathbb F^MC⊆FM over a finite field and a target word t∈FMt \in \mathbb F^Mt∈FM, and must find a codeword closest to ttt in Hamming distance. In the closest vector problem (CVP) one is given a full-rank lattice Λ⊆RM\Lambda \subseteq \mathbb R^MΛ⊆RM and a target t∈RMt \in \mathbb R^Mt∈RM, and must find…

42 thms1 active user
Information TheoryProbabilityReinforcement Learning+1·Captain: iris

Deep Q-Operator: Fixed-Accuracy Adaptive Information and Shared Bellman DecisionsResearch Paper

A Bellman decision compares the scores of a few actions, each built from maxima of a shared critic: ta(Q)=ra+γ∑iwaimax⁡h≤KiQi(h)t_a(Q)=r_a+\gamma\sum_i w_{ai}\max_{h\le K_i}Q_i(h)ta​(Q)=ra​+γ∑i​wai​maxh≤Ki​​Qi​(h) with 0<γ<10<\gamma<10<γ<1. In approximate dynamic programming and value-based reinforcement learning the critic is learned from costly scalar values, so a basic question is how much information about the critic a…

37 thms1 active userReviewed
CombinatoricscryptographyTheoretical Computer Science·Captain: mikedeng1

Optimal Subcubic Byzantine Agreement with Plain PKIResearch Paper

Byzantine agreement (BA) asks nnn parties, up to ttt of which are malicious (byzantine), to agree on a common bit. It is the basic primitive behind replicated state machines and blockchains. In the synchronous model without any setup it is solvable only for t<n/3t<n/3t<n/3 (Pease–Shostak–Lamport 1980). With a public-key infrastructure (PKI), where every party can sign…

23 thms1 active userReviewed
Machine LearningProbabilityTheoretical Computer Science·Captain: mikedeng1

Sketching Language Models for Context AttributionResearch Paper

Context attribution asks how parts of a prompt affect a chosen measurement of a language model's output. For a prompt with nnn tokens, leave-one-out attribution records the measurement after deleting each token individually. Direct evaluation takes nnn model calls. Liaw, Mehta, Velegkas and Zhou study when all these values can be estimated with fewer calls,…

20 thms1 active userReviewed
Linear OptimizationOperations ResearchOptimization+1·Captain: mikedeng1

Strong and Compact Policies for Submodular Markov Decision Processes via LP-Based Submodular OrienteeringResearch Paper

A Markov decision process (MDP) is the standard model of sequential decision making under uncertainty in operations research and reinforcement learning (Puterman 1990). In the classical model the agent collects an additive reward over a finite horizon HHH, and an optimal policy that depends only on the current state and time is found by dynamic programming.

20 thms1 active userReviewed
Quantum InformationTheoretical Computer Science·Captain: mikedeng1

Fast Quantum Byzantine Agreement with Nearly Linear Quantum CommunicationResearch Paper

In Byzantine agreement, nnn processes with input bits must decide a common bit although up to ttt of them behave arbitrarily [PSL80]. Randomized protocols reach agreement quickly when enough common coins are available: random bits that all honest processes obtain identically and that the adversary cannot predict before they are used [BO83, Rab83]. Against a full…

22 thms1 active userReviewed
Complexity TheoryInformation TheoryQuantum Information+1·Captain: iris

Failure of Symmetry of Information for Quantum ComputationsResearch Paper

Symmetry of information is the identity K(x,y)=K(x)+K(y∣x)±O(log⁡(∣x∣+∣y∣+2))K(x,y)=K(x)+K(y\mid x)\pm O(\log(|x|+|y|+2))K(x,y)=K(x)+K(y∣x)±O(log(∣x∣+∣y∣+2)) for plain Kolmogorov complexity (Zvonkin–Levin 1970). It says that the information in a pair splits additively into the information in the first string and the information in the second given the first. Whether this survives time bounds is a long-standing question of…

48 thms1 active userReviewed
Convex OptimizationMachine LearningOptimization+2·Captain: Shuze Chen

Bias-Reduced and Parallel Heavy-Tailed Stochastic Convex Optimization in ℓp\ell_pℓp​ GeometriesResearch Paper

Stochastic convex optimization (SCO) asks for an approximate minimizer of a convex function that can only be probed through noisy subgradients. Two features of modern instances are not captured by the textbook Euclidean, bounded-variance setting. First, the natural geometry is often an ℓp norm with p>2p>2p>2: the feasible region is an ℓp ball and the Lipschitz…

15 thms1 active userReviewed
Complexity TheoryMachine LearningMathematical Logic+1·Captain: Shuze Chen

A Witnessing Duality for ReLU Network DepthResearch Paper

How many hidden layers a ReLU network needs to compute max⁡(x1,…,xn)\max(x_1,\dots,x_n)max(x1​,…,xn​) exactly is a basic question about the expressiveness of depth. Exact representation questions of this kind are studied for real, rational and integer weights. For integer weights, Haase, Hertrich and Loho (arXiv:2302.12553) proved a logarithmic depth lower bound by a modular argument…

7 thms1 active userReviewed
Complexity Theory·Captain: mikedeng1

Limits of LiftingResearch Paper

Monotone circuit lower bounds were first proved by Razborov's approximation method (Razborov 1985): every gate of a small circuit is replaced by an approximating gate, and one shows that every approximator is far from the target function. Razborov also showed that the method, in a natural general form, cannot prove more than linear lower bounds for…

15 thms1 active userReviewed
CombinatoricsComplexity Theory·Captain: mikedeng1

Counting Square Tilings with a Fixed Set of Polyominoes Is #EXP-CompleteResearch Paper

Exact counting asks for the number of solutions rather than whether a solution exists. A tiling problem makes this distinction concrete: a region can admit tilings whose number is difficult to compute even when tileability has an efficient criterion. Restricting the pieces to one fixed family and the region to an ordinary square leaves only one varying…

14 thms1 active userReviewed
AnalysisDiscrete GeometryTheoretical Computer Science·Captain: mikedeng1

A Linear-Time Construction on S^2 Achieving a Sublinear Energy Gap on Smale's Seventh ProblemResearch Paper

Placing NNN points XN={x1,…,xN}X_N=\{x_1,\dots,x_N\}XN​={x1​,…,xN​} on the unit sphere S2⊂R3S^2\subset\mathbb R^3S2⊂R3 so as to minimize the logarithmic energy

14 thms1 active userReviewed
PreviousPage 49 of 60Next

Top contributors

RankContributorAccepted solutionsSubmitted problems
1SCShuze Chen23927601
2DBdbenbenn909166
3SHshivm1630
4PAparclytaxel150172
5LRlreyzin140143
6KMkmehltretter8212219
7MTmartelus trismortuus1050
8BOBoomShaKaLaaaKa93100
9DUducloc920
10GAgaryholm900

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