default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXuxing Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Xuxing Chen, Tesi Xiao, Krishnakumar Balasubramanian:
Optimal Algorithms for Stochastic Bilevel Optimization under Relaxed Smoothness Conditions. J. Mach. Learn. Res. 25: 151:1-151:51 (2024)- [j1]Xuxing Chen, Krishna Balasubramanian, Promit Ghosal, Bhavya Agrawalla:
From Stability to Chaos: Analyzing Gradient Descent Dynamics in Quadratic Regression. Trans. Mach. Learn. Res. 2024 (2024) - [c5]Xuxing Chen, Abhishek Roy, Yifan Hu, Krishnakumar Balasubramanian:
Stochastic Optimization Algorithms for Instrumental Variable Regression with Streaming Data. NeurIPS 2024 - [i9]Jiaxiang Li, Xuxing Chen, Shiqian Ma, Mingyi Hong:
Problem-Parameter-Free Decentralized Nonconvex Stochastic Optimization. CoRR abs/2402.08821 (2024) - [i8]Xuxing Chen, Abhishek Roy, Yifan Hu, Krishnakumar Balasubramanian:
Stochastic Optimization Algorithms for Instrumental Variable Regression with Streaming Data. CoRR abs/2405.19463 (2024) - [i7]Xiaoyu Wang, Xuxing Chen, Shiqian Ma, Tong Zhang:
Fully First-Order Methods for Decentralized Bilevel Optimization. CoRR abs/2410.19319 (2024) - [i6]Yun He, Xuxing Chen, Jiayi Xu, Renqin Cai, Yiling You, Jennifer Cao, Minhui Huang, Liu Yang, Yiqun Liu, Xiaoyi Liu, Rong Jin, Sem Park, Bo Long, Xue Feng:
MultiBalance: Multi-Objective Gradient Balancing in Industrial-Scale Multi-Task Recommendation System. CoRR abs/2411.11871 (2024) - 2023
- [c4]Xuxing Chen, Minhui Huang, Shiqian Ma, Krishna Balasubramanian:
Decentralized Stochastic Bilevel Optimization with Improved per-Iteration Complexity. ICML 2023: 4641-4671 - [c3]Tesi Xiao, Xuxing Chen, Krishnakumar Balasubramanian, Saeed Ghadimi:
A one-sample decentralized proximal algorithm for non-convex stochastic composite optimization. UAI 2023: 2324-2334 - [i5]Tesi Xiao, Xuxing Chen, Krishnakumar Balasubramanian, Saeed Ghadimi:
A One-Sample Decentralized Proximal Algorithm for Non-Convex Stochastic Composite Optimization. CoRR abs/2302.09766 (2023) - [i4]Xuxing Chen, Tesi Xiao, Krishnakumar Balasubramanian:
Optimal Algorithms for Stochastic Bilevel Optimization under Relaxed Smoothness Conditions. CoRR abs/2306.12067 (2023) - [i3]Xuxing Chen, Krishnakumar Balasubramanian, Saeed Ghadimi:
Stochastic Nested Compositional Bi-level Optimization for Robust Feature Learning. CoRR abs/2307.05384 (2023) - [i2]Xuxing Chen, Krishnakumar Balasubramanian, Promit Ghosal, Bhavya Agrawalla:
From Stability to Chaos: Analyzing Gradient Descent Dynamics in Quadratic Regression. CoRR abs/2310.01687 (2023) - 2022
- [i1]Xuxing Chen, Minhui Huang, Shiqian Ma, Krishnakumar Balasubramanian:
Decentralized Stochastic Bilevel Optimization with Improved Per-Iteration Complexity. CoRR abs/2210.12839 (2022) - 2020
- [c2]Weihe Li, Jiawei Huang, Shaojun Zou, Zhuoran Liu, Qichen Su, Xuxing Chen, Jianxin Wang:
Pipeline-Based Chunk Scheduling to Improve ABR Performance in DASH System. ICCCN 2020: 1-9
2010 – 2019
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-02-08 00:50 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:
