You can train classifiers on dependent, non-i.i.d. data and still get theoretical guarantees on generalization error if the data has a regenerative structure (cycles), making learning theory applicable to realistic scenarios like time series.
This paper develops statistical inequalities for learning from non-independent data that follows a regenerative process (data organized into cycles).