$\S \ 1.$ Is it better to guess if the only objective is to score at least some fixed grade?
This would be relevant when someone just wanted to pass, or only cared about getting eg. over $95 \%$.
Suppose you have answered $C$ of the $90$ questions correctly, so $R=90-C$ questions remain. Of these you guess $G$ questions, $0\leq G \leq R$. We first find the minimum number of correct guesses to reach a target grade $t^*$. If you have already reached this target grade, $4C\geq t^*$. Denote $G_{\pm}$ the number of correct (+) and incorrect (-) guesses, thus $G=G_++G_-$.
Current grade (without guessing) is $4C$ so you need $(t^*-4C)>0$ more points.
Points from guessing: $4G_+-G_-=4G_+-(G-G_+)=5G_+-G$.
Equating these
$$
5G_+-G\stackrel{!}{=}t^*-4C
$$
Solve for $G_+$ (remember that $G$, $C$ and $t^*$ are known quantities)
$$
G_+=\frac{1}{5}\left(t^*+G-4C \right)
$$
Where it is understood that we round up in the case of non-integer $G_+$.
The probability $\mathcal{P}_k$ of getting exactly $k$ guesses correct out of $G$ total guesses when each guess has a $1/4$ probability of being correct is given by the binomial distribution
$$
\mathcal{P}_k=\left( \matrix{G \\ k}\right) \left(\frac{1}{4}\right)^k \left(\frac{3}{4}\right)^{G-k}
$$
The probability $\mathcal{P}$ of getting at least a grade of $t^*$ is the probability of getting at least $G_+$ successes in $G$ trials
$$
\mathcal{P}=1-\sum\limits_{k=0}^{G_+ -1} \left( \matrix{G \\ k}\right) \left(\frac{1}{4}\right)^k \left(\frac{3}{4}\right)^{G-k}
$$
We are interested in $\mathcal{P}$ as a function of $G$, the number of guessed questions. Surprisingly, $\mathcal{P}$ is not a monotone function of $G$! Here are some plots of $\mathcal{P}$ vs $G$ with $C=70$:

If $4C\geq t^*$ (left plot) it is optimal to guess at most $4C-t^*$ questions, as even if all these guesses are incorrect you still make the target grade with probability $\mathcal{P}=1$.
If $4C< t^*$, the optimal number of guesses that maximizes $\mathcal{P}$ is close to but not necessarily equal to $R$. Notice in the $t^*=316$ plot it is best to leave exactly one question blank. By playing with the graphs, it appears that it is always optimal to leave between zero and three questions blank, and guess the rest. I conjecture that the optimal value depends upon $t^* \mod 5$ and $R \mod 5$, as $\mathcal{P}$ has cycles of length five in both these quantities.
Generalization: let us write a general form for $\mathcal{P}$. Let there be $N$ questions total (previously we had $N=90$), each with $n$ options (one of which is correct). Correct answers get $g_+$ points and incorrect answers get $g_-$ points. The probability that a random guess is correct is $1/n$, and the probability it is incorrect is $(1-1/n)$. Repeating the calculation gives
$$
G_+=\frac{t^*-Cg_+-Gg_-}{g_+-g_-} \\
\mathcal{P}=1-\sum\limits_{k=0}^{G_+ -1} \left( \matrix{G \\ k}\right) \left(\frac{1}{n}\right)^k \left(1-\frac{1}{n}\right)^{G-k}
$$
$\S \ 2.$ Guessing when trying to maximize the total grade
The expectation value of marks $\bar{g}_1$ from guessing one question is (using all the notation as in $\S \ 1.$)
$$
\bar{g}_1=\frac{1}{n}g_+ + \left(1-\frac{1}{n}\right)g_-
$$
In the case of your example, $n=4$, $g_+=4$, and $g_-=-1$ yielding$^\dagger$
$$
\bar{g}_1=+\frac{1}{4}
$$
Each guess is an independent random variable, and the expectation value of guessing $G$ questions is thus $\bar{g}_G=\frac{G}{4}$. If maximizing this expectation value is the objective, then you should always guess rather than leave any question blank (which has an expectation value of zero).
$\dagger$ It is possible there is a minimum overall grade of zero (rather than $-90$), in which case: the expectation value of guessing more questions than those already answered is a little higher than this.
$\S \ 3.$ Variance
Guessing introduces variance. The variance $\sigma_1^2$ associated with one guess is
$$
\sigma_1^2 = \bar{g_1^2}-\bar{g_1}^2 \\
\sigma_1^2 = \frac{1}{n}g_+^2 + \left(1-\frac{1}{n}\right)g_-^2-\left(\frac{1}{n}g_+ + \left(1-\frac{1}{n}\right)g_- \right)^2
$$
After some algebra
$$
\sigma_1^2 =\frac{n-1}{n^2}(g_+ - g_-)^2
$$
For your example $\sigma_1^2 \approx 4.7$. The variance of grade for guessing $G$ questions is
$$
\sigma_G^2 =G \frac{n-1}{n^2}(g_+ - g_-)^2
$$
Notice that both the expectation value and variance increase with $G$, the number of guessed questions. If you wanted to take this further, you could associate the 'risk' associated with guessing questions with the variance.