MétaCan
ENFR
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

Export CSVExport JSONAPI query

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Year range
→
Sort
Language
Type
Field
Venue
Topic
Advanced Bandit Algorithms Research
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

436 results · 1 filter active ·
Categories
Machine labels · sparse coverage
Evidence
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
436 works in the cohort · of 4,299,418page 1 of 9

Labels cover 1 of 436 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 436 of 436 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affunlabeled
Bandit Algorithms
2020· book· en· Cambridge University Press eBooks· Decision Sciences
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
851
citations
affno abstractunlabeled
Algorithms for Reinforcement Learning
2010· book· en· Synthesis lectures on artificial intelligence and machine learning· Decision Sciences
distilled prediction:candidate · metaresearch+metaepi_narrow+sts+research_integrity+insufficient_payloadconsensus · insufficient_payload
750
citations
affunlabeled
Contextual Multi-Armed Bandits
2010· article· en· Decision Sciences
distilled prediction:candidate · metaresearch+insufficient_payloadconsensus · insufficient_payload
164
citations
affunlabeled
Online Optimization in X-Armed Bandits
2008· article· en· RePEc: Research Papers in Economics· Decision Sciences
distilled prediction:candidate · metaresearchconsensus · none
122
citations
affunlabeled
Online learning under delayed feedback
2015· article· en· Open Collections· Decision Sciences
distilled prediction:candidate · sts+scholarly_communication+insufficient_payloadconsensus · insufficient_payload
98
citations
affunlabeled
Bernoulli Rank-1 Bandits for Click Feedback
2017· preprint· en· Decision Sciences
distilled prediction:candidate · metaresearch+metaepi_narrow+scholarly_communication+open_science+insufficient_payloadconsensus · insufficient_payload
75
citations
affunlabeled
Online Learning with Sample Path Constraints
2009· article· en· DSpace@MIT (Massachusetts Institute of Technology)· Decision Sciences
distilled prediction:candidate · metaresearch+metaepi_narrowconsensus · none
74
citations
affno abstractunlabeled
Partial Monitoring with Side Information
2012· book-chapter· en· Lecture notes in computer science· Decision Sciences
distilled prediction:candidate · noneconsensus · none
69
citations
affunlabeled
Dueling algorithms
2011· article· en· Decision Sciences
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
66
citations
affunlabeled
On Explore-Then-Commit Strategies
2016· preprint· en· arXiv (Cornell University)· Decision Sciences
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
59
citations
affunlabeled
Bayesian Multi-Scale Optimistic Optimization
2014· preprint· en· arXiv (Cornell University)· Decision Sciences
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
53
citations
affunlabeled
Combinatorial cascading bandits
2015· article· en· Decision Sciences
distilled prediction:candidate · insufficient_payloadconsensus · none
51
citations
affunlabeled
Robust Multiarmed Bandit Problems
2015· article· en· Management Science· Decision Sciences
distilled prediction:candidate · insufficient_payloadconsensus · none
51
citations
affno abstractunlabeled
The Budgeted Multi-armed Bandit Problem
2004· book-chapter· en· Lecture notes in computer science· Decision Sciences
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_scienceconsensus · none
44
citations
affno abstractunlabeled
Near-optimal PAC bounds for discounted MDPs
2014· article· en· Theoretical Computer Science· Decision Sciences
distilled prediction:candidate · sts+scholarly_communicationconsensus · none
43
citations
affunlabeled
PAC-Bayesian Analysis of Contextual Bandits
2011· article· la· MPG.PuRe (Max Planck Society)· Decision Sciences
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
40
citations
affunlabeled
Online (Budgeted) Social Choice
2014· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Decision Sciences
distilled prediction:candidate · metaresearchconsensus · none
33
citations
next →

How this was built: Screen · Findings · About