AI Ranking
alias ai-rank
Ranks neural networks by the accuracy–resource trade-off and returns one score per model. There is no weight to choose: the exchange rate between accuracy and cost is derived from the candidates' own frontier.
Nothing is declared by hand — no price, no grain, no chance level. The only
argument is --alpha, a coverage convention.
Create and Activate a Virtual Environment (recommended)
For Linux/Mac:
python3 -m venv .venv
source .venv/bin/activate
python -m pip install --upgrade pip
For Windows:
python3 -m venv .venv
.venv\Scripts\activate
python -m pip install --upgrade pip
python -m pip install --upgrade pip
pip install -r requirements.txt
Use as an API
The API is two functions, and they are the two halves of one operation: derive a price from candidates, or reuse a price already derived.
| function | what it does | when |
|---|---|---|
select(df, ...) |
derives the price from the candidates given, tests the error floor, and ranks them at it | the models in hand define the trade-off |
score(df, price) |
reuses a price that is already known, and ranks at that | the price is settled and a model arrives later |
Nothing else is public. They share one charging kernel, so a model ranked
either way gets the same score, sigma and eps_eff — identical by
construction, not by agreement.
What select() does and score() does not: derive a price, test the
floor, and report a verdict, an interval, a band or a regret. There is
nothing to verify at a price you supply, so score() returns the ranking
alone. score() needs one model; select() needs enough of a frontier
to price.
select() — derive a price
import pandas as pd
from ab.nn.select import select
df = pd.DataFrame({
"name": ["B0", "B1", "B2", "B3", "B4", "B5", "B6", "B7"],
"accuracy": [0.771, 0.791, 0.801, 0.816, 0.829, 0.836, 0.840, 0.843],
"flops_B": [0.39, 0.70, 1.0, 1.8, 4.2, 9.9, 19, 37],
"params_M": [5.3, 7.8, 9.2, 12, 19, 30, 43, 66],
})
r = select(df, res_col=["flops_B", "params_M"], rank=True)
r["winner"]["name"] # 'B0' <- the selected model
r["winner"]["score"] # 0.8024 <- its score, higher is better
r["verdict"]["level"] # 'USABLE' | 'UNVERIFIED' | 'UNUSABLE'
r["ranking"] # DataFrame: name, score, rank, ...
r["band"]["members"] # ['B4', 'B0'] <- what a price in the interval can pick
r["minimax"]["regret"] # worst-case regret per candidate, in nats
Input
One row per model, in a pandas.DataFrame:
| column | required | meaning |
|---|---|---|
name |
yes | model identifier |
accuracy |
yes | quality in (0, 1), strictly between 0 and 1 |
| one or more resource columns | yes | anything you spend: latency, FLOPs, parameters, memory, energy. Each > 0 |
select(df, res_col=...) names the resource column(s) — a string for one, a
list for several. All models must be measured on the same test set and the
same device, and each resource in one fixed unit.
Quality that is not already in (0, 1) must be converted first. For PSNR in dB,
accuracy = 1 - 10 ** (-PSNR / 10). For top-1, mAP, mIoU, SSIM or F1, use the
value as it is.
Output of select()
select() returns a dict. The three things most users need:
| key | what it is |
|---|---|
winner["name"] |
the selected model |
winner["score"] |
its score — higher is better |
ranking |
a DataFrame, winner first: name, score, rank, accuracy, each resource, sigma, eps_eff, margin_to_next, rank_low, rank_high, optimal_from, optimal_to, regret_sup, in_band, note |
band |
the candidates a supported price can select, and the price range that supports them |
minimax |
the pick, its worst-case regret in nats, and what a single price would have picked |
Also returned: verdict, status, prices (one price per resource axis),
rate, price_free (dominations true at every price), jet (the curve read
from three accuracies), rung (the fit-free third-order test), front,
fit, envelope, axis_drop, next, notes, problems. select() prints
nothing and raises nothing; bad input comes back as status="bad_input" with
the offending rows listed in problems.
The score
score = 1 / (1 + eps_eff)
eps_eff = eps * product over axes of (resource ** lambda) eps = 1 - accuracy
eps_eff is the error the model effectively costs once its resources are
charged at the derived price lambda; score is that mapped into (0, 1) so
that higher is better.
Its one useful property: it is computed from a single model's own accuracy and
resources, and from nothing else. Adding or removing other models cannot
change it — unlike rank, or any score normalised over the candidate set.
So scores are comparable across runs and across published tables.
Two things it is not invariant to:
- the resource unit — milliseconds vs seconds shifts every score by the same constant, so the ordering is untouched but the numbers are not comparable unless the unit is fixed;
lambda— only compare scores derived at the same price.
score() — reuse a price
select() derives the price from the models it is given, so a model measured
later (a new candidate, a re-run) cannot be compared by calling select()
again: the price would be re-derived with it in the set, and scores are
comparable only at the same price. score() charges any frame at a price
fixed earlier instead:
from ab.nn.select import select, score
r = select(reference, res_col="latency_ms") # derive the price once
s = score(new_models, r, res_col="latency_ms") # reuse it: DataFrame, best first
s = score(new_models, 1.04, res_col="latency_ms") # or give lambda directly
The price is a select() result, a float for one resource, or a
{axis: lambda} dict for several. On the command line: --price 1.04, or
--price p1=0.5 --price p2=0.2 for several resources.
score() returns a DataFrame, best first: name, score, rank,
accuracy, each resource, sigma, eps_eff — the same columns and the same
numbers select()'s ranking carries at that price. Rows that fail validation
are dropped and listed in .attrs["problems"]; the price used is in
.attrs["price"]. It raises ValueError only for a price or columns it
cannot use.
No verdict is returned, and that is not an omission: a price you supplied is
not a measurement this data can confirm or reject. Read the verdict from the
select() run that derived the price, once.
Read the verdict before the ranking
verdict["level"] says whether the ranking means anything. A clean run prints
nothing; a problem prints in red, first.
| level | meaning |
|---|---|
USABLE |
the error floor is confirmed by a nested F-test, so an exchange rate exists and the ranking is a genuine trade-off ranking |
UNVERIFIED |
too few points on the frontier to test the floor, or its knee lies outside the measured range — the price comes from the jet instead of the fit (below) |
UNUSABLE |
the floor is rejected: no exchange rate exists in this data, and the ranking collapses to resource order |
UNVERIFIED and UNUSABLE still return a full ranking — labelled, not
withheld. What holds regardless of the verdict is price_free: a model beaten
on accuracy and on every resource can never win at any price. So does the
band: it is built from the envelope, which needs no rate, no floor and no
fit.
A second, independent floor verdict comes from rung["floor_sign"], which is
read from four accuracies with no fit at all — see the rung below. It is the
one verdict the F-test cannot give below four points.
The optimum is a band, not a point
Two candidates can be separated by a price, or not separated by any price the
data supports. select() reports which case it is in, and only picks for you
in the first.
band["members"] are the candidates that some price in Λ would select,
where Λ is the derived rate interval by default. A band of one means the
derived price settles the answer: winner is then the sigma argmax, exactly
as before. A band of more than one means no price in that interval separates
its members, and the tie is broken on worst-case regret,
regret(i) = max over lambda in Lambda of [ best sigma at lambda - sigma(i) at lambda ]
reported per candidate in ranking["regret_sup"], in nats — the excess
effective error that choosing i costs at the least favourable price in Λ.
This is the only case in which the winner differs from the old single pick,
and it is the case in which the old single pick was arbitrary: the previous
version printed ! NOT ROBUST and named the other winners without choosing
between them.
band["supported_span"] is reported whatever Λ is: the span of the envelope's
own breakpoints, outside which no price changes the answer at all. A candidate
outside it is optimal at no price, which is a proof, not missing evidence.
tiebreak= |
Λ |
|---|---|
"interval" (default) |
the derived rate interval — never overwrites a price that settles the answer |
"support" |
every price the frontier supports. The paper's reading for a deployment that can name no price; it ignores the derived price by construction, which is why it is opt-in. On the paper's corpus it cuts the median excess over the minimax-optimal candidate from 0.075 to 0.029 nats — a figure measured in that same wide range, so it is not a claim about a deployment that does have a price |
"point" |
nothing: the sigma argmax, breaking no tie |
Because the derived price always lies inside Λ, the candidate it selects is
always in the band, so minimax["regret_nats"] <= minimax["point_regret_nats"]
always holds. rank and score are untouched by any of this: they order by
sigma at the derived price, so score stays comparable across runs.
Three accuracies, four accuracies
Two readings need no fit, no bootstrap and no floor. Both are always
reported, in jet and rung.
The jet — the price the frontier quotes. With S = -ln eps against
x = ln resource, a triple gives the slope s, the curvature kappa and the
channel count N_eff = s^2 / kappa. The canonical price is
lambda* = s / sqrt(t * N_eff), so at the operating rule N_eff = 1 in
delivered units it is simply
lambda* = s
a first difference: no floor, no units, no origin, and the spacing cancels
identically. N_eff itself is a ratio of second differences and is
noise-dominated on published windows, so it is reported as a measurement
standard; where no triple reads near the right angle the quote is the median
over the readable triples, with the spread in jet["lambda_low" / "lambda_high"].
The jet replaces the fitted alpha/2 price in one situation only: the floor
test could not be run (too few points, or a knee outside the measured
range) and the marginal curve carries at least two readable triples. Where
the floor is confirmed, alpha/2 and its bootstrap stand and those runs are
unchanged number for number. Where the floor is rejected, nothing changes
either: a scale-free frontier has no rate to quote and kappa = 0 makes
N_eff meaningless. And on a single triple nothing changes, because one first
difference is a quote with nothing to check it against — no better founded
than an exponent interpolated through three points, so there is no reason to
prefer it. Pass jet_price=False (--no-jet) to keep alpha/2 everywhere.
The rung — the third-order test, repaired. On a quadruple, with dd_k the
Newton divided differences of S,
D1_hat = (3/2) * dd1 * dd3 / dd2^2 - 1 >= 0
is the hypothesis's own first rung, N_eff_dot <= 1. The third-order
statistic in standard use, dd3 >= 0, is only N_eff_dot <= 2 — twice as
loose as the hypothesis it is quoted against — so the sharper test comes free
from the same four accuracies. And since a floor is present exactly when
D1 < 1, the same reading carries rung["floor_sign"], a floor verdict with
no fit behind it. rung["spacing_ratio"] is the widest-to-narrowest gap of
the four nodes: node irregularity alone can flip a negative sign, so distrust
a refutation when it is large.
How many models are needed
Counts refer to candidates that survive the cull, not those supplied.
| surviving | behaviour |
|---|---|
| 8 or more | the floor test identifies a rate reliably — USABLE expected |
| 6–7 | the papers' threshold, but noise-sensitive: identification 81% at 1% accuracy noise, 9% at 3% |
| 4–5 | the F-test cannot settle the floor, but the rung reads: a fit-free floor verdict, and the jet prices once it has two triples |
| 3 | one triple: N_eff and a reported jet quote, the envelope and the band — no rung, and the price stays alpha/2 |
| 2 | the envelope and price_free only, which still prove who can never win |
Fewer still ranks usefully: the exponent's precision is flat from three to ten
candidates when a floor is present, and price_free dominations hold at any
price. On MAI 2021, three surviving candidates of ten recovered the official
top two and identified six of the nine entries as dominated.
Competition leaderboards rarely reach eight by construction: their rules fix
quality at a threshold and compete on cost, so the surviving frontier is short
and carries little curvature. On a three-point frontier the price is not
rescuable from either side — a three-parameter fit through three points has no
residual left, and a single triple gives one first difference with nothing to
check it against — so the price stays alpha/2, the verdict stays
UNVERIFIED, and what these tables do get is the envelope, the band and the
reported jet. Four or more points on the marginal curve is where the rung
reads and the jet prices.
Usage examples
Ranked by the accuracy–time trade-off, no weight to choose. Any bare argument
containing a comma is a candidate: name,accuracy,p1[,p2,...].
- MAI 2026 INT8, SSIM vs inference time ms (NPU) — arXiv:2611.00963
python -m ab.nn.select --rank koreatechV2,0.8499,4.35 Godzilla,0.8831,215160 AntSR,0.8731,4.52 LoongSR,0.8586,5729 IN2GM,0.8701,46.5 z6,0.8699,5.49 AIO_MAI,0.8634,41.1 AntYSP,0.8729,4.33
- MAI 2026 INT8, PSNR converted to (0,1) vs 3 resources — NPU ms, CPU ms, model size (KB) — arXiv:2611.00963
python -m ab.nn.select --rank koreatechV2,0.998758348,4.35,464,77.1 Godzilla,0.999085887,215160,215160,16253 AntSR,0.998995384,4.52,404,65.3 LoongSR,0.998943182,5729,5729,708 IN2GM,0.998964858,46.5,526,64.3 z6,0.998983751,5.49,330,67.4 AIO_MAI,0.998950458,41.1,610,96.1 AntYSP,0.998990747,4.33,338,54.9
- EfficientNet B0–B7, ImageNet top-1 vs FLOPs and params (2 resources simultaneously) — arXiv:1905.11946, Table 2
python -m ab.nn.select --rank B7,0.843000000,37,66 B0,0.771000000,0.39,5.3 B4,0.829000000,4.2,19 B6,0.840000000,19,43 B2,0.801000000,1,9.2 B1,0.791000000,0.7,7.8 B3,0.816000000,1.8,12 B5,0.836000000,9.9,30
- YOLO11, mAP vs 4 resources — T4 TensorRT10 ms, CPU ONNX ms, params (M), FLOPs (B) — Ultralytics YOLO11 docs
python -m ab.nn.select --rank YOLO11l,0.534000000,6.2,238.6,25.3,87.2 YOLO11m,0.515000000,4.7,183.2,20.1,68.1 YOLO11x,0.547000000,11.3,462.8,56.9,195.3 YOLO11n,0.395000000,1.5,56.1,2.6,6.5 YOLO11s,0.470000000,2.5,90.0,9.4,21.6
- MAI 2021 camera scene detection, Top-1 vs A11 Bionic runtime — CVPRW 2021
python -m ab.nn.select --rank Airia-Det,0.9300,17.51 Sidiki,0.7800,1.74 ByteScene,0.9500,4.44 MobileNet-V2,0.9417,16.38 PyImageSearch,0.8967,45.88 ALONG,0.9467,64.45 neptuneai,0.8367,4.17 EVAI,0.9300,3.35 DataArt,0.9150,54.13 Team-Horizon,0.9233,7.7
A CSV works too, with headers guessed or named:
python -m ab.nn.select models.csv --rank --acc-col top1 --res-col latency_ms --res-col params_M
Other options
| flag | effect |
|---|---|
--rank |
order every model winner to loser (otherwise only the winner) |
--price LAMBDA |
score at a fixed price instead of deriving one; --price AXIS=LAMBDA per resource when there are several |
--out-csv FILE |
write the ranking to CSV (- for stdout) |
--alpha 0.05 |
coverage level for the rate interval |
--tiebreak interval|support|point |
which prices the tie inside the band is judged over (default interval) |
--no-jet |
keep alpha/2 even where the floor test fails, instead of lambda* = s |
--boot N |
max bootstrap refits; skipped automatically once the frontier has 50+ points, and wherever the jet supplies the price |
--no-color, --quiet |
plain text / suppress the report |
Exit codes: 0 clean, 1 UNVERIFIED or UNUSABLE, 2 bad input.
Scale: thousands of candidates are fine — they collapse to a frontier of a few hundred, and the fit runs on that. 20,000 models rank in about 1 second. The jet and the rung are O(n) in the frontier's length and the regret is one K-by-grid maximum on the matrix the rank spread already builds, so none of them is measurable in the total; on the runs where the jet supplies the price, 400 bootstrap refits are skipped and the call gets faster.
Tests
python -m unittest discover -s test # 89 tests, about 40 s
python -m unittest test.test.TestPublishedCases -v
No dependency beyond unittest. TestPublishedCases is frozen on the
examples above: its expected winners are what this implementation and the
pre-band one both return, so a diff there is a change in the answer users
see and has to be deliberate. The other groups are ordered by how little
they assume — input, envelope, price-free, jet, rung, verdict, rate, score,
band — so a failure localises. TestOneCharge guards the API itself: it
fails if select() or score() ever computes a ranking without going
through the shared charging kernel, which is how the two would drift apart.
Citation
If you find the NN-Rank project to be useful for your research, please consider citing the articles Frontier-Based AI Model Selection and Multiresource Frontier:
@article{ABrain.Rank,
author = {Ignatov, Dmitry},
title = {A Frontier-Based Theory of Quality--Resource Trade-offs for {AI} Model Selection},
journal = {SSRN},
volume = {7683960},
url = {https://doi.org/10.2139/ssrn.7683960},
year={2026}
note = {Software: \url{https://github.com/ABrain-One/nn-rank}}
}
@article{ABrain.Multi-Rank,
author = {Ignatov, Dmitry},
title = {A Differential Theory of Quality–Resource Trade-offs for {AI} Model Selection: The Multiresource Frontier and Its Minimax Price},
journal = {arXiv preprint},
volume = {arXiv:2611.23324},
url = {https://arxiv.org/abs/2611.23324},
year = {2026},
note = {Software: \url{https://github.com/ABrain-One/nn-rank}}
}
Metadata
Release files for nn-rank 1.0.1
For a detailed explanation of source distributions (sdists) and built distributions (wheels), please see the package formats documentation.
Source distribution (sdist)
| File | Size | Uploaded | Provenance | Actions |
|---|---|---|---|---|
| nn_rank-1.0.1.tar.gz | 63.3 kB | Without provenance | Details for nn_rank-1.0.1.tar.gz |
Built distribution (wheel)
| File | Interpreter | ABI | Platform | Actions Reset |
|---|---|---|---|---|
| nn_rank-1.0.1-py3-none-any.whl | Python 3 | none | any | Details for nn_rank-1.0.1-py3-none-any.whl |
Total release size: 109.3 kB
Release files / nn_rank-1.0.1.tar.gz
| Download URL | nn_rank-1.0.1.tar.gz |
|---|---|
| Size | 63.3 kB |
| Tags | Source |
|
SHA-256 checksum How to use checksums |
3e00ee9f475a578d5eb76597923d1df8ca85cd421e60d00f0f9aa907e7313171
|
|
BLAKE2b-256 checksum How to use checksums |
94138b5c87e80e0a5baca8b585eba4c292046f3906b34c4e3a14aea972d1a3d8
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
No |
| Uploaded via |
twine/7.0.0 CPython/3.13.5
|
Release files / nn_rank-1.0.1-py3-none-any.whl
| Download URL | nn_rank-1.0.1-py3-none-any.whl |
|---|---|
| Size | 46.0 kB |
| Tags | Python 3 |
|
SHA-256 checksum How to use checksums |
a43bb190eb9fa5f46bb852ae577caa0436fbb36bd698cec0bab027cf916d2a71
|
|
BLAKE2b-256 checksum How to use checksums |
19db810ba052f5f3ebf8540d68174c582d2d951983f43cf57a25517ac87c2f1f
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
No |
| Uploaded via |
twine/7.0.0 CPython/3.13.5
|
Security for nn-rank 1.0.1
Provenance
Provenance describes where a file came from. On PyPI, provenance is shared via attestations, which provide a verifiable record of the build or publishing details. View details, limitations and caveats.
No provenance found
None of the files in this release were uploaded with provenance metadata.
A note on package security
PyPI is a repository for distributing packages, not a service for auditing them. While third-party security researchers and our staff do their best to detect and remove malicious packages, PyPI cannot guarantee the quality, security or suitability of any given package.
To learn more about protecting yourself from malicious actors, visit our package security documentation.