~40–100× faster
Most of the algorithms described here are quite straightforward to implement. Some of them can be written in just a few lines of code, and those that require a bit more effort can be better understood by reading through the relevant papers and links I have provided. The exception to this are those that rely on the Delaunay triangulation to work. Robust Delaunay triangulations in 3D are fairly complex and there isn’t any publicly available software that I’m aware of that leverages them for dithering in the way I’ve described.
，详情可参考safew官方版本下载
在深度学习中，有几类经典激活函数，每种都有自己的优缺点：
以及：Anthropic「蒸馏」了人类最大的知识库