Mao Ye, Jingjing Liu, Yan Wang, Chenjian Gao, Tongda Xu, Dailan He, Hongwei Qin, Han Gao, Yuanyuan Wang, Jinyong Pi, Jixiang Luo, Ziyu Zhu, and 1 more
None of the 1 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (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/2209.09422.json · badge: /api/ran/2209.09422.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.
| Repository | Role | Ran |
|---|---|---|
| tongdaxu/bit-allocation-using-optimization | marked official in Papers with Code Papers with Code archive |
0 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| Quantizator_SGA | Not yet run unverified (harvested, no recorded run) |
tongdaxu/bit-allocation-using-optimization/5.2. Evaluation on Bit Allocation/I_model/models/priors.py code served (permissive licence) · get_code("5421d0b72850e0c6") How it ranno invocation recorded. |
Of 1 samples lifted from this paper's linked repositories, 1 carry a function identity and 0 do not. Of the 1 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 1 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-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
In this paper, we consider the problem of bit allocation in Neural Video Compression (NVC). First, we reveal a fundamental relationship between bit allocation in NVC and Semi-Amortized Variational Inference (SAVI). Specifically, we show that SAVI with GoP (Group-of-Picture)level likelihood is equivalent to pixel-level bit allocation with precise rate & quality dependency model. Based on this equivalence, we establish a new paradigm of bit allocation using SAVI. Different from previous bit allocation methods, our approach requires no empirical model and is thus optimal. Moreover, as the original SAVI using gradient ascent only applies to single-level latent, we extend the SAVI to multi-level such as NVC by recursively applying back-propagating through gradient ascent. Finally, we propose a tractable approximation for practical implementation. Our method can be applied to scenarios where performance outweights encoding speed, and serves as an empirical bound on the R-D performance of bit allocation. Experimental results show that current state-of-the-art bit allocation algorithms still have a room of ≈ 0.5 dB PSNR to improve compared with ours. Code is available at https://github.com/tongdaxu/ Bit-Allocation-Using-Optimization.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2209.09422")
get_code_for_paper("2209.09422")
have("2209.09422")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2209.09422.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2209.09422)
Connect an agent — have() is free.