Showing 2025Show all
2 papers · 1 filter
cs.CC2025
A Pseudorandom Generator for Functions of Low-Degree Polynomial Threshold Functions
Penghui Yao, Mingnan Zhao
Developing explicit pseudorandom generators (PRGs) for prominent categories of Boolean functions is a key focus in computational complexity theory. In this paper, we investigate th…
math.OC2025
On the complexity of proximal gradient and proximal gradient-Newton-CG methods for -regularized Optimization
Hong Zhu
In this paper, we propose two second-order methods for solving the \(\ell_1\)-regularized composite optimization problem, which are developed based on two distinct definitions of a…