In least squares, assuming homoskedacity, the algorithm will try to reduce the sum square error where the data points are densest. This can be a problem, if you need to ensure accuracy in a region with a relatively sparse point density and you are unsure of the correct functional form of the fit (i.e. lack of fit might be an issue). One simple solution would be to weight the fit to emphasize the region of greatest interest, but that messes up the homoskedacity assumption. If you used weights, how do you estimate the errors? We need to estimate a value based on a non-linear fit to 5 variables. Of these 5, one, x, is by far the most dominant. Unfortunately, the density of data points goes approximately as x and for practical reasons, we need the most accuracy as x goes to zero.