相关论文: Binary perceptrons capacity via fully lifted rando…

We estimate the critical capacity of the zero-temperature Hopfield model by using a novel and rigorous method. The probability of having a stable fixed point is one when $\alpha\le 0.113$ for a large number of neurons. This result is an…

Upper and lower bounds for the typical storage capacity of a constructive algorithm, the Tilinglike Learning Algorithm for the Parity Machine [M. Biehl and M. Opper, Phys. Rev. A {\bf 44} 6888 (1991)], are determined in the asymptotic limit…

The capacitance of the electric double layer has potential applications in supercapacitors, and theoretical investigations of the double-layer capacitance in binary mixtures are important. In this work, we develop the theory of the electric…

Identifying signals that replicate across multiple studies is essential for establishing robust scientific evidence, yet existing methods for high-dimensional replicability analysis either rely on restrictive modeling assumptions, are…

We construct a two-parameter complex function $\eta_{\kappa \nu}:\mathbb{C}\to \mathbb{C}$, $\kappa \in (0, \infty)$, $\nu\in (0,\infty)$ that we call a holomorphic nonlinear embedding and that is given by a double series which is…

The storage capacity of a binary classification model is the maximum number of random input-output pairs per parameter that the model can learn. It is one of the indicators of the expressive power of machine learning models and is important…

A Blume-Emery-Griffiths perceptron model is introduced and its optimal capacity is calculated within the replica-symmetric Gardner approach, as a function of the pattern activity and the imbedding stability parameter. The stability of the…

We study the random binary symmetric perceptron problem, focusing on the behavior of rare high-margin solutions. While most solutions are isolated, we demonstrate that these rare solutions are part of clusters of extensive entropy,…

We consider \emph{bilinearly indexed random processes} (blirp) and study their interpolating comparative mechanisms. Generic introduction of the \emph{fully lifted} (fl) blirp interpolation in [105] was followed by a corresponding…

In the negative perceptron problem we are given $n$ data points $({\boldsymbol x}_i,y_i)$, where ${\boldsymbol x}_i$ is a $d$-dimensional vector and $y_i\in\{+1,-1\}$ is a binary label. The data are not linearly separable and hence we…

We determine the scaling dimension $\Delta_n$ for the class of composite operators $\phi^n$ in the $\lambda \phi^4$ theory in $d=4-\epsilon$ taking the double scaling limit $n\rightarrow \infty$ and $\lambda \rightarrow 0$ with fixed…

We consider \emph{random linear programs} (rlps) as a subclass of \emph{random optimization problems} (rops) and study their typical behavior. Our particular focus is on appropriate linear objectives which connect the rlps to the mean…

Based on our \bl{\textbf{Random Duality Theory (RDT)}}, in a sequence of our recent papers \cite{Stojnicclupint19,Stojnicclupcmpl19,Stojnicclupplt19}, we introduced a powerful algorithmic mechanism (called \bl{\textbf{CLuP}}) that can be…

Open fermion systems with energy-independent bilinear coupling to a fermionic environment have been shown to obey a general duality relation [Phys. Rev. B 93, 81411 (2016)] which allows for a drastic simplification of time-evolution…

We study the theoretical limits of the $\ell_0$ (quasi) norm based optimization algorithms when employed for solving classical compressed sensing or sparse regression problems. Considering standard contexts with deterministic signals and…

We consider restricted Boltzmann machines with a binary visible layer and a Gaussian hidden layer trained by an unlabelled dataset composed of noisy realizations of a single ground pattern. We develop a statistical mechanics framework to…

We study the replica symmetry breaking (rsb) concepts on a generic level through the prism of recently introduced interpolating/comparison mechanisms for bilinearly indexed (bli) random processes. In particular, \cite{Stojnicnflgscompyx23}…

We study the convex duality method for robust utility maximization in the presence of a random endowment. When the underlying price process is a locally bounded semimartingale, we show that the fundamental duality relation holds true for a…

Statistical mechanics is used to study unrealizable generalization in two large feed-forward neural networks with binary weights and output, a perceptron and a tree committee machine. The student is trained by a teacher being larger, i.e.…

Sparse autoencoders (SAEs) decompose transformer residual streams into interpretable feature dictionaries, yet the relationship between SAE width and causal influence on model output has not been systematically characterised. We introduce…