4 problems

0 votes0 replies0 views
The error-corrected neural-network collision-resistant hash conjecture
Error-corrected CRH conjecture. If $\widetilde{\alpha}(q_{\mathrm{code}})<1$ , then $f_{\boldsymbol{A}}\circ ECC$ is a CRH.
Conjectureopencollision-resistance error-correcting-codes neural-networksarXiv posted 2 days ago
0 votes0 replies0 views
The average-case hardness conjecture between the OGP and collision thresholds
Average-case collision-hardness conjecture. Finding one of these collisions is algorithmically hard in the average case.
Conjectureopencollision-resistance computational-complexity overlap-gap-propertyarXiv posted 2 days ago
0 votes0 replies0 views
The collision-finding hardness conjecture for square-wave perceptrons
Collision-finding hardness conjecture. In the regime where collisions exist and the collision solution space has the OGP, finding collisions with $|q_1|<1$ is infeasible.
Conjectureopencollision-resistance neural-networks overlap-gap-propertyarXiv posted 2 days ago
0 votes0 replies1 view
The replica-symmetric transition conjecture for neural-network collisions
Replica-symmetric transition conjecture. The estimate of this threshold obtained by the replica method with a replica-symmetric Ansatz coincides with the actual SAT/UNSAT transitio…
Conjectureopencollision-resistance neural-networks statistical-physicsarXiv posted 2 days ago

The error-corrected neural-network collision-resistant hash conjecture