Classes of boolean functions where reasonable lower bounds on approximate degree is unknown?
If I understand correctly you are asking about the relationship between the degree necessary for exact representation and the degree necessary for approximate representation.  The seminal paper by Nisan and Szegedy shows that for $\epsilon$ constant these degrees are polynomially related.