mlsanityData to 7 Oct 2026

On tracking varying bounds when forecasting bounded time series

arXiv 2306.13428 ↗First posted 23 Jun 2023stat.ML cs.LG stat.APcited by 1

Not on the map. Why?

Abstract (arXiv)

We consider a new framework where a continuous, though bounded, random variable has unobserved bounds that vary over time. In the context of univariate time series, we look at the bounds as parameters of the distribution of the bounded random variable. We introduce an extended log-likelihood estimation and design algorithms to track the bound through online maximum likelihood estimation. Since the resulting optimization problem is not convex, we make use of recent theoretical results on Normalized Gradient Descent (NGD) for quasiconvex optimization, to eventually derive an Online Normalized Gradient Descent algorithm. We illustrate and discuss the workings of our approach based on both simulation studies and a real-world wind power forecasting problem.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 3 of its 36 references that are in the map. First posted on arXiv 23 Jun 2023.

Builds on

3 of 36 references.

References · 3

  1. 2021Convex optimizationcited by 2,479
  2. 2019Introduction to Online Convex Optimizationcited by 793
  3. 2015Beyond Convexity: Stochastic Quasi-Convex Optimizationcited by 75

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.