Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQiuyi (Richard) Zhang
Person information
- unicode name: 张秋逸
- affiliation: Google Brain, Pittsburgh, PA, USA
- affiliation: University of California at Berkeley, Department of Mathematics, CA, USA
- affiliation: Princeton University, NJ, USA
Other persons with the same name
- Qiuyi Zhang — disambiguation page
- Qiuyi Zhang 0002 — University at Buffalo, Department of Geography, Buffalo, NY, USA
- Richard Zhang — disambiguation page
- Richard Zhang 0001
![[0000-0003-2507-4674]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0003-2507-4674")
— Adobe Research, San Francisco, CA, USA (and 1 more) - Hao (Richard) Zhang (aka: Hao Zhang 0002, Richard Zhang 0002) — Simon Fraser University, Burnaby, Canada
- Richard Zhang 0004 — University of Pennsylvania, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c15]Yeshwanth Cherapanamjeri, Sandeep Silwal, David P. Woodruff, Fred Zhang, Qiuyi Zhang, Samson Zhou:
Robust Algorithms on Adaptive Inputs from Bounded Adversaries. ICLR 2023- [i17]Yeshwanth Cherapanamjeri, Sandeep Silwal, David P. Woodruff, Fred Zhang, Qiuyi Zhang, Samson Zhou:
Robust Algorithms on Adaptive Inputs from Bounded Adversaries. CoRR abs/2304.07413 (2023) - [i16]Tamás Sarlós, Xingyou Song, David P. Woodruff, Qiuyi Zhang:
Hardness of Low Rank Approximation of Entrywise Transformed Matrix Products. CoRR abs/2311.01960 (2023) - [i15]Swati Padmanabhan, David P. Woodruff, Qiuyi (Richard) Zhang:
Computing Approximate 𝓁p Sensitivities. CoRR abs/2311.04158 (2023) - 2022
- [c14]Ashok Cutkosky, Christoph Dann, Abhimanyu Das, Qiuyi (Richard) Zhang:
Leveraging Initial Hints for Free in Stochastic Linear Bandits. ALT 2022: 282-318 - [c13]Yutian Chen, Xingyou Song, Chansoo Lee, Zi Wang, Richard Zhang, David Dohan, Kazuya Kawakami, Greg Kochanski, Arnaud Doucet, Marc'Aurelio Ranzato, Sagi Perel, Nando de Freitas:
Towards Learning Universal Hyperparameter Optimizers with Transformers. NeurIPS 2022 - [c12]David P. Woodruff, Fred Zhang, Richard Zhang:
Optimal Query Complexities for Dynamic Trace Estimation. NeurIPS 2022 - [i14]Ashok Cutkosky, Christoph Dann, Abhimanyu Das, Qiuyi (Richard) Zhang:
Leveraging Initial Hints for Free in Stochastic Linear Bandits. CoRR abs/2203.04274 (2022) - [i13]Yutian Chen, Xingyou Song, Chansoo Lee, Zi Wang, Qiuyi Zhang, David Dohan, Kazuya Kawakami, Greg Kochanski, Arnaud Doucet, Marc'Aurelio Ranzato, Sagi Perel, Nando de Freitas:
Towards Learning Universal Hyperparameter Optimizers with Transformers. CoRR abs/2205.13320 (2022) - [i12]David P. Woodruff, Fred Zhang, Qiuyi Zhang:
Optimal Query Complexities for Dynamic Trace Estimation. CoRR abs/2209.15219 (2022) - 2021
- [j3]Thien Le, Aaron Sy, Erin K. Molloy, Qiuyi Zhang, Satish Rao, Tandy J. Warnow:
Using Constrained-INC for Large-Scale Gene Tree and Species Tree Estimation. IEEE ACM Trans. Comput. Biol. Bioinform. 18(1): 2-15 (2021) - [c11]Atish Agarwala, Abhimanyu Das, Brendan Juba, Rina Panigrahy, Vatsal Sharan, Xin Wang, Qiuyi Zhang:
One Network Fits All? Modular versus Monolithic Task Formulations in Neural Networks. ICLR 2021 - [c10]Shuli Jiang, Hai Pham, David P. Woodruff, Qiuyi (Richard) Zhang:
Optimal Sketching for Trace Estimation. NeurIPS 2021: 23741-23753 - [i11]Atish Agarwala, Abhimanyu Das, Brendan Juba, Rina Panigrahy, Vatsal Sharan, Xin Wang, Qiuyi Zhang:
One Network Fits All? Modular versus Monolithic Task Formulations in Neural Networks. CoRR abs/2103.15261 (2021) - [i10]Shuli Jiang, Hai Pham, David P. Woodruff, Qiuyi (Richard) Zhang:
Optimal Sketching for Trace Estimation. CoRR abs/2111.00664 (2021) - 2020
- [c9]Daniel Golovin, John Karro, Greg Kochanski, Chansoo Lee, Xingyou Song, Qiuyi (Richard) Zhang:
Gradientless Descent: High-Dimensional Zeroth-Order Optimization. ICLR 2020 - [c8]Rajesh Jayaram, David P. Woodruff, Qiuyi Zhang:
Span Recovery for Deep Neural Networks with Applications to Input Obfuscation. ICLR 2020 - [c7]Qiuyi (Richard) Zhang, Daniel Golovin:
Random Hypervolume Scalarizations for Provable Multi-Objective Black Box Optimization. ICML 2020: 11096-11105 - [i9]Rajesh Jayaram, David P. Woodruff, Qiuyi Zhang:
Span Recovery for Deep Neural Networks with Applications to Input Obfuscation. CoRR abs/2002.08202 (2020) - [i8]Atish Agarwala, Abhimanyu Das, Rina Panigrahy, Qiuyi Zhang:
Learning the gravitational force law and other analytic functions. CoRR abs/2005.07724 (2020) - [i7]Daniel Golovin, Qiuyi (Richard) Zhang:
Random Hypervolume Scalarizations for Provable Multi-Objective Black Box Optimization. CoRR abs/2006.04655 (2020)
2010 – 2019
- 2019
- [b1]Qiuyi (Richard) Zhang:
Fast Algorithms for Interior Point Methods. University of California, Berkeley, USA, 2019 - [j2]Qiuyi Zhang, Satish Rao, Tandy J. Warnow:
Constrained incremental tree building: new absolute fast converging phylogeny estimation methods with improved scalability and accuracy. Algorithms Mol. Biol. 14(1): 2:1-2:12 (2019) - [c6]Thien Le, Aaron Sy, Erin K. Molloy, Qiuyi (Richard) Zhang, Satish Rao, Tandy J. Warnow:
Using INC Within Divide-and-Conquer Phylogeny Estimation. AlCoB 2019: 167-178 - [c5]Yin Tat Lee, Zhao Song, Qiuyi Zhang:
Solving Empirical Risk Minimization in the Current Matrix Multiplication Time. COLT 2019: 2140-2157 - [c4]Frank Ban, David P. Woodruff, Qiuyi (Richard) Zhang:
Regularized Weighted Low Rank Approximation. NeurIPS 2019: 4061-4071 - [c3]Arun Ganesh, Qiuyi (Richard) Zhang:
Optimal sequence length requirements for phylogenetic tree reconstruction with indels. STOC 2019: 721-732 - [i6]Yin Tat Lee, Zhao Song, Qiuyi Zhang:
Solving Empirical Risk Minimization in the Current Matrix Multiplication Time. CoRR abs/1905.04447 (2019) - [i5]Daniel Golovin, John Karro, Greg Kochanski, Chansoo Lee, Xingyou Song, Qiuyi (Richard) Zhang:
Gradientless Descent: High-Dimensional Zeroth-Order Optimization. CoRR abs/1911.06317 (2019) - [i4]Frank Ban, David P. Woodruff, Qiuyi (Richard) Zhang:
Regularized Weighted Low Rank Approximation. CoRR abs/1911.06958 (2019) - 2018
- [c2]Rina Panigrahy, Ali Rahimi, Sushant Sachdeva, Qiuyi Zhang:
Convergence Results for Neural Networks via Electrodynamics. ITCS 2018: 22:1-22:19 - [c1]Qiuyi (Richard) Zhang, Satish Rao, Tandy J. Warnow:
New Absolute Fast Converging Phylogeny Estimation Methods with Improved Scalability and Accuracy. WABI 2018: 8:1-8:12 - [i3]Arun Ganesh, Qiuyi (Richard) Zhang:
Optimal Sequence Length Requirements for Phylogenetic Tree Reconstruction with Indels. CoRR abs/1811.01121 (2018) - 2017
- [j1]Shiva Kintali, Qiuyi Zhang:
Forbidden directed minors and Kelly-width. Theor. Comput. Sci. 662: 40-47 (2017) - [i2]Qiuyi Zhang, Rina Panigrahy, Sushant Sachdeva:
Electron-Proton Dynamics in Deep Learning. CoRR abs/1702.00458 (2017) - 2013
- [i1]Shiva Kintali, Qiuyi Zhang:
Forbidden Directed Minors and Kelly-width. CoRR abs/1308.5170 (2013)
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-04-18 20:28 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:
