The Quasi-Quadratic Gradient is proposed as a new search direction that multiplies the BFGS inverse-Hessian approximation by the gradient to accelerate convergence over standard BFGS.
Privacy-Preserving Logistic Regression Training with A Faster Gradient Variant
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Training logistic regression over encrypted data has emerged as a prominent approach to addressing security concerns in recent years. In this paper, we introduce an efficient gradient variant, termed the \textit{quadratic gradient}, which is specifically designed for privacy-preserving logistic regression while remaining equally effective in plaintext optimization. By incorporating this quadratic gradient, we enhance Nesterov's Accelerated Gradient (NAG), Adaptive Gradient (AdaGrad), and Adam algorithms. We evaluate these enhanced algorithms across various datasets, with experimental results demonstrating state-of-the-art convergence rates that significantly outperform traditional first-order gradient methods. Furthermore, we apply the enhanced NAG method to implement homomorphic logistic regression training, achieving comparable performance within only four iterations. The proposed quadratic-gradient approach offers a unified framework that synergizes the advantages of first-order gradient methods and second-order Newton-type methods, suggesting broad applicability to diverse numerical optimization tasks.
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Quasi-Quadratic Gradient: A New Direction for Accelerating the BFGS Method in Quasi-Newton Optimization
The Quasi-Quadratic Gradient is proposed as a new search direction that multiplies the BFGS inverse-Hessian approximation by the gradient to accelerate convergence over standard BFGS.