Pages that link to "Item:Q2795881"

The following pages link to Non-Stationary Stochastic Optimization (Q2795881):

Displaying 23 items.

• Bounds for the tracking error of first-order online optimization methods (Q2032000) (← links)
• Handling concept drift via model reuse (Q2183593) (← links)
• Decentralized online convex optimization based on signs of relative states (Q2665168) (← links)
• Reinforcement with Fading Memories (Q3387923) (← links)
• Dynamic Pricing and Learning with Finite Inventories (Q3465597) (← links)
• (Q4633030) (← links)
• Technical Note—Perishable Inventory Systems: Convexity Results for Base-Stock Policies and Learning Algorithms Under Censored Demand (Q4971563) (← links)
• (Q4999102) (← links)
• A Simplex Method for Countably Infinite Linear Programs (Q5020851) (← links)
• Tracking and Regret Bounds for Online Zeroth-Order Euclidean and Riemannian Optimization (Q5072586) (← links)
• Data-Driven Pricing for a New Product (Q5080649) (← links)
• Learning in Structured MDPs with Convex Cost Functions: Improved Regret Bounds for Inventory Management (Q5095166) (← links)
• Optimal Exploration–Exploitation in a Multi-armed Bandit Problem with Non-stationary Rewards (Q5113912) (← links)
• Technical Note—Nonstationary Stochastic Optimization Under <i>L</i>_<i>p,q</i>-Variation Measures (Q5129221) (← links)
• Nonstationary Bandits with Habituation and Recovery Dynamics (Q5144777) (← links)
• Adaptive online distributed optimization in dynamic environments (Q5865329) (← links)
• Stochastic approximation with nondecaying gain: Error bound and data‐driven gain‐tuning (Q6054830) (← links)
• 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 (Q6072149) (← links)
• A relaxation-based probabilistic approach for PDE-constrained optimization under uncertainty with pointwise state constraints (Q6097761) (← links)
• Online decision making for trading wind energy (Q6134306) (← links)
• Decentralized online convex optimization with compressed communications (Q6136129) (← links)
• Nonstationary online convex optimization with multiple predictions (Q6151925) (← links)
• The optimal dynamic regret for smoothed online convex optimization with squared \(l_2\) norm switching costs (Q6157294) (← links)