Allen–O’Donnell correlation-rounding conjecture
Statement
For every and every random vector , there is a universal constant such that, for every integer , one can condition on a set with so that the remaining conditional correlations satisfy a bound of order ; equivalently, the conditioning complexity required to make the relevant aggregate conditional-covariance quantity at most is rather than the previously known . The conjecture is proved in the cited preprint for signed multivariate totally positive () laws, but remains open in general.
Record
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.