SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2103.12827 · 2021

Fisher Task Distance and Its Application in Neural Architecture Search

arXiv · PDF · Open in the Atlas

Code that ran

3 of 4 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 2 failures of our instrument; 1 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2103.12827.json · badge: /api/ran/2103.12827.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
lephuoccat/Fisher-Information-NAS canonical (classifier label)
classifier basis: classifier_2025
2 ran · 1 no recorded run
copy not recorded community
not in the paper's declared repositories
1 ran · 0 no recorded run
FunctionStatusWhere it lives
diag_fisher Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
lephuoccat/Fisher-Information-NAS/fisher-distance.py
pointer only (licence: NONE) · get_code("5fb149dc14622726")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, lephuoccat/Fisher-Information-NAS when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

rSubset Ran
ran; our contract draft was wrong, not the code
lephuoccat/Fisher-Information-NAS/train_task_mnist.py
pointer only (licence: NONE) · get_code("70494a0c3e43f7e3")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, lephuoccat/Fisher-Information-NAS when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

variable Ran
ran, honoured the contract we drafted
this paper's copy was not recorded; identical code first harvested from oakdata/benchmark
pointer only; the stored copy get_code serves, from oakdata/benchmark, is pointer only (licence: NONE) · get_code("d95385178f502fa2")
How it ran

The body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

FUSE Not yet run
unverified (harvested, no recorded run)
lephuoccat/Fisher-Information-NAS/NAS_FUSE.py
pointer only (licence: NONE) · get_code("78790a9cae022909")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, lephuoccat/Fisher-Information-NAS when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

Also present in other papers' code

Of 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 distinct functions with an identity, 1 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 0 the same month, 1 later) and 3 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
variable 4 other papers
2 dated earlier, 2 later
1711.04436 (2017-11)
SQLNet: Generating Structured Queries From Natural Language Without Reinforcement Learning
2004.14366 (2020-04)
Elastic weight consolidation for better bias inoculation
2108.11005 (2021-08)
Wanderlust: Online Continual Object Detection in the Real World
and 1 more not named here

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

We formulate an asymmetric (or non-commutative) distance between tasks based on Fisher Information Matrices, called Fisher task distance. This distance represents the complexity of transferring the knowledge from one task to another. We provide a proof of consistency for our distance through theorems and experiments on various classification tasks from MNIST, CIFAR-10, CIFAR-100, ImageNet, and Taskonomy datasets. Next, we construct an online neural architecture search framework using the Fisher task distance, in which we have access to the past learned tasks. By using the Fisher task distance, we can identify the closest learned tasks to the target task, and utilize the knowledge learned from these related tasks for the target task. Here, we show how the proposed distance between a target task and a set of learned tasks can be used to reduce the neural architecture search space for the target task. The complexity reduction in search space for task-specific architectures is achieved by building on the optimized architectures for similar tasks instead of doing a full search and without using this side information. Experimental results for tasks in MNIST, CIFAR-10, CIFAR-100, ImageNet datasets demonstrate the efficacy of the proposed approach and its improvements, in terms of the performance and the number of parameters, over other gradient-based search methods, such as ENAS, DARTS, PC-DARTS.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2103.12827")
get_code_for_paper("2103.12827")
have("2103.12827")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2103.12827.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2103.12827.svg)](https://syntology.ai/paper/2103.12827)

Connect an agent — have() is free.