"On the Sample Complexity of a Policy Gradient Algorithm with Occupancy ..."

Anas Barakat et al. (2024)

> Home

Details and statistics

DOI: 10.48550/ARXIV.2410.04108

access: open

type: Informal or Other Publication

metadata version: 2024-11-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2410-04108
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2410-04108
Anas Barakat, Souradip Chakraborty, Peihong Yu, Pratap Tokekar, Amrit Singh Bedi:
On the Sample Complexity of a Policy Gradient Algorithm with Occupancy Approximation for General Utility Reinforcement Learning. CoRR abs/2410.04108 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.