Follow
Miaolan Xie
Title
Cited by
Cited by
Year
High probability complexity bounds for line search based on stochastic oracles
B Jin, K Scheinberg, M Xie
Advances in Neural Information Processing Systems 34, 9193-9203, 2021
252021
A Sequential Quadratic Programming Method With High-Probability Complexity Bounds for Nonlinear Equality-Constrained Stochastic Optimization
AS Berahas, M Xie, B Zhou
SIAM Journal on Optimization 35 (1), 240-269, 2025
142025
Stochastic adaptive regularization method with cubics: A high probability complexity bound
K Scheinberg, M Xie
2023 Winter Simulation Conference (WSC), 3520-3531, 2023
132023
Controlburn: Feature selection by sparse forests
B Liu, M Xie, M Udell
Proceedings of the 27th ACM SIGKDD conference on knowledge discovery & data …, 2021
122021
Sample complexity analysis for adaptive optimization algorithms with stochastic oracles
B Jin, K Scheinberg, M Xie
Mathematical Programming 209 (1), 651-679, 2025
92025
High Probability Complexity Bounds for Adaptive Step Search Based on Stochastic Oracles
B Jin, K Scheinberg, M Xie
SIAM Journal on Optimization, 2024 - SIAM, 2024
92024
A Stochastic Quasi-Newton Method in the Absence of Common Random Numbers
M Menickelly, SM Wild, M Xie
arXiv preprint arXiv:2302.09128, 2023
62023
Inner approximation of convex cones via primal-dual ellipsoidal norms
M Xie
University of Waterloo, 2016
22016
ControlBurn: Nonlinear Feature Selection with Sparse Tree Ensembles
B Liu, M Xie, H Yang, M Udell
arXiv preprint arXiv:2207.03935, 2022
12022
High Probability Step Size Lower Bound for Adaptive Stochastic Optimization
B Jin, K Scheinberg, M Xie
OPT 2021: Optimization for Machine Learning (NeurIPS 2021 Workshop), 0
The system can't perform the operation now. Try again later.
Articles 1–10