Strongly convex stochastic online optimization on a unit simplex with application to the mixing least square regression
Anastasia Bayandina, Elena Chernousova, Alexander Gasnikov, Ekaterina, Krymova

TL;DR
This paper introduces a novel stochastic online mirror descent method for strongly convex optimization on a unit simplex, with applications to mixing least squares regression, enhancing estimation accuracy in non-Euclidean settings.
Contribution
It presents a new approach for mixing least squares regression using stochastic online mirror descent tailored for non-Euclidean spaces.
Findings
Effective estimation on the unit simplex
Improved convergence in non-Euclidean settings
Applicability to mixing least squares regression
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFace and Expression Recognition · Blind Source Separation Techniques · Sparse and Compressive Sensing Techniques
