default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLichen Zhang 0003
Person information
- affiliation: Massachusetts Institute of Technology (MIT), Cambridge, MA, USA
- affiliation (former): Carnegie Mellon University (CMU), Pittsburgh, PA, USA
Other persons with the same name
- Lichen Zhang (aka: Li-Chen Zhang) — disambiguation page
- Lichen Zhang 0001
![[0000-0002-6711-0533]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-6711-0533")
— Shaanxi Normal University, School of Computer Science, China (and 1 more) - Lichen Zhang 0004 — Guangdong University of Technology, Guangzhou, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Zhao Song, Junze Yin, Lichen Zhang:
Solving Attention Kernel Regression Problem via Pre-conditioner. AISTATS 2024: 208-216- [c11]Zhao Song, Junze Yin, Lichen Zhang, Ruizhe Zhang:
Fast Dynamic Sampling for Determinantal Point Processes. AISTATS 2024: 244-252 - [c10]Yuzhou Gu, Zhao Song, Junze Yin, Lichen Zhang:
Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time. ICLR 2024 - [c9]Zhao Song, Lichen Zhang, Ruizhe Zhang:
Training Multi-Layer Over-Parametrized Neural Network in Subquadratic Time. ITCS 2024: 93:1-93:15 - [c8]Haotian Jiang, Yin Tat Lee, Zhao Song, Lichen Zhang:
Convex Minimization with Integer Minima in Õ(n4) Time. SODA 2024: 3659-3684 - 2023
- [c7]Lianke Qin, Zhao Song, Lichen Zhang, Danyang Zhuo:
An Online and Unified Algorithm for Projection Matrix Vector Multiplication with Application to Empirical Risk Minimization. AISTATS 2023: 101-156 - [c6]S. Cliff Liu, Zhao Song, Hengjie Zhang, Lichen Zhang, Tianyi Zhou:
Space-Efficient Interior Point Method, with Applications to Linear Programming and Maximum Weight Bipartite Matching. ICALP 2023: 88:1-88:14 - [c5]Zhao Song, Yitan Wang, Zheng Yu, Lichen Zhang:
Sketching for First Order Method: Efficient Algorithm for Low-Bandwidth Channel and Vulnerability. ICML 2023: 32365-32417 - [c4]Zhao Song, Xin Yang, Yuanyuan Yang, Lichen Zhang:
Sketching Meets Differential Privacy: Fast Algorithm for Dynamic Kronecker Projection Maintenance. ICML 2023: 32418-32462 - [c3]Zhao Song, Mingquan Ye, Junze Yin, Lichen Zhang:
A Nearly-Optimal Bound for Fast Regression with ℓ∞ Guarantee. ICML 2023: 32463-32482 - [i16]Zhao Song, Mingquan Ye, Junze Yin, Lichen Zhang:
A Nearly-Optimal Bound for Fast Regression with 𝓁∞ Guarantee. CoRR abs/2302.00248 (2023) - [i15]Yuzhou Gu, Zhao Song, Junze Yin, Lichen Zhang:
Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time. CoRR abs/2302.11068 (2023) - [i14]Haotian Jiang, Yin Tat Lee, Zhao Song, Lichen Zhang:
Convex Minimization with Integer Minima in Õ(n4) Time. CoRR abs/2304.03426 (2023) - [i13]Zhao Song, Mingquan Ye, Junze Yin, Lichen Zhang:
Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation. CoRR abs/2306.04169 (2023) - [i12]Yichuan Deng, Zhao Song, Lichen Zhang, Ruizhe Zhang:
Efficient Algorithm for Solving Hyperbolic Programs. CoRR abs/2306.07587 (2023) - [i11]Yuzhou Gu, Zhao Song, Lichen Zhang:
A Nearly-Linear Time Algorithm for Structured Support Vector Machines. CoRR abs/2307.07735 (2023) - [i10]Zhao Song, Junze Yin, Lichen Zhang:
Solving Attention Kernel Regression Problem via Pre-conditioner. CoRR abs/2308.14304 (2023) - [i9]Zhao Song, Mingquan Ye, Lichen Zhang:
Streaming Semidefinite Programs: O(√n) Passes, Small Space and Fast Runtime. CoRR abs/2309.05135 (2023) - 2022
- [c2]Aravind Reddy, Zhao Song, Lichen Zhang:
Dynamic Tensor Product Regression. NeurIPS 2022 - [i8]Zhao Song, Zhaozhuo Xu, Lichen Zhang:
Speeding Up Sparsification using Inner Product Search Data Structures. CoRR abs/2204.03209 (2022) - [i7]Zhao Song, Zhaozhuo Xu, Yuanyuan Yang, Lichen Zhang:
Accelerating Frank-Wolfe Algorithm using Low-Dimensional and Adaptive Data Structures. CoRR abs/2207.09002 (2022) - [i6]Aravind Reddy, Zhao Song, Lichen Zhang:
Dynamic Tensor Product Regression. CoRR abs/2210.03961 (2022) - [i5]Zhao Song, Yitan Wang, Zheng Yu, Lichen Zhang:
Sketching for First Order Method: Efficient Algorithm for Low-Bandwidth Channel and Vulnerability. CoRR abs/2210.08371 (2022) - [i4]Zhao Song, Xin Yang, Yuanyuan Yang, Lichen Zhang:
Sketching Meets Differential Privacy: Fast Algorithm for Dynamic Kronecker Projection Maintenance. CoRR abs/2210.11542 (2022) - 2021
- [c1]Zhao Song, David P. Woodruff, Zheng Yu, Lichen Zhang:
Fast Sketching of Polynomial Kernels of Polynomial Degree. ICML 2021: 9812-9823 - [i3]Zhao Song, David P. Woodruff, Zheng Yu, Lichen Zhang:
Fast Sketching of Polynomial Kernels of Polynomial Degree. CoRR abs/2108.09420 (2021) - [i2]Zhao Song, Lichen Zhang, Ruizhe Zhang:
Training Multi-Layer Over-Parametrized Neural Network in Subquadratic Time. CoRR abs/2112.07628 (2021) - 2020
- [i1]S. Cliff Liu, Zhao Song, Hengjie Zhang, Lichen Zhang, Tianyi Zhou:
Space-Efficient Interior Point Method, with applications to Linear Programming and Maximum Weight Bipartite Matching. CoRR abs/2009.06106 (2020)
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-10-23 21:26 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:
