Non-Stationary Stochastic Optimization
From MaRDI portal
Publication:2795881
DOI10.1287/opre.2015.1408zbMath1338.90280arXiv1307.5449OpenAlexW3123661679MaRDI QIDQ2795881
Assaf J. Zeevi, Yonatan Gur, Omar Besbes
Publication date: 22 March 2016
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.5449
Related Items (25)
Dynamic Pricing and Learning with Finite Inventories ⋮ Tracking and Regret Bounds for Online Zeroth-Order Euclidean and Riemannian Optimization ⋮ Data-Driven Pricing for a New Product ⋮ Decentralized online convex optimization based on signs of relative states ⋮ Learning in Structured MDPs with Convex Cost Functions: Improved Regret Bounds for Inventory Management ⋮ Handling concept drift via model reuse ⋮ Stochastic approximation with nondecaying gain: Error bound and data‐driven gain‐tuning ⋮ Technical note: <scp>Finite‐time</scp> regret analysis of <scp>Kiefer‐Wolfowitz</scp> stochastic approximation algorithm and nonparametric <scp>multi‐product</scp> dynamic pricing with unknown demand ⋮ A relaxation-based probabilistic approach for PDE-constrained optimization under uncertainty with pointwise state constraints ⋮ Unnamed Item ⋮ Online decision making for trading wind energy ⋮ Decentralized online convex optimization with compressed communications ⋮ Nonstationary online convex optimization with multiple predictions ⋮ Nearly Dimension-Independent Sparse Linear Bandit over Small Action Spaces via Best Subset Selection ⋮ The optimal dynamic regret for smoothed online convex optimization with squared \(l_2\) norm switching costs ⋮ Optimal Exploration–Exploitation in a Multi-armed Bandit Problem with Non-stationary Rewards ⋮ Dynamic regret of adaptive gradient methods for strongly convex problems ⋮ Technical Note—Nonstationary Stochastic Optimization Under Lp,q-Variation Measures ⋮ Nonstationary Bandits with Habituation and Recovery Dynamics ⋮ Bounds for the tracking error of first-order online optimization methods ⋮ Technical Note—Perishable Inventory Systems: Convexity Results for Base-Stock Policies and Learning Algorithms Under Censored Demand ⋮ Reinforcement with Fading Memories ⋮ Unnamed Item ⋮ Adaptive online distributed optimization in dynamic environments ⋮ A Simplex Method for Countably Infinite Linear Programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An analog of the minimax theorem for vector payoffs
- Robust Convex Optimization
- Dynamic Pricing with an Unknown Demand Model: Asymptotically Optimal Semi-Myopic Policies
- On the Minimax Complexity of Pricing in a Changing Environment
- Theory and Applications of Robust Optimization
- Dynamic Pricing Under a General Parametric Choice Model
- A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand
- Optimal Experimentation in a Changing Environment
- Learning Theory
- Regret and Convergence Bounds for a Class of Continuum-Armed Bandit Problems
- Stochastic Convex Optimization with Bandit Feedback
- Learning Theory and Kernel Machines
- Logarithmic Regret Algorithms for Online Convex Optimization
- Stochastic Estimation of the Maximum of a Regression Function
- A Stochastic Approximation Method
- Stochastic approximation
This page was built for publication: Non-Stationary Stochastic Optimization
