Search Results for author:
Found 12 papers, 1 papers with code
Backdoor to the Hidden Ground State: Planted Vertex Cover Example
We discover that the disordered symmetric phase of this system may be locally stable with respect to the ordered phase at all inverse temperatures except for a unique eureka point $\beta_b$ at which it is only marginally stable.
Energy--Information Trade-off Induces Continuous and Discontinuous Phase Transitions in Lateral Predictive Coding
Lateral predictive coding is a recurrent neural network which creates energy-efficient internal representations by exploiting statistical regularity in sensory inputs.
Lateral predictive coding revisited: Internal model, symmetry breaking, and response time
Predictive coding is a promising theoretical framework in neuroscience for understanding information transmission and perception.
Circumventing spin glass traps by microcanonical spontaneous symmetry breaking
The planted p-spin interaction model is a paradigm of random-graph systems possessing both a ferromagnetic phase and a disordered phase with the latter splitting into many spin glass states at low temperatures.
Solving Statistical Mechanics on Sparse Graphs with Feedback Set Variational Autoregressive Networks
We propose a method for solving statistical mechanics problems defined on sparse graphs.
Active online learning in the binary perceptron problem
We demonstrate that it is mathematically possible to achieve perfect (error-free) inference using only $N$ designed training patterns, but this is computationally unfeasible for large systems.
Unsupervised prototype learning in an associative-memory network
Unsupervised learning in a generalized Hopfield associative-memory network is investigated in this work.
A spin glass approach to the directed feedback vertex set problem
A feedback vertex set (FVS) is a set of vertices that contains at least one vertex of every directed cycle in this digraph.
Physics and Society Disordered Systems and Neural Networks Social and Information Networks
Generalized minimum dominating set and application in automatic text summarization
For a graph formed by vertices and weighted edges, a generalized minimum dominating set (MDS) is a vertex set of smallest cardinality such that the summed weight of edges from each outside vertex to vertices in this set is equal to or larger than certain threshold value.
Loop-corrected belief propagation for lattice spin models
Belief propagation (BP) is a message-passing method for solving probabilistic graphical models.
Solving the undirected feedback vertex set problem by local search
An undirected graph consists of a set of vertices and a set of undirected edges between vertices.
Social cycling and conditional responses in the Rock-Paper-Scissors game
How humans make decisions in non-cooperative strategic interactions is a challenging question.
Physics and Society Computer Science and Game Theory
