ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2012.06961
  4. Cited By
Online Stochastic Optimization with Wasserstein Based Non-stationarity

Online Stochastic Optimization with Wasserstein Based Non-stationarity

13 December 2020
Jiashuo Jiang
Xiaocheng Li
Jiawei Zhang
ArXivPDFHTML

Papers citing "Online Stochastic Optimization with Wasserstein Based Non-stationarity"

9 / 9 papers shown
Title
Adaptive Bidding Policies for First-Price Auctions with Budget Constraints under Non-stationarity
Adaptive Bidding Policies for First-Price Auctions with Budget Constraints under Non-stationarity
Yige Wang
Jiashuo Jiang
32
0
0
05 May 2025
Efficiently Solving Discounted MDPs with Predictions on Transition Matrices
Efficiently Solving Discounted MDPs with Predictions on Transition Matrices
Lixing Lyu
Jiashuo Jiang
Wang Chi Cheung
42
1
0
24 Feb 2025
Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions
Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions
Jiashuo Jiang
Will Ma
Jiawei Zhang
26
14
0
03 Jan 2025
A Stability Principle for Learning under Non-Stationarity
A Stability Principle for Learning under Non-Stationarity
Chengpiao Huang
Kaizheng Wang
47
2
0
27 Oct 2023
Robust Budget Pacing with a Single Sample
Robust Budget Pacing with a Single Sample
S. Balseiro
Rachitesh Kumar
Vahab Mirrokni
Balasubramanian Sivan
Di Wang
23
2
0
03 Feb 2023
Learning-Assisted Algorithm Unrolling for Online Optimization with
  Budget Constraints
Learning-Assisted Algorithm Unrolling for Online Optimization with Budget Constraints
Jianyi Yang
Shaolei Ren
25
2
0
03 Dec 2022
Online Resource Allocation under Horizon Uncertainty
Online Resource Allocation under Horizon Uncertainty
S. Balseiro
Christian Kroer
Rachitesh Kumar
29
15
0
27 Jun 2022
The Best of Many Worlds: Dual Mirror Descent for Online Allocation
  Problems
The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems
S. Balseiro
Haihao Lu
Vahab Mirrokni
27
101
0
18 Nov 2020
Weighted Linear Bandits for Non-Stationary Environments
Weighted Linear Bandits for Non-Stationary Environments
Yoan Russac
Claire Vernade
Olivier Cappé
82
102
0
19 Sep 2019
1