This work presents an overview of several nonlinear reduction strategies for data compression from various research fields, and a comparison of their performance when applied to problems characterized by diffusion and/or advection terms. We aim to create a common framework between the methods by unifying the notation referring to a common two-stage pipeline. At the same time, we underline their main differences and objectives by highlighting the diverse choices made for each stage. We test the considered approaches on three test cases belonging to the family of Advection-Diffusion problems, also focusing on the pure Advection and pure Diffusion benchmarks, studying their reducibility while varying the latent dimension. Finally, we interpret the numerical results under the lens of the discussed theoretical considerations, offering a comprehensive landscape for nonlinear reduction methods for general Advection-Diffusion dynamics.