MétaCan
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.

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
Author
Year range
Sort
Language
Type
Field
Venue
Topic
Stochastic Gradient Optimization Techniques
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.

271 results · 1 filter active ·
Results by year
20002025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
271 works in the cohort · of 4,299,418page 2 of 6

Labels cover 1 of 271 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 271 of 271 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affunlabeled
A Subsampling Line-Search Method with Second-Order Results
El Houcine Bergou, Youssef Diouane, Vladimír Kunc, Vyacheslav Kungurtsev, Clément W. Royer
2022· article· en· INFORMS Journal on Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affunlabeled
From PAC-Bayes Bounds to KL Regularization
Pascal Germain, Alexandre Lacasse, Mario Marchand, Sara Shanian, François Laviolette
2009· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affunlabeled
Hierarchical coded matrix multiplication
Shahrzad Kiani, Nuwan S. Ferdinand, Stark C. Draper
2019· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
fundno affunlabeled
Differentially Quantized Gradient Descent
Chung-Yi Lin, Victoria Kostina, Babak Hassibi
2021· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affunlabeled
Gradient Estimation with Stochastic Softmax Tricks
Max B. Paulus, Dami Choi, Daniel Tarlow, Andreas Krause, Chris J. Maddison
2020· article· en· Neural Information Processing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Stochastic Sign Descent Methods: New Algorithms and Better Theory
Mher Safaryan, Peter Richtárik
2021· article· en· King Abdullah University of Science and Technology Repository (King Abdullah University of Science and Technology)· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations

How this was built: Screen · Findings · About