{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/bytecover2-towards-dimensionality-reduction","title":"BYTECOVER2: TOWARDS DIMENSIONALITY REDUCTION OF LATENT EMBEDDING FOR EFFICIENT COVER SONG IDENTIFICATION","arxiv_id":null,"date":"2022-04-27","proceeding":"ICASSP 2022 4","authors":["Xingjian Du","Ke Chen","Zijie Wang","Bilei Zhu","Zejun Ma"],"abstract":"Convolutional neural network (CNN)-based methods have\r\ndominated the recent research of cover song identification\r\n(CSI). A typical example is the ByteCover system we proposed, which has achieved state-of-the-art results on all the\r\nmainstream datasets of CSI. In this paper, we propose an upgraded version of ByteCover, termed ByteCover2, which further improves ByteCover in both identification performance\r\nand efficiency. Compared with ByteCover, ByteCover2 is\r\ndesigned with an additional PCA-FC module, which integrates the capability of principal component analysis (PCA)\r\nand fully-connected (FC) neural network for dimensionality reduction of the audio embedding, allowing ByteCover2\r\nto perform CSI in a more precise and efficient way. We\r\nevaluated ByteCover2 on multiple datasets in different dimension sizes and training settings, where ByteCover2 beat\r\nall the compared methods including ByteCover, even with a\r\ndimension size of 128, which is 15 times smaller than that of\r\nByteCover.","url_abs":"https://ieeexplore.ieee.org/abstract/document/9747630","url_pdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9747630","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[],"tasks":[{"task_slug":"cover-song-identification","task_name":"Cover song identification"},{"task_slug":"dimensionality-reduction","task_name":"Dimensionality Reduction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/cover-song-identification-on-covers80","task":"Cover song identification","dataset":"Covers80","model":"ByteCover2","rank_in_archive_order":1,"of":5,"metrics":{"MAP":"0.928"},"uses_additional_data":false},{"leaderboard":"/sota/cover-song-identification-on-da-tacos","task":"Cover song identification","dataset":"Da-TACOS","model":"ByteCover2","rank_in_archive_order":1,"of":4,"metrics":{"mAP":"0.791"},"uses_additional_data":false},{"leaderboard":"/sota/cover-song-identification-on-shs100k-test","task":"Cover song identification","dataset":"SHS100K-TEST","model":"Bytecover","rank_in_archive_order":2,"of":8,"metrics":{"mAP":"0.864"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"64e682535399a96699734fbe7b8575658eae7f442f8ede6bfee8e4da46970ec9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}