Advanced techniques
Advanced Techniques Capstone
Integrate advanced methods into a minimal, testable system design with matched baselines, stopping rules, and release evidence.
By the end you can
- Diagnose which bottlenecks, if any, justify advanced techniques
- Sequence experiments so each method has a fair counterfactual and interpretable contribution
- Design release gates for transfer, graph, semi-supervised, continual, ensemble, and policy-learning components
- Produce a decision memo that can recommend deployment, redesign, or rejection
The capstone scenario: a marketplace risk and ranking platform
A global marketplace wants one platform to support fraud detection, seller-quality prediction, recommendation ranking, and deciding which cases investigators open first. Labels are delayed and uneven across regions. New sellers have little history. Accounts, devices, payments, and merchants form a graph. A large pretrained encoder exists, and the platform also holds a much larger pool of unlabeled activity. Production latency is strict, policies change over time, and investigators can review only a limited queue.
Every advanced method in this path is tempting here. That would be a design failure. The task is to choose a minimal sequence of interventions, each tied to evidence and a matched counterfactual.
The brief itself is an exercise; nothing in it is a finding. Every gate imposed on it below comes from a published measurement, and each one is named where it applies: a 47,000-run graph re-evaluation, a reproducibility audit of 18 neural recommenders, a benchmark of ten real distribution shifts, two distillation results, one company's decision to shut an algorithmic business down, and one federal framework's numbered requirement that somebody be able to switch a model off.
A strong advanced design says no to most available complexity.
Visual
Map evidence to candidate mechanisms
The project contains several bottlenecks, but they should be addressed in an explicit order.
Each branch below is a hypothesis, and each already has a published measurement attached to it. The relational branch answers to more than 47,000 controlled runs that compared five graph neural networks against baselines ignoring the edges. The changing-behavior and regional branches answer to WILDS, where standard training loses 93.2% to 70.3% average accuracy across hospitals on Camelyon17. The serving branch answers to two distillation results, one from 2006 and one from 2015. The sections below set all of them out. The map's only job is to say which one is being tested.
Delayed and sparse labels
Consider self-supervised pretraining, transfer, weak proxies, or careful teacher–student learning.
Relational fraud patterns
Test graph features and GNNs against row-wise aggregate baselines.
Changing attacker behavior
Plan temporal evaluation, retraining, and possibly continual-learning defenses.
Strict serving budget
Compare distillation, compact experts, and staged ranking.
Related but conflicting tasks
Test shared encoders before multi-task or sparse routing.
The map creates hypotheses; it does not authorize simultaneous implementation.
Comparison
Three plausible system strategies
Each strategy solves a different subset of the problem and creates different ownership costs.
Read the three rows against the re-evaluation literature, not against their own promises. The conservative modular system is the option that beat most of the neural recommenders the 2019 reproducibility audit could reproduce at all. It is also the option that beat learned similarities in Google's own follow-up, once hyperparameters were properly selected. The graph and routed architecture is the option that failed to beat structure-agnostic baselines on several of nine benchmarks in the 47,000-run comparison. Neither result says the ambitious row is wrong here. Both say it has to be measured against the modest row before it is built.
Conservative modular system
Separate strong tabular models with shared data infrastructure.
- Lowest coordination risk
- Clear per-task evaluation
- Duplicates some representations
- Best initial production baseline
Shared representation platform
Pretrain one encoder, then fine-tune or attach heads per task.
- Reuses unlabeled behavior data
- Can improve low-label tasks
- Creates shared regression risk
- Needs retained-capability tests
Graph and routed architecture
Use graph representations plus task or domain experts.
- Captures relations and specialization
- Highest systems and evaluation burden
- Requires graph freshness and router monitoring
- Only justified after simpler ablations
Example
Evidence the design review must request
The review should force claims to become measurable commitments.
The reason the first bullet is first: a benchmark called WILDS collects ten datasets whose splits follow real boundaries — hospital, camera, country, demographic group, scaffold, time and region, repository, user, location, batch. Standard models were trained on all ten. Camelyon17 falls from 93.2% to 70.3% average accuracy across hospitals. CivilComments falls from 92.2% to 56.0% worst-group accuracy. FMoW falls from 48.6% to 32.3% worst-region accuracy. The 2021 summary is flat: “On each dataset, we show that standard training yields substantially lower out-of-distribution than in-distribution performance. This gap remains even with models trained by existing methods for tackling distribution shifts, underscoring the need for new methods for training models that are more robust to the types of distribution shifts that arise in practice.” CORAL, IRM and Group DRO are the methods a design review would reach for on being shown those gaps. They generally failed to improve on standard empirical risk minimisation. A marketplace whose labels are uneven across regions is asking for exactly this measurement, and no aggregate score will supply it.
- Baseline stability: Variance across seeds, time windows, regions, and seller cohorts, reported as separate in-distribution and out-of-distribution numbers the way WILDS reports 93.2% against 70.3%.
- Label audit: Delay, censoring, investigation policy, and likely target leakage.
- Graph contribution: Gain over non-graph aggregates under temporal and new-node splits — the structure-agnostic comparison run on all nine of the graph benchmarks.
- Transfer contribution: Scratch, frozen, partial, and parameter-efficient adaptation curves.
- Serving budget: Latency percentiles, memory, throughput, failure behavior, and cost per decision, fixed before any compression is attempted so the distillation gate has a number to meet.
- Regression surface: Performance on old regions, rare fraud types, calibrated risk bands, and human-review workload, scored worst-group rather than on average, as in the 92.2% to 56.0% CivilComments figure.
- Operational ownership: Teams responsible for data refresh, graph construction, model routing, monitoring, and rollback.
Key idea
Define reasons to stop before experimentation begins
Advanced projects often continue because sunk cost replaces evidence. Set stopping rules before the first experiment runs. Stop when a method shows no reliable gain over a tuned baseline, or when an apparent graph benefit disappears under a realistic temporal split. Stop as well when transfer harms critical regions, sparse routing saves no active compute after overhead, or monitoring cannot identify component failures.
Stopping is not failure, and it is not hypothetical. On 2 November 2021 the board of Zillow Group determined to wind down Zillow Offers, the company's algorithmic home-buying business. The third-quarter earnings release published that day carried an inventory write-down of approximately $304 million, a further $240–265 million of losses expected in the fourth quarter, and a workforce reduction of approximately 25%. Rich Barton, co-founder and CEO of Zillow Group, gave the reason in that release: “We’ve determined the unpredictability in forecasting home prices far exceeds what we anticipated and continuing to scale Zillow Offers would result in too much earnings and balance-sheet volatility.” The Form 8-K filed with the SEC the same day records the board's determination and its stated reasons — “home pricing unpredictability, capacity constraints and other operational challenges”. That is what a stopping decision costs when the rule is written after the system is running at scale rather than before.
One seed is not a measurement. A 2021 paper modeled the whole benchmarking process — data sampling, initialization, hyperparameters, all of it — and put the point in a single line. Strong evidence that one algorithm beats another, Bouthillier and colleagues write, “calls for multiple trials optimizing the learning pipeline over sources of variation such as data sampling, data augmentation, parameter initialization, and hyperparameters choices”. Adding those sources to an imperfect estimator approached the ideal estimator at a 51-fold reduction in compute cost. A gate decided by one seed is not a gate.
A stopping rule protects the project from becoming a demonstration of complexity rather than a solution.
Steps
Build the experiment matrix in dependency order
Later rows should not begin until earlier evidence passes the agreed gate. The order is not fastidiousness. Each step is here because a published re-evaluation found that step deciding the result the step below it was given credit for.
Step 1 is the split, and the split is often the whole finding. The WILDS collapses above were measured across hospitals, regions and demographic groups, never across randomly shuffled rows.
Step 2 is the one most often skipped, and the one with the largest recorded body count. Ferrari Dacrema and two colleagues took 18 neural top-n recommendation methods published at top conferences and tried to reproduce them at RecSys 2019: “Only 7 of them could be reproduced with reasonable effort. For these methods, it however turned out that 6 of them can often be outperformed with comparably simple heuristic methods, e.g., based on nearest-neighbor or graph-based techniques.” The next year Google's own paper reached the same verdict from the other direction, setting neural collaborative filtering against plain matrix factorization: “With a proper hyperparameter selection, a simple dot product substantially outperforms the proposed learned similarities”. An untuned baseline is not a baseline. It is a foil, and a design review that accepts one has already decided the outcome.
Step 4 asks whether the edges carry signal at all. That is a separate question from whether a graph network is good at using them. Errica and three colleagues answered it at scale in 2020: “To counter this troubling trend, we ran more than 47000 experiments in a controlled and uniform framework to re-evaluate five popular models across nine common benchmarks. Moreover, by comparing GNNs with structure-agnostic baselines we provide convincing evidence that, on some datasets, structural information has not been exploited yet.” A model that ignores the edges entirely was competitive on several of those nine datasets. Run that model first here, on the marketplace's own temporal and new-node splits. The graph platform then either earns its ownership cost or is dropped in a week.
Step 6 prices the serving constraint, and here the evidence is unusually kind. In 2006 three researchers at Cornell compressed large ensembles into single networks and concluded: “Results on eight test problems show that, on average, the loss in performance due to compression is usually negligible, yet the mimic neural nets are 1000 times smaller and 1000 times faster.” Geoffrey Hinton and two colleagues reported the same trade with production numbers in 2015. On about 2,000 hours of spoken English, roughly 700M training examples, a 10-model acoustic-model ensemble reached 61.1% test frame accuracy and 10.7% WER. A single distilled model reached 60.8% and 10.7%. The single-model baseline reached 58.9% and 10.9%. On MNIST the same paper counts 67 errors for the large regularised net, 146 for the unregularised small net, and 74 for that same small net distilled at temperature 20. Distillation buys the latency budget cheaply — but only after steps 2 to 5 have established that the teacher is worth copying.
1. Lock the data protocol
Freeze temporal, entity, and regional splits plus leakage checks.
2. Establish task-specific baselines
Train simple and strong models for each target.
3. Test one reusable representation
Compare scratch, frozen, and adapted encoders.
4. Test graph value separately
Add relational features, then a simple GNN, under matched splits.
5. Test sharing or routing
Introduce multi-task learning only after single-task evidence is stable.
6. Prove serving readiness
Compress if needed, then shadow-test latency, drift, reviewer load, and component failure.
The design must be a sequence of falsifiable choices
Each advanced component enters only after a simpler experiment establishes the bottleneck it is meant to remove. Transfer follows a target-only baseline. Graph learning follows relational features. Sharing follows stable single-task models.
This sequence makes negative results useful. When an intervention fails its gate, the team can stop without invalidating the rest of the system or hiding the result inside an end-to-end score.
The failure it is defending against has a name: underspecification. A pipeline is underspecified when it can return “many predictors with equivalently strong held-out performance in the training domain” — and “such predictors can behave very differently in deployment domains”. D’Amour and his co-authors set that out in 2020. The held-out score cannot choose between such predictors, because by construction they tie on it. The stress test has to.
How much room a tie leaves is measurable. In 2019 Recht and three colleagues built new test sets that replicated the original CIFAR-10 and ImageNet collection procedures, then re-scored a wide range of published classifiers. Accuracy dropped by 3–15% on CIFAR-10 and by 11–14% on ImageNet. The new sets were built to the same recipe, with no shift anyone intended. The ordering largely held, since “accuracy gains on the original test sets translate to larger gains on the new test sets”, but the level did not. A gate that reads a single held-out number to two decimal places is reading past the noise floor of its own benchmark.
A modular experiment plan turns complexity into a set of decisions that can be accepted or rejected independently.
Example
The final design package
A production-ready proposal should contain more than architecture diagrams.
The ownership sections are not boilerplate, and they are not left to taste. The U.S. National Institute of Standards and Technology released its AI Risk Management Framework on 26 January 2023. The framework is voluntary. It still states the requirement as an outcome to be achieved rather than an aspiration. Its MANAGE function includes: “MANAGE 2.4: Mechanisms are in place and applied, and responsibilities are assigned and understood, to supersede, disengage, or deactivate AI systems that demonstrate performance or outcomes inconsistent with intended use.” MANAGE 4.1 adds that post-deployment monitoring plans are implemented, including mechanisms for appeal and override, decommissioning, incident response, recovery and change management. A package that cannot say which named team executes each of those verbs has not been finished, whatever its offline scores are.
- Problem brief: Decision, users, harms, latency, label delay, and deployment environment.
- Bottleneck map: Evidence linking each observed failure to one candidate mechanism.
- Experiment table: Baselines, ablations, metrics, slices, budgets, and stopping rules — thresholds written down before the first run, not after the first disappointing one.
- Data and split specification: Entity, temporal, graph, and domain boundaries with leakage controls.
- Model card draft: Intended use, limitations, retained capabilities, and unsupported conditions.
- Operations plan: Versioning, monitoring, drift response, retraining, rollback, and ownership — MANAGE 4.1's list is the floor: appeal and override, decommissioning, incident response, recovery, change management.
- Decision memo: Which techniques were accepted, rejected, or deferred—and why.
The design principle to carry forward
The advanced practitioner is not the person who can name the most methods. It is the person who can identify the narrow mechanism a project needs, build a fair comparison, and stop when the evidence is weak.
The cost of the alternative is on the record, and it is specific. More than 47,000 controlled runs were needed before anyone could say whether five popular graph networks beat models that ignore the edges. Of 18 published neural recommenders, 7 could be reproduced with reasonable effort, and 6 of those 7 were often beaten by nearest-neighbour or graph heuristics. Camelyon17 scores 93.2% in distribution and 70.3% across hospitals. And on 2 November 2021 a company took an approximately $304 million write-down and cut approximately 25% of its workforce to stop a model-driven business it had already scaled.
Ensembles, transfer, self-supervision, meta-learning, continual learning, reinforcement learning, graphs, and sparse experts are powerful because they change where learning signal or capacity comes from. That same change creates new failure modes. The course ends where production judgment begins: every technique is a hypothesis, every hypothesis needs a counterfactual, and every deployed component needs an owner who, in the words of MANAGE 2.4, can supersede, disengage, or deactivate it.
Advanced ML is disciplined mechanism selection under evidence, constraints, and long-term ownership.
Key takeaways
- A capstone begins with a locked decision context, split protocol, and bottleneck map — WILDS measures the split, not the model: 93.2% in distribution against 70.3% across hospitals on Camelyon17.
- Advanced techniques should be introduced in dependency order so their contribution can be isolated; more than 47,000 controlled runs were needed to isolate one such contribution across nine benchmarks.
- Graph, transfer, sharing, routing, and compression each need a simpler matched baseline: 6 of the 7 reproducible neural recommenders in the RecSys '19 audit were often beaten by nearest-neighbour or graph heuristics.
- Stopping rules are part of rigorous experimentation and protect against complexity driven by sunk cost — Zillow Group's board wound down Zillow Offers on 2 November 2021 after an approximately $304 million inventory write-down.
- A release plan must cover retained quality, latency, drift, rollback, and component ownership; distillation priced the latency line at 60.8% test frame accuracy against the 10-model ensemble's 61.1%.
- The gold-standard habit is mechanism-first judgment: use the smallest advanced method that earns its place, and, as NIST AI 100-1's MANAGE 2.4 requires, assign someone who can turn it off.