Explainable subgradient tree boosting for prescriptive analytics in operations management
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 1950578 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- A decision-theoretic generalization of on-line learning and an application to boosting
- A random forest guided tour
- A survey on the explainability of supervised machine learning
- An algorithm for calculating one subgradient of a convex function of two variables
- Boosting algorithms: regularization, prediction and model fitting
- Boosting with early stopping: convergence and consistency
- Boosting. Foundations and algorithms.
- Explaining individual predictions when features are dependent: more accurate approximations to Shapley values
- Explanation in artificial intelligence: insights from the social sciences
- Flexible Service Capacity: Optimal Investment and the Impact of Demand Correlation
- Greedy function approximation: A gradient boosting machine.
- Minimax analysis of stochastic problems
- Monte Carlo sampling approach to stochastic programming
- Optimization by Gradient Boosting
- Prescriptive analytics for a multi-shift staffing problem
- Some theory for generalized boosting algorithms
- Stochastic gradient boosting.
- The big data newsvendor: practical insights from machine learning
This page was built for publication: Explainable subgradient tree boosting for prescriptive analytics in operations management
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6087515)
