4 papers · 1 filter
Reduction of interaction order in hard combinatorial optimization via conditionally independent degrees of freedom
Alexandru Ciobanu, David Dahmen, John Paul Strachan +1
Combinatorial optimization problems have a broad range of applications and map to physical systems with complex dynamics. Among them, the 3-SAT problem is prominent due to its NP-c…
Event-driven eligibility propagation in large sparse networks: efficiency shaped by biological realism
Agnes Korcsak-Gorzo, Jesús A. Espinoza Valverde, Jonas Stapmanns +5
Despite remarkable technological advances, AI systems may still benefit from biological principles, such as recurrent connectivity and energy-efficient mechanisms. Drawing inspirat…
Beyond-mean-field fluctuations for the solution of constraint satisfaction problems
Niklas Foos, Bastian Epping, Jannik Grundler +5
Constraint Satisfaction Problems (CSPs) lie at the heart of complexity theory and find application in a plethora of prominent tasks ranging from cryptography to genetics. Classical…
From Kernels to Features: A Multi-Scale Adaptive Theory of Feature Learning
Noa Rubin, Kirsten Fischer, Javed Lindner +5
Feature learning in neural networks is crucial for their expressive power and inductive biases, motivating various theoretical approaches. Some approaches describe network behavior…