2 problems

0 votes0 replies0 views
The random-start LAS algorithm performance conjecture
Let $p=2$ , and let the Large Average Submatrix algorithm, denoted by $\mathcal{LAS}$ , start from a uniformly random $k\times k$ submatrix of an $n\times n$ random matrix. A local o…
Conjecturesolvedprobabilistic-algorithms random-matrices submatrix-detectionarXiv posted 2 days ago
0 votes0 replies0 views
Conjecture on drift negligibility for non-linear algorithms under stochastic rounding
Drift-negligibility conjecture. The drift is negligible when $nu^2=o(1)$ .
Conjectureopenerror-analysis probabilistic-algorithms stochastic-roundingarXiv posted 2 days ago

The random-start LAS algorithm performance conjecture