SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 1908.02729 · 2019

Robust Learning with Jacobian Regularization

arXiv · PDF · Open in the Atlas

Code that ran

1 of 3 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; 0 honoured the contract we drafted, 1 violated it and 0 have no contract verdict; 0 failures of our instrument; 2 no recorded run), measured 2026-11-21; 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/1908.02729.json · badge: /api/ran/1908.02729.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
bioai-oslo/bioinspiredrobustness extension (classifier label)
classifier basis: classifier_2025
1 ran · 2 no recorded run
FunctionStatusWhere it lives
weight_convergence_criterion Ran
ran, violated the contract we drafted
bioai-oslo/bioinspiredrobustness/src/LocalLearning/LocalLearning.py
code served (permissive licence) · get_code("f33622e1b49fd81d")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned Tensor, ndim 0, dtype family float, shape () as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import torch
import torch.nn as nn
import math

torch.manual_seed(0)

# Build a minimal KHL3 model
init_dict = {
    'in_size': 16,
    'hidden_size': 8,
    'n': 4.5,
    'p': 3,
    'tau_l': 1 / 0.04,
    'k': 2,
    'Delta': 0.4,
    'R': 1.0
}

model = nn.Module.__new__(type('KHL3', (nn.Module,), {}))
model.__class__.__bases__ = (nn.Module,)
nn.Module.__init__(model)

# Manually set up the model attributes needed by weight_convergence_criterion
model.pSet = init_dict.copy()
model.W = nn.Parameter(
    torch.randn((init_dict['in_size'], init_dict['hidden_size'])),
    requires_grad=False
)

# Create a proper KHL3 instance instead
class KHL3(nn.Module):
    pSet = {'in_size': 28 ** 2, 'hidden_size': 2000, 'n': 4.5, 'p': 3, 'tau_l': 1 / 0.04, 'k': 7, 'Delta': 0.4, 'R': 1.0}

    def __init__(self, init_dict: dict, sigma=None):
        super().__init__()
        self.flatten = nn.Flatten()
        self.flatten.requires_grad_(False)
        try:
            if init_dict['type_name'] != type(self).__name__:
                raise IOError(f'state_dict does not correspond to {type(self).__name__} model')
            else:
                self._write_pSet(init_dict['pSet'])
                self.W = nn.Parameter(torch.empty((self.pSet['in_size'], self.pSet['hidden_size'])), requires_grad=False)
                self.load_state_dict(init_dict)
        except KeyError:
            parameter_set = init_dict
            self._write_pSet(parameter_set)
            self.W = nn.Parameter(torch.zeros((self.pSet['in_size'], self.pSet['hidden_size'])), requires_grad=False)
            if type(sigma) == type(None):
                sigma = 1.0 / math.sqrt(self.pSet['in_size'] + self.pSet['hidden_size'])
            self.W.normal_(mean=0.0, std=sigma)

    def _write_pSet(self, params: dict) -> None:
        self.pSet['in_size'] = params['in_size']
        self.pSet['hidden_size'] = params['hidden_size']
        self.pSet['n'] = params['n']
        self.pSet['p'] = params['p']
        self.pSet['tau_l'] = params['tau_l']
        self.pSet['k'] = params['k']
        self.pSet['Delta'] = params['Delta']
        self.pSet['R'] = params['R']

model = KHL3({
    'in_size': 16,
    'hidden_size': 8,
    'n': 4.5,
    'p': 3,
    'tau_l': 1 / 0.04,
    'k': 2,
    'Delta': 0.4,
    'R': 1.0
})

conv_tol = 0.1
tol = 0.5

ARGS = {
    'model': model,
    'conv_tol': conv_tol,
    'tol': tol
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1
Imports
torch — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type Tensor, ndim 0, dtype family float, shape () — shape () as a later run recorded it
dtype family
int means an integer dtype; float means any other dtype the instrument saw, bool and complex included (fixture_check.py records only these two families)
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
train_half_backprop Not yet run
unverified (harvested, no recorded run)
bioai-oslo/bioinspiredrobustness/src/LocalLearning/LocalLearning.py
code served (permissive licence) · get_code("c6278a1d2b9aa57e")
How it ran

no invocation recorded.

weight_mean_criterion Not yet run
unverified (harvested, no recorded run)
bioai-oslo/bioinspiredrobustness/src/LocalLearning/LocalLearning.py
code served (permissive licence) · get_code("c9aa153ce969a420")
How it ran

no invocation recorded.

Also present in other papers' code

Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 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.

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-21.

Repositories linked to this paper

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

Abstract

Design of reliable systems must guarantee stability against input perturbations. In machine learning, such guarantee entails preventing overfitting and ensuring robustness of models against corruption of input data. In order to maximize stability, we analyze and develop a computationally efficient implementation of Jacobian regularization that increases classification margins of neural networks. The stabilizing effect of the Jacobian regularizer leads to significant improvements in robustness, as measured against both random and adversarial input perturbations, without severely degrading generalization properties on clean data.

For agents

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

get_harvested_code_for_paper("1908.02729")
get_code_for_paper("1908.02729")
have("1908.02729")

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

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

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

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

Connect an agent — have() is free.