Asymptotic optimality in stochastic optimization
From MaRDI portal
Publication:2656586
DOI10.1214/19-AOS1831zbMath1461.62146arXiv1612.05612OpenAlexW3128015591MaRDI QIDQ2656586
Publication date: 11 March 2021
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.05612
Asymptotic properties of parametric estimators (62F12) Analysis of algorithms and problem complexity (68Q25) Minimax procedures in statistical decision theory (62C20) Stochastic programming (90C15) Stochastic approximation (62L20)
Related Items (6)
Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization ⋮ Asymptotic properties of dual averaging algorithm for constrained distributed stochastic optimization ⋮ Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search ⋮ Unifying mirror descent and dual averaging ⋮ The right complexity measure in locally private estimation: it is not the Fisher information ⋮ Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual subgradient methods for convex problems
- Geometrizing rates of convergence. II
- Geometrizing rates of convergence. III
- Stochastic approximation algorithms for constrained optimization problems
- Asymptotic properties of statistical estimators in stochastic programming
- Asymptotics in statistics. Some basic concepts.
- Weak convergence and empirical processes. With applications to statistics
- Trust-region methods on Riemannian manifolds
- Asymptotically efficient stochastic approximation; the RM case
- Identifiable Surfaces in Constrained Optimization
- Lectures on Stochastic Programming
- Robust Stochastic Approximation Approach to Stochastic Programming
- stochastic quasigradient methods and their application to system optimization†
- Stochastic iteration for a constrained optimization problem
- Sensitivity Analysis of Nonlinear Programs and Differentiability Properties of Metric Projections
- Acceleration of Stochastic Approximation by Averaging
- Optimization Problems with Perturbations: A Guided Tour
- Asymptotic Statistics
- Exposing Constraints
- Tilt Stability of a Local Minimum
- [https://portal.mardi4nfdi.de/wiki/Publication:4743580 Approximation dans les espaces m�triques et th�orie de l'estimation]
- Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization
- Tilt Stability, Uniform Quadratic Growth, and Strong Metric Regularity of the Subdifferential
- Stochastic Gradient Descent on Riemannian Manifolds
- Implicit Functions and Solution Mappings
- An Extension of the Robbins-Monro Procedure
- A Stochastic Approximation Method
This page was built for publication: Asymptotic optimality in stochastic optimization