We study the exploration problem with approximate linear action-value functions in episodic reinforcement learning under the notion of low inherent Bellman error, a condition normally employed to show convergence of approximate value iteration. We relate this condition to other common frameworks and show that it is strictly more general than the low rank (or linear) MDP assumption of prior work. We provide an algorithm with a rate optimal regret bound for this setting. While computational tracta…