Journal of Complexity

Papers
(The median citation count of Journal of Complexity is 1. 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
Sampling discretization and related problems19
Non-convergence of stochastic gradient descent in the training of deep neural networks19
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
On the worst-case error of least squares algorithms for L15
Robust pairwise learning with Huber loss15
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
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
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
Exponential convergence of adaptive quarklet approximation3
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
Consistency of randomized integration methods2
A promenade through correct test sequences I: Degree of constructible sets, Bézout's Inequality and density2
Bypassing the quadrature exactness assumption of hyperinterpolation on the sphere2
Lower bounds of cowidths and widths of multiplier operators2
Gauss–Newton methods with approximate projections for solving constrained nonlinear least squares problems2
On a central algorithm for calculation of the inverse of the harmonic oscillator in the spaces of orbits2
Bounds for discrepancies in the Hamming space2
The recovery of ridge functions on the hypercube suffers from the curse of dimensionality2
Best and random approximation of a convex body by a polytope2
Nuclear embeddings in general vector-valued sequence spaces with an application to Sobolev embeddings of function spaces on quasi-bounded domains2
New bounds on the minimal dispersion2
Tractability of L2-approximation and integration in weighted Hermite spaces of finite smoothness2
Convergence rates of support vector machines regression for functional data2
Optimal subsampling for least absolute relative error estimators with massive data2
On the complexity of Putinar–Vasilescu's Positivstellensatz2
On Newton's method for solving generalized equations2
Low-energy points on the sphere and the real projective plane2
Tractability properties of the discrepancy in Orlicz norms2
Rates of approximation by ReLU shallow neural networks2
Optimal prediction for high-dimensional functional quantile regression in reproducing kernel Hilbert spaces2
Tractability for Volterra problems of the second kind with convolution kernels2
Lower bounds for artificial neural network approximations: A proof that shallow neural networks fail to overcome the curse of dimensionality2
The nonzero gain coefficients of Sobol's sequences are always powers of two2
Functional linear regression with Huber loss1
Sharp estimates for the covering numbers of the Weierstrass fractal kernel1
Quasi-Monte Carlo and ε-truncation dimension in ANOVA spaces1
Amortized multi-point evaluation of multivariate polynomials1
The VC-dimension of axis-parallel boxes on the Torus1
Minimal dispersion of large volume boxes in the cube1
Approximation by quasi-interpolation operators and Smolyak's algorithm1
Numerical weighted integration of functions having mixed smoothness1
On the complexity of a unified convergence analysis for iterative methods1
Estimates of the asymptotic Nikolskii constants for spherical polynomials1
Approximating smooth and sparse functions by deep neural networks: Optimal approximation rates and saturation1
Star discrepancy subset selection: Problem formulation and efficient approaches for low dimensions1
On the complexity of convergence for high order iterative methods1
Estimates for n-widths of sets of smooth functions on complex spheres1
The BMO-discrepancy suffers from the curse of dimensionality1
On oracle factoring of integers1
Nonasymptotic analysis of robust regression with modified Huber's loss1
Improved bounds on the gain coefficients for digital nets in prime power base1
Complexity and tractability for a class of elliptic partial integro-differential equations1
Weaker convergence criteria for Traub's method1
EC-(t1,t2)-tractability of approximation in weighted Korobov spaces in the worst case setting1
Convergence of the Gauss-Newton method for convex composite optimization problems under majorant condition on Riemannian manifolds1
Spectral flatness and the volume of intersections of p-ellipsoids1
Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations1
A note on the CBC-DBD construction of lattice rules with general positive weights1
On negative dependence properties of Latin hypercube samples and scrambled nets1
A note on isotropic discrepancy and spectral test of lattice point sets1
Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus1
A simplified iteratively regularized projection method for nonlinear ill-posed problems1
A note on (s,t1
Computing Riemann–Roch spaces via Puiseux expansions1
A note on concatenation of quasi-Monte Carlo and plain Monte Carlo rules in high dimensions1
Learning rate of distribution regression with dependent samples1
A quasi-Monte Carlo data compression algorithm for machine learning1
A note on the complexity of a phaseless polynomial interpolation1
A closer look at covering number bounds for Gaussian kernels1
On the expected number of real roots of polynomials and exponential sums1
On the cardinality of lower sets and universal discretization1
Approximation in periodic Gevrey spaces1
A continuous characterization of PSPACE using polynomial ordinary differential equations1
A note on Korobov lattice rules for integration of analytic functions1
0.35991501808167