Quant Memo
Core

Weak Supervision for Financial Text Labels

Building a large labeled training set for financial text classifiers not by hand-labeling every document, but by combining several noisy, imperfect labeling rules and letting their agreement pattern estimate the true label.

Prerequisites: Text Classification for Filings, Event Taxonomies for Financial Text

Training a good text classifier — to flag "guidance cut" stories, or tag filing sections by risk type — needs thousands of labeled examples, and getting an analyst to read and label thousands of documents by hand is slow and expensive. Skipping labeling and hoping unsupervised methods find the right categories usually doesn't work either: the categories a desk cares about ("this is genuine fraud-risk language, not a routine caveat") are specific enough that nothing discovers them without some form of supervision.

Weak supervision offers a middle path: instead of one expensive, high-quality human label per document, a practitioner writes several cheap, imperfect labeling functions — simple rules, keyword matches, or existing lexicons — each of which is individually noisy and sometimes wrong, but which collectively, through their pattern of agreement and disagreement, can be combined into a single estimated label that's substantially more accurate than any one rule alone.

How the pieces fit together

A typical weak-supervision pipeline for financial text has three components:

  • Labeling functions — one might flag "guidance cut" whenever a document contains phrases like "lowered outlook" or "reduced forecast"; another might flag it whenever a document mentions a percentage decline near the word "guidance"; a third might use an existing financial sentiment lexicon (see The Loughran-McDonald Financial Lexicon) as a noisy proxy.
  • A generative label model — rather than simply majority-voting the labeling functions, a model learns each function's accuracy and correlation with the others from their agreement patterns alone, and produces a probabilistic estimated label for every document, even ones where the labeling functions disagree.
  • A downstream classifier — trained on the large set of probabilistically-labeled documents, which typically generalizes better than any individual labeling function because it learns from the underlying text features directly, not just the noisy rules.

Worked example

A team writes four labeling functions for tagging "guidance cut" events, each abstaining on documents it can't confidently classify. On 10,000 documents: function A (keyword match on "lowered outlook") fires on 800 documents at roughly 75% precision against a small hand-labeled sample; function B ("reduced forecast") fires on 650 at about 70%; function C (a sentiment-lexicon threshold) fires on 2,200 at only 55%, since it also catches unrelated negative news; function D (requiring both a percentage figure and "guidance" nearby) fires on 300 at 90% precision but low coverage. A generative label model, learning each function's accuracy and correlation from their overlap, combines all four into probabilistic labels for the full 10,000 documents — an estimated 87% accuracy on held-out validation, well above any single function.

Rule A (75%) Rule B (70%) Lexicon (55%) Rule D (90%) Label model learns weights from overlap ~87% est. accuracy
Four individually noisy labeling functions, each with a different accuracy and coverage, are combined by a label model into probabilistic labels more accurate than any single rule.

What this means in practice

Weak supervision lets a small desk build classifiers for narrow, finance-specific categories no off-the-shelf dataset covers, at a fraction of the cost of hand-labeling everything, while still needing a small high-quality validation set to check the label model's accuracy against ground truth. It works best when labeling functions are reasonably independent — several rules that are just rephrasings of the same keyword check don't add much beyond one of them alone.

Weak supervision replaces one expensive human label per document with several cheap, individually noisy labeling rules, combined by a model that learns each rule's reliability from how they agree and disagree with each other — producing labels for far more documents than hand-labeling could ever cover, at meaningfully better accuracy than any single rule.

The common failure mode is writing labeling functions that are all correlated proxies for the same surface signal (several keyword variants of the same phrase) — the label model can mistake their agreement for independent confirmation and overstate its own confidence, when in reality all four rules would fail together on the exact same edge cases.

Related concepts

Practice in interviews

Further reading

  • Ratner et al., 'Snorkel: Rapid Training Data Creation with Weak Supervision'
  • Ratner et al., 'Data Programming: Creating Large Training Sets, Quickly'
ShareTwitterLinkedIn