Sitan Chen
where else to find them
what they talk about
where they keep going back
no series more than once — all 3 in the filters
on a stage with
- Ruizhe Zhangonce
- Runzhou Taoonce
- Zhao Songonce
who talks about the same things
- Zhao Song2 talks
- Runzhou Tao6 talks
- Ruizhe Zhang2 talks
- Lijie Chen9 talks
- Toniann Pitassi5 talks
- Samson Zhou4 talks
| title | conference | date |
|---|---|---|
| Symmetric Sparse Boolean Matrix Factorization and Applications | ITCS 2022 | 2022-01-31 |
Average-case result recovers a K‑sparse Boolean factor W from M = W W^T when each row of W is an independent uniform K‑subset, with high probability and… | ||
| Distribution-Free Robustness | Meet the Fellows Welcome Event | 2021-09-08 |
Provides an efficient algorithm that tolerates up to a 50% fraction of arbitrary corruptions and achieves near‑optimal clean mean squared error (up to log… | ||
| Basis Collapse for Holographic Algorithms Over all Domain Sizes | The Classification Program of Counting Complexity | 2016-03-28 |
Proves a collapse: for domain size K any holographic algorithm that uses a full‑rank matchgate can be simulated with basis size l = floor(log2 K). Proof uses… | ||
| nothing matches | ||