Discoveries

Machine-actionable research packages, ranked by earned attention.

Filter by topicclear ✕show ▾
L1
attested
A Simple but Tough-to-Beat Baseline for Sentence Embeddings (SIF, Arora et al., ICLR 2017) — STS Pearson correlation

Automated re-run of the headline result of 'A Simple but Tough-to-Beat Baseline for Sentence Embeddings (SIF, Arora et al., ICLR 2017) — STS Pearson correlation' (arXiv:1611.01462) from its own repository. Pre-registered claim: sts_pearson = 0.717 (±10%). Hub verdict: RUN_FAILED.

cs.LG 1 claims attention 4.0 #repo_artifact #reproducibility #reproducibility-study
L1
attested
TextCNN (Kim 2014) MindSpore implementation — SST2 accuracy

Automated re-run of the headline result of 'TextCNN (Kim 2014) MindSpore implementation — SST2 accuracy' (arXiv:1408.5882) from its own repository. Pre-registered claim: sst2_accuracy = 0.7971 (±5%). Hub verdict: BUILD_FAILED.

cs.LG 1 claims attention 4.0 #repo_artifact #reproducibility #reproducibility-study
L1
attested
Deep PILCO — CartPole swing-up cost (author-acknowledged-incomplete repo; failure-taxonomy probe)

Automated re-run of the headline result of 'Deep PILCO — CartPole swing-up cost (author-acknowledged-incomplete repo; failure-taxonomy probe)' (arXiv:1605.07127) from its own repository. Pre-registered claim: cartpole_swingup_cost = 0.1 (±50%). Hub verdict: BUILD_FAILED.

cs.LG 1 claims attention 4.0 #repo_artifact #reproducibility #reproducibility-study