default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLijun Ding
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Nuoya Xiong, Lijun Ding, Simon Shaolei Du:
How Over-Parameterization Slows Down Gradient Descent in Matrix Sensing: The Curses of Symmetry and Initialization. ICLR 2024- [c8]Feng-Yi Liao, Lijun Ding, Yang Zheng:
Error bounds, PL condition, and quadratic growth for weakly convex functions, and linear convergences of proximal point methods. L4DC 2024: 993-1005 - [c7]Zhongyu Wang, Yaheng Song, Erci Xu, Haonan Wu, Guangxun Tong, Shizhuo Sun, Haoran Li, Jincheng Liu, Lijun Ding, Rong Liu, Jiaji Zhu, Jiesheng Wu:
Ransom Access Memories: Achieving Practical Ransomware Protection in Cloud with DeftPunk. OSDI 2024: 687-702 - [i18]Feng-Yi Liao, Lijun Ding, Yang Zheng:
Inexact Augmented Lagrangian Methods for Conic Programs: Quadratic Growth and Linear Convergence. CoRR abs/2410.22683 (2024) - 2023
- [j11]Lijun Ding
, Madeleine Udell:
A strict complementarity approach to error bound and sensitivity of solution of conic programs. Optim. Lett. 17(7): 1551-1574 (2023) - [j10]Lijun Ding, Benjamin Grimmer:
Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates. SIAM J. Optim. 33(2): 1305-1332 (2023) - [j9]Liwei Jiang, Yudong Chen, Lijun Ding:
Algorithmic Regularization in Model-Free Overparametrized Asymmetric Matrix Factorization. SIAM J. Math. Data Sci. 5(3): 723-744 (2023) - [j8]Jicong Fan, Lijun Ding, Chengrun Yang, Zhao Zhang, Madeleine Udell:
Euclidean-Norm-Induced Schatten-p Quasi-Norm Regularization for Low-Rank Tensor Completion and Tensor Robust Principal Component Analysis. Trans. Mach. Learn. Res. 2023 (2023) - [j7]Jun Song, Niao He, Lijun Ding, Chaoyue Zhao:
Provably Convergent Policy Optimization via Metric-aware Trust Region Methods. Trans. Mach. Learn. Res. 2023 (2023) - [i17]Jun Song, Niao He, Lijun Ding, Chaoyue Zhao:
Provably Convergent Policy Optimization via Metric-aware Trust Region Methods. CoRR abs/2306.14133 (2023) - [i16]Feng-Yi Liao, Lijun Ding, Yang Zheng:
An Overview and Comparison of Spectral Bundle Methods for Primal and Dual Semidefinite Programs. CoRR abs/2307.07651 (2023) - [i15]Nuoya Xiong, Lijun Ding, Simon S. Du:
How Over-Parameterization Slows Down Gradient Descent in Matrix Sensing: The Curses of Symmetry and Initialization. CoRR abs/2310.01769 (2023) - [i14]Feng-Yi Liao, Lijun Ding, Yang Zheng:
Error bounds, PL condition, and quadratic growth for weakly convex functions, and linear convergences of proximal point methods. CoRR abs/2312.16775 (2023) - 2022
- [i13]Liwei Jiang, Yudong Chen, Lijun Ding:
Algorithmic Regularization in Model-free Overparametrized Asymmetric Matrix Factorization. CoRR abs/2203.02839 (2022) - [i12]Lijun Ding, Dmitriy Drusvyatskiy, Maryam Fazel:
Flat minima generalize for low-rank matrix recovery. CoRR abs/2203.03756 (2022) - [i11]Lijun Ding, Zhen Qin, Liwei Jiang, Jinxin Zhou, Zhihui Zhu:
A Validation Approach to Over-parameterized Matrix and Image Recovery. CoRR abs/2209.10675 (2022) - 2021
- [j6]Vasileios Charisopoulos, Yudong Chen, Damek Davis, Mateo Díaz, Lijun Ding, Dmitriy Drusvyatskiy:
Low-Rank Matrix Recovery with Composite Optimization: Good Conditioning and Rapid Convergence. Found. Comput. Math. 21(6): 1505-1593 (2021) - [j5]Lijun Ding, Madeleine Udell:
On the Simplicity and Conditioning of Low Rank Semidefinite Programs. SIAM J. Optim. 31(4): 2614-2637 (2021) - [j4]Lijun Ding, Alp Yurtsever, Volkan Cevher, Joel A. Tropp, Madeleine Udell:
An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity. SIAM J. Optim. 31(4): 2695-2725 (2021) - [c6]Chengrun Yang, Lijun Ding, Ziyang Wu, Madeleine Udell:
TenIPS: Inverse Propensity Sampling for Tensor Completion. AISTATS 2021: 3160-3168 - [c5]Lijun Ding, Liwei Jiang, Yudong Chen, Qing Qu, Zhihui Zhu:
Rank Overspecified Robust Matrix Recovery: Subgradient Method and Exact Recovery. NeurIPS 2021: 26767-26778 - [i10]Chengrun Yang, Lijun Ding, Ziyang Wu, Madeleine Udell:
TenIPS: Inverse Propensity Sampling for Tensor Completion. CoRR abs/2101.00323 (2021) - [i9]Lijun Ding, Liwei Jiang, Yudong Chen, Qing Qu, Zhihui Zhu:
Rank Overspecified Robust Matrix Recovery: Subgradient Method and Exact Recovery. CoRR abs/2109.11154 (2021) - 2020
- [j3]Lijun Ding, Yudong Chen:
Leave-One-Out Approach for Matrix Completion: Primal and Dual Analysis. IEEE Trans. Inf. Theory 66(11): 7274-7301 (2020) - [c4]Lijun Ding, Yingjie Fei, Qiantong Xu, Chengrun Yang:
Spectral Frank-Wolfe Algorithm: Strict Complementarity and Linear Convergence. ICML 2020: 2535-2544 - [i8]Lijun Ding, Madeleine Udell:
On the regularity and conditioning of low rank semidefinite programs. CoRR abs/2002.10673 (2020) - [i7]Lijun Ding, Jicong Fan, Madeleine Udell:
kFW: A Frank-Wolfe style algorithm with stronger subproblem oracles. CoRR abs/2006.16142 (2020) - [i6]Lijun Ding, Yuqian Zhang, Yudong Chen:
Low-rank matrix recovery with non-quadratic loss: projected gradient method and regularity projection oracle. CoRR abs/2008.13777 (2020) - [i5]Jicong Fan, Lijun Ding, Chengrun Yang, Madeleine Udell:
Low-Rank Tensor Recovery with Euclidean-Norm-Induced Schatten-p Quasi-Norm Regularization. CoRR abs/2012.03436 (2020)
2010 – 2019
- 2019
- [c3]Jicong Fan, Lijun Ding, Yudong Chen, Madeleine Udell:
Factor Group-Sparse Regularization for Efficient Low-Rank Matrix Recovery. NeurIPS 2019: 5105-5115 - [i4]Lijun Ding, Alp Yurtsever, Volkan Cevher, Joel A. Tropp, Madeleine Udell:
An Optimal-Storage Approach to Semidefinite Programming using Approximate Complementarity. CoRR abs/1902.03373 (2019) - [i3]Vasileios Charisopoulos, Yudong Chen, Damek Davis, Mateo Díaz, Lijun Ding, Dmitriy Drusvyatskiy:
Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence. CoRR abs/1904.10020 (2019) - [i2]Jicong Fan, Lijun Ding, Yudong Chen, Madeleine Udell:
Factor Group-Sparse Regularization for Efficient Low-Rank Matrix Recovery. CoRR abs/1911.05774 (2019) - 2018
- [i1]Lijun Ding, Yudong Chen:
The Leave-one-out Approach for Matrix Completion: Primal and Dual Analysis. CoRR abs/1803.07554 (2018)
2000 – 2009
- 2008
- [c2]Lijun Ding, Liang Hua, Hongwu Li:
Mechanical Fault Patterns Identification and Grades Cognizance Based on Geometrical Learning. PACIIA (1) 2008: 869-873 - 2005
- [j2]Tony J. Simon, Lijun Ding, Joel P. Bish, Donna M. McDonald-McGinn, Elaine H. Zackai, James C. Gee:
Volumetric, connective, and morphologic changes in the brains of children with chromosome 22q11.2 deletion syndrome: an integrative study. NeuroImage 25(1): 169-180 (2005) - 2001
- [j1]Lijun Ding, A. Ardeshir Goshtasby:
On the Canny edge detector. Pattern Recognit. 34(3): 721-725 (2001) - 2000
- [c1]Lijun Ding, Thisath C. Kularatna, Ardeshir Goshtasby, Martin Satter:
Volumetric image registration by template matching. Image Processing 2000
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-01 01:15 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:
