{"url":"/dataset/duolingo-notifications-data","name":"Duolingo Bandit Notifications","full_name":null,"description_markdown":"Replication datasets (200 million rows) used in experiments by Yancey & Settles (2020). (2019-06-11)","description_withheld":null,"homepage":"https://dataverse.harvard.edu/dataset.xhtml?persistentId=doi:10.7910/DVN/23ZWVI","introduced_date":"2020-08-23","introduced_date_note":null,"introduced_by":{"paper":"/paper/a-sleeping-recovering-bandit-algorithm-for","title":"A Sleeping, Recovering Bandit Algorithm for Optimizing Recurring Notifications","first_author":"Kevin P. Yancey","url":null},"license":{"name":"CC BY-NC 4.0","url":"https://creativecommons.org/licenses/by-nc/4.0/"},"modalities":[{"name":"Time series","url":"/datasets/modality/time-series"}],"tasks":[{"name":"Multi-Armed Bandits","url":"/task/multi-armed-bandits","datasets_with_task":"/datasets/task/multi-armed-bandits"}],"languages":[],"variants":["Duolingo Bandit Notifications"],"data_loaders":[],"num_papers_in_archive":1,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[],"papers_with_a_benchmark_row":[],"syntology_totals":{"read_at":"2026-09-25T09:33:49+00:00","papers_with_samples":0,"samples_harvested":0,"samples_ran":0,"samples_unverified":0,"pointer_only_for_licence":0,"papers_with_no_sample_that_ran":0,"note":"the per-paper counts above, summed; not a rate"},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks."}