SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2110.14577 · NeurIPS · 2021

A Geometric Perspective towards Neural Calibration via Sensitivity Decomposition

Junjiao Tian, Yen-Chang Hsu, Zsolt Kira, Dylan Yung

arXiv · PDF · Open in the Atlas

Code that ran

3 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, 0 violated it and 2 have no contract verdict; 1 failure of our instrument; 0 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/2110.14577.json · badge: /api/ran/2110.14577.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
gt-ripl/geometric-sensitivity-decomposition canonical (classifier label)
classifier basis: classifier_2025
3 ran · 0 no recorded run
FunctionStatusWhere it lives
Wide_ResNet Ran
ran on a synthesized input
gt-ripl/geometric-sensitivity-decomposition/models/wide_resnet.py
pointer only (licence: NONE) · get_code("e98762c2e70fc081")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, gt-ripl/geometric-sensitivity-decomposition 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.

conv3x3 Ran
ran; our contract draft was wrong, not the code
gt-ripl/geometric-sensitivity-decomposition/models/wide_resnet.py
pointer only (licence: NONE) · get_code("dc0af2f648f31d69")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, gt-ripl/geometric-sensitivity-decomposition 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.

wide_basic Ran
ran on a synthesized input
gt-ripl/geometric-sensitivity-decomposition/models/wide_resnet.py
pointer only (licence: NONE) · get_code("5bf063c5e1f8ebf4")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, gt-ripl/geometric-sensitivity-decomposition 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.

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, 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 2 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
conv3x3
brick of this paper's assembly: helper
3 other papers
1 dated earlier, 2 later
2008.01352 (2020-08)
PDE-Driven Spatiotemporal Disentanglement
2405.14793 (2024-05)
SEA-RAFT: Simple, Efficient, Accurate RAFT for Optical Flow
2506.23151 (2025-06)
MEMFOF: High-Resolution Training for Memory-Efficient Multi-Frame Optical Flow Estimation

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

It is well known that vision classification models suffer from poor calibration in the face of data distribution shifts. In this paper, we take a geometric approach to this problem. We propose Geometric Sensitivity Decomposition (GSD) which decomposes the norm of a sample feature embedding and the angular similarity to a target classifier into an instance-dependent and an instance-independent component. The instance-dependent component captures the sensitive information about changes in the input while the instance-independent component represents the insensitive information serving solely to minimize the loss on the training dataset. Inspired by the decomposition, we analytically derive a simple extension to current softmax-linear models, which learns to disentangle the two components during training. On several common vision models, the disentangled model outperforms other calibration methods on standard calibration metrics in the face of out-of-distribution (OOD) data and corruption with significantly less complexity. Specifically, we surpass the current state of the art by 30.8% relative improvement on corrupted CIFAR100 in Expected Calibration Error. Code available at https: //github.com/GT-RIPL/Geometric-Sensitivity-Decomposition.git.

For agents

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

get_harvested_code_for_paper("2110.14577")
get_code_for_paper("2110.14577")
have("2110.14577")

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

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

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

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

Connect an agent — have() is free.