Boosting algorithms in energy research: A systematic review

• URL: http://arxiv.org/abs/2004.07049v2
• Date: Fri, 29 Oct 2021 20:48:49 GMT
• Title: Boosting algorithms in energy research: A systematic review
• Authors: Hristos Tyralis, Georgia Papacharalampous
• Abstract summary: Boosting algorithms are characterized by both high flexibility and high interpretability. We show that boosting has been underexploited so far, while great advances in the energy field are possible.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Machine learning algorithms have been extensively exploited in energy research, due to their flexibility, automation and ability to handle big data. Among the most prominent machine learning algorithms are the boosting ones, which are known to be "garnering wisdom from a council of fools", thereby transforming weak learners to strong learners. Boosting algorithms are characterized by both high flexibility and high interpretability. The latter property is the result of recent developments by the statistical community. In this work, we provide understanding on the properties of boosting algorithms to facilitate a better exploitation of their strengths in energy research. In this respect, (a) we summarize recent advances on boosting algorithms, (b) we review relevant applications in energy research with those focusing on renewable energy (in particular those focusing on wind energy and solar energy) consisting a significant portion of the total ones, and (c) we describe how boosting algorithms are implemented and how their use is related to their properties. We show that boosting has been underexploited so far, while great advances in the energy field are possible both in terms of explanation and interpretation, and in terms of predictive performance.

Related papers

• The Impossibility of Parallelizing Boosting [56.24620522825757]
  We investigate the possibility of parallelizing boosting. Our main contribution is a strong negative result, implying that significant parallelization of boosting requires an exponential blow-up in the total computing resources needed for training.
  arXiv  Detail & Related papers  (2023-01-23T18:57:16Z)
• RMBench: Benchmarking Deep Reinforcement Learning for Robotic Manipulator Control [47.61691569074207]
  Reinforcement learning is applied to solve actual complex tasks from high-dimensional, sensory inputs. Recent progress benefits from deep learning for raw sensory signal representation. We present RMBench, the first benchmark for robotic manipulations.
  arXiv  Detail & Related papers  (2022-10-20T13:34:26Z)
• Trends in Energy Estimates for Computing in AI/Machine Learning Accelerators, Supercomputers, and Compute-Intensive Applications [3.2634122554914]
  We examine the computational energy requirements of different systems driven by the geometrical scaling law. We show that energy efficiency due to geometrical scaling is slowing down. At the application level, general-purpose AI-ML methods can be computationally energy intensive.
  arXiv  Detail & Related papers  (2022-10-12T16:14:33Z)
• Boosted Off-Policy Learning [21.042970740577648]
  We propose the first boosting algorithm for off-policy learning from logged bandit feedback. Unlike existing boosting methods for supervised learning, our algorithm directly optimize an estimate of the policy's expected reward. We show how to reduce the base learner to supervised learning, which opens up a broad range of readily available base learners.
  arXiv  Detail & Related papers  (2022-08-01T21:43:02Z)
• Energy-based Latent Aligner for Incremental Learning [83.0135278697976]
  Deep learning models tend to forget their earlier knowledge while incrementally learning new tasks. This behavior emerges because the parameter updates optimized for the new tasks may not align well with the updates suitable for older tasks. We propose ELI: Energy-based Latent Aligner for Incremental Learning.
  arXiv  Detail & Related papers  (2022-03-28T17:57:25Z)
• Quantum Boosting using Domain-Partitioning Hypotheses [0.9264464791978363]
  Boosting is an ensemble learning method that converts a weak learner into a strong learner in the PAC learning framework. We show that Q-RealBoost provides a speedup over Q-AdaBoost in terms of both the bias of the weak learner and the time taken by the weak learner to learn the target concept class.
  arXiv  Detail & Related papers  (2021-10-25T10:46:13Z)
• Compute and Energy Consumption Trends in Deep Learning Inference [67.32875669386488]
  We study relevant models in the areas of computer vision and natural language processing. For a sustained increase in performance we see a much softer growth in energy consumption than previously anticipated.
  arXiv  Detail & Related papers  (2021-09-12T09:40:18Z)
• A Brief Look at Generalization in Visual Meta-Reinforcement Learning [56.50123642237106]
  We evaluate the generalization performance of meta-reinforcement learning algorithms. We find that these algorithms can display strong overfitting when they are evaluated on challenging tasks.
  arXiv  Detail & Related papers  (2020-06-12T15:17:17Z)
• Towards the Systematic Reporting of the Energy and Carbon Footprints of Machine Learning [68.37641996188133]
  We introduce a framework for tracking realtime energy consumption and carbon emissions. We create a leaderboard for energy efficient reinforcement learning algorithms. We propose strategies for mitigation of carbon emissions and reduction of energy consumption.
  arXiv  Detail & Related papers  (2020-01-31T05:12:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.