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-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
Functional linear regression with Huber loss6
Kolmogorov widths of intersections of finite-dimensional balls6
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
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
Best and random approximation of a convex body by a polytope3
Numerical weighted integration of functions having mixed smoothness3
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
Improved bounds on the gain coefficients for digital nets in prime power base2
Online regularized learning algorithm for functional data2
Sharp lower error bounds for strong approximation of SDEs with piecewise Lipschitz continuous drift coefficient2
Lower bounds of cowidths and widths of multiplier operators2
Random-prime–fixed-vector randomised lattice-based algorithm for high-dimensional integration2
On oracle factoring of integers2
On the complexity of a unified convergence analysis for iterative methods2
Bounds for discrepancies in the Hamming space2
Approximating smooth and sparse functions by deep neural networks: Optimal approximation rates and saturation2
Nonasymptotic analysis of robust regression with modified Huber's loss2
The recovery of ridge functions on the hypercube suffers from the curse of dimensionality2
Tractability properties of the discrepancy in Orlicz norms2
Learning rate of distribution regression with dependent samples2
EC-(t1,t2)-tractability of approximation in weighted Korobov spaces in the worst case setting2
On regularized polynomial functional regression2
A quasi-Monte Carlo data compression algorithm for machine learning2
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
Enhancing the applicability of Chebyshev-like method2
A closer look at covering number bounds for Gaussian kernels2
Deep ReLU neural network approximation in Bochner spaces and applications to parametric PDEs2
The rate of convergence for sparse and low-rank quantile trace regression2
Low-energy points on the sphere and the real projective plane2
On a class of linear regression methods2
Tamed-adaptive Euler-Maruyama approximation for SDEs with superlinearly growing and piecewise continuous drift, superlinearly growing and locally Hölder continuous diffusion2
Weaker convergence criteria for Traub's method2
On a central algorithm for calculation of the inverse of the harmonic oscillator in the spaces of orbits2
On the complexity of convergence for high order iterative methods2
A continuous characterization of PSPACE using polynomial ordinary differential equations2
Matrix and tensor rigidity and L-approximation2
Computing Riemann–Roch spaces via Puiseux expansions2
A note on the CBC-DBD construction of lattice rules with general positive weights1
Complexity for a class of elliptic ordinary integro-differential equations1
Approximation in periodic Gevrey spaces1
The BMO-discrepancy suffers from the curse of dimensionality1
A note on Korobov lattice rules for integration of analytic functions1
The VC-dimension of axis-parallel boxes on the Torus1
A generative model for fBm with deep ReLU neural networks1
High-order lifting for polynomial Sylvester matrices1
Selected aspects of tractability analysis1
Nonlinear Tikhonov regularization in Hilbert scales for inverse learning1
A note on concatenation of quasi-Monte Carlo and plain Monte Carlo rules in high dimensions1
Tractability of linear ill-posed problems in Hilbert space1
Adaptive iterative hard thresholding for low-rank matrix recovery and rank-one measurements1
On the strong convergence rate for the Euler–Maruyama scheme of one-dimensional SDEs with irregular diffusion coefficient and local time1
On the information complexity for integration in subspaces of the Wiener algebra1
A note on (s,t1
Sharp estimates for the covering numbers of the Weierstrass fractal kernel1
The area of empty axis-parallel boxes amidst 2-dimensional lattice points1
Central Limit Theorem for (t,s)-sequences in base 21
Homogeneous algorithms and solvable problems on cones1
On the cardinality of lower sets and universal discretization1
On Huber's contaminated model1
On negative dependence properties of Latin hypercube samples and scrambled nets1
A strongly monotonic polygonal Euler scheme1
Estimates of the asymptotic Nikolskii constants for spherical polynomials1
On the expected number of real roots of polynomials and exponential sums1
A simplified iteratively regularized projection method for nonlinear ill-posed problems1
Average case tractability of non-homogeneous tensor product problems with the absolute error criterion1
Estimates for n-widths of sets of smooth functions on complex spheres1
Approximation by quasi-interpolation operators and Smolyak's algorithm1
Worst case tractability of linear problems in the presence of noise: Linear information1
A unified treatment of tractability for approximation problems defined on Hilbert spaces1
The curse of dimensionality for the L-discrepancy with finite p1
Discrepancy bounds for normal numbers generated by necklaces in arbitrary base1
Complexity and tractability for a class of elliptic partial integro-differential equations1
Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations1
A space-time adaptive low-rank method for high-dimensional parabolic partial differential equations1
0.042013883590698