The Inverse Gowers problem is a central problem in additive combinatorics. In this talk we present the finite field variant of this problem and briefly survey the history of this problem. While the original conjecture is essentially solved, quantitative bounds remain elusive. Our main result is that for some special class of functions, good quantitative bounds (almost polynomial) are available. Joint work with Guy Moshkovitz.