Journal of Complexity

Papers
(The TQCC of Journal of Complexity is 3. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-11-01 to 2024-11-01.)
ArticleCitations
Optimal subsampling for large-scale quantile regression33
Function values are enough for L2-approximation: Part II28
On optimal recovery in L223
Sampling discretization and related problems23
Non-convergence of stochastic gradient descent in the training of deep neural networks22
Robust pairwise learning with Huber loss20
Optimal pointwise sampling for L2 approximation17
A proof of convergence for gradient descent in the training of artificial neural networks for constant target functions14
Bounds on Kolmogorov widths and sampling recovery for classes with small mixed smoothness14
Online gradient descent algorithms for functional data learning13
Deterministic computation of the characteristic polynomial in the time of matrix multiplication12
Tractability of approximation in the weighted Korobov space in the worst-case setting — a complete picture10
Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives9
Lower bounds for the error of quadrature formulas for Hilbert spaces9
Digit-by-digit and component-by-component constructions of lattice rules for periodic functions with unknown smoothness9
Rates of approximation by ReLU shallow neural networks8
How anisotropic mixed smoothness affects the decay of singular numbers for Sobolev embeddings8
Multi-task Learning in vector-valued reproducing kernel Banach spaces with the8
Convergence analysis of an optimally accurate frozen multi-level projected steepest descent iteration for solving inverse problems8
Sampling numbers of smoothness classes via ℓ1-minimization8
Fast computation of generic bivariate resultants7
Expected dispersion of uniformly distributed points7
Randomized Runge–Kutta method — Stability and convergence under inexact information7
On the complexity of extending the convergence ball of Wang’s method for finding a zero of a derivative6
Positive-Definite Functions, Exponential Sums and the Greedy Algorithm: a Curious Phenomenon6
On a unified convergence analysis for Newton-type methods solving generalized equations with the Aubin property6
On the power of standard information for tractability for L2-approximation in the average case setting6
Fast amortized multi-point evaluation6
Functional linear regression with Huber loss6
Kolmogorov widths of intersections of finite-dimensional balls6
Regularization in a functional reproducing kernel Hilbert space5
Homotopy techniques for solving sparse column support determinantal polynomial systems5
Algorithms and complexity for functions on general domains5
Lower bounds for integration and recovery in L25
On the oracle complexity of smooth strongly convex minimization5
On Newton's method for solving generalized equations5
The nonzero gain coefficients of Sobol's sequences are always powers of two4
New bounds on the minimal dispersion4
Randomized complexity of parametric integration and the role of adaption I. Finite dimensional case4
Bypassing the quadrature exactness assumption of hyperinterpolation on the sphere4
A note on EC-tractability of multivariate approximation in weighted Korobov spaces for the standard information class4
Convergence rates of support vector machines regression for functional data4
Instances of computational optimal recovery: Refined approximability models4
Countable tensor products of Hermite spaces and spaces of Gaussian kernels4
Randomized complexity of parametric integration and the role of adaption II. Sobolev spaces3
Optimal prediction for high-dimensional functional quantile regression in reproducing kernel Hilbert spaces3
On a partition with a lower expected L23
Asymptotic analysis in multivariate average case approximation with Gaussian kernels3
Amortized multi-point evaluation of multivariate polynomials3
Nuclear embeddings in general vector-valued sequence spaces with an application to Sobolev embeddings of function spaces on quasi-bounded domains3
The radii of sections of origin-symmetric convex bodies and their applications3
Tractability of L2-approximation and integration in weighted Hermite spaces of finite smoothness3
Improved dispersion bounds for modified Fibonacci lattices3
On the complexity of Putinar–Vasilescu's Positivstellensatz3
Consistency of randomized integration methods3
Minimal dispersion of large volume boxes in the cube3
Spectral flatness and the volume of intersections of p-ellipsoids3
Exponential tractability of linear weighted tensor product problems in the worst-case setting for arbitrary linear functionals3
Star discrepancy subset selection: Problem formulation and efficient approaches for low dimensions3
Convergence of the Gauss-Newton method for convex composite optimization problems under majorant condition on Riemannian manifolds3
Optimal subsampling for least absolute relative error estimators with massive data3
On the fixed volume discrepancy of the Fibonacci sets in the integral norms3
A promenade through correct test sequences I: Degree of constructible sets, Bézout's Inequality and density3
Best and random approximation of a convex body by a polytope3
Numerical weighted integration of functions having mixed smoothness3
0.02591609954834