Skip to content

Author

Si-Tan Chen

We have 8 of 90 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.

#machine learning Preprint Oct 2026

Are We Overthinking One-Step Generation?

Diffusion and flow matching are now dominant frameworks for generative modeling in continuous domains, but they typically require multiple network evaluations at inference. This has motivated extensive research on one-step generative modeling primarily built on diffusion and flow, though existing approaches often rely...

Woobin Park, Jaeyeon Kim, Yi-Lun Du et al. · 0 citations
Preprint Oct 2026

Learning SYK Hamiltonians

We study the problem of learning the dense Sachdev--Ye--Kitaev (SYK) Hamiltonian from copies of its Gibbs state. Existing algorithms for Hamiltonian learning typically rely on geometric locality or bounded interaction degree and therefore do not apply to SYK, where each quartic interaction overlaps with $\Theta(n^3)$ o...

Anurag Anshu, Srinivasan Arunachalam, Si-Tan Chen et al. · 0 citations
#machine learning Preprint Oct 2026

Out-of-control Hamiltonian Learning

Learning the Hamiltonian of a many-body system from its dynamics is a central task in quantum science, yet the algorithms with the strongest provable guarantees assume some level of quantum control--fast, arbitrary single-qubit gates interleaved with time evolution, and measurements in arbitrary bases--that is beyond t...

W. Gong, Mu-Zhou Ma, Si-Tan Chen et al. · 0 citations
#artificial intelligence Preprint Oct 2026

Finetuning with Sampling: SFT Learns Better Than You Think

Introducing new capabilities to frontier models has long been the goal of posttraining, which predominantly employs supervised finetuning (SFT) and reinforcement learning (RL) to this end. Conventional wisdom dictates that RL enables strong generalization on new tasks without losing existing capabilities, while SFT is...

Aayush Karan, Si-Tan Chen, Yi-Lun Du · 2 citations
#machine learning Preprint Sep 2026

Blackboard Intelligence Can Surpass Autoregressive on Globally Constrained Problems

This work studies blackboard intelligence: an inference-time perspective in which a model works on a fixed, revisable canvas and searches over candidate solution states rather than committing to a causal, left-to-right trajectory, and concludes that mean confidence, a simple model-internal quantity available from the s...

Woosang Jeon, Jaeyeon Kim, S. Kakade et al. · 0 citations
#small language model Preprint Sep 2026

Parallelism, critical windows, and separations among diffusion language models

A fine-grained comparison of the capacity for parallelism among these three leading approaches is initiated and it is proved that uniform and Gaussian diffusion can sample in a number of forward passes which scales with the dual total correlation of the underlying distribution.

Si-Tan Chen, Li-Ye Wang · 1 citation
Jul 2026

Online Shadow Tomography Matching the Classical Bounds

The key to the proof is a new framework for quantifying post-measurement damage, based on the quantum Efron-Stein decomposition, which improves all three exponents even in the Offline Shadow Tomography setting.

Si-Tan Chen, R. O'Donnell, Angelos Pelecanos et al. · 2 citations · ⚡1
Jul 2026

The log log jam in Gaussian state tomography

Unlike in finite dimensions, quantum information in continuous-variable systems has the peculiar feature that without imposing physical constraints, the sample complexity of state tomography can be unbounded. Remarkably, this is even the case for state-of-the-art protocols for learning Gaussian states, which have finit...

Si-Tan Chen, W. Gong, Qi Ye et al. · 2 citations · ⚡1

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