Non-convex cost functionals in boosting: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 02:0402:04, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,276 bytes +2,276‎ Created page with "Title: Non-convex cost functionals in boosting Researchers: M. Visentin Abstract: This research proposes a new improvement for boosting techniques used in modeling and forecasting additive time series. The idea is to introduce a correlation term to better deal with forecasting additive time series. The problem is discussed in a theoretical way to prove the existence of a minimizing sequence, and in a numerical way to propose an ArgMin algorithm. The model has been used..."
Retrieved from "https://simplesci.org/wiki/Non-convex_cost_functionals_in_boosting"