The shadow tomography problem introduced by [1] is an important problem in quantum computing. Given an unknown n-qubit quantum state \rho, the goal is to estimate \mathrm{t}\mathrm{r}(F_1\rho ),\dots ,\mathrm{t}\mathrm{r}(F_M\rho ) using as least copies of \rho as possible, within an additive error of \epsilon, where F_1,\dots ,F_M are known 2-outcome measurements. In this paper, we consider the shadow tomography problem with a potentially inaccurate prediction \varrho of the true state \rho. This corresponds to practical cases where we possess prior knowledge of the unknown state. For example, in quantum verification or calibration, we may be aware of the quantum state that the quantum device is expected to generate. However, the actual state it generates may have deviations. We introduce an algorithm with sample complexity \tilde{\mathcal{O}}(nmax\{\Vert \rho -\varrho {\Vert }_1,\epsilon \}{\log }^{2}M/{\epsilon }^4). In the generic case, even if the prediction can be arbitrarily bad, our algorithm has the same complexity as the best algorithm without prediction [2]. At the same time, as the prediction quality improves, the sample complexity can be reduced smoothly to \tilde{\mathcal{O}}(n{\log }^{2}M/{\epsilon }^3) when the trace distance between the prediction and the unknown state is \mathrm{\Theta } (\epsilon ). Furthermore, we conduct numerical experiments to validate our theoretical analysis. The experiments are constructed to simulate noisy quantum circuits that reflect possible real scenarios in quantum verification or calibration. Notably, our algorithm outperforms the previous work without prediction in most settings.