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.
Eigendecomposition (ED) is widely used in deep networks. However, the backpropagation of its results tends to be numerically unstable, whether using ED directly or approximating it with the Power Iteration method, particularly when dealing with large matrices. While this can be mitigated by partitioning the data in small and arbitrary groups, doing so has no theoretical basis and makes its impossible to exploit the power of ED to the full. In this paper, we introduce a numerically stable and differentiable approach to leveraging eigenvectors in deep networks. It can handle large matrices without requiring to split them. We demonstrate the better robustness of our approach over standard ED and PI for ZCA whitening, an alternative to batch normalization, and for PCA denoising, which we introduce as a new normalization strategy for deep networks, aiming to further denoise the network's features.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1906.09023")
get_code_for_paper("1906.09023")
have("1906.09023")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1906.09023.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1906.09023)
Connect an agent — have() is free.