Journal of Complexity最新文献_第2页

Bounds for the sampling discretization error and their applications to the universal sampling discretization 抽样离散误差的界限及其在通用抽样离散中的应用

IF 1.8 2区数学

Journal of Complexity Pub Date : 2025-05-05 DOI: 10.1016/j.jco.2025.101958

E.D. Kosov , V.N. Temlyakov

引用次数: 0

Average case tractability of multivariate approximation with Gevrey type kernels Gevrey型核多元逼近的平均情况可跟踪性

IF 1.8 2区数学

Journal of Complexity Pub Date : 2025-05-05 DOI: 10.1016/j.jco.2025.101957

Wanting Lu , Heping Wang

引用次数: 0

Tractability results for integration in subspaces of the Wiener algebra 维纳代数子空间积分的可溯性结果

IF 1.8 2区数学

Journal of Complexity Pub Date : 2025-04-16 DOI: 10.1016/j.jco.2025.101948

Josef Dick , Takashi Goda , Kosuke Suzuki

引用次数: 0

Takashi Goda is the winner of the 2025 Joseph F. Traub Prize for Achievement in Information-Based Complexity 后田隆史是 2025 年约瑟夫-特劳布信息复杂性成就奖（Joseph F. Traub Prize for Achievement in Information-Based Complexity）的获得者。

IF 1.8 2区数学

Journal of Complexity Pub Date : 2025-04-10 DOI: 10.1016/j.jco.2025.101947

Erich Novak

引用次数: 0

Constructions of normal numbers with infinite digit sets 具有无限位集的正常数的构造

IF 1.8 2区数学

Journal of Complexity Pub Date : 2025-04-04 DOI: 10.1016/j.jco.2025.101945

Aafko Boonstra , Charlene Kalle

引用次数: 0

Multilevel Picard approximations overcome the curse of dimensionality in the numerical approximation of general semilinear PDEs with gradient-dependent nonlinearities 多阶皮卡德近似克服了一般非线性梯度半线性偏微分方程数值逼近的维数问题

IF 1.8 2区数学

Journal of Complexity Pub Date : 2025-04-04 DOI: 10.1016/j.jco.2025.101946

Ariel Neufeld , Tuan Anh Nguyen , Sizhou Wu

{"title":"Multilevel Picard approximations overcome the curse of dimensionality in the numerical approximation of general semilinear PDEs with gradient-dependent nonlinearities","authors":"Ariel Neufeld , Tuan Anh Nguyen , Sizhou Wu","doi":"10.1016/j.jco.2025.101946","DOIUrl":"10.1016/j.jco.2025.101946","url":null,"abstract":"<div><div>Neufeld and Wu (2023) <span><span>[49]</span></span> developed a multilevel Picard (MLP) algorithm which can approximately solve <em>general</em> semilinear parabolic PDEs with gradient-dependent nonlinearities, allowing also for coefficient functions of the corresponding PDE to be non-constant. By introducing a particular stochastic fixed-point equation (SFPE) motivated by the Feynman-Kac representation and the Bismut-Elworthy-Li formula and identifying the first and second component of the unique fixed-point of the SFPE with the unique viscosity solution of the PDE and its gradient, they proved convergence of their algorithm. However, it remained an open question whether the proposed MLP schema in Neufeld and Wu (2023) <span><span>[49]</span></span> does not suffer from the curse of dimensionality. In this paper, we prove that the MLP algorithm in Neufeld and Wu (2023) <span><span>[49]</span></span> indeed can overcome the curse of dimensionality, i.e. that its computational complexity only grows polynomially in the dimension <span><math><mi>d</mi><mo>∈</mo><mi>N</mi></math></span> and the reciprocal of the accuracy <em>ε</em>, under some suitable assumptions on the nonlinear part of the corresponding PDE.</div></div>","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":"90 ","pages":"Article 101946"},"PeriodicalIF":1.8,"publicationDate":"2025-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144070001","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Nonparametric conditional U-statistics on Lie groups with measurement errors 具有测量误差的李群的非参数条件u统计量

IF 1.8 2区数学

Journal of Complexity Pub Date : 2025-03-31 DOI: 10.1016/j.jco.2025.101944

Salim Bouzebda, Nourelhouda Taachouche

{"title":"Nonparametric conditional U-statistics on Lie groups with measurement errors","authors":"Salim Bouzebda, Nourelhouda Taachouche","doi":"10.1016/j.jco.2025.101944","DOIUrl":"10.1016/j.jco.2025.101944","url":null,"abstract":"<div><div>This study presents a comprehensive framework for conditional <em>U</em>-statistics of a general order in the context of Lie group-valued predictors affected by measurement errors. Such situations arise in a variety of modern statistical problems. Our approach is grounded in an abstract harmonic analysis on Lie groups, a setting relatively underexplored in statistical research. In a unified study, we introduce an innovative deconvolution method for conditional <em>U</em>-statistics and investigate its convergence rate and asymptotic distribution for the first time. Furthermore, we explore the application of conditional <em>U</em>-statistics to variables that combine, in a nontrivial way, Euclidean and non-Euclidean elements subject to measurement errors, an area largely uncharted in statistical research. We derive general asymptotic properties, including convergence rates across various modes and the asymptotic distribution. All results are established under fairly general conditions on the underlying models. Additionally, our results are used to derive the asymptotic confidence intervals derived from the asymptotic distribution of the estimator. We also discuss applications of the general approximation results and give new insights into the Kendall rank correlation coefficient and discrimination problems.</div></div>","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":"89 ","pages":"Article 101944"},"PeriodicalIF":1.8,"publicationDate":"2025-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143768448","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Integrability of weak mixed first-order derivatives and convergence rates of scrambled digital nets 弱混合一阶导数的可积性与乱置数字网络的收敛速度

IF 1.8 2区数学

Journal of Complexity Pub Date : 2025-03-04 DOI: 10.1016/j.jco.2025.101935

Yang Liu

引用次数: 0

Weighted mesh algorithms for general Markov decision processes: Convergence and tractability 一般马尔可夫决策过程的加权网格算法：收敛性和可追溯性

IF 1.8 2区数学

Journal of Complexity Pub Date : 2025-02-26 DOI: 10.1016/j.jco.2025.101932

Denis Belomestny , John Schoenmakers , Veronika Zorina

{"title":"Weighted mesh algorithms for general Markov decision processes: Convergence and tractability","authors":"Denis Belomestny , John Schoenmakers , Veronika Zorina","doi":"10.1016/j.jco.2025.101932","DOIUrl":"10.1016/j.jco.2025.101932","url":null,"abstract":"<div><div>We introduce a mesh-type approach for tackling discrete-time, finite-horizon Markov Decision Processes (MDPs) characterized by state and action spaces that are general, encompassing both finite and infinite (yet suitably regular) subsets of Euclidean space. In particular, for bounded state and action spaces, our algorithm achieves a computational complexity that is tractable in the sense of Novak & Woźniakowski <span><span>[12]</span></span>, and is polynomial in the time horizon. For an unbounded state space the algorithm is “semi-tractable” in the sense that the complexity is proportional to <span><math><msup><mrow><mi>ε</mi></mrow><mrow><mo>−</mo><mi>c</mi></mrow></msup></math></span> with some dimension independent <span><math><mi>c</mi><mo>≥</mo><mn>2</mn></math></span>, to achieve precision <em>ε</em>, and polynomial in the time horizon with linear degree in the underlying dimension. As such, the proposed approach has some flavor of the randomization method by Rust <span><span>[14]</span></span> which uses uniform sampling in compact state space. However, the present approach is essentially different due to the inhomogeneous finite horizon setting, which involves general transition distributions over a possibly non-compact state space. To demonstrate the effectiveness of our algorithm, we provide illustrations based on Linear-Quadratic Gaussian (LQG) control problems.</div></div>","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":"88 ","pages":"Article 101932"},"PeriodicalIF":1.8,"publicationDate":"2025-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143520997","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Factoring sparse polynomials fast 快速分解稀疏多项式

IF 1.8 2区数学

Journal of Complexity Pub Date : 2025-02-25 DOI: 10.1016/j.jco.2025.101934

Alexander Demin , Joris van der Hoeven

引用次数: 0