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.
Recent work has shown that tight concentration of the entire spectrum of singular values of a deep network's input-output Jacobian around one at initialization can speed up learning by orders of magnitude. Therefore, to guide important design choices, it is important to build a full theoretical understanding of the spectra of Jacobians at initialization. To this end, we leverage powerful tools from free probability theory to provide a detailed analytic understanding of how a deep network's Jacobian spectrum depends on various hyperparameters including the nonlinearity, the weight and bias distributions, and the depth. For a variety of nonlinearities, our work reveals the emergence of new universal limiting spectral distributions that remain concentrated around one even as the depth goes to infinity.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1802.09979")
get_code_for_paper("1802.09979")
have("1802.09979")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1802.09979.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1802.09979)
Connect an agent — have() is free.