We study an approximate version of q-query LDCs (Locally Decodable Codes) over the real numbers and prove lower bounds on the encoding length of such codes. A q-query () -approximate LDC is a set V of n points in Rd so that, for each i[d] there are (n) disjoint q-tuples (u1uq) in V so that span(u1uq) contains a unit vector whose i'th coordinate is at least . We prove exponential lower bounds of the form n2(d) for the case q=2 and, in some cases, stronger bounds (exponential in d).