Is $k$-CLIQUE W[1]-hard for parameter $n - k$? It is well-known that the problem of deciding if a graph contains a clique of size $k$ is W[1]-hard with respect to parameter $k$.

Is it also known to W[1]-hard (or perhaps FPT) in parameter $n - k$, where $n$ is the number of vertices of the graph?
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.