| CARVIEW |
Select Language
HTTP/2 200
last-modified: Fri, 17 Nov 2023 01:24:31 GMT
content-type: text/html; charset=utf-8
content-security-policy: frame-ancestors 'none'
x-cloud-trace-context: 1c4812b9637f51ad815470259a4e350a
cache-control: max-age=3600
x-frame-options: SAMEORIGIN
server: Google Frontend
via: 1.1 google, 1.1 varnish, 1.1 varnish, 1.1 varnish
accept-ranges: bytes
age: 0
date: Thu, 01 Jan 2026 01:04:16 GMT
x-served-by: cache-lga21980-LGA, cache-lga21974-LGA, cache-bom-vanm7210055-BOM
x-cache: MISS, MISS, MISS
x-timer: S1767229456.827706,VS0,VE341
content-length: 45862
[2311.01052] Resilient Multiple Choice Learning: A learned scoring scheme with application to audio scene analysis
Skip to main content
[v1] Thu, 2 Nov 2023 07:54:03 UTC (1,652 KB)
[v2] Thu, 16 Nov 2023 11:04:53 UTC (1,652 KB)
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors.
Donate
Statistics > Machine Learning
arXiv:2311.01052 (stat)
[Submitted on 2 Nov 2023 (v1), last revised 16 Nov 2023 (this version, v2)]
Title:Resilient Multiple Choice Learning: A learned scoring scheme with application to audio scene analysis
View a PDF of the paper titled Resilient Multiple Choice Learning: A learned scoring scheme with application to audio scene analysis, by Victor Letzelter and 5 other authors
View PDF
Abstract:We introduce Resilient Multiple Choice Learning (rMCL), an extension of the MCL approach for conditional distribution estimation in regression settings where multiple targets may be sampled for each training input. Multiple Choice Learning is a simple framework to tackle multimodal density estimation, using the Winner-Takes-All (WTA) loss for a set of hypotheses. In regression settings, the existing MCL variants focus on merging the hypotheses, thereby eventually sacrificing the diversity of the predictions. In contrast, our method relies on a novel learned scoring scheme underpinned by a mathematical framework based on Voronoi tessellations of the output space, from which we can derive a probabilistic interpretation. After empirically validating rMCL with experiments on synthetic data, we further assess its merits on the sound source localization problem, demonstrating its practical usefulness and the relevance of its interpretation.
| Subjects: | Machine Learning (stat.ML); Machine Learning (cs.LG) |
| Cite as: | arXiv:2311.01052 [stat.ML] |
| (or arXiv:2311.01052v2 [stat.ML] for this version) | |
| https://doi.org/10.48550/arXiv.2311.01052
arXiv-issued DOI via DataCite
|
|
| Journal reference: | Advances in neural information processing systems, Dec 2023, New Orleans, United States |
Submission history
From: Victor Letzelter [view email] [via CCSD proxy][v1] Thu, 2 Nov 2023 07:54:03 UTC (1,652 KB)
[v2] Thu, 16 Nov 2023 11:04:53 UTC (1,652 KB)
Full-text links:
Access Paper:
- View PDF
- TeX Source
View a PDF of the paper titled Resilient Multiple Choice Learning: A learned scoring scheme with application to audio scene analysis, by Victor Letzelter and 5 other authors
Current browse context:
stat.ML
References & Citations
export BibTeX citation
Loading...
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.