Skip to content

A Classifier That Teaches Itself: Self-Improving, Frozen-gate Training (SIFT) for Dynamic Document Classification

Jul 2026 · arXiv.org · Vol abs/2607.18358 · 0 citations · 11 references
Computer Science

TL;DR

SIFT (Self-Improving, Frozen-gate Training), a dynamic classifier service, which attacks model architecture and safety, and the economics of a classifier whose marginal labeling cost trends toward zero are discussed.

Abstract

Document classification is a solved problem in the laboratory and an unsolved one in the enterprise. The blocker is rarely model architecture; it is the labeling project that must precede a model and the institutional fear of letting a model retrain itself once one exists. We present SIFT (Self-Improving, Frozen-gate Training), a dynamic classifier service, which attacks both. SIFT serves classification from a deliberately cheap, CPU-bound pipeline, a SPLADE sparse encoder feeding a LightGBM head, and escalates only the low-confidence minority of pages to an LLM judge. The judge's verdicts are written back into a labeled corpus, so the expensive model continuously teaches the cheap one: the escalation rate falls, the corpus grows from production traffic rather than from an up-front annotation effort, and accuracy compounds with use. Onboarding a new document family requires only a declarative bundle, label space, anchor phrases, and a judge glossary, not a labeling project. The harder problem is safety: an autonomously retraining classifier can silently regress. SIFT resolves this with a two-part promote gate, a critical-label F1 regression check plus a frozen golden regression set the model is never trained on, either of which vetoes promotion. This turns"retrain monthly without a human"from reckless into routine. We describe the architecture, the self-feeding corpus loop, the frozen-gate promotion mechanism, and an illustrative multi-domain deployment, and we discuss the economics of a classifier whose marginal labeling cost trends toward zero.

View source

Similar papers

Preprint Jul 2026

ADS-C: Antidistillation Sampling for Classification

Knowledge distillation enables an adversary to replicate a proprietary classifier by querying its prediction interface and training a surrogate on the returned probability vectors. Antidistillation sampling, proposed for large language models, counters this threat with an input-dependent, gradient-directed perturbation...

Khawaja Abaid Ullah, M. J. Khojasteh · 0 citations
Preprint Aug 2026

Training a Knowledge Base: Supervised Structure Learning for Agent-Curated Document Stores

This work evaluates the curated store with a test set, on two contamination-free benchmarks: KBGym, a fictional-universe generator the authors release, and PhantomWiki, a fictional-universe generator they release, and PhantomWiki, a fictional-universe generator they release.

Yu Pan, Hongfeng Yu · 0 citations
Jul 2026

The Model Knows Your Project, Not You: Measuring Recognition in LLMs with NameRank

NameRank, a [0,1] recognition score, is built: recognition is paid to named, indexable artifacts, not to credentials or titles, because recognition attaches to the artifact's own distinctive name, not to the roster behind it.

Bojie Li, Noah Shi · 0 citations
Jul 2026

The Art of Not Forgetting

We introduce CMP (Cognitive Memory Primitive), an architecture that represents inputs as sparse relational codes, stores them in a two-tier competitive memory, and learns entirely through local, gradient-free updates, with no backpropagation anywhere in the network. We use this architecture to test a specific hypothesi...

Ashmith Atmuri, Akshay Kumar, Yashaswini Rao Bhogarajula · 0 citations
Preprint Aug 2026

MIL-BERT: Classification of Arbitrarily Large Text with Performance and Explanatory Guarantees

This work presents an algorithm for training a neural network to classify text by selecting constituent excerpts by selecting such excerpts, and shows that the approach is also scalable with demonstrated learning against samples with nearly 1M tokens.

John J. Cadigan, Dayne Freitag, Eric Yeh · 0 citations
Open access Jul 2026

No train, no pain: a training-free few-shot traffic classifier based on LLMs

This work proposes a novel training-free few-shot network traffic classification framework based on large language models based on large language models (LLMs) that reduces reliance on labeled data, eliminates task-specific training, and improves performance.

Xingmao Guan, Ning Li, Xueying Han et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.