Strongly convex stochastic online optimization on a unit simplex with application to the mixing least square regression
classification
🧮 math.OC
keywords
leastmixingonlineregressionsquarestochasticapplicationapproach
read the original abstract
In this paper we propose a new approach to obtain mixing least square regression estimate by means of stochastic online mirror descent in non-euclidian set-up.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.