ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1708.03020
  4. Cited By
Non-stationary Stochastic Optimization under $L_{p,q}$-Variation
  Measures
v1v2v3 (latest)

Non-stationary Stochastic Optimization under Lp,qL_{p,q}Lp,q​-Variation Measures

9 August 2017
Xi Chen
Yining Wang
Yu Wang
ArXiv (abs)PDFHTML

Papers citing "Non-stationary Stochastic Optimization under $L_{p,q}$-Variation Measures"

8 / 8 papers shown
Learning to Price Supply Chain Contracts against a Learning Retailer
Learning to Price Supply Chain Contracts against a Learning RetailerSocial Science Research Network (SSRN), 2022
Xuejun Zhao
Ruihao Zhu
W. Haskell
OffRL
260
1
0
02 Nov 2022
Second Order Path Variationals in Non-Stationary Online Learning
Second Order Path Variationals in Non-Stationary Online LearningInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2022
Dheeraj Baby
Yu Wang
482
7
0
04 May 2022
Optimal Dynamic Regret in Proper Online Learning with Strongly Convex
  Losses and Beyond
Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and BeyondInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2022
Dheeraj Baby
Yu Wang
323
34
0
21 Jan 2022
Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for
  Online Convex Optimization
Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex OptimizationJournal of machine learning research (JMLR), 2021
Peng Zhao
Yu Zhang
Lijun Zhang
Zhi Zhou
434
89
0
29 Dec 2021
Optimal Dynamic Regret in Exp-Concave Online Learning
Optimal Dynamic Regret in Exp-Concave Online LearningAnnual Conference Computational Learning Theory (COLT), 2021
Dheeraj Baby
Yu Wang
331
53
0
23 Apr 2021
Adaptive Importance Sampling for Finite-Sum Optimization and Sampling
  with Decreasing Step-Sizes
Adaptive Importance Sampling for Finite-Sum Optimization and Sampling with Decreasing Step-SizesNeural Information Processing Systems (NeurIPS), 2021
Ayoub El Hanchi
D. Stephens
181
17
0
23 Mar 2021
Temporal Variability in Implicit Online Learning
Temporal Variability in Implicit Online LearningNeural Information Processing Systems (NeurIPS), 2020
Nicolò Campolongo
Francesco Orabona
362
29
0
12 Jun 2020
Online and Bandit Algorithms for Nonstationary Stochastic Saddle-Point
  Optimization
Online and Bandit Algorithms for Nonstationary Stochastic Saddle-Point Optimization
Abhishek Roy
Yifang Chen
Krishnakumar Balasubramanian
P. Mohapatra
323
28
0
03 Dec 2019
1
Page 1 of 1