This question arises as a variation of this question, which was helpfully answered in the negative. It turns out that for my application, a substantially weaker conjecture suffices, which fails to be counterexampled by the answers given in the previous question.
Define $$A^\gamma(K,\delta) := \sup \left\{c_0 : \exists (c_j)_{j=1}^\infty, |c_j| \leq K\,, \lambda\bigg(\Big\{ x \in (0,1/2) : \Big|\textstyle\sum_{j=0}^\infty c_j x^j\Big| > \delta \Big\}\bigg) \leq \gamma\right\},$$ where by $\lambda(S)$ for a set $S \subseteq \mathbb{R}$ we mean the Lebesgue measure of $S$.
Question.
Does there exists $\gamma>0,K>1$ such that $$\limsup_n A^\gamma(K^n,e^{-n}) =0?$$
Relation to Previous Question.
Iosif Pinelis' answer to the above linked question shows that for all $K>1$ there exists some $\gamma<1/2$ such that $$\limsup_n A^\gamma(K^n,e^{-n}) \geq 1.$$ One can verify that the $\gamma$ given by his example goes rapidly to $1/2$ as $K \downarrow 1$. It seems that by taking $\gamma$ small, we should be able to avoid examples such as Iosif Pinelis'.
Thoughts on Possible Paths to a Proof.
First, let's note that $A^\gamma$ is $1$-homogeneous, so that $A^\gamma(CK,C\delta) = C A^\gamma(K,\delta)$. Thus we can rewrite $$A^\gamma(K^n,e^{-n}) = K^n A^\gamma(1, (Ke)^{-n}).$$ Thus it suffices to show that $$A^\gamma(1,\delta) \leq C\delta^{1/N}$$ for some $N$ and $\delta$ small enough, since then, taking $1 < K \leq e^{1/N}$ $$A^\gamma(K^n,e^{-n}) = K^n A^\gamma(1, (Ke)^{-n}) \leq CK^n (Ke)^{-n/N} \leq CK^{-n/N} \to 0.$$
There is a fairly straightforward proof that, for any $\gamma$, $A^\gamma(1,\delta) \to 0$ as $\delta \downarrow 0$, e.g. using weak-* compactness of the unit ball in $\ell^\infty$ applied to the $c_j$ sequences. The proof is entirely non-quantitative, so the above remark reduces the question to giving a good rate for this convergence.
One thought on how one could try to show some quantitative control of $A^\gamma(1,\delta)$ as $\delta \to 0$ is by some sort of interpolation inequality. For any $\gamma, \delta$, we have the $\sup$ almost realized by some function $f_{\gamma,\delta}(x) = \sum_j c_j x^j$, where $$f(0) \geq \frac{1}{2}A^\gamma(1,\delta);\ \ |c_j| \leq 1;\ \ \lambda(\{x : |f(x)| > \delta\})\leq \gamma.$$ Note that the control on the $c_j$ allow us control infinite derivative order norms, in particular we can control $W^{k,\infty}$ norms for every $k$. The fact the $f_{\delta,\gamma}$ is small on a large set allows us to show that "norms" like $\log L$ are small. $$\|f_{\delta,\gamma}\|_{\log L} = \exp\left(\int_0^{1/2} \log |f_{\delta,\gamma}|\right) \leq \exp\left(\gamma\log 2 + (1/2-\gamma) \log \delta\right) \leq 2^\gamma \delta^{1/2-\gamma}.$$ One can similarly show that $L^\epsilon$ "norms" are small for $0<\epsilon <1$.
Thus if we can get an interpolation inequality controlling $L^\infty$, say between an appropriately defined $W^{\infty,\infty}$ norm and a $\log L$ "norm", we'd get the desired bound. Note this looks something like a Gagliardo-Nirenberg interpolation.