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.
Existing bounds on the generalization error of deep networks assume some form of smooth or bounded dependence on the input variable, falling short of investigating the mechanisms controlling such factors in practice. In this work, we present an extensive experimental study of the empirical Lipschitz constant of deep networks undergoing double descent, and highlight non-monotonic trends strongly correlating with the test error. Building a connection between parameter-space and input-space gradients for SGD around a critical point, we isolate two important factors -- namely loss landscape curvature and distance of parameters from initialization -- respectively controlling optimization dynamics around a critical point and bounding model function complexity, even beyond the training data. Our study presents novels insights on implicit regularization via overparameterization, and effective model complexity for networks trained in practice.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2301.12309")
get_code_for_paper("2301.12309")
have("2301.12309")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2301.12309.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2301.12309)
Connect an agent — have() is free.