Pith. sign in

REVIEW 1 cited by

Secost: Sequential co-supervision for large scale weakly labeled audio event detection

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1910.11789 v3 pith:P3IKHQ4I submitted 2019-10-25 cs.SD cs.LGeess.AS

classification cs.SDcs.LGeess.AS
keywords learningsecostsequentialweaklyaudioco-supervisiondetectionevent
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Weakly supervised learning algorithms are critical for scaling audio event detection to several hundreds of sound categories. Such learning models should not only disambiguate sound events efficiently with minimal class-specific annotation but also be robust to label noise, which is more apparent with weak labels instead of strong annotations. In this work, we propose a new framework for designing learning models with weak supervision by bridging ideas from sequential learning and knowledge distillation. We refer to the proposed methodology as SeCoST (pronounced Sequest) -- Sequential Co-supervision for training generations of Students. SeCoST incrementally builds a cascade of student-teacher pairs via a novel knowledge transfer method. Our evaluations on Audioset (the largest weakly labeled dataset available) show that SeCoST achieves a mean average precision of 0.383 while outperforming prior state of the art by a considerable margin.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Robust Losses from Univariate Base Functions for Noisy-Label Learning

    cs.LG 2026-07 conditional novelty 5.0 of 10

    Robust multiclass losses can be generated from univariate base functions by target-separation or pairwise binary-reduction mappings with derivative-based sufficient conditions.

Pith tools