Skip to content

7 papers indexed here

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.

#artificial intelligence Preprint Oct 2026

Adaptive Multi-Token Prediction: How far should we go?

Multi-token prediction (MTP) can accelerate language-model decoding by drafting several tokens and verifying them in a single target-model pass. However, the best speculation horizon changes with context: longer drafts offer greater amortization when reliable, but can waste compute on suffixes discarded after a rejecti...

E. Anand, M. Parwani, Xin-Yuan Cao · 0 citations
Preprint Oct 2026

The Koml\'os Problem in Matrix-Multiplication Time

We give a randomized algorithm that, for an $m\times n$ matrix whose columns have Euclidean norm at most one, finds a signing with discrepancy below $99$ in expected $\widetilde O(L_{\mathrm{in}}+n^\omega)$ bit operations, where $L_{\mathrm{in}}$ is the input encoding length and $\omega$ is the exponent of matrix multi...

E. Anand, Peter Chen · 1 citation
Preprint Oct 2026

Finite-Precision Gram-Schmidt Walks

This work analyzes the concentration of the perturbed Gram-Schmidt walk directly under bounded, potentially biased and history-dependent errors, and constructs a full-column-rank instance in which bounded update errors produce bias of order $\min\{n^2\varepsilon,n\}$, showing that updates accumulate error unavoidably u...

E. Anand, J. W. van den Brand, Peter Chen · 0 citations
Preprint Aug 2026

Good Stabilizer Codes from Shallow Clifford Circuits with Random Matchings

Encoding quantum information with low circuit overhead is a fundamental challenge in fault-tolerant quantum computation. Random circuits provide a natural mechanism for rapidly spreading logical information through simple gates applied in parallel. Brown and Fawzi showed that random Clifford circuits on two-qubit Cliff...

E. Anand, Elia Gorokhovsky, Jennifer Hritz et al. · 1 citation
Preprint Oct 2026

Coloring 3-colorable graphs with $O(n^{4/23})$ colors via a Gaussian-cover recursion

A randomized polynomial-time algorithm that colors any promised $3$-colorable graph on $n$ vertices with O(n^{0.17506\dots + \epsilon}) colors is given, which shows that root-conditioned vector colorings can either extract a large independent set from a group or bound its size, forcing a contradiction after constantly...

E. Anand · 0 citations
#artificial intelligence Preprint Oct 2026

Hob-VL: A Benchmark for Visually Grounded Boolean Reasoning

Reliable visual reasoning requires composing multiple visual observations and returning consistent answers to logically equivalent questions. We introduce Hob-VL, a benchmark for visually grounded Boolean reasoning. Hob-VL comprises two tasks: (1) evaluating whether a Boolean rule holds in an image, and (2) identifying...

Yu-Zhou Wang, Emile Anand, Ijay Narang · 0 citations

SMat-Attention: Structured Long-Context Sequence Modeling

This work introduces Structured Matrix Attention via a family of causal masks with structured long-range routing whose row supports have VC-dimension, which makes VC-dimension an explicit knob governing access-pattern complexity, prefill cost, and decoding memory.

E. Anand, Abdullah Ateyeh, Archer Wang et al. · 3 citations

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