default search action
Yi Li 0002
Person information
- affiliation: Nanyang Technological University, Singapore
- affiliation: Facebook
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
- not to be confused with: Yi Li 0008
Other persons with the same name
- Yi Li — disambiguation page
- Yi Li 0001
(aka: Henry Yi Li) — University of Manchester, School of Materials, UK (and 1 more)
- Yi Li 0003
- Yi Li 0004
- Yi Li 0005
- Yi Li 0006
- Yi Li 0007 — Syracuse University, Department of Electrical Engineering and Computer Science, NY, USA
- Yi Li 0008
- Yi Li 0009
- Yi Li 0010
- Yi Li 0011
- Yi Li 0012 — University of Texas at Austin, Department of Computer Sciences, TX, USA
- Yi Li 0013 — Zhejiang University, Department of Computer Science, Hangzhou, China
- Yi Li 0014 — High School Affiliated to Renmin University of China, Beijing, China (and 1 more)
- Yi Li 0015
- Yi Li 0016
- Yi Li 0017
- Yi Li 0018
- Yi Li 0019
- Yi Li 0020
- Yi Li 0021 — University of California, Irvine, USA
- Yi Li 0022 — University of Hong Kong, Pokfulam, Hong Kong
- Yi Li 0023 — University of South Florida, Florida Center for Cybersecurity, Tampa, FL, USA
- Yi Li 0024 — Chinese Academy of Sciences, Institute of Remote Sensing and Digital Earth, Beijing, China (and 1 more)
- Yi Li 0025 — Google Brain, Mountain View, CA, USA (and 3 more)
- Yi Li 0026 — University of Jinan, School of Electrical Engineering, China
- Yi Li 0027
- Yi Li 0028
- Yi Li 0029
- Yi Li 0030
- Yi Li 0031
- Yi Li 0032
- Yi Li 0033
- Yi Li 0034
- Yi Li 0035
- Yi Li 0036
- Yi Li 0037
- Yi Li 0038 — University of Washington, Seattle, WA, USA (and 2 more)
- Yi Li 0039
- Yi Li 0040
- Yi Li 0041
- Yi Li 0042 — Harbin Institute of Technology, Shenzhen Graduate School, School of Computer Science and Technology, Harbin, China
- Yi Li 0043
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c35]Yi Li, Honghao Lin, David P. Woodruff:
Optimal Sketching for Residual Error Estimation for Matrix and Vector Norms. ICLR 2024 - [i30]Yi Li, Honghao Lin, David P. Woodruff:
Optimal Sketching for Residual Error Estimation for Matrix and Vector Norms. CoRR abs/2408.08494 (2024) - 2023
- [c34]Yi Li, Honghao Lin, David P. Woodruff:
ℓp-Regression in the Arbitrary Partition Model of Communication. COLT 2023: 4902-4928 - [c33]Yi Li, Honghao Lin, Simin Liu, Ali Vakilian, David P. Woodruff:
Learning the Positions in CountSketch. ICLR 2023 - [c32]Yi Li, Honghao Lin, David P. Woodruff:
The ℓp-Subspace Sketch Problem in Small Dimensions with Applications to Support Vector Machines. SODA 2023: 850-877 - [i29]Yi Li, Honghao Lin, Simin Liu, Ali Vakilian, David P. Woodruff:
Learning the Positions in CountSketch. CoRR abs/2306.06611 (2023) - [i28]Yi Li, Honghao Lin, David P. Woodruff:
𝓁p-Regression in the Arbitrary Partition Model of Communication. CoRR abs/2307.05117 (2023) - 2022
- [j8]Zhengyang Guo
Expected size of random Tukey layers and convex layers. Comput. Geom. 103: 101856 (2022) - [c31]Yi Li
Streaming Algorithms with Large Approximation Factors. APPROX/RANDOM 2022: 13:1-13:23 - [c30]Cheng Chen, Yi Li, Yiming Sun:
Online Active Regression. ICML 2022: 3320-3335 - [c29]Yi Li
Lower Bounds for Sparse Oblivious Subspace Embeddings. PODS 2022: 251-260 - [i27]Yi Li, David P. Woodruff:
Tight Bounds for Sketching the Operator Norm, Schatten Norms, and Subspace Embeddings. CoRR abs/2202.09797 (2022) - [i26]Cheng Chen, Yi Li, Yiming Sun:
Online Active Regression. CoRR abs/2207.05945 (2022) - [i25]Yi Li, Honghao Lin, David P. Woodruff, Yuheng Zhang:
Streaming Algorithms with Large Approximation Factors. CoRR abs/2207.08075 (2022) - [i24]Yi Li, Honghao Lin, David P. Woodruff:
The 𝓁p-Subspace Sketch Problem in Small Dimensions with Applications to Support Vector Machines. CoRR abs/2211.07132 (2022) - [i23]Yi Li, Mingmou Liu:
Higher Lower Bounds for Sparse Oblivious Subspace Embeddings. CoRR abs/2212.02913 (2022) - 2021
- [j7]Yi Li
Tight Bounds for the Subspace Sketch Problem with Applications. SIAM J. Comput. 50(4): 1287-1335 (2021) - [c28]Yi Li, David P. Woodruff:
The Product of Gaussian Matrices Is Close to Gaussian. APPROX-RANDOM 2021: 35:1-35:22 - [c27]Yi Li
Learning to Cluster via Same-Cluster Queries. CIKM 2021: 978-987 - [c26]Yi Li, David P. Woodruff, Taisuke Yasuda:
Exponentially Improved Dimensionality Reduction for l1: Subspace Embeddings and Independence Testing. COLT 2021: 3111-3195 - [c25]Yifei Jiang, Yi Li, Yiming Sun, Jiaxin Wang, David P. Woodruff:
Single Pass Entrywise-Transformed Low Rank Approximation. ICML 2021: 4982-4991 - [c24]Zhengyang Guo, Yi Li:
Geometric Cover with Outliers Removal. STACS 2021: 39:1-39:15 - [i22]Yi Li, Honghao Lin, David P. Woodruff:
Learning-Augmented Sketches for Hessians. CoRR abs/2102.12317 (2021) - [i21]Yi Li, David P. Woodruff, Taisuke Yasuda:
Exponentially Improved Dimensionality Reduction for 𝓁1: Subspace Embeddings and Independence Testing. CoRR abs/2104.12946 (2021) - [i20]Yifei Jiang, Yi Li, Yiming Sun, Jiaxin Wang, David P. Woodruff:
Single Pass Entrywise-Transformed Low Rank Approximation. CoRR abs/2107.07889 (2021) - [i19]Yi Li, Yan Song, Qin Zhang:
Learning to Cluster via Same-Cluster Queries. CoRR abs/2108.07383 (2021) - [i18]Yi Li, David P. Woodruff:
The Product of Gaussian Matrices is Close to Gaussian. CoRR abs/2108.09887 (2021) - [i17]Yi Li, Mingmou Liu:
Lower Bounds for Sparse Oblivious Subspace Embeddings. CoRR abs/2112.10987 (2021) - 2020
- [j6]Yi Li
Sublinear-Time Algorithms for Compressive Phase Retrieval. IEEE Trans. Inf. Theory 66(11): 7302-7310 (2020) - [c23]Alexandr Andoni, Collin Burns, Yi Li
Streaming Complexity of SVMs. APPROX-RANDOM 2020: 50:1-50:22 - [c22]Yi Li
Deterministic Sparse Fourier Transform with an ℓ∞ Guarantee. ICALP 2020: 77:1-77:14 - [c21]Tanqiu Jiang
Learning-Augmented Data Stream Algorithms. ICLR 2020 - [c20]Yi Li, David P. Woodruff:
Input-Sparsity Low Rank Approximation in Schatten Norm. ICML 2020: 6001-6009 - [c19]Yi Li, Ruosong Wang, David P. Woodruff:
Tight Bounds for the Subspace Sketch Problem with Applications. SODA 2020: 1655-1674 - [i16]Zhengyang Guo, Yi Li:
Minimum Enclosing Parallelogram with Outliers. CoRR abs/2003.01900 (2020) - [i15]Yi Li, David P. Woodruff:
Input-Sparsity Low Rank Approximation in Schatten Norm. CoRR abs/2004.12646 (2020) - [i14]Alexandr Andoni, Collin Burns, Yi Li, Sepideh Mahabadi, David P. Woodruff:
Streaming Complexity of SVMs. CoRR abs/2007.03633 (2020) - [i13]Zhengyang Guo, Yi Li, Shaoyu Pei:
The Expected Size of Random Convex Layers and Convex Shells. CoRR abs/2008.02258 (2020)
2010 – 2019
- 2019
- [j5]Yi Li
On Approximating Matrix Norms in Data Streams. SIAM J. Comput. 48(6): 1643-1697 (2019) - [j4]Sudipto Guha, Yi Li
Distributed Partial Clustering. ACM Trans. Parallel Comput. 6(3): 11:1-11:20 (2019) - [c18]Maria-Florina Balcan, Yi Li, David P. Woodruff, Hongyang Zhang:
Testing Matrix Rank, Optimally. SODA 2019: 727-746 - [i12]Yi Li, Vasileios Nakos:
Deterministic Sparse Fourier Transform with an ell_infty Guarantee. CoRR abs/1903.00995 (2019) - [i11]Yi Li, Ruosong Wang, David P. Woodruff:
Tight Bounds for the Subspace Sketch Problem with Applications. CoRR abs/1904.05543 (2019) - 2018
- [c17]Yi Li
Deterministic Heavy Hitters with Sublinear Query Time. APPROX-RANDOM 2018: 18:1-18:18 - [c16]Yi Li
On Low-Risk Heavy Hitters and Sparse Recovery Schemes. APPROX-RANDOM 2018: 19:1-19:13 - [c15]Vladimir Braverman, Stephen R. Chestnut, Robert Krauthgamer, Yi Li, David P. Woodruff, Lin F. Yang
Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order. ICML 2018: 648-657 - [c14]Yi Li
Sublinear- Time Algorithms for Compressive Phase Retrieval. ISIT 2018: 2301-2305 - [i10]Maria-Florina Balcan, Yi Li, David P. Woodruff, Hongyang Zhang:
Testing Matrix Rank, Optimally. CoRR abs/1810.08171 (2018) - 2017
- [j3]Anna C. Gilbert, Yi Li
For-All Sparse Recovery in Near-Optimal Time. ACM Trans. Algorithms 13(3): 32:1-32:26 (2017) - [c13]Yi Li
Embeddings of Schatten Norms with Applications to Data Streams. ICALP 2017: 60:1-60:14 - [c12]Sudipto Guha, Yi Li
Distributed Partial Clustering. SPAA 2017: 143-152 - [i9]Yi Li, David P. Woodruff:
Embeddings of Schatten Norms with Applications to Data Streams. CoRR abs/1702.05626 (2017) - [i8]Sudipto Guha, Yi Li, Qin Zhang:
Distributed Partial Clustering. CoRR abs/1703.01539 (2017) - [i7]Yi Li, Vasileios Nakos:
Sublinear-Time Algorithms for Compressive Phase Retrieval. CoRR abs/1709.02917 (2017) - [i6]Yi Li, Vasileios Nakos, David P. Woodruff:
On Low-Risk Heavy Hitters and Sparse Recovery Schemes. CoRR abs/1709.02919 (2017) - [i5]Yi Li, Vasileios Nakos:
Deterministic Heavy Hitters with Sublinear Query Time. CoRR abs/1712.01971 (2017) - 2016
- [c11]Yi Li
Tight Bounds for Sketching the Operator Norm, Schatten Norms, and Subspace Embeddings. APPROX-RANDOM 2016: 39:1-39:11 - [c10]Yuqing Ai, Wei Hu, Yi Li
New Characterizations in Turnstile Streams with Applications. CCC 2016: 20:1-20:22 - [c9]Yi Li
On approximating functions of the singular values in a stream. STOC 2016: 726-739 - [i4]Yi Li, David P. Woodruff:
On Approximating Functions of the Singular Values in a Stream. CoRR abs/1604.08679 (2016) - 2015
- [j2]Petros Boufounos, Volkan Cevher, Anna C. Gilbert, Yi Li
What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid. Algorithmica 73(2): 261-288 (2015) - 2014
- [c8]Anna C. Gilbert, Yi Li
For-All Sparse Recovery in Near-Optimal Time. ICALP (1) 2014: 538-550 - [c7]Yi Li
Improved testing of low rank matrices. KDD 2014: 691-700 - [c6]Yi Li, Huy L. Nguyen, David P. Woodruff:
On Sketching Matrix Norms and the Top Singular Vector. SODA 2014: 1562-1581 - [c5]Yi Li
Turnstile streaming algorithms might as well be linear sketches. STOC 2014: 174-183 - [c4]Yi Li, Xiaoming Sun, Chengu Wang, David P. Woodruff:
On the Communication Complexity of Linear Algebraic Problems in the Message Passing Model. DISC 2014: 499-513 - [i3]Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss:
For-all Sparse Recovery in Near-Optimal Time. CoRR abs/1402.1726 (2014) - [i2]Yi Li, Xiaoming Sun, Chengu Wang, David P. Woodruff:
On The Communication Complexity of Linear Algebraic Problems in the Message Passing Model. CoRR abs/1407.4755 (2014) - 2013
- [b1]Yi Li:
Sublinear Time Algorithms for the Sparse Recovery Problem. University of Michigan, USA, 2013 - [c3]Yi Li
A Tight Lower Bound for High Frequency Moment Estimation with Small Error. APPROX-RANDOM 2013: 623-638 - 2012
- [j1]Anna C. Gilbert, Yi Li
Approximate Sparse Recovery: Optimizing Time and Measurements. SIAM J. Comput. 41(2): 436-453 (2012) - [c2]Petros Boufounos
What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid. APPROX-RANDOM 2012: 61-72 - 2010
- [c1]Anna C. Gilbert, Yi Li
Approximate sparse recovery: optimizing time and measurements. STOC 2010: 475-484
2000 – 2009
- 2009
- [i1]Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss:
Approximate Sparse Recovery: Optimizing Time and Measurements. CoRR abs/0912.0229 (2009)
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-12-16 22:24 CET 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: