{"url":"/sota/cover-song-identification-on-youtube350","task":{"name":"Cover song identification","url":"/task/cover-song-identification","note":null},"dataset":{"name":"YouTube350","url":null},"category":"Music","categories":["Music"],"category_note":null,"description":"**Cover Song Identification** is the task of identifying an alternative version of a previous musical piece, even though it may differ substantially in timbre, tempo, structure, and even fundamental aspects relating to the harmony and melody of the song. The term “cover” is so wide that it ranges from acoustic renditions of a previous song, to Jimi Hendrix’ famous (and radical) reinterpretation of Bob Dylan’s “All Along the Watchtower”, to Rage Against the Machine essentially rewriting Bob Dylan’s “Maggie’s Farm”. Beyond its value for computational musicology and for enhancing music recommendation, Cover Song Identification is of interest because of its potential for benchmarking other music similarity and retrieval algorithms. Chord analysis, melody extraction and music similarity are all strongly connected to Cover Song Identification - another field of music analysis where AI has been applied.\n\n\n<span class=\"description-source\">Source: [Artificial Musical Intelligence: A Survey ](https://arxiv.org/abs/2006.10553)</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["MAP"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"MAP":"higher"}},"counts":{"rows":4,"rows_with_code":3,"rows_with_paper_page":4,"rows_dated":4,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"SCNN-M","metrics":{"MAP":"0.961"},"uses_additional_data":false,"paper_date":"2020-05-14","paper":"/paper/similarity-learning-for-cover-song","paper_url":"https://ieeexplore.ieee.org/abstract/document/9053257","paper_title":"SIMILARITY LEARNING FOR COVER SONG IDENTIFICATION USING CROSS-SIMILARITY MATRICES OF MULTI-LEVEL DEEP SEQUENCES","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":2,"model":"ByteCover","metrics":{"MAP":"0.955"},"uses_additional_data":false,"paper_date":"2020-10-27","paper":"/paper/bytecover-cover-song-identification-via-multi","paper_url":"https://arxiv.org/abs/2010.14022v2","paper_title":"ByteCover: Cover Song Identification via Multi-Loss Training","code":"https://github.com/Orfium/bytecover","n_code_links":1,"syntology":null},{"rank_in_archive_order":3,"model":"CQT-Net","metrics":{"MAP":"0.917"},"uses_additional_data":false,"paper_date":"2019-11-01","paper":"/paper/learning-a-representation-for-cover-song","paper_url":"https://arxiv.org/abs/1911.00334v1","paper_title":"Learning a Representation for Cover Song Identification Using Convolutional Neural Network","code":"https://github.com/yzspku/CQTNet","n_code_links":2,"syntology":null},{"rank_in_archive_order":4,"model":"MOVE","metrics":{"MAP":"0.885"},"uses_additional_data":false,"paper_date":"2019-10-28","paper":"/paper/accurate-and-scalable-version-identification","paper_url":"https://arxiv.org/abs/1910.12551v2","paper_title":"Accurate and Scalable Version Identification Using Musically-Motivated Embeddings","code":"https://github.com/furkanyesiler/move","n_code_links":1,"syntology":null}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,885 of the 9,623 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9623,"papers_checked":6885,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":2737},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-25T09:33:49+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":0,"rows_with_any_sample_ran":0,"distinct_papers_with_graph_line":0,"distinct_papers_with_any_sample_ran":0,"samples_over_distinct_papers":{"n_ran":0,"n_unverified":0,"n_samples":0,"n_pointer_only_licence":0,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":0,"n_unverified":0,"n_samples":0,"n_pointer_only_licence":0,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}