Lican Kang
Orcid: 0000-0003-3136-9225
According to our database1,
Lican Kang
authored at least 15 papers
between 2020 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Pattern Recognit., 2025
2024
Newton-Raphson Meets Sparsity: Sparse Learning Via a Novel Penalty and a Fast Solver.
IEEE Trans. Neural Networks Learn. Syst., September, 2024
A communication-efficient method for generalized linear regression with ℓ <sub>0</sub> regularization.
Commun. Stat. Simul. Comput., August, 2024
2023
Inf. Sci., November, 2023
SIAM J. Control. Optim., October, 2023
Over-parameterized Deep Nonparametric Regression for Dependent Data with Its Applications to Reinforcement Learning.
J. Mach. Learn. Res., 2023
Proceedings of the International Conference on Machine Learning, 2023
An Empirical Study of the Effect of Background Data Size on the Stability of SHapley Additive exPlanations (SHAP) for Deep Learning Models.
Proceedings of the First Tiny Papers Track at ICLR 2023, 2023
Proceedings of the First Tiny Papers Track at ICLR 2023, 2023
2022
GSDAR: a fast Newton algorithm for ℓ <sub>0</sub> regularized generalized linear models with statistical guarantee.
Comput. Stat., 2022
A data-driven line search rule for support recovery in high-dimensional data analysis.
Comput. Stat. Data Anal., 2022
2021
CoRR, 2021
2020
A Support Detection and Root Finding Approach for Learning High-dimensional Generalized Linear Models.
CoRR, 2020