Maximum Likelihood With a Time Varying Parameter
Not on the map. Why?
Abstract (arXiv)
We consider the problem of tracking an unknown time varying parameter that characterizes the probabilistic evolution of a sequence of independent observations. To this aim, we propose a stochastic gradient descent-based recursive scheme in which the log-likelihood of the observations acts as time varying gain function. We prove convergence in mean-square error in a suitable neighbourhood of the unknown time varying parameter and illustrate the details of our findings in the case where data are generated from distributions belonging to the exponential family.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 5 of its 20 references that are in the map. First posted on arXiv 28 Feb 2023.
Builds on
5 of 20 references.
References · 5
- 2021Convex optimizationcited by 2,479
- 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
- 2018SGD and Hogwild! Convergence Without the Bounded Gradients Assumptioncited by 94
- 2020Time-Varying Convex Optimization: Time-Structured Algorithms and Applicationscited by 31
- 2016Adaptive Sequential Stochastic Optimizationcited by 8
Built on by
Citing papers per year: 2024: 1.
1 paper.
- 2024A Novel Theoretical Framework for Exponential Smoothingcited by 1
- 2024A Novel Theoretical Framework for Exponential Smoothing7 Mar 2024