We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Compressing large Neural Networks (NN) by quantizing the parameters, while maintaining the performance is highly desirable due to reduced memory and time complexity. In this work, we cast NN quantization as a discrete labelling problem, and by examining relaxations, we design an efficient iterative optimization procedure that involves stochastic gradient descent followed by a projection. We prove that our simple projected gradient descent approach is, in fact, equivalent to a proximal version of the well-known mean-field method. These findings would allow the decades-old and theoretically grounded research on MRF optimization to be used to design better network quantization schemes. Our experiments on standard classification datasets (MNIST, CIFAR10/100, TinyImageNet) with convolutional and residual architectures show that our algorithm obtains fully-quantized networks with accuracies very close to the floating-point reference networks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1812.04353")
get_code_for_paper("1812.04353")
have("1812.04353")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1812.04353.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1812.04353)
Connect an agent — have() is free.