Cover Image

Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Long-Fei, Zhang, Yu-Jie, Zhao, Peng, Zhou, Zhi-Hua
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Variance-Adaptive Optimal Algorithm for Reinforcement Learning with Multinomial Logit Function Approximation
by: Kim, Wonyoung, et al.
Published: (2026)

Provably Efficient Online RLHF with One-Pass Reward Modeling
by: Li, Long-Fei, et al.
Published: (2025)

Contextual Multinomial Logit Bandits with General Value Functions
by: Zhang, Mengxiao, et al.
Published: (2024)

Randomized Exploration for Reinforcement Learning with Multinomial Logistic Function Approximation
by: Cho, Wooseong, et al.
Published: (2024)

Model-Based Reinforcement Learning with Multinomial Logistic Function Approximation
by: Hwang, Taehyun, et al.
Published: (2022)

Infinite-Horizon Reinforcement Learning with Multinomial Logistic Function Approximation
by: Park, Jaehyun, et al.
Published: (2024)

Provable Risk-Sensitive Distributional Reinforcement Learning with General Function Approximation
by: Chen, Yu, et al.
Published: (2024)

Provably and Practically Efficient Adversarial Imitation Learning with General Function Approximation
by: Xu, Tian, et al.
Published: (2024)

Learning in Position-Aware Multinomial Logit Bandits: From Multiplicative to General Position Effects
by: Chen, Xi, et al.
Published: (2026)

A Tractable Online Learning Algorithm for the Multinomial Logit Contextual Bandit
by: Agrawal, Priyank, et al.
Published: (2020)

Tractable Multinomial Logit Contextual Bandits with Non-Linear Utilities
by: Hwang, Taehyun, et al.
Published: (2026)

Provably Efficient Offline-to-Online Value Adaptation with General Function Approximation
by: Li, Shangzhe, et al.
Published: (2026)

Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs
by: Li, Long-Fei, et al.
Published: (2024)

Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition
by: Li, Long-Fei, et al.
Published: (2024)

Learning Multinomial Logits in $O(n \log n)$ time
by: Chierichetti, Flavio, et al.
Published: (2026)

Optimal Design for Multinomial Logit Model with Applications to Best Assortment Identification
by: Lee, Joongkyu, et al.
Published: (2026)

Provably Efficient Action-Manipulation Attack Against Continuous Reinforcement Learning
by: Luo, Zhi, et al.
Published: (2024)

Bellman Unbiasedness: Toward Provably Efficient Distributional Reinforcement Learning with General Value Function Approximation
by: Cho, Taehyun, et al.
Published: (2024)

Provably Efficient Infinite-Horizon Average-Reward Reinforcement Learning with Linear Function Approximation
by: Chae, Woojin, et al.
Published: (2024)

Distributionally Robust Off-Dynamics Reinforcement Learning: Provable Efficiency with Linear Function Approximation
by: Liu, Zhishuai, et al.
Published: (2024)

Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation
by: Zhao, Runze, et al.
Published: (2025)

Provably Efficient Partially Observable Risk-Sensitive Reinforcement Learning with Hindsight Observation
by: Zhang, Tonghe, et al.
Published: (2024)

Efficient Methods for Non-stationary Online Learning
by: Zhao, Peng, et al.
Published: (2023)

Reinforcement Learning with Function Approximation: From Linear to Nonlinear
by: Long, Jihao, et al.
Published: (2023)

Reinforcement Learning from Partial Observation: Linear Function Approximation with Provable Sample Efficiency
by: Cai, Qi, et al.
Published: (2022)

Provably Efficient Reward Transfer in Reinforcement Learning with Discrete Markov Decision Processes
by: Vora, Kevin, et al.
Published: (2025)

Provably Sample-Efficient Robust Reinforcement Learning with Average Reward
by: Roch, Zachary, et al.
Published: (2025)

Provable Reinforcement Learning from Human Feedback with an Unknown Link Function
by: Zhang, Qining, et al.
Published: (2025)

Multi-objective Reinforcement Learning with Nonlinear Preferences: Provable Approximation for Maximizing Expected Scalarized Return
by: Peng, Nianli, et al.
Published: (2023)

Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization
by: Zhao, Peng, et al.
Published: (2021)

Exploratory Machine Learning with Unknown Unknowns
by: Zhao, Peng, et al.
Published: (2020)

Provably Efficient Exploration in Inverse Constrained Reinforcement Learning
by: Yue, Bo, et al.
Published: (2024)

Stochastic Approximation Approaches to Group Distributionally Robust Optimization and Beyond
by: Zhang, Lijun, et al.
Published: (2023)

An Efficient Subgraph GNN with Provable Substructure Counting Power
by: Yan, Zuoyu, et al.
Published: (2023)

Heavy-Tailed Linear Bandits: Huber Regression with One-Pass Update
by: Wang, Jing, et al.
Published: (2025)

Nonstationary Reinforcement Learning with Linear Function Approximation
by: Zhou, Huozhi, et al.
Published: (2020)

Provable Representation with Efficient Planning for Partial Observable Reinforcement Learning
by: Zhang, Hongming, et al.
Published: (2023)

RA-PbRL: Provably Efficient Risk-Aware Preference-Based Reinforcement Learning
by: Zhao, Yujie, et al.
Published: (2024)

Provable Memory Efficient Self-Play Algorithm for Model-free Reinforcement Learning
by: Li, Na, et al.
Published: (2025)

TreeLoRA: Efficient Continual Learning via Layer-Wise LoRAs Guided by a Hierarchical Gradient-Similarity Tree
by: Qian, Yu-Yang, et al.
Published: (2025)