Qihang Lin
Titre
Citée par
Citée par
Année
Smoothing proximal gradient method for general structured sparse learning
X Chen, Q Lin, S Kim, JG Carbonell, EP Xing
Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial …, 2011
415*2011
Optimistic knowledge gradient policy for optimal budget allocation in crowdsourcing
X Chen, Q Lin, D Zhou
International Conference on Machine Learning, 64-72, 2013
1142013
An accelerated proximal coordinate gradient method
Q Lin, Z Lu, L Xiao
Advances in Neural Information Processing Systems, 3059-3067, 2014
1102014
Distributed stochastic variance reduced gradient methods by sampling extra data with replacement
JD Lee, Q Lin, T Ma, T Yang
The Journal of Machine Learning Research 18 (1), 4404-4446, 2017
86*2017
An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization
Q Lin, Z Lu, L Xiao
SIAM Journal on Optimization 25 (4), 2244–2273, 2015
762015
An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
Q Lin, L Xiao
Computational Optimization and Applications 60 (3), 633–674, 2015
632015
Non-convex min-max optimization: Provable algorithms and applications in machine learning
H Rafique, M Liu, Q Lin, T Yang
arXiv preprint arXiv:1810.02060, 2018
562018
A Unified Analysis of Stochastic Momentum Methods for Deep Learning.
Y Yan, T Yang, Z Li, Q Lin, Y Yang
IJCAI, 2955-2961, 2018
52*2018
Sparse latent semantic analysis
X Chen, Y Qi, B Bai, Q Lin, JG Carbonell
Proceedings of the 2011 SIAM International Conference on Data Mining, 474-485, 2011
512011
RSG: Beating subgradient method without smoothness and strong convexity
T Yang, Q Lin
arXiv preprint arXiv:1512.03107, 2015
50*2015
Optimal regularized dual averaging methods for stochastic optimization
X Chen, Q Lin, J Pena
Advances in Neural Information Processing Systems, 395-403, 2012
462012
Stochastic convex optimization: Faster local growth implies faster global convergence
Y Xu, Q Lin, T Yang
International Conference on Machine Learning, 3821-3830, 2017
41*2017
An accelerated proximal coordinate gradient method and its application to regularized empirical risk minimization
Q Lin, Z Lu, L Xiao
arXiv preprint arXiv:1407.1296, 2014
352014
Solving weakly-convex-weakly-concave saddle-point problems as weakly-monotone variational inequality
Q Lin, M Liu, H Rafique, T Yang
arXiv preprint arXiv:1810.10207, 2018
262018
A sparsity preserving stochastic gradient methods for sparse regression
Q Lin, X Chen, J Peña
Computational Optimization and Applications 58 (2), 455-482, 2014
25*2014
Statistical decision making for optimal budget allocation in crowd labeling
X Chen, Q Lin, D Zhou
The Journal of Machine Learning Research 16 (1), 1-46, 2015
242015
DSCOVR: Randomized Primal-Dual Block Coordinate Algorithms for Asynchronous Distributed Optimization.
L Xiao, AW Yu, Q Lin, W Chen
J. Mach. Learn. Res. 20, 43:1-43:58, 2019
232019
Block-normalized gradient method: An empirical study for training deep neural network
AW Yu, L Huang, Q Lin, R Salakhutdinov, J Carbonell
arXiv preprint arXiv:1707.04822, 2017
20*2017
ADMM without a fixed penalty parameter: Faster convergence with new adaptive penalization
Y Xu, M Liu, Q Lin, T Yang
Advances in Neural Information Processing Systems, 1267-1277, 2017
202017
Homotopy Smoothing for Non-Smooth Problems with Lower Complexity than
Y Xu, Y Yan, Q Lin, T Yang
Advances In Neural Information Processing Systems, 1208-1216, 2016
182016
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20