Scott Niekum

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 Stephane Hatgis-Kessell

> Home > Persons > Scott Niekum

Publications

2024
[c62]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/aaai/KnoxHABDSN24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaai/KnoxHABDSN24
W. Bradley Knox, Stephane Hatgis-Kessell, Sigurdur O. Adalgeirsson, Serena Booth, Anca D. Dragan, Peter Stone, Scott Niekum:
Learning Optimal Advantage from Preferences and Mistaking It for Reward. AAAI 2024: 10066-10073
2023
[i45]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2310-02456
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2310-02456
W. Bradley Knox, Stephane Hatgis-Kessell, Sigurdur O. Adalgeirsson, Serena Booth, Anca D. Dragan, Peter Stone, Scott Niekum:
Learning Optimal Advantage from Preferences and Mistaking it for Reward. CoRR abs/2310.02456 (2023)
2022
[i39]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2206-02231
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2206-02231
W. Bradley Knox, Stephane Hatgis-Kessell, Serena Booth, Scott Niekum, Peter Stone, Alessandro Allievi:
Models of human preference for learning reward functions. CoRR abs/2206.02231 (2022)

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.