Fengmiao Bian
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Fengmiao Bian has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Xiaoqun Zhang
Shanghai Jiao Tong University
7 shared publications Jian-Feng Cai
Department of Mathematics, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong Special Administrative Region of China, People’s Republic of China
2 shared publications- Jiulong Liu
Institute of Computational Mathematics and Scientific/Engineering Computing, Academy of Mathematics and System Sciences, Chinese Academy of Sciences, Beijing 100190, People’s Republic of China
2 shared publications Hao Gao
Department of Radiation Oncology, University of Kansas Medical Center, Kansas City, KS, United States of America
1 shared publication- Hao Gao
Department of Radiation Oncology University of Kansas Medical Center Kansas City Kansas USA
1 shared publication - Jian-Feng Cai
Hong Kong University of Science and Technology
1 shared publication
Latest Publications
- Open Access
- 24 January 2025
- Published by IOP Publishing in Inverse Problems
- Vol. 41 (2) , 025007
Flash proton radiation therapy via a stochastic three-operator splitting method
The inverse radiation therapy planning problem is crucial in achieving tumoricidal doses while minimizing radiation-induced normal-tissue toxicity. Compared to conventional radiation therapy (with conventional dose rates), flash proton radiation therapy (with ultra-high dose rates) can provide additional normal tissue sparing. However, this groundbreaking advancement in radiation oncology introduces a challenging nonconvex and nonsmooth optimization problem. In this paper, we propose a stochastic three-operator splitting (STOS) algorithm to address the flash proton radiation therapy problem. We establish the convergence and convergence rates of the STOS algorithm under the nonconvex framework for both unbiased gradient estimators and variance-reduced gradient estimators. These stochastic gradient estimators include the most popular ones, such as SGD, SAGA, SARAH, and SAG, among others. Experimental results demonstrate that the flash proton radiation therapy plans obtained by the STOS algorithm can effectively kill tumors while better protecting normal tissues.
- 24 January 2025
- Published by IOP Publishing in Inverse Problems
- Vol. 41 (2) , 025007
Open AccessFlash proton radiation therapy via a stochastic three-operator splitting method
The inverse radiation therapy planning problem is crucial in achieving tumoricidal doses while minimizing radiation-induced normal-tissue toxicity. Compared to conventional radiation therapy (with conventional dose rates), flash proton radiation therapy (with ultra-high dose rates) can provide additional normal tissue sparing. However, this groundbreaking advancement in radiation oncology introduces a challenging nonconvex and nonsmooth optimization problem. In this paper, we propose a stochastic three-operator splitting (STOS) algorithm to address the flash proton radiation therapy problem. We establish the convergence and convergence rates of the STOS algorithm under the nonconvex framework for both unbiased gradient estimators and variance-reduced gradient estimators. These stochastic gradient estimators include the most popular ones, such as SGD, SAGA, SARAH, and SAG, among others. Experimental results demonstrate that the flash proton radiation therapy plans obtained by the STOS algorithm can effectively kill tumors while better protecting normal tissues.
- Open Access
Fast and Provable Tensor-Train Format Tensor Completion via Precondtioned Riemannian Gradient Descent
Low-rank tensor completion aims to recover a tensor from partially observed entries, and it is widely applicable in fields such as quantum computing and image processing. Due to the significant advantages of the tensor train (TT) format in handling structured high-order tensors, this paper investigates the low-rank tensor completion problem based on the TT-format. We proposed a preconditioned Riemannian gradient descent algorithm (PRGD) to solve low TT-rank tensor completion and establish its linear convergence. Experimental results on both simulated and real datasets demonstrate the effectiveness of the PRGD algorithm. On the simulated dataset, the PRGD algorithm reduced the computation time by two orders of magnitude compared to existing classical algorithms. In practical applications such as hyperspectral image completion and quantum state tomography, the PRGD algorithm significantly reduced the number of iterations, thereby substantially reducing the computational time.
Open AccessFast and Provable Tensor-Train Format Tensor Completion via Precondtioned Riemannian Gradient Descent
Low-rank tensor completion aims to recover a tensor from partially observed entries, and it is widely applicable in fields such as quantum computing and image processing. Due to the significant advantages of the tensor train (TT) format in handling structured high-order tensors, this paper investigates the low-rank tensor completion problem based on the TT-format. We proposed a preconditioned Riemannian gradient descent algorithm (PRGD) to solve low TT-rank tensor completion and establish its linear convergence. Experimental results on both simulated and real datasets demonstrate the effectiveness of the PRGD algorithm. On the simulated dataset, the PRGD algorithm reduced the computation time by two orders of magnitude compared to existing classical algorithms. In practical applications such as hyperspectral image completion and quantum state tomography, the PRGD algorithm significantly reduced the number of iterations, thereby substantially reducing the computational time.
- 23 October 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 45 (4) , 2075-2103
A Preconditioned Riemannian Gradient Descent Algorithm for Low-Rank Matrix Recovery
The low-rank matrix recovery problem often arises in various fields, including signal processing, machine learning, and imaging science. The Riemannian gradient descent (RGD) algorithm has proven to be an efficient algorithm for solving this problem. In this paper, we present a preconditioned Riemannian gradient descent (PRGD) for low-rank matrix recovery. The preconditioner, noted for its simplicity and computational efficiency, is constructed by weighting the [Formula: see text]th entry of the gradient matrix according to the norms of the [Formula: see text]th row and the [Formula: see text]th column. We establish the theoretical recovery guarantee for PRGD under the restricted isometry property assumption. Experimental results indicate that PRGD can accelerate RGD by up to tenfold in solving low-rank matrix recovery problems such as matrix completion.
- 23 October 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 45 (4) , 2075-2103
A Preconditioned Riemannian Gradient Descent Algorithm for Low-Rank Matrix Recovery
The low-rank matrix recovery problem often arises in various fields, including signal processing, machine learning, and imaging science. The Riemannian gradient descent (RGD) algorithm has proven to be an efficient algorithm for solving this problem. In this paper, we present a preconditioned Riemannian gradient descent (PRGD) for low-rank matrix recovery. The preconditioner, noted for its simplicity and computational efficiency, is constructed by weighting the [Formula: see text]th entry of the gradient matrix according to the norms of the [Formula: see text]th row and the [Formula: see text]th column. We establish the theoretical recovery guarantee for PRGD under the restricted isometry property assumption. Experimental results indicate that PRGD can accelerate RGD by up to tenfold in solving low-rank matrix recovery problems such as matrix completion.
- Open Access
Stochastic Three-Operator Splitting Algorithms for Nonconvex and Nonsmooth Optimization Arising from FLASH Radiotherapy
Radiation therapy (RT) aims to deliver tumoricidal doses with minimal radiation-induced normal-tissue toxicity. Compared to conventional RT (of conventional dose rate), FLASH-RT (of ultra-high dose rate) can provide additional normal tissue sparing, which however has created a new nonconvex and nonsmooth optimization problem that is highly challenging to solve. In this paper, we propose a stochastic three-operator splitting (STOS) algorithm to address the FLASH optimization problem. We establish the convergence and convergence rates of the STOS algorithm under the nonconvex framework for both unbiased gradient estimators and variance-reduced gradient estimators. These stochastic gradient estimators include the most popular ones, such as SGD, SAGA, SARAH, and SVRG, among others. The effectiveness of the STOS algorithm is validated using FLASH radiotherapy planning for patients.
Open AccessStochastic Three-Operator Splitting Algorithms for Nonconvex and Nonsmooth Optimization Arising from FLASH Radiotherapy
Radiation therapy (RT) aims to deliver tumoricidal doses with minimal radiation-induced normal-tissue toxicity. Compared to conventional RT (of conventional dose rate), FLASH-RT (of ultra-high dose rate) can provide additional normal tissue sparing, which however has created a new nonconvex and nonsmooth optimization problem that is highly challenging to solve. In this paper, we propose a stochastic three-operator splitting (STOS) algorithm to address the FLASH optimization problem. We establish the convergence and convergence rates of the STOS algorithm under the nonconvex framework for both unbiased gradient estimators and variance-reduced gradient estimators. These stochastic gradient estimators include the most popular ones, such as SGD, SAGA, SARAH, and SVRG, among others. The effectiveness of the STOS algorithm is validated using FLASH radiotherapy planning for patients.
- 31 March 2023
- Published by Springer Nature in Journal of the Operations Research Society of China
- Vol. 11 (4) , 783-807
Accelerated Stochastic Peaceman–Rachford Method for Empirical Risk Minimization
- 31 March 2023
- Published by Springer Nature in Journal of the Operations Research Society of China
- Vol. 11 (4) , 783-807
Accelerated Stochastic Peaceman–Rachford Method for Empirical Risk Minimization
- 11 December 2022
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 94 (1) , 1-26
Binary Quantized Network Training With Sharpness-Aware Minimization
- 11 December 2022
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 94 (1) , 1-26
Binary Quantized Network Training With Sharpness-Aware Minimization
- 1 December 2021
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 410
A parameterized Douglas–Rachford splitting algorithm for nonconvex optimization
- 1 December 2021
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 410
A parameterized Douglas–Rachford splitting algorithm for nonconvex optimization
- 1 July 2021
- Published by IOP Publishing in Inverse Problems
- Vol. 37 (7) , 075009
A stochastic alternating direction method of multipliers for non-smooth and non-convex optimization
Alternating direction method of multipliers (ADMM) is a popular first-order method owing to its simplicity and efficiency. However, similar to other proximal splitting methods, the performance of ADMM degrades significantly when the scale of optimization problems to solve becomes large. In this paper, we consider combining ADMM with a class of variance-reduced stochastic gradient estimators for solving large-scale non-convex and non-smooth optimization problems. Global convergence of the generated sequence is established under the additional assumption that the object function satisfies Kurdyka-Łojasiewicz property. Numerical experiments on graph-guided fused lasso and computed tomography are presented to demonstrate the performance of the proposed methods.
- 1 July 2021
- Published by IOP Publishing in Inverse Problems
- Vol. 37 (7) , 075009
A stochastic alternating direction method of multipliers for non-smooth and non-convex optimization
Alternating direction method of multipliers (ADMM) is a popular first-order method owing to its simplicity and efficiency. However, similar to other proximal splitting methods, the performance of ADMM degrades significantly when the scale of optimization problems to solve becomes large. In this paper, we consider combining ADMM with a class of variance-reduced stochastic gradient estimators for solving large-scale non-convex and non-smooth optimization problems. Global convergence of the generated sequence is established under the additional assumption that the object function satisfies Kurdyka-Łojasiewicz property. Numerical experiments on graph-guided fused lasso and computed tomography are presented to demonstrate the performance of the proposed methods.
- Open Access
A parameterized Douglas-Rachford Splitting algorithm for nonconvex optimization
In this paper, we study a parameterized Douglas-Rachford splitting method for a class of nonconvex optimization problem. A new merit function is constructed to establish the convergence of the whole sequence generated by the parameterized Douglas-Rachford splitting method. We then apply the parameterized Douglas-Rachford splitting method to three important classes of nonconvex optimization problems arising in data science: sparsity constrained least squares problem, feasibility problem and low rank matrix completion. Numerical results validate the effectiveness of the parameterized Douglas-Rachford splitting method compared with some other classical methods.
Open AccessA parameterized Douglas-Rachford Splitting algorithm for nonconvex optimization
In this paper, we study a parameterized Douglas-Rachford splitting method for a class of nonconvex optimization problem. A new merit function is constructed to establish the convergence of the whole sequence generated by the parameterized Douglas-Rachford splitting method. We then apply the parameterized Douglas-Rachford splitting method to three important classes of nonconvex optimization problems arising in data science: sparsity constrained least squares problem, feasibility problem and low rank matrix completion. Numerical results validate the effectiveness of the parameterized Douglas-Rachford splitting method compared with some other classical methods.