Finite-Sample Performance of Gradient Descent in Logistic Regression with Gaussian Design

We consider the parameter estimation problem in logistic regression with Gaussian design: the estimation of a fixed unknown parameter θ^*∈ ℝd (|θ^*|2≥ 1) from n i.i.d. samples (xi,yi)i=1n, where xi~ N(0,Id) and yi|xi ~ rm Bernoulli(1/(1+exp(-xi^top θ^*))). Our main aim is to characterize the finite-sample estimation performance and convergence behavior of gradient descent (GD) on the maximum likelihood objective (i.e., the logistic loss). Under small O(1) stepsize and 0 initialization, we show that GD linearly converges to a small neighborhood of θ^* achieving an ℓ2 error of order O(√|θ^*|25d/n). This substantially goes beyond existing theoretical results that lack non-asymptotic estimation error rate and exhibit much slower parameter convergence. We also establish a faster local linear convergence to the same statistical error under a large Theta(|θ^*|2) stepsize. The main technical component is to show that the gradient of the logistic loss satisfies a certain approximate invertibility condition (AIC). To that end, we uniformly control the deviation of the gradient from its population counterpart by covering and peeling arguments, and then show that the population GD is a contraction by a delicate analysis based on the eigenvalues of population Hessian matrices. Finally, we build upon the recent work Matsumoto and Mazumdar (2025) and devise a novel efficient estimator that attains a sharper rate in high dimensions. This indicates that the existing non-asymptotic guarantees exhibit sub-optimal dependence on |θ^*|2, and that in many regimes Theta(√|θ^*|2d/n) is the tight estimation error rate. Numerical examples are provided to corroborate our theoretical results.