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-03-01 to 2024-03-01.)
ArticleCitations
Optimal subsampling for large-scale quantile regression28
Function values are enough for L2-approximation: Part II22
Non-convergence of stochastic gradient descent in the training of deep neural networks19
Sampling discretization and related problems19
On optimal recovery in L218
Lower error bounds for the stochastic gradient descent optimization algorithm: Sharp convergence rates for slowly and fast decaying learning rates17
Robust pairwise learning with Huber loss15
On the worst-case error of least squares algorithms for L15
Bounds on Kolmogorov widths and sampling recovery for classes with small mixed smoothness13
Optimal pointwise sampling for L2 approximation12
The Diamond ensemble: A constructive set of spherical points with small logarithmic energy11
A proof of convergence for gradient descent in the training of artificial neural networks for constant target functions10
Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives8
Digit-by-digit and component-by-component constructions of lattice rules for periodic functions with unknown smoothness8
How anisotropic mixed smoothness affects the decay of singular numbers for Sobolev embeddings8
Lower bounds for the error of quadrature formulas for Hilbert spaces8
Directed evaluation7
Randomized Runge–Kutta method — Stability and convergence under inexact information7
Computing syzygies in finite dimension using fast linear algebra7
Multi-task Learning in vector-valued reproducing kernel Banach spaces with the 7
Deterministic computation of the characteristic polynomial in the time of matrix multiplication6
Online gradient descent algorithms for functional data learning6
Convergence analysis of an optimally accurate frozen multi-level projected steepest descent iteration for solving inverse problems6
Tractability of approximation in the weighted Korobov space in the worst-case setting — a complete picture6
Positive-Definite Functions, Exponential Sums and the Greedy Algorithm: a Curious Phenomenon5
Kolmogorov widths of intersections of finite-dimensional balls5
Fast amortized multi-point evaluation5
On the power of standard information for tractability for L2-approximation in the average case setting5
Regularization in a functional reproducing kernel Hilbert space4
Algorithms and complexity for functions on general domains4
Lower bounds for integration and recovery in L24
Expected dispersion of uniformly distributed points4
On the complexity of extending the convergence ball of Wang’s method for finding a zero of a derivative4
Complexity of approximating Hölder classes from information with varying Gaussian noise4
On the oracle complexity of smooth strongly convex minimization4
Homotopy techniques for solving sparse column support determinantal polynomial systems4
Fast computation of generic bivariate resultants4
On the fixed volume discrepancy of the Fibonacci sets in the integral norms3
Instances of computational optimal recovery: Refined approximability models3
The radii of sections of origin-symmetric convex bodies and their applications3
Countable tensor products of Hermite spaces and spaces of Gaussian kernels3
Sampling numbers of smoothness classes via ℓ1-minimization3
Iterative hard thresholding for compressed data separation3
Information based complexity for high dimensional sparse functions3
Improved dispersion bounds for modified Fibonacci lattices3
On a partition with a lower expected L23
Asymptotic analysis in multivariate average case approximation with Gaussian kernels3
On the power of standard information for 3
Exponential tractability of linear weighted tensor product problems in the worst-case setting for arbitrary linear functionals3
A note on EC-tractability of multivariate approximation in weighted Korobov spaces for the standard information class3
Exponential convergence of adaptive quarklet approximation3
0.021130084991455