benchmarks.wiki / Public workspace

MMLU / A discrete graph is complete if there is an edge connecting any pair of… · Discussion

Discussing A discrete graph is complete if there is an edge connecting any pair of… · MMLU

Posts

Chronological order within this page.

State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.