:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Lu, Miao, Zhong, Han, Zhang, Tong, Blanchet, Jose
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2404.03578
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Learning an Optimal Assortment Policy under Observational Data
by: Han, Yuxuan, et al.
Published: (2025)

Robust Assortment Optimization from Observational Data
by: Lu, Miao, et al.
Published: (2026)

Single-Trajectory Distributionally Robust Reinforcement Learning
by: Liang, Zhipeng, et al.
Published: (2023)

On the Foundation of Distributionally Robust Reinforcement Learning
by: Wang, Shengbo, et al.
Published: (2023)

Learning Optimal Distributionally Robust Stochastic Control in Continuous State Spaces
by: Wang, Shengbo, et al.
Published: (2024)

Wasserstein Distributionally Robust Regret Optimization for Reinforcement Learning from Human Feedback
by: Wang, Yikai, et al.
Published: (2026)

ORVIT: Near-Optimal Online Distributionally Robust Reinforcement Learning
by: Ghosh, Debamita, et al.
Published: (2025)

Unifying Distributionally Robust Optimization via Optimal Transport Theory
by: Blanchet, Jose, et al.
Published: (2023)

Wasserstein Distributionally Robust Regret Optimization
by: Fiechtner, Lukas-Benedikt, et al.
Published: (2025)

Towards Robust Offline Reinforcement Learning under Diverse Data Corruption
by: Yang, Rui, et al.
Published: (2023)

Near-Optimal Sample Complexities of Divergence-based S-rectangular Distributionally Robust Reinforcement Learning
by: Li, Zhenghao, et al.
Published: (2025)

Distributionally Robust Model-Based Offline Reinforcement Learning with Near-Optimal Sample Complexity
by: Shi, Laixi, et al.
Published: (2022)

Near-Optimal Algorithms for Group Distributionally Robust Optimization and Beyond
by: Soma, Tasuku, et al.
Published: (2022)

Gap-Dependent Bounds for Nearly Minimax Optimal Reinforcement Learning with Linear Function Approximation
by: Zhang, Haochen, et al.
Published: (2026)

Minimax Optimal and Computationally Efficient Algorithms for Distributionally Robust Offline Reinforcement Learning
by: Liu, Zhishuai, et al.
Published: (2024)

A Finite Sample Complexity Bound for Distributionally Robust Q-learning
by: Wang, Shengbo, et al.
Published: (2023)

Near-Optimality of Contrastive Divergence Algorithms
by: Glaser, Pierre, et al.
Published: (2025)

Near-Minimax-Optimal Distributional Reinforcement Learning with a Generative Model
by: Rowland, Mark, et al.
Published: (2024)

Sample Complexity of Variance-reduced Distributionally Robust Q-learning
by: Wang, Shengbo, et al.
Published: (2023)

DRO: A Python Library for Distributionally Robust Optimization in Machine Learning
by: Liu, Jiashuo, et al.
Published: (2025)

Reinforcement Learning for Individual Optimal Policy from Heterogeneous Data
by: Miao, Rui, et al.
Published: (2025)

Deep Learning for Markov Chains: Lyapunov Functions, Poisson's Equation, and Stationary Distributions
by: Qu, Yanlin, et al.
Published: (2025)

Distributed Saddle-Point Problems: Lower Bounds, Near-Optimal and Robust Algorithms
by: Beznosikov, Aleksandr, et al.
Published: (2020)

Near-Optimal Cryptographic Hardness of Learning With Homogeneous Halfspaces Under Gaussian Marginals
by: Huang, Jizhou, et al.
Published: (2026)

A Nearly Optimal and Low-Switching Algorithm for Reinforcement Learning with General Function Approximation
by: Zhao, Heyang, et al.
Published: (2023)

Optimal Sample Complexity for Average Reward Markov Decision Processes
by: Wang, Shengbo, et al.
Published: (2023)

Towards Optimal Adversarial Robust Reinforcement Learning with Infinity Measurement Error
by: Li, Haoran, et al.
Published: (2025)

Optimality and NP-Hardness of Transformers in Learning Markovian Dynamical Functions
by: Ding, Yanna, et al.
Published: (2025)

Duality and Policy Evaluation in Distributionally Robust Bayesian Diffusion Control
by: Blanchet, Jose, et al.
Published: (2025)

Realizable Abstractions: Near-Optimal Hierarchical Reinforcement Learning
by: Cipollone, Roberto, et al.
Published: (2025)

Distributionally Robust Optimization as a Scalable Framework to Characterize Extreme Value Distributions
by: Kuiper, Patrick, et al.
Published: (2024)

When Should Humans Step In? Optimal Human Dispatching in AI-Assisted Decisions
by: Tan, Lezhi, et al.
Published: (2026)

Automatic Outlier Rectification via Optimal Transport
by: Blanchet, Jose, et al.
Published: (2024)

Near-Optimal Algorithms for Omniprediction
by: Okoroafor, Princewill, et al.
Published: (2025)

Outcome-Based Online Reinforcement Learning: Algorithms and Fundamental Limits
by: Chen, Fan, et al.
Published: (2025)

Regret-Optimal Q-Learning with Low Cost for Single-Agent and Federated Reinforcement Learning
by: Zhang, Haochen, et al.
Published: (2025)

Score-based Metropolis-Hastings for Fractional Langevin Algorithms
by: Aloui, Ahmed, et al.
Published: (2026)

On Uncertainty Quantification for Near-Bayes Optimal Algorithms
by: Wang, Ziyu, et al.
Published: (2024)

Nearly-Optimal Algorithm for Adversarial Kernelized Bandits
by: Iwazaki, Shogo
Published: (2026)

Near Optimal Inference for the Best-Performing Algorithm
by: Painsky, Amichai
Published: (2025)