default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXiaoyu Li 0001
Person information
- affiliation: University of New South Wales, Sydney, NSW, Australia
- affiliation (former): Stevens Institute of Technology, Department of Computer Science, Hoboken, NJ, USA
Other persons with the same name
- Xiaoyu Li (aka: Xiao-yu Li, Xiao-Yu Li) — disambiguation page
- Xiaoyu Li 0002
![[0000-0003-2588-1687]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0003-2588-1687")
— Tencent AI Lab, Shenzhen, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i26]Yekun Ke, Xiaoyu Li, Yingyu Liang, Zhenmei Shi, Zhao Song:
Circuit Complexity Bounds for Visual Autoregressive Model. CoRR abs/2501.04299 (2025)- [i25]Yekun Ke, Xiaoyu Li, Yingyu Liang, Zhizhou Sha, Zhenmei Shi, Zhao Song:
On Computational Limits and Provably Efficient Criteria of Visual Autoregressive Models: A Fine-Grained Complexity Analysis. CoRR abs/2501.04377 (2025) - [i24]Xiaoyu Li, Yingyu Liang, Zhenmei Shi, Zhao Song, Wei Wang, Jiahao Zhang:
On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective. CoRR abs/2501.06444 (2025) - [i23]Yuefan Cao, Chengyue Gong, Xiaoyu Li, Yingyu Liang, Zhizhou Sha, Zhenmei Shi, Zhao Song:
RichSpace: Enriching Text-to-Video Prompt Space via Text Embedding Interpolation. CoRR abs/2501.09982 (2025) - [i22]Xiaoyu Li, Yingyu Liang, Jiangxuan Long, Zhenmei Shi, Zhao Song, Zhen Zhuang:
Neural Algorithmic Reasoning for Hypergraphs with Looped Transformers. CoRR abs/2501.10688 (2025) - [i21]Bo Chen, Chengyue Gong, Xiaoyu Li, Yingyu Liang, Zhizhou Sha, Zhenmei Shi, Zhao Song, Mingda Wan:
High-Order Matching for One-Step Shortcut Diffusion Models. CoRR abs/2502.00688 (2025) - [i20]Yuefan Cao, Xiaoyu Li, Yingyu Liang, Zhizhou Sha, Zhenmei Shi, Zhao Song, Jiahao Zhang:
Dissecting Submission Limit in Desk-Rejections: A Mathematical Analysis of Fairness in AI Conference Policies. CoRR abs/2502.00690 (2025) - [i19]Yifang Chen, Xiaoyu Li, Yingyu Liang, Zhenmei Shi, Zhao Song:
Universal Approximation of Visual Autoregressive Transformers. CoRR abs/2502.06167 (2025) - [i18]Yang Cao, Bo Chen, Xiaoyu Li, Yingyu Liang, Zhizhou Sha, Zhenmei Shi, Zhao Song, Mingda Wan:
Force Matching with Relativistic Constraints: A Physics-Inspired Approach to Stable and Efficient Generative Modeling. CoRR abs/2502.08150 (2025) - [i17]Chengyue Gong, Yekun Ke, Xiaoyu Li, Yingyu Liang, Zhizhou Sha, Zhenmei Shi, Zhao Song:
On Computational Limits of FlowAR Models: Expressivity and Efficiency. CoRR abs/2502.16490 (2025) - [i16]Yifang Chen, Xuyang Guo, Xiaoyu Li, Yingyu Liang, Zhenmei Shi, Zhao Song:
Scaling Law Phenomena Across Regression Paradigms: Multiple and Kernel Approaches. CoRR abs/2503.01314 (2025) - [i15]Chengyue Gong, Xiaoyu Li, Yingyu Liang, Jiangxuan Long, Zhenmei Shi, Zhao Song, Yu Tian:
Theoretical Guarantees for High Order Trajectory Refinement in Generative Flows. CoRR abs/2503.09069 (2025) - [i14]Yifang Chen, Xiaoyu Li, Yingyu Liang, Zhenmei Shi, Zhao Song, Yu Tian:
Time and Memory Trade-off of KV-Cache Compression in Tensor Transformer Decoding. CoRR abs/2503.11108 (2025) - [i13]Bo Chen, Xiaoyu Li, Yekun Ke, Yingyu Liang, Zhenmei Shi, Zhao Song:
Exploring the Limits of KV Cache Compression in Visual Autoregressive Transformers. CoRR abs/2503.14881 (2025) - 2024
- [c3]Yekun Ke, Xiaoyu Li, Zhao Song, Tianyi Zhou:
Faster Sampling Algorithms for Polytopes with Small Treewidth. IEEE Big Data 2024: 44-53 - [c2]Xiaoyu Li, Jiangxuan Long, Zhao Song, Tianyi Zhou:
Fast Second-order Method for Neural Networks under Small Treewidth Setting. IEEE Big Data 2024: 1029-1038 - [c1]Ya-Ting Chang, Zhibo Hu, Xiaoyu Li, Shuiqiao Yang, Jiaojiao Jiang, Nan Sun:
DiHAN: A Novel Dynamic Hierarchical Graph Attention Network for Fake News Detection. CIKM 2024: 197-206 - [i12]Jiuxiang Gu, Xiaoyu Li, Yingyu Liang, Zhenmei Shi, Zhao Song, Junwei Yu:
Fast John Ellipsoid Computation with Differential Privacy Optimization. CoRR abs/2408.06395 (2024) - [i11]Xiaoyu Li, Yingyu Liang, Zhenmei Shi, Zhao Song:
A Tighter Complexity Analysis of SparseGPT. CoRR abs/2408.12151 (2024) - [i10]Xiaoyu Li, Zhao Song, Junwei Yu:
Quantum Speedups for Approximating the John Ellipsoid. CoRR abs/2408.14018 (2024) - [i9]Xiaoyu Li, Yingyu Liang, Zhenmei Shi, Zhao Song, Yufa Zhou:
Fine-grained Attention I/O Complexity: Comprehensive Analysis for Backward Passes. CoRR abs/2410.09397 (2024) - [i8]Bo Chen, Xiaoyu Li, Yingyu Liang, Zhenmei Shi, Zhao Song:
Bypassing the Exponential Dependency: Looped Transformers Efficiently Learn In-context by Multi-step Gradient Descent. CoRR abs/2410.11268 (2024) - [i7]Yekun Ke, Xiaoyu Li, Yingyu Liang, Zhenmei Shi, Zhao Song:
Advancing the Understanding of Fixed Point Iterations in Deep Neural Networks: A Detailed Analytical Study. CoRR abs/2410.11279 (2024) - [i6]Bo Chen, Xiaoyu Li, Yingyu Liang, Jiangxuan Long, Zhenmei Shi, Zhao Song:
Circuit Complexity Bounds for RoPE-based Transformer Architecture. CoRR abs/2411.07602 (2024) - [i5]Xiaoyu Li, Yuanpeng Li, Yingyu Liang, Zhenmei Shi, Zhao Song:
On the Expressive Power of Modern Hopfield Networks. CoRR abs/2412.05562 (2024) - [i4]Yifang Chen, Xiaoyu Li, Yingyu Liang, Zhenmei Shi, Zhao Song:
The Computational Limits of State-Space Models and Mamba via the Lens of Circuit Complexity. CoRR abs/2412.06148 (2024) - [i3]Yang Cao, Xiaoyu Li, Zhao Song:
Grams: Gradient Descent with Adaptive Momentum Scaling. CoRR abs/2412.17107 (2024) - [i2]Yifang Chen, Jiayan Huo, Xiaoyu Li, Yingyu Liang, Zhenmei Shi, Zhao Song:
Fast Gradient Computation for RoPE Attention in Almost Linear Time. CoRR abs/2412.17316 (2024) - [i1]Xiaoyu Li, Yingyu Liang, Zhenmei Shi, Zhao Song, Mingda Wan:
Theoretical Constraints on the Expressive Power of RoPE-based Tensor Attention Transformers. CoRR abs/2412.18040 (2024)
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 2025-05-18 20:30 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:
