Non-convex cost functionals in boosting algorithms and methods for panel selection
Marco Visentin
Abstract
In this document we propose a new improvement for boosting techniques as proposed in Friedman '99 by the use of non-convex cost functional. The idea is to introduce a correlation term to better deal with forecasting of additive time series. The problem is discussed in a theoretical way to prove the existence of minimizing sequence, and in a numerical way to propose a new "ArgMin" algorithm. The model has been used to perform the touristic presence forecast for the winter season 1999/2000 in Trentino (italian Alps).
Create a lesson
Related papers
DyssomniaNN: Multi-Scale Spiking Neural Modeling of Human Sleep Disorders and Perceived Restedness
Daniel Szelogowski
REMBGO for Evaluation-Limited Optimization: CEC2022 Benchmarking and EAF-STATCOM Generalization
Vikram Chekuri, Narapareddy Ramarao, Prashanth N A
Learning to Orchestrate Evolutionary Search: Progression-Aware Deep Reinforcement Learning for Dynamic DE-CMA-ES Coordination in Optimization and Structural Model Updating
Lechen Li, Rongye Shi, Wanhuan Zhou
Evolutionary Architecture Search for Chlorophyll-a Prediction in Lakes using Sentinel-2
Kursat Komurcu, Linas Petkevicius
The Modular CMA-ES: A Framework for Modern Evolution Strategies
Jacob de Nobel, Diederick Vermetten, Anna V. Kononova et al.
Relocating Nonlinearity: How a Downstream Learner Reshapes What Genetic Programming Must Evolve
Nam H. Le