Online Program

Return to main conference page
Saturday, June 1
Computational Statistics
Computational Statistics E-Posters
Sat, Jun 1, 9:30 AM - 10:30 AM
Grand Ballroom Foyer

Innovative Robust Boosting Algorithms (306271)


*Zhu Wang, UT Health San Antonio 

Keywords: robust, nonconvex, optimization, boosting

Classical robust statistical methods dealing with noisy data are often based on modifications of convex loss functions. For example, Huber loss is more robust than least squares in regression. In recent years, however, nonconvex loss based robust methods have been increasingly popular. A nonconvex loss can provide robust estimation for data contaminated with outliers. A significant challenge is that a nonconvex loss can be numerically difficult to optimize. The presentation focuses on some recently developed computational methodologies in this area (1, 2). Combining majorization-minimization algorithm with machine learning boosting algorithm, a class of nonconvex robust loss functions can be minimized. Convergence guarantees are presented. The new algorithms improve classification accuracy and variable selection, illustrated using a pediatric database developed for the US Healthcare Cost and Utilization Project, and breast cancer gene expression data. References

1. Wang, Z. (2018). Robust boosting with truncated loss functions, Electronic Journal of Statistics, 12(1), 599-650, doi:10.1214/18-EJS1404 2. Wang, Z. (2018). Quadratic majorization for nonconvex loss with applications to the boosting algorithm. Journal of Computational and Graphical Statistics. doi:10.1080/10618600.2018.1424635