Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Audrey Durand

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Maxime Heuillet

> Home > Persons > Audrey Durand

Publications

2024
[i20]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2402-05002
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2402-05002
Maxime Heuillet, Ola Ahmad, Audrey Durand:
Randomized Confidence Bounds for Stochastic Partial Monitoring. CoRR abs/2402.05002 (2024)
2022
[c19]
- view
  - electronic edition @ ceur-ws.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/aaai/GodboutHRBD22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaai/GodboutHRBD22
Mathieu Godbout, Maxime Heuillet, Sharath Chandra Raparthy, Rupali Bhati, Audrey Durand:
A Game-Theoretic Perspective on Risk-Sensitive Reinforcement Learning. SafeAI@AAAI 2022
2021
[i14]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2109-09470
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2109-09470
Mathieu Godbout, Maxime Heuillet, Sharath Chandra, Rupali Bhati, Audrey Durand:
CARL: Conditional-value-at-risk Adversarial Reinforcement Learning. CoRR abs/2109.09470 (2021)

a service of

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.