  A Cayley diagram is an edge labelling of a Cayley graph $G=(\Gamma, E)$ by
elements of the generating set $E$ so that the cycles correspond exactly to
paths labelled by relations in $\Gamma$. We show that if $G$ admits an
$\operatorname{Aut}(G)$-f.i.i.d. Cayley diagram, then any $\Gamma$-f.i.i.d.
solution to a local labelling problem lifts to an
$\operatorname{Aut}(G)$-f.i.i.d. solution, and that approximate solutions lift
similarly given an approximate Cayley diagram. We also establish a number of
results on which graphs admit such a Cayley diagram. We show that regular trees
and Cayley graphs of amenable groups always admit
$\operatorname{Aut}(G)$-f.i.i.d. approximate Cayley diagrams, and that
torsion-free nilpotent groups never admit nontrivial
$\operatorname{Aut}(G)$-f.i.i.d. Cayley diagrams. Finally, we construct a
Cayley graph with a $\Gamma$-f.i.i.d. 3-colorings that does not lift to even an
approximate $\operatorname{Aut}(G)$-f.i.i.d. 3-coloring. Our construction also
answers a question of Weilacher.
