SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2608.11045 · 2026

ReRound: Reconstructive Rounding to Resolve Midpoint Ambiguity in Calibration-Free LLM Quantization

H Kung, He-Yen Hsieh

arXiv · PDF · Open in the Atlas

Code that ran

We lifted 16 functions out of this paper's own repositories and ran 13 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.

RepositoryRoleRan
louisYen/ReRound — 13 of 16
FunctionStatusWhere it lives
ReRoundConfig Ran louisYen/ReRound/reround_ptq/llm_quant/rounding.py
pointer only (licence: NONE) · get_code("b291cd4474b2b0b1")
ReRoundResult Ran louisYen/ReRound/reround_ptq/llm_quant/rounding.py
pointer only (licence: NONE) · get_code("99b7319828711fd6")
_candidate_name Ran louisYen/ReRound/reround_ptq/llm_quant/rounding.py
pointer only (licence: NONE) · get_code("c7562eb1308b4f27")
_find_rtn_loss Ran louisYen/ReRound/reround_ptq/llm_quant/rounding.py
pointer only (licence: NONE) · get_code("18123e0d23912b0a")
_fmt_count Ran louisYen/ReRound/reround_ptq/llm_quant/rounding.py
pointer only (licence: NONE) · get_code("5b2e48474d839b75")
_fmt_loss Ran louisYen/ReRound/reround_ptq/llm_quant/rounding.py
pointer only (licence: NONE) · get_code("4f18cda286393324")
_fmt_pct Ran louisYen/ReRound/reround_ptq/llm_quant/rounding.py
pointer only (licence: NONE) · get_code("678a26367f6214c4")
_format_reround_candidates Ran louisYen/ReRound/reround_ptq/llm_quant/rounding.py
pointer only (licence: NONE) · get_code("888fff0d92acfbe0")
_pick_tau_row Ran louisYen/ReRound/reround_ptq/llm_quant/rounding.py
pointer only (licence: NONE) · get_code("bbcd1c1fdfa90aa4")
_selection_name Ran louisYen/ReRound/reround_ptq/llm_quant/rounding.py
pointer only (licence: NONE) · get_code("7d4f6860df13a8e5")
_status_text Ran louisYen/ReRound/reround_ptq/llm_quant/rounding.py
pointer only (licence: NONE) · get_code("450db99d12ab9c3c")
dequantize_from_bins Ran louisYen/ReRound/reround_ptq/llm_quant/rounding.py
pointer only (licence: NONE) · get_code("57b44820869a2d91")
spectral_loss_from_q Ran louisYen/ReRound/reround_ptq/llm_quant/rounding.py
pointer only (licence: NONE) · get_code("38ff793e4abe8ad7")
_log_reround_selection Not yet run louisYen/ReRound/reround_ptq/llm_quant/rounding.py
pointer only (licence: NONE) · get_code("c1dbcf5ff9ad4fba")
reround Not yet run louisYen/ReRound/reround_ptq/llm_quant/rounding.py
pointer only (licence: NONE) · get_code("d6c73f1cfd6218c4")
select_reround_bins Not yet run louisYen/ReRound/reround_ptq/llm_quant/rounding.py
pointer only (licence: NONE) · get_code("88da9893deb0449e")

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

ReRound (Reconstructive Rounding) is a post-training quantization method that addresses the midpoint ambiguity inherent in standard round-to-nearest (RTN) schemes when quantizing weights near the centers of quantization intervals. Starting from a pretrained LLM, ReRound trains a conditional diffusion model to produce continuous reconstructions of lowbit weights for the LLM. These reconstructed weights act as a guidance signal to disambiguate the rounding direction of weights located close to interval midpoints. To integrate this reconstruction-guided rounding with conventional RTN, ReRound introduces a tolerance metric measuring how far the quantized weight (not the final quantized integer) is away from the midpoint: quantized weights within a tolerance region around midpoints are quantized using diffusionbased reconstructions, whereas weights closer to quantization boundaries are quantized with RTN. By sweeping the tolerance parameter, ReRound generates multiple candidate quantized integer weight matrices and selects the de-quantized weight matrix candidate whose leading singular values most closely match those of the original full-precision weights. This selected candidate determines the tolerance parameter ReRound uses. ReRound is particularly effective for smaller LLMs. Across a range of such models, it consistently outperforms standard RTN for 3-bit and 4-bit weight quantization. ReRound achieves superior accuracy compared to an extensive set of calibration-free methods, remains competitive with calibration-dependent approaches, and operates entirely offline, introducing no additional overhead during low-bit inference. The ReRound strategy represents a new approach for low-bit quantization. The method applies to AI models beyond LLMs. This paper focuses on its applications to small LLMs. Code is available at https://github.com/louisYen/ReRound. Reconstructed Weight Matrix 𝑊 !"# Round Up (a) Midpoint Ambiguity: Round Down or Up? Round Down Round Up Floor Ceiling Midpoint 1 2 = 1.76 = 1.48 1.5 𝑤 " 𝑤 " !"# Diffusion-Prior Guidance from (b) (b) Diffusion-Prior Guidance Patches of LLM Weight Matrices Train U-Net Weight Matrix 𝑊 𝑤 " !"# Learned Diffusion Prior (U-Net) Quantized floating-point weight 𝑤 # Reconstructed quantized floating-point weight 𝑤 # !"# Map to quantized coordinates

For agents

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

get_harvested_code_for_paper("2608.11045")
get_code_for_paper("2608.11045")
have("2608.11045")

Connect an agent — have() is free.