![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 79 matches
- 2024
- Sitan Chen, Shyam Narayanan:
A faster and simpler algorithm for learning shallow networks. COLT 2024: 981-994 - Sitan Chen
, Jerry Li
, Allen Liu
:
An Optimal Tradeoff between Entanglement and Copy Complexity for State Tomography. STOC 2024: 1331-1342 - Sitan Chen, Yuanzhi Li:
Provably learning a multi-head attention layer. CoRR abs/2402.04084 (2024) - Sitan Chen, Jerry Li, Allen Liu:
An optimal tradeoff between entanglement and copy complexity for state tomography. CoRR abs/2402.16353 (2024) - Marvin Li, Sitan Chen:
Critical windows: non-asymptotic theory for feature emergence in diffusion models. CoRR abs/2403.01633 (2024) - Sitan Chen, Vasilis Kontonis, Kulin Shah:
Learning general Gaussian mixtures with efficient score matching. CoRR abs/2404.18893 (2024) - Sitan Chen, Weiyuan Gong, Qi Ye:
Optimal tradeoffs for estimating Pauli observables. CoRR abs/2404.19105 (2024) - Shivam Gupta, Linda Cai, Sitan Chen:
Faster Diffusion-based Sampling with Randomized Midpoints: Sequential and Parallel. CoRR abs/2406.00924 (2024) - 2023
- Sitan Chen, Zehao Dou, Surbhi Goel, Adam R. Klivans, Raghu Meka:
Learning Narrow One-Hidden-Layer ReLU Networks. COLT 2023: 5580-5614 - Sitan Chen, Brice Huang, Jerry Li, Allen Liu, Mark Sellke:
When Does Adaptivity Help for Quantum State Learning? FOCS 2023: 391-404 - Sitan Chen, Sinho Chewi, Jerry Li, Yuanzhi Li, Adil Salim, Anru Zhang:
Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptions. ICLR 2023 - Sitan Chen, Giannis Daras, Alex Dimakis:
Restoration-Degradation Beyond Linear Diffusions: A Non-Asymptotic Analysis For DDIM-type Samplers. ICML 2023: 4462-4484 - Zihan Zhang, Juan Chen, Sitan Liu, John Impagliazzo
:
Using the Internet of Everything for High-Performance Computing. IoECon 2023: 3-10 - Sitan Chen, Sinho Chewi, Holden Lee, Yuanzhi Li, Jianfeng Lu, Adil Salim:
The probability flow ODE is provably fast. NeurIPS 2023 - Kulin Shah, Sitan Chen, Adam R. Klivans:
Learning Mixtures of Gaussians Using the DDPM Objective. NeurIPS 2023 - Sitan Chen, Jerry Li, Yuanzhi Li, Anru R. Zhang:
Learning Polynomial Transformations via Generalized Tensor Decompositions. STOC 2023: 1671-1684 - Sitan Chen, Giannis Daras, Alexandros G. Dimakis:
Restoration-Degradation Beyond Linear Diffusions: A Non-Asymptotic Analysis For DDIM-Type Samplers. CoRR abs/2303.03384 (2023) - Sitan Chen, Zehao Dou, Surbhi Goel, Adam R. Klivans, Raghu Meka:
Learning Narrow One-Hidden-Layer ReLU Networks. CoRR abs/2304.10524 (2023) - Sitan Chen, Sinho Chewi, Holden Lee, Yuanzhi Li, Jianfeng Lu, Adil Salim:
The probability flow ODE is provably fast. CoRR abs/2305.11798 (2023) - Kulin Shah, Sitan Chen, Adam R. Klivans:
Learning Mixtures of Gaussians Using the DDPM Objective. CoRR abs/2307.01178 (2023) - Sitan Chen, Shyam Narayanan:
A faster and simpler algorithm for learning shallow networks. CoRR abs/2307.12496 (2023) - Sitan Chen, Weiyuan Gong:
Futility and utility of a few ancillas for Pauli channel learning. CoRR abs/2309.14326 (2023) - 2022
- Sitan Chen, Jerry Li, Ryan O'Donnell:
Toward Instance-Optimal State Certification With Incoherent Measurements. COLT 2022: 2541-2596 - Sitan Chen, Jerry Li, Brice Huang, Allen Liu:
Tight Bounds for Quantum State Certification with Incoherent Measurements. FOCS 2022: 1205-1213 - Sitan Chen, Jerry Li, Yuanzhi Li, Raghu Meka:
Minimax Optimality (Probably) Doesn't Imply Distribution Learning for GANs. ICLR 2022 - Sitan Chen, Zhao Song, Runzhou Tao
, Ruizhe Zhang:
Symmetric Sparse Boolean Matrix Factorization and Applications. ITCS 2022: 46:1-46:25 - Wen-Kuo Chen, Lin Sheng Ling, Huang Yu Jie, Pantas H. Silaban, Yuni Kartika Sitanggang, Andri Dayarana K. Silalahi
:
How Travel Vlogs on YouTube Influence Consumer Travel Behavior in Indonesia: Empirical Evidence from fsQCA. IRI 2022: 95-100 - Sitan Chen, Jerry Li, Yuanzhi Li:
Learning (Very) Simple Generative Models Is Hard. NeurIPS 2022 - Sitan Chen, Aravind Gollakota, Adam R. Klivans, Raghu Meka:
Hardness of Noise-Free Learning for Two-Hidden-Layer Neural Networks. NeurIPS 2022 - Sitan Chen, Frederic Koehler, Ankur Moitra, Morris Yau:
Kalman filtering with adversarial corruptions. STOC 2022: 832-845
skipping 49 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-07-27 15:37 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint