具有线性平均计算时间的非均匀quantization
Non-uniform quantization with linear average-case computation time
摘要：
提出了一种新的方法，用于将一组$n$数据值分箱到一组m个箱中，其中箱具有不同的大小。该方法一直使用跨箱的二进制搜索来跳过分箱。它被证明是一个线性的平均情况下的计算时间。实验结果表明，对于分布未知的数据值，与仅通过二分搜索进行分箱相比，加速因子超过4。这一结果与方法的分析一致。
英文摘要：
A new method for binning a set of $n$ data values into a set of m bins for the case where the bins are of different sizes is proposed. The method skips binning using a binary search across the bins all the time. It is proven the method exhibits a linear average-case computation time. The experiments' results show a speedup factor of over four compared to binning by binary search alone for data values with unknown distributions. This result is consistent with the analysis of the method.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
