Explainable subgradient tree boosting for prescriptive analytics in operations management
From MaRDI portal
Publication:6087515
DOI10.1016/j.ejor.2023.08.037MaRDI QIDQ6087515
Pascal M. Notz, Richard Pibernik
Publication date: 15 November 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Greedy function approximation: A gradient boosting machine.
- Boosting algorithms: regularization, prediction and model fitting
- An algorithm for calculating one subgradient of a convex function of two variables
- A decision-theoretic generalization of on-line learning and an application to boosting
- Prescriptive analytics for a multi-shift staffing problem
- Explaining individual predictions when features are dependent: more accurate approximations to Shapley values
- Explanation in artificial intelligence: insights from the social sciences
- Boosting with early stopping: convergence and consistency
- A random forest guided tour
- Flexible Service Capacity: Optimal Investment and the Impact of Demand Correlation
- Monte Carlo sampling approach to stochastic programming
- Minimax analysis of stochastic problems
- The Big Data Newsvendor: Practical Insights from Machine Learning
- A Survey on the Explainability of Supervised Machine Learning
- Optimization by Gradient Boosting
- Stochastic gradient boosting.
This page was built for publication: Explainable subgradient tree boosting for prescriptive analytics in operations management