# Formulation of Weighted Average Smoothing as a Projection of the Origin onto a Convex Polytope

arXiv: https://arxiv.org/abs/2303.11958 · HTML: https://mlsanity.com/paper/2303.11958/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 10 of its 61 references that are in the map.
- First posted on arXiv 19 Mar 2023.

## Builds on (most cited first, 10 of 10)

- [Convex optimization](https://mlsanity.com/paper/2106.01946/) (2021)
- [Flow Smoothing and Denoising: Graph Signal Processing in the Edge-Space](https://mlsanity.com/paper/1808.02111/) (2018)
- [Generalized Huber Loss for Robust Learning and its Efficient Minimization for a Robust Statistics](https://mlsanity.com/paper/2108.12627/) (2021)
- [Sequential Outlier Detection based on Incremental Decision Trees](https://mlsanity.com/paper/1803.03674/) (2018)
- [Optimally Efficient Sequential Calibration of Binary Classifiers to Minimize Classification Error](https://mlsanity.com/paper/2108.08780/) (2021)
- [Recursive Experts: An Efficient Optimal Mixture of Learning Systems in Dynamic Environments](https://mlsanity.com/paper/2009.09249/) (2020)
- [Nonparametric Extrema Analysis in Time Series for Envelope Extraction, Peak Detection and Clustering](https://mlsanity.com/paper/2109.02082/) (2021)
- [Optimal and Efficient Algorithms for General Mixable Losses against Switching Oracles](https://mlsanity.com/paper/2108.06411/) (2021)
- [Nonconvex Extension of Generalized Huber Loss for Robust Learning and Pseudo-Mode Statistics](https://mlsanity.com/paper/2202.11141/) (2022)
- [The Problem of Projecting the Origin of Euclidean Space onto the Convex Polyhedron](https://mlsanity.com/paper/1605.05351/) (2016)

## Abstract (arXiv)

Our study focuses on determining the best weight windows for a weighted moving average smoother under squared loss. We show that there exists an optimal weight window that is symmetrical around its center. We study the class of tapered weight windows, which decrease in weight as they move away from the center. We formulate the corresponding least squares problem as a quadratic program and finally as a projection of the origin onto a convex polytope. Additionally, we provide some analytical solutions to the best window when some conditions are met on the input data.