Graph explorer

TTTTTackling WinoGrande Schemas

We applied the T5 sequence-to-sequence model to tackle the AI2 WinoGrande Challenge by decomposing each example into two input text strings, each containing a hypothesis, and using the probabilities assigned to the "entailment" token as a score of the hypothesis. Our first (and only) submission to the official leaderboard yielded 0.7673 AUC on March 13, 2020, which is the best known result at this time and beats the previous state of the art by over five points.

9 nodes14 linksoverview previewTTTTTackling WinoGrande Schemas
9 nodes14 links
TTTTTackling WinoGrande Schemas9 visible / 9 total nodes / 28 links
Related contextWorks onCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipAuthorshipWorks onWorks onWorks onAuthorshipAuthorshipAuthorshipTopic signalTopic signalAuthorshipAuthorshipWTTTTTackling WinoGrande Schemaspreprint / 2020ASheng-Chieh LinResearcherAJheng-Hong YangResearcherARodrigo NogueiraResearcherAMing-Feng TsaiResearcherTMachine Learning49008 worksTComputation and Language14115 worksAChuan-Ju WangResearcherAJimmy LinResearcher
PaperSignal 108 links

TTTTTackling WinoGrande Schemas

preprint / 2020

Open