Show simple item record

dc.contributor.authorBlock, Adam
dc.contributor.authorKidambi, Rahul
dc.contributor.authorHill, Daniel
dc.contributor.authorJoachims, Thorsten
dc.contributor.authorDhillon, Inderjit
dc.date.accessioned2022-11-04T18:39:20Z
dc.date.available2022-11-04T18:39:20Z
dc.date.issued2022-07-06
dc.identifier.isbn978-1-4503-8732-3
dc.identifier.urihttps://hdl.handle.net/1721.1/146167
dc.publisherACM|Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrievalen_US
dc.relation.isversionofhttps://doi.org/10.1145/3477495.3531958en_US
dc.rightsCreative Commons Attribution 4.0 International licenseen_US
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/en_US
dc.sourceACM|Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrievalen_US
dc.titleCounterfactual Learning To Rank for Utility-Maximizing Query Autocompletionen_US
dc.typeArticleen_US
dc.identifier.citationBlock, Adam, Kidambi, Rahul, Hill, Daniel, Joachims, Thorsten and Dhillon, Inderjit. 2022. "Counterfactual Learning To Rank for Utility-Maximizing Query Autocompletion."
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematics
dc.contributor.departmentStatistics and Data Science Center (Massachusetts Institute of Technology)
dc.identifier.mitlicensePUBLISHER_CC
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2022-11-03T00:21:56Z
dc.language.rfc3066en
dc.rights.holderThe author(s)
dspace.date.submission2022-11-03T00:21:56Z
mit.licensePUBLISHER_CC
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record