default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuansi Chen
Person information
- affiliation: Duke University, Department of Statistical Science, USA
- affiliation (former): ETH Zurich, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i12]Yuansi Chen, Khashayar Gatmiry:
A Simple Proof of the Mixing of Metropolis-Adjusted Langevin Algorithm under Smoothness and Isoperimetry. CoRR abs/2304.04095 (2023)- [i11]Yuansi Chen, Khashayar Gatmiry:
When does Metropolized Hamiltonian Monte Carlo provably outperform Metropolis-adjusted Langevin algorithm? CoRR abs/2304.04724 (2023) - [i10]Keru Wu, Yuansi Chen, Wooseok Ha, Bin Yu:
Prominent Roles of Conditionally Invariant Components in Domain Adaptation: Theory and Algorithms. CoRR abs/2309.10301 (2023) - 2022
- [j5]Keru Wu, Scott C. Schmidler, Yuansi Chen:
Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Sampling. J. Mach. Learn. Res. 23: 270:1-270:63 (2022) - [c5]Yuansi Chen, Ronen Eldan:
Localization Schemes: A Framework for Proving Mixing Bounds for Markov Chains (extended abstract). FOCS 2022: 110-122 - [i9]Yuansi Chen, Ronen Eldan:
Localization Schemes: A Framework for Proving Mixing Bounds for Markov Chains. CoRR abs/2203.04163 (2022) - [i8]Yuansi Chen, Ronen Eldan:
Hit-and-run mixing via localization schemes. CoRR abs/2212.00297 (2022) - 2021
- [j4]Yuansi Chen, Peter Bühlmann:
Domain adaptation under structural causal models. J. Mach. Learn. Res. 22: 261:1-261:80 (2021) - [i7]Keru Wu, Scott C. Schmidler, Yuansi Chen:
Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Sampling. CoRR abs/2109.13055 (2021) - 2020
- [j3]Yuansi Chen, Raaz Dwivedi, Martin J. Wainwright, Bin Yu:
Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradients. J. Mach. Learn. Res. 21: 92:1-92:72 (2020) - [i6]Yuansi Chen, Peter Bühlmann:
Domain adaptation under structural causal models. CoRR abs/2010.15764 (2020)
2010 – 2019
- 2019
- [j2]Raaz Dwivedi, Yuansi Chen, Martin J. Wainwright, Bin Yu:
Log-concave sampling: Metropolis-Hastings algorithms are fast. J. Mach. Learn. Res. 20: 183:1-183:42 (2019) - [i5]Yuansi Chen, Raaz Dwivedi, Martin J. Wainwright, Bin Yu:
Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradients. CoRR abs/1905.12247 (2019) - 2018
- [j1]Yuansi Chen, Raaz Dwivedi, Martin J. Wainwright, Bin Yu:
Fast MCMC Sampling Algorithms on Polytopes. J. Mach. Learn. Res. 19: 55:1-55:86 (2018) - [c4]Raaz Dwivedi, Yuansi Chen, Martin J. Wainwright, Bin Yu:
Log-concave sampling: Metropolis-Hastings algorithms are fast! COLT 2018: 793-797 - [i4]Yuansi Chen, Chi Jin, Bin Yu:
Stability and Convergence Trade-off of Iterative Optimization Algorithms. CoRR abs/1804.01619 (2018) - [i3]Yi-An Ma, Yuansi Chen, Chi Jin, Nicolas Flammarion, Michael I. Jordan:
Sampling Can Be Faster Than Optimization. CoRR abs/1811.08413 (2018) - 2017
- [c3]Yuansi Chen, Raaz Dwivedi, Martin J. Wainwright, Bin Yu:
Vaidya walk: A sampling algorithm based on the volumetric barrier. Allerton 2017: 1220-1227 - 2016
- [c2]Yuansi Chen, Cengiz Pehlevan
, Dmitri B. Chklovskii:
Self-calibrating neural networks for dimensionality reduction. ACSSC 2016: 1488-1495 - [i2]Yuansi Chen, Cengiz Pehlevan, Dmitri B. Chklovskii:
Self-calibrating Neural Networks for Dimensionality Reduction. CoRR abs/1612.03480 (2016) - 2014
- [c1]Yuansi Chen, Julien Mairal, Zaïd Harchaoui:
Fast and Robust Archetypal Analysis for Representation Learning. CVPR 2014: 1478-1485 - [i1]Yuansi Chen, Julien Mairal, Zaïd Harchaoui:
Fast and Robust Archetypal Analysis for Representation Learning. CoRR abs/1405.6472 (2014)
Coauthor Index
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.
last updated on 2024-09-13 01:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
