Papers › ProxQuant: Quantized Neural Networks via Proximal Operators

ProxQuant: Quantized Neural Networks via Proximal Operators

1 Oct 2018ICLR 2019 5arXiv:1810.00861archive 2025-07-28

Yu Bai, Yu-Xiang Wang, Edo Liberty

To make deep neural networks feasible in resource-constrained environments (such as mobile devices), it is beneficial to quantize models by using low-precision weights. One common technique for quantizing neural networks is the straight-through gradient method, which enables back-propagation through the quantization mapping. Despite its empirical success, little is understood about why the straight-through gradient method works. Building upon a novel observation that the straight-through gradient method is in fact identical to the well-known Nesterov's dual-averaging algorithm on a quantization constrained optimization problem, we propose a more principled alternative approach, called ProxQuant, that formulates quantized network training as a regularized learning problem instead and optimizes it via the prox-gradient method. ProxQuant does back-propagation on the underlying full-precision vector and applies an efficient prox-operator in between stochastic gradient steps to encourage quantizedness. For quantizing ResNets and LSTMs, ProxQuant outperforms state-of-the-art results on binary quantization and is on par with state-of-the-art on multi-bit quantization. For binary quantization, our analysis shows both theoretically and experimentally that ProxQuant is more stable than the straight-through gradient method (i.e. BinaryConnect), challenging the indispensability of the straight-through gradient method and providing a powerful alternative.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 16 code samples harvested from 1 repository linked to this paper: 8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 8 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 16 samples from 1 repository, 8 ran (7 with no instrument failure; 1 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 1 of the 8 samples that ran has no recorded date.

allenbai01/ProxQuant officialmentioned in paperpytorchMITSyntology: 16 samples, 8 ran (1 instrument-failed) · 8 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

16 samples harvested: 8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 8 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · our draft was wrong
7ran
8unverified

Licence: 1 of the 16 samples is pointer only, meaning Syntology does not serve that copy's text. For that sample, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from allenbai01/ProxQuant. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

allenbai01/ProxQuant official repository 16 samples, 8 ran (1 instrument-failed) · 8 unverified
Binarize models/binarized_modules.py ran fingerprinted MIT (permissive) · 87e04701edce84bc · report fixture: signature tensor:Tensor/2/float, quant_mode:str/0/str · returned Tensor · level recorded 2026-09-25
Quantize models/binarized_modules.py ran MIT (permissive) · 389e9d00ee17c1e7 · report fixture: signature tensor:Tensor/2/float, quant_mode:str/0/str, params:NoneType/0/?, numBits:int/0/int · returned Tensor · level recorded 2026-09-25
conv3x3 in 1,376 papers models/resnet.py ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only · fac5364e2f53c6db · report fixture: signature in_planes:int/0/int, out_planes:int/0/int, stride:int/0/int · returned Conv2d · level recorded, date not recorded
find_B_numpy bst.py ran MIT (permissive) · ce88743b4a4532aa · report fixture: signature w:ndarray/2/float, Alpha:ndarray/1/float, by_row:bool/0/bool · returned ndarray · level recorded 2026-09-25
if_binary reg.py ran MIT (permissive) · 2bdeac768f5f8258 · report fixture: signature n:str/0/str · returned bool · level recorded 2026-09-25
if_binary_lm reg.py ran MIT (permissive) · 489f980022491193 · report fixture: signature n:str/0/str · returned bool · level recorded 2026-09-25
if_binary_tern reg.py ran MIT (permissive) · 5efcd1e9ae48efb9 · report fixture: signature n:str/0/str · returned bool · level recorded 2026-09-25
pad_random_crop preprocess.py ran MIT (permissive) · 65a7404ee8437540 · report fixture: signature input_size:int/0/int, scale_size:int/0/int, normalize:dict/0/? · returned Compose · level recorded 2026-09-25
Binaryconv3x3 models/resnet_binary.py unverified MIT (permissive) · 11d4ff1157dd777a · report
find_B_torch bst.py unverified MIT (permissive) · ea137766123e8a10 · report
forward in 75 papers main_binary_reg.py unverified MIT (permissive) · 172df2baa8f002c3 · report
get_dataset in 285 papers data.py unverified MIT (permissive) · 3b6b395f11bd2a5e · report
inception_preproccess preprocess.py unverified MIT (permissive) · f407103e88c43c4d · report
scale_crop preprocess.py unverified MIT (permissive) · 7e8728eb31828d77 · report
train in 522 papers main_binary_reg.py unverified MIT (permissive) · a6c968b28755b58c · report
validate in 313 papers main_binary_reg.py unverified MIT (permissive) · 6604ddcbff9362bd · report

Tasks

Quantization

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections