A basic question in random matrix theory is how likely a matrix is to have a large rank. For many classical models, this probability decays extremely quickly, but the strongest results often rely on the entries being identically distributed. In this talk, I will discuss how to obtain the same exponential scale for matrices with fully independent, non-identically distributed entries under only a uniform anti-concentration assumption and explain the main ideas that make this possible.