Research map / Optimization / Nonconvex and smooth optimization
Approaching Quartic Convergence Rates for Quasi-Stochastic Approximation with Application to Gradient-Free Optimization
Caio Kalil Lauand, Sean P. Meyn
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| replace divergence-minimizing and bilevel regularized baselines with Implicit Flow Network layer (hard conservation plus learned nonlinear constitutive relationship) | flow estimation · AC power networks (IEEE-57/118/145/300, ACTIVSg200/500) | RMSE on unlabeled edges (MW) | Improved |
| replace divergence-minimizing and bilevel regularized baselines with Implicit Flow Network layer | flow estimation · Water distribution (Fairfield, Bellingham, Harrisburg) | RMSE on unlabeled edges (m3/s) | Improved |
| increase the fraction of labeled edges toward 90% | baselines (Div, Bil-MLP, Bil-GCN, Bil-True) · power and water networks | RMSE | Improved |
| use only 10% labeled edges instead of more | IFN · power and water networks | RMSE | No clear effect |
| large labeled fraction (above 80% power, 60% water) as opposed to small | IFN versus baselines · power and water networks | RMSE | Mixed |
Closest papers by meaning
- High-probability Convergence of Gradient Methods under Markovian Stochasticity (NeurIPS 2026 · similarity 0.89)
- Accelerated, Optimal and Parallel: Some results on model-based stochastic optimization (ICML 2022 · similarity 0.89)
- Almost Sure Convergence Rates of Stochastic Approximation and Reinforcement Learning via a Poisson-Moreau Drift (NeurIPS 2026 · similarity 0.88)
- Revisiting the Last-Iterate Convergence of Stochastic Gradient Methods (ICLR 2024 · similarity 0.87)
- Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness (ICLR 2025 · similarity 0.87)
- Faster Stochastic Optimization with Arbitrary Delays via Adaptive Asynchronous Mini-Batching (ICML 2025 · similarity 0.87)
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.
