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. 2012.06961
  4. Cited By
Online Stochastic Optimization with Wasserstein Based Non-stationarity
v1v2v3 (latest)

Online Stochastic Optimization with Wasserstein Based Non-stationarity

Management Sciences (MS), 2020
13 December 2020
Jiashuo Jiang
Xiaocheng Li
Jiawei Zhang
ArXiv (abs)PDFHTML

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

21 / 21 papers shown
No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need!
No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need!
Francesco Emanuele Stradi
Matteo Castiglioni
A. Marchesi
N. Gatti
Christian Kroer
612
4
0
16 Jun 2025
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
275
1
0
05 May 2025
Decision-Dependent Stochastic Optimization: The Role of Distribution Dynamics
Decision-Dependent Stochastic Optimization: The Role of Distribution Dynamics
Zhiyu He
S. Bolognani
Florian Dorfler
Michael Muehlebach
325
8
0
10 Mar 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
353
3
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 DistributionsOperational Research (OR), 2022
Jiashuo Jiang
Will Ma
Jiawei Zhang
476
19
0
03 Jan 2025
Infrequent Resolving Algorithm for Online Linear Programming
Infrequent Resolving Algorithm for Online Linear Programming
Guokai Li
Yuan Wang
Mingjie Li
660
2
0
01 Aug 2024
A Re-solving Heuristic for Dynamic Assortment Optimization with Knapsack Constraints
A Re-solving Heuristic for Dynamic Assortment Optimization with Knapsack Constraints
Xi Chen
Mo Liu
Yining Wang
Yuan Zhou
249
2
0
08 Jul 2024
Risk-averse Learning with Non-Stationary Distributions
Risk-averse Learning with Non-Stationary Distributions
Siyi Wang
Zifan Wang
Xinlei Yi
Michael M. Zavlanos
Karl H. Johansson
Sandra Hirche
162
2
0
03 Apr 2024
Grace Period is All You Need: Individual Fairness without Revenue Loss in Revenue Management
Grace Period is All You Need: Individual Fairness without Revenue Loss in Revenue Management
Patrick Jaillet
Chara Podimata
Zijie Zhou
FaML
240
0
0
13 Feb 2024
Constrained Online Two-stage Stochastic Optimization: Algorithm with
  (and without) Predictions
Constrained Online Two-stage Stochastic Optimization: Algorithm with (and without) PredictionsSocial Science Research Network (SSRN), 2024
Piao Hu
Jiashuo Jiang
Guodong Lyu
Hao Su
286
2
0
02 Jan 2024
High-dimensional Linear Bandits with Knapsacks
High-dimensional Linear Bandits with KnapsacksInternational Conference on Machine Learning (ICML), 2023
Wanteng Ma
Dong Xia
Jiashuo Jiang
261
1
0
02 Nov 2023
A Stability Principle for Learning under Non-Stationarity
A Stability Principle for Learning under Non-StationarityOperational Research (OR), 2023
Chengpiao Huang
Kaizheng Wang
622
9
0
27 Oct 2023
Distributionally Time-Varying Online Stochastic Optimization under
  Polyak-Łojasiewicz Condition with Application in Conditional Value-at-Risk
  Statistical Learning
Distributionally Time-Varying Online Stochastic Optimization under Polyak-Łojasiewicz Condition with Application in Conditional Value-at-Risk Statistical Learning
Yuen-Man Pun
Farhad Farokhi
Iman Shames
249
4
0
18 Sep 2023
Online Resource Allocation in Episodic Markov Decision Processes
Online Resource Allocation in Episodic Markov Decision Processes
Duksang Lee
William Overman
Dabeen Lee
405
1
0
18 May 2023
An Online Algorithm for Chance Constrained Resource Allocation
An Online Algorithm for Chance Constrained Resource AllocationIEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 2023
Yuwei Chen
Zengde Deng
Yinzhi Zhou
Zaiyi Chen
Yujie Chen
Haoyuan Hu
202
2
0
06 Mar 2023
Robust Budget Pacing with a Single Sample
Robust Budget Pacing with a Single SampleInternational Conference on Machine Learning (ICML), 2023
S. Balseiro
Rachitesh Kumar
Vahab Mirrokni
Balasubramanian Sivan
Di Wang
236
7
0
03 Feb 2023
Constrained Online Two-stage Stochastic Optimization: Near Optimal
  Algorithms via Adversarial Learning
Constrained Online Two-stage Stochastic Optimization: Near Optimal Algorithms via Adversarial Learning
Jiashuo Jiang
387
0
0
02 Feb 2023
Learning-Assisted Algorithm Unrolling for Online Optimization with
  Budget Constraints
Learning-Assisted Algorithm Unrolling for Online Optimization with Budget ConstraintsAAAI Conference on Artificial Intelligence (AAAI), 2022
Jianyi Yang
Shaolei Ren
332
3
0
03 Dec 2022
Online Resource Allocation under Horizon Uncertainty
Online Resource Allocation under Horizon UncertaintyMeasurement and Modeling of Computer Systems (SIGMETRICS), 2022
S. Balseiro
Christian Kroer
Rachitesh Kumar
318
17
0
27 Jun 2022
Non-stationary Bandits with Knapsacks
Non-stationary Bandits with KnapsacksNeural Information Processing Systems (NeurIPS), 2022
Shang Liu
Jiashuo Jiang
Xiaocheng Li
377
28
0
25 May 2022
The Best of Many Worlds: Dual Mirror Descent for Online Allocation
  Problems
The Best of Many Worlds: Dual Mirror Descent for Online Allocation ProblemsOperational Research (OR), 2020
S. Balseiro
Haihao Lu
Vahab Mirrokni
552
135
0
18 Nov 2020
1
Page 1 of 1