ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Determine whether there exist universal constants C,c>0C,c>0 and a polynomial-time online signing algorithm such that, for every dimension n≥1n\ge 1 and every finite horizon TT, when v1,…,vTv_1,\ldots,v_T are independent samples from N(0,In)\mathcal{N}(0,I_n), the algorithm chooses each xt∈{±1}x_t\in\{\pm1\} upon seeing vtv_t and satisfies P ⁣(∥∑t=1Txtvt∥∞≤Cn)≥1−exp⁡(−cn)\mathbb{P}\!\left(\left\|\sum_{t=1}^{T}x_t v_t\right\|_\infty\le C\sqrt{n}\right)\ge 1-\exp(-c\sqrt{n}). The algorithm should operate online and its guarantee should be independent of TT.

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.