Criticality & Deep Learning II: Momentum Renormalisation Group
Guided by critical systems found in nature we develop a novel mechanism consisting of inhomogeneous polynomial regularisation via which we can induce scale invariance in deep learning systems. Technically, we map our deep learning (DL) setup to a genuine field theory, on which we act with the Renormalisation Group (RG) in momentum space and produce the flow equations of the couplings; those are translated to constraints and consequently interpreted as "critical regularisation" conditions in the optimiser; the resulting equations hence prove to be sufficient conditions for - and serve as an elegant and simple mechanism to induce scale invariance in any deep learning setup.
Code (0)
등록된 구현이 없습니다.
Tasks
Deep LearningSimilar Papers 제목 키워드 기반
Criticality at work: scaling in the mouse cortex enhances performance
The critical brain hypothesis posits that neural systems operate near a phase transition, optimising the transmission, storage, and processing of information. While scale invariance and non-Gaussian dynamics - hallmarks …
Abstraction requires breadth: a renormalisation group approach
Abstraction is the process of extracting the essential features from raw data while ignoring irrelevant details. This is similar to the process of focusing on large-scale properties, systematically removing irrelevant sm…
Iterative Magnitude Pruning as a Renormalisation Group: A Study in The Context of The Lottery Ticket Hypothesis
This thesis delves into the intricate world of Deep Neural Networks (DNNs), focusing on the exciting concept of the Lottery Ticket Hypothesis (LTH). The LTH posits that within extensive DNNs, smaller, trainable subnetwor…
Renormalisation Group Methods for Effective Epidemiological Models
Epidemiological models describe the spread of an infectious disease within a population. They capture microscopic details on how the disease is passed on among individuals in various different ways, while making predicti…
Optimisation via encodings: a renormalisation group perspective
Difficult, in particular NP-complete, optimization problems are traditionally solved approximately using search heuristics. These are usually slowed down by the rugged landscapes encountered, because local minima arrest …