Consider the following paragraph from 2 Learning in High Dimensions
in from of the paper titled Geometric Deep Learning Grids, Groups, Graphs, Geodesics, and Gauges
Supervised machine learning, in its simplest formalisation, considers a set of $N$ observations $D = \{(x_i, y_i)\}_{i=1}^{N}$ drawn i.i.d. from an underlying data distribution $P$ defined over $\mathcal{X} \times \mathcal{Y}$, where $\mathcal{X}$ and $\mathcal{Y}$ are respectively the data and the label domains. The defining feature in this setup is that $\mathcal{X}$ is a high-dimensional space: one typically assumes $\mathcal{X} = \mathbb{R}^d$ to be a Euclidean space of large dimension $d$.
Here, it is mentioned that $N$ observations are drawn i.i.d from probability distribution $P$, which is defined over $\mathcal{X} \times \mathcal{Y}$.
My doubt is that how can we draw i.i.d from every probability distribution if our distribution is not an i.i.d distribution. The only $P$ I know to be an i.i.d is the following
$$p(x_i) = \dfrac{1}{|\mathcal{X} \times \mathcal{Y}|} \text{ for } x_i \in \mathcal{X} \times \mathcal{Y} \text{ and } 1 \le i \le |\mathcal{X} \times \mathcal{Y}|$$
To put simply, dataset with all possible $256 \times 256 \times 3$ images is i.i.d but the dataset with all dogs is not an i.i.d.
As per my knowledge, every possible distribution may not be an i.i.d distribution. Then, without knowing anything about the distribution, how can we draw i.i.d?