Skip to content

Author

Hong-Hao Lin

We have 6 of 34 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

A Proof of the Most Informative Boolean Function Conjecture

Let $X$ be uniform on $\{-1,1\}^n$, let $Y$ be obtained by passing its coordinates independently through a binary symmetric channel with crossover probability $p$, and let $g:\{-1,1\}^n\to\{0,1\}$ be a Boolean function. We give a computer-assisted proof of the Courtade--Kumar conjecture $I(g(X);Y)\le1-H_2(p)$, where $H...

Zi-Jie Chen, Amin Gohari, Adel Javanmard et al. · 0 citations
Preprint Aug 2026

The Condition-Number Barrier in Sparse Least Squares

In [AS21], Axiotis and Sviridenko conjectured that the linear dependence on the restricted condition number in sparse convex optimization cannot be improved by a polynomial-time algorithm. We establish their conjectured lower bound for least-squares objectives, conditional on the randomized exact-volume Small-Set Expan...

Hong-Hao Lin, V. Mirrokni, David P. Woodruff · 1 citation
#artificial intelligence Preprint Sep 2026

Stellar Colosseum: A Many-Agent Harness for Long-Horizon Research in Mathematics and Theoretical Computer Science

Language models can produce plausible short proofs, but may still be unreliable on long-horizon research problems, where progress depends on a sequence of uncertain and interdependent decisions. We introduce Stellar Colosseum, a model-agnostic harness for allocating inference across research in mathematics and theoreti...

Hong-Hao Lin, David P. Woodruff, Yuan Deng et al. · 1 citation · ⚡1
Preprint Aug 2026

A Near-Optimal Lower Bound for Prefix-Matrix Factorizations

For the $n\times n$ lower-triangular all-ones matrix $Q$, we prove a near-optimal lower bound \[ \gamma_{2,1}(Q) := \inf_{Q=AB} \|A\|_{2\to\infty}\|B\|_{1\to1} = \Omega\!\left( \frac{\log^{3/2}n}{(\log\log n)^{3/2}} \right), \] where the infimum ranges over real factorizations of arbitrary finite inner dimension. This...

Hong-Hao Lin, V. Mirrokni, David P. Woodruff · 2 citations
Preprint Aug 2026

Pairwise-Independent Dithering for Single-Stage Hadamard Quantization

This work eliminates the residual-stage $O(d)$-bit payload and reduces the leading upper-bound constant by a factor of approximately $5.93$ compared with the two-stage construction of Feng et al.

Hong-Hao Lin, V. Mirrokni, David P. Woodruff · 1 citation
Preprint Jul 2026

Adversarial Robustness for Small Frequency Moments and a Weak Equivalence Theorem for Turnstile Streams

It is proved that for any sub-multiplicative norm, the existence of an efficient classical linear sketch is equivalent to the existence of an efficient robust turnstile algorithm, up to polynomial factors, formalizing $L_1$ embeddability as the fundamental mechanism governing both models.

Elena Gribelyuk, Honghao Lin, David P. Woodruff et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.