Research map / Optimization / Nonconvex and smooth optimization
Stochastic Online Optimization using Kalman Recursion
Joseph de Vilmarest, Olivier Wintenberger
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Stochastic Optimization under Distributional Drift (JMLR 2023 · similarity 0.87)
- Stochastic-Constrained Stochastic Optimization with Markovian Data (JMLR 2024 · similarity 0.87)
- Continuous-time Models for Stochastic Optimization Algorithms (NeurIPS 2019 · similarity 0.87)
- Stochastic Optimization with Arbitrary Recurrent Data Sampling (ICML 2024 · similarity 0.86)
- Accelerating Distributed Stochastic Optimization via Self-Repellent Random Walks (ICLR 2024 · similarity 0.86)
- An Online Optimization Perspective on First-Order and Zero-Order Decentralized Nonsmooth Nonconvex Stochastic Optimization (ICML 2024 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
