Obserwuj
Sitan Chen
Sitan Chen
Zweryfikowany adres z berkeley.edu - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Linear programming bounds for randomly sampling colorings
S Chen, A Moitra
arXiv preprint arXiv:1804.03156, 2018
48*2018
Quantum advantage in learning from experiments
HY Huang, M Broughton, J Cotler, S Chen, J Li, M Mohseni, H Neven, ...
Science 376 (6598), 1182-1186, 2022
232022
Learning mixtures of linear regressions in subexponential time via fourier moments
S Chen, J Li, Z Song
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
232020
Entanglement is Necessary for Optimal Quantum Property Testing
S Bubeck, S Chen, J Li
Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science, 2020
212020
Exponential separations between learning with and without quantum memory
S Chen, J Cotler, HY Huang, J Li
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
162022
Beyond the low-degree algorithm: mixtures of subcubes and their applications
S Chen, A Moitra
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
162019
Learning deep relu networks is fixed-parameter tractable
S Chen, AR Klivans, R Meka
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
152022
Algorithmic foundations for the diffraction limit
S Chen, A Moitra
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2020
152020
Efficiently learning structured distributions from untrusted batches
S Chen, J Li, A Moitra
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
142020
Classification under misspecification: Halfspaces, generalized linear models, and evolvability
S Chen, F Koehler, A Moitra, M Yau
Advances in Neural Information Processing Systems 33, 8391-8403, 2020
14*2020
Online and distribution-free robustness: Regression and contextual bandits with huber contamination
S Chen, F Koehler, A Moitra, M Yau
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
102022
Pseudorandomness for read-once, constant-depth circuits
S Chen, T Steinke, S Vadhan
arXiv preprint arXiv:1504.04675, 2015
92015
Learning Polynomials of Few Relevant Dimensions
S Chen, R Meka
Proceedings of the 33rd Annual Conference on Learning Theory, 2020
82020
Learning Structured Distributions From Untrusted Batches: Faster and Simpler
S Chen, J Li, A Moitra
Advances in Neural Information Processing Systems 33, 2020
82020
On InstaHide, Phase Retrieval, and Sparse Matrix Factorization
S Chen, X Li, Z Song, D Zhuo
International Conference on Learning Representations (ICLR), 2020
72020
Toward instance-optimal state certification with incoherent measurements
S Chen, J Li, R O'Donnell
arXiv preprint arXiv:2102.13098, 2021
52021
Basis collapse for holographic algorithms over all domain sizes
S Chen
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
42016
Kalman filtering with adversarial corruptions
S Chen, F Koehler, A Moitra, M Yau
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
32022
Efficiently Learning One Hidden Layer ReLU Networks From Queries
S Chen, A Klivans, R Meka
Advances in Neural Information Processing Systems 34, 24087-24098, 2021
3*2021
Learning polynomial transformations
S Chen, J Li, Y Li, AR Zhang
arXiv preprint arXiv:2204.04209, 2022
22022
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20