Jiashuo Jiang

Orcid: 0000-0001-5230-4231

According to our database1, Jiashuo Jiang authored at least 20 papers between 2020 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
A Lyapunov Drift-Plus-Penalty Method Tailored for Reinforcement Learning with Queue Stability.
CoRR, June, 2025

Adaptive Resolving Methods for Reinforcement Learning with Function Approximations.
CoRR, May, 2025

Adaptive Bidding Policies for First-Price Auctions with Budget Constraints under Non-stationarity.
CoRR, May, 2025

Efficiently Solving Discounted MDPs with Predictions on Transition Matrices.
CoRR, February, 2025

Joint Pricing and Resource Allocation: An Optimal Online-Learning Approach.
CoRR, January, 2025

Learning to Price with Resource Constraints: From Full Information to Machine-Learned Prices.
CoRR, January, 2025

Tight Guarantees for Multiunit Prophet Inequalities and Online Stochastic Knapsack.
Oper. Res., 2025

Reinforcement Learning with Intrinsically Motivated Feedback Graph for Lost-sales Inventory Control.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2025

2024
Learning to Order for Inventory Systems with Lost Sales and Uncertain Supplies.
Manag. Sci., 2024

Regret Minimization and Statistical Inference in Online Decision Making with High-dimensional Covariates.
CoRR, 2024

Constrained Online Two-stage Stochastic Optimization: Algorithm with (and without) Predictions.
CoRR, 2024

Achieving Õ(1/ε) Sample Complexity for Constrained Markov Decision Process.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

High-dimensional Linear Bandits with Knapsacks.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023
Achieving High Individual Service Levels Without Safety Stock? Optimal Rationing Policy of Pooled Resources.
Oper. Res., January, 2023

Constant Approximation for Network Revenue Management with Markovian-Correlated Customer Arrivals.
CoRR, 2023

Tightness without Counterexamples: A New Approach and New Results for Prophet Inequalities.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022
Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions.
CoRR, 2022

Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Non-stationary Bandits with Knapsacks.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2020
Online Stochastic Optimization with Wasserstein Based Non-stationarity.
CoRR, 2020


  Loading...