Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

20406080 · Jun 202619922001200920172026
48 results for Replica-Symmetric Formulas

We rigorously prove statistical physics predictions for non-convex GLMs in high dimensions.

problem Analyzing high-dimensional optimization problems in non-convex Generalized Linear Models.
method Developed a systematic framework using the Gaussian Min-Max Theorem and AMP to rigorously prove replica-symmetric formulas.
result Validated statistical physics predictions for non-convex GLMs, aligning with physicist's conjectures.

PLS-SVD struggles with missing data in multimodal datasets, showing a phase transition in performance.

problem Missing data in PLS-SVD for multimodal datasets.
method Replica-symmetric analysis of spiked rectangular random matrices with missing entries.
result PLS-SVD performance transitions from uninformative to informative singular vectors at a critical signal-to-noise threshold.

Dense Associative Memories outperform classical networks in robustness and signal processing.

problem Improving neural network performance in adversarial attacks and weak signal processing.
method Relaxing replica symmetry in statistical mechanics of spin glasses to analyze unsupervised and supervised learning.
result Explicit analytical investigation of phase diagrams and storage capacities for Dense Associative Memories.

We study Generalised Restricted Boltzmann Machines with generic priors for units and weights, interpolating between Boolean and Gaussian variables. We present a complete analysis of the replica symmetric phase diagram of these systems, which can be regarded as Generalised Hopfield models. We underline the role of the r…

2016-12-09abs ↗pdf ↗

Binary perceptron's instability linked to replica symmetry breaking.

problem Understanding the relationship between algorithmic instability and replica symmetry breaking in binary perceptron learning.
method Established the connection between algorithmic instability and replica symmetry breaking by comparing the instability condition around the fixed point to the instability for breaking the replica symmetric solution of the free energy function.
result The instability condition around the algorithmic fixed point is identical to the instability for breaking the replica symmetric saddle point solution of the free energy function.

Minimizing a convex, quadratic objective of the form fA,b(x):=12xAxb,xf_{\mathbf{A},\mathbf{b}}(x) := \frac{1}{2}x^\top \mathbf{A} x - \langle \mathbf{b}, x \rangle for A0\mathbf{A} \succ 0 is a fundamental problem in machine learning and optimization. In this work, we prove gradient-query complexity lower bounds for minimizing conv…

2018-07-24abs ↗pdf ↗

A fast, approximate method for variable selection in GLMs tackles correlated data.

problem Variable selection in generalized linear models with correlated data.
method Replica method of statistical mechanics and vector approximate message passing.
result The proposed algorithm provides fast convergence and high approximation accuracy.

Analyzes unsupervised neural networks using statistical mechanics and Monte Carlo simulations.

problem Understanding computational capabilities of unsupervised neural networks.
method Statistical mechanics approach and Monte Carlo simulations.
result Obtained a phase diagram summarizing network performance.

We study the problem of detecting the presence of a single unknown spike in a rectangular data matrix, in a high-dimensional regime where the spike has fixed strength and the aspect ratio of the matrix converges to a finite limit. This setup includes Johnstone's spiked covariance model. We analyze the likelihood ratio …

2018-02-20abs ↗pdf ↗

Paper introduces supervised and unsupervised TAM models for binary neurons.

problem Learning and retrieval of structured triplets of patterns in neural networks.
method Extends Hebbian paradigm to supervised and unsupervised protocols, using glassy statistical mechanical techniques.
result Obtained self-consistency equations for critical dataset sizes and retrieval performance.

Neural networks can detect weak patterns hidden in noise.

problem Detecting weak patterns in noisy data.
method Developed a three-layer Sejnowski machine with redundant representation, showing patterns can be stored and retrieved efficiently.
result Neural networks can retrieve information with intensity O(1) even in the presence of noise O(\sqrt{N}) in the large N limit.

Injectivity of ReLU networks studied using statistical physics.

problem When can the input of a ReLU neural network be inferred from its output?
method Connection to spherical integral geometry and statistical physics.
result Replica symmetry-breaking theory and Gordon's min--max theorem provide insights into the injectivity threshold.

Dense neural networks learn efficiently with large datasets and noise.

problem Training neural networks with large, noisy datasets.
method Statistical mechanics and Monte Carlo simulations.
result Dense neural networks can handle large amounts of patterns and recognize patterns at high signal-to-noise ratios.

Study neural networks learning from noisy examples via reverberation.

problem Learning from noisy examples in neural networks.
method Adapted Guerra's interpolation technique to provide statistical mechanics of supervised and unsupervised learning.
result Full phase diagrams and thresholds for learning are analytically obtained.

Recently a daily routine for associative neural networks has been proposed: the network Hebbian-learns during the awake state (thus behaving as a standard Hopfield model), then, during its sleep state, optimizing information storage, it consolidates pure patterns and removes spurious ones: this forces the synaptic matr…

2018-12-21abs ↗pdf ↗

We prove two tropical gluing formulae for Gromov-Witten invariants of exploded manifolds, useful for calculating Gromov-Witten invariants of a symplectic manifold using a normal-crossing degeneration. The first formula generalizes the symplectic-sum formula for Gromov-Witten invariants. The second formula is stronger, …

2017-03-16abs ↗pdf ↗

The main result of the present paper is a coincidence formula for foliated manifolds. To prove this we establish Kuenneth formula, Poincare duality and intersection product in the context of tangential de Rham cohomology and homology of tangential currents. We apply the formula to get a dynamical Lefschetz formula for …

2003-06-02abs ↗pdf ↗

It has been shown that the Alvarez-Gaumeˊ\mathrm{\acute{e}}-Witten miraculous anomaly cancellation formula in type IIB superstring theory and its various generalizations can be derived from modularity of certain characteristic forms. In this paper, we show that the Green-Schwarz formula and the Schwarz-Witten formula i…

2012-05-03abs ↗pdf ↗

Proves a formula for a special invariant of 4-manifolds.

problem Calculating the Bauer-Furuta invariant for connected sums of 4-manifolds.
method Uses a finite dimensional approximation of the Seiberg-Witten monopole map to derive a formula for the families Bauer-Furuta invariant of a fibrewise connected sum.
result Derives a general connected sum formula for the families Bauer-Furuta invariant.

Formulae for non-symmetric connections derived from covariant derivatives.

problem Deriving commutation formulae for non-symmetric affine connections.
method Covariant derivatives of tensors with respect to symmetric and non-symmetric affine connections.
result Formulae for non-symmetric connections derived from covariant derivatives.

We prove a quasi-Poisson bracket formula for the space of representations of the fundamental groupoid of a surface with boundary, which generalizes Goldman's Poisson bracket formula. We also deduce a similar formula for quasi-Poisson cross-sections.

2013-01-22abs ↗pdf ↗

Paper derives matrix formulae and proves skein relations for non-orientable surfaces in quasi-cluster algebras.

problem Understanding quasi-cluster algebras on non-orientable surfaces.
method Developed matrix formulae and proved skein relations for quasi-cluster variables.
result Laurent expansion and skein relations for quasi-cluster variables on non-orientable surfaces.