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.
We consider gradient-based optimisation of wide, shallow neural networks, where the output of each hidden node is scaled by a positive parameter. The scaling parameters are non-identical, differing from the classical Neural Tangent Kernel (NTK) parameterisation. We prove that for large such neural networks, with high probability, gradient flow and gradient descent converge to a global minimum and can learn features in some sense, unlike in the NTK parameterisation. We perform experiments illustrating our theoretical results and discuss the benefits of such scaling in terms of prunability and transfer learning.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2302.01002")
get_code_for_paper("2302.01002")
have("2302.01002")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2302.01002.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2302.01002)
Connect an agent — have() is free.