Is $k$-CLIQUE W[1]-hard for parameter $n - k$?
I believe this is FPT.

FInding a $(n - k)$-clique is equivalent to finding an independent set of size $n - k$ on the complement.  This is equivalent to finding a vertex cover of size $k$.  And the latter is FPT.