The maximum-average subtensor problem: equilibrium and out-of-equilibrium properties
From MaRDI portal
Cites work
- Algorithms and barriers in the symmetric binary perceptron model
- Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster
- Clustering of solutions in the symmetric binary perceptron
- Disordered systems insights on computational hardness
- Energy landscape for large average submatrix detection problems in Gaussian random matrices
- Entropy landscape of solutions in the binary perceptron problem
- Estimating rank-one matrices with mismatched prior and noise: universality and large deviations
- Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms
- Finding a large submatrix of a Gaussian random matrix
- Free energy in the mixed p-spin models with vector spins
- Frozen 1-RSB structure of the symmetric Ising perceptron
- How to escape atypical regions in the symmetric binary perceptron: a journey through connected-solutions states
- Local equations describe unreasonably efficient stochastic algorithms in random K-SAT
- Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio
- Notes on computational-to-statistical gaps: predictions using statistical physics
- On some features of quadratic unconstrained binary optimization with random coefficients
- On the atypical solutions of the symmetric binary perceptron
- On the free energy of vector spin glasses with nonconvex interactions
- On the maximal size of large-average and ANOVA-fit submatrices in a Gaussian random matrix
- On the solution-space geometry of random constraint satisfaction problems
- Random Max-CSPs inherit algorithmic hardness from spin glasses
- Random-energy model: an exactly solvable model of disordered systems
- Shaping the learning landscape in neural networks around wide flat minima
- Statistical Physics of Spin Glasses and Information Processing
- Statistical mechanics of the maximum-average submatrix problem
- Storage capacity in symmetric binary perceptrons
- The algorithmic phase transition of random graph alignment problem
- Tight Lipschitz hardness for optimizing mean field spin glasses
This page was built for publication: The maximum-average subtensor problem: equilibrium and out-of-equilibrium properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7236696)
