Journal of Complexity最新文献

英文中文

Geo-indistinguishable location obfuscation with inference error bounds 具有推理误差界的地理不可区分位置混淆

IF 1.8 2区数学 Q1 MATHEMATICS

Journal of Complexity

Pub Date : 2025-06-11 DOI: 10.1016/j.jco.2025.101970

Shun Zhang , Benfei Duan , Zhili Chen , Hong Zhong

Geo-indistinguishability and expected inference error are two complementary statistical notions for location privacy. The joint guarantee of differential privacy (indistinguishability) and distortion privacy (inference error) limits the information leakage. This paper analyzes the dynamic location obfuscation mechanism called PIVE by Yu, Liu and Pu (NDSS 2017), and shows that PIVE fails to offer either of the privacy guarantees on adaptive Protection Location Sets (PLSs) as claimed. Specifically, we demonstrate that different PLSs could intersect with one another due to the defined search algorithm, and different apriori locations in the same PLS could have different protection diameters which causes the problematic proof of local differential privacy for PIVE. Besides, the condition introduced in PIVE is confirmed to be not sufficient for bounding expected inference errors against Bayesian attacks. To address these issues, we introduce a relaxed definition of geo-indistinguishability, propose a couple of correction approaches, and analyze their satisfied privacy characteristics.

地理不可分辨性和预期推断误差是位置隐私的两个互补的统计概念。差分隐私（不可区分性）和失真隐私（推理错误）的联合保证限制了信息的泄露。本文分析了Yu， Liu和Pu （NDSS 2017）提出的动态位置混淆机制PIVE，并表明PIVE不能像声称的那样对自适应保护位置集（pls）提供任何一种隐私保证。具体来说，我们证明了由于定义的搜索算法，不同的PLS可能会彼此相交，并且同一PLS中的不同先验位置可能具有不同的保护直径，这导致PIVE的局部差分隐私证明存在问题。此外，还证实了PIVE中引入的条件不足以限定针对贝叶斯攻击的预期推理错误。为了解决这些问题，我们引入了一个宽松的地理不可分辨性定义，提出了几种校正方法，并分析了它们满足的隐私特征。

引用次数: 0

A sixth-order bi-parametric iterative method for nonlinear systems: Theory, stability and computational complexity 非线性系统的六阶双参数迭代法：理论、稳定性和计算复杂度

IF 1.8 2区数学 Q1 MATHEMATICS

Journal of Complexity

Pub Date : 2025-06-06 DOI: 10.1016/j.jco.2025.101960

G Thangkhenpau, Sunil Panday

In this paper, we propose a new bi-parametric three-step iterative method with sixth-order convergence for solving systems of nonlinear equations. The method is formulated using the composition technique, which we uniquely apply twice within a single method - an approach that, to our knowledge, is the first of its kind in the literature. This allows us to incorporate two free disposable parameters, offering flexibility with enhanced performance, stability and adaptability. The local convergence behaviour is rigorously analysed within the framework of Banach spaces, where we establish theoretical bounds for the convergence radius and demonstrate uniqueness conditions under Lipschitz-continuous Fréchet derivative assumptions. The theoretical outcomes are supported by numerical experiments. Lastly, we evaluate the method's efficiency by exploring its basins of attraction and applying it to systems of nonlinear equations and boundary value problems.

本文提出了求解非线性方程组的一种新的双参数六阶收敛三步迭代法。该方法是使用合成技术制定的，我们在一种方法中独特地应用了两次——据我们所知，这种方法在文献中是第一次。这允许我们合并两个自由的一次性参数，提供增强性能，稳定性和适应性的灵活性。在Banach空间框架内严格分析了其局部收敛性，建立了收敛半径的理论边界，并证明了在Lipschitz-continuous fr chet导数假设下的唯一性条件。理论结果得到数值实验的支持。最后，我们通过探索其吸引力盆地并将其应用于非线性方程组和边值问题来评估该方法的有效性。

引用次数: 0

On upper and lower bounds for pathwise approximation of scalar SDEs with reflection 带反射的标量SDEs路径逼近的上界和下界

IF 1.8 2区数学 Q1 MATHEMATICS

Journal of Complexity

Pub Date : 2025-05-16 DOI: 10.1016/j.jco.2025.101959

Mario Hefter , André Herzwurm , Klaus Ritter

For scalar SDEs with a one-sided reflection we study pathwise approximation, globally on a compact time interval or at a single time point. We consider algorithms based on sequential evaluations of the driving Brownian motion and establish upper and lower bounds for the minimal errors. Exploiting the relation to a reflected Ornstein-Uhlenbeck process, we also provide a new upper bound for a Cox-Ingersoll-Ross process.

对于具有单侧反射的标量SDEs，我们研究了在紧时间区间上的全局路径逼近和在单个时间点上的全局路径逼近。我们考虑基于驱动布朗运动的顺序评估的算法，并建立最小误差的上界和下界。利用与反射的Ornstein-Uhlenbeck过程的关系，我们还为Cox-Ingersoll-Ross过程提供了一个新的上界。

引用次数: 0

Skewness of a randomized quasi-Monte Carlo estimate 随机拟蒙特卡罗估计的偏度

IF 1.8 2区数学 Q1 MATHEMATICS

Journal of Complexity

Pub Date : 2025-05-05 DOI: 10.1016/j.jco.2025.101956

Zexin Pan, Art B. Owen

Some recent work on confidence intervals for randomized quasi-Monte Carlo (RQMC) sampling found a surprising result: ordinary Student's t 95% confidence intervals based on a modest number of replicates were seen to be very effective and even more reliable than some bootstrap t intervals that were expected to be best. One potential explanation is that those RQMC estimates have small skewness. In this paper we give conditions under which the skewness is

O (n^{ϵ})

for any

ϵ > 0

, so ‘almost

O (1)

’. Under a random generator matrix model, we can improve this rate to

O (n^{- 1 / 2 + ϵ})

with very high probability. We also improve some probabilistic bounds on the distribution of the quality parameter t for a digital net in a prime base under random sampling of generator matrices.

最近一些关于随机准蒙特卡罗（RQMC）抽样置信区间的研究发现了一个令人惊讶的结果：基于少量重复的普通学生的t 95%置信区间被认为是非常有效的，甚至比一些期望最好的bootstrap t区间更可靠。一种可能的解释是，RQMC的估计偏差很小。在本文中，我们给出了任意ϵ>；0的偏度为O（nλ）的条件，因此‘几乎为O(1) ’。在随机生成器矩阵模型下，我们可以以非常高的概率将该速率提高到O（n−1/2+ ε）。我们还改进了一个数字网络在质数基中质量参数t分布的一些概率界。

{"title":"Skewness of a randomized quasi-Monte Carlo estimate","authors":"Zexin Pan, Art B. Owen","doi":"10.1016/j.jco.2025.101956","DOIUrl":"10.1016/j.jco.2025.101956","url":null,"abstract":"<div><div>Some recent work on confidence intervals for randomized quasi-Monte Carlo (RQMC) sampling found a surprising result: ordinary Student's <em>t</em> 95% confidence intervals based on a modest number of replicates were seen to be very effective and even more reliable than some bootstrap <em>t</em> intervals that were expected to be best. One potential explanation is that those RQMC estimates have small skewness. In this paper we give conditions under which the skewness is <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mi>ϵ</mi></mrow></msup><mo>)</mo></math></span> for any <span><math><mi>ϵ</mi><mo>></mo><mn>0</mn></math></span>, so ‘almost <span><math><mi>O</mi><mo>(</mo><mn>1</mn><mo>)</mo></math></span>’. Under a random generator matrix model, we can improve this rate to <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mo>−</mo><mn>1</mn><mo>/</mo><mn>2</mn><mo>+</mo><mi>ϵ</mi></mrow></msup><mo>)</mo></math></span> with very high probability. We also improve some probabilistic bounds on the distribution of the quality parameter <em>t</em> for a digital net in a prime base under random sampling of generator matrices.</div></div>","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":"90 ","pages":"Article 101956"},"PeriodicalIF":1.8,"publicationDate":"2025-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143908058","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

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

IF 1.8 2区数学 Q1 MATHEMATICS

Journal of Complexity

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

Wanting Lu , Heping Wang

We consider multivariate approximation problems in the average case setting with a zero mean Gaussian measure whose covariance kernel is a periodic Gevrey kernel. We investigate various notions of algebraic tractability and exponential tractability, and obtain necessary and sufficient conditions in terms of the parameters of the problem.

研究了具有零均值高斯测度的多元逼近问题，高斯测度的协方差核为周期Gevrey核。我们研究了代数可跟踪性和指数可跟踪性的各种概念，并根据问题的参数得到了问题的充分必要条件。

引用次数: 0

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

IF 1.8 2区数学 Q1 MATHEMATICS

Journal of Complexity

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

E.D. Kosov , V.N. Temlyakov

In the first part of the paper we study absolute error of sampling discretization of the integral

L_{p}

-norm for function classes of continuous functions. We use basic approaches from chaining technique to provide general upper bounds for the error of sampling discretization of the

L_{p}

-norm on a given function class in terms of entropy numbers in the uniform norm of this class. As an example we apply these general results to obtain new error bounds for sampling discretization of the

L_{p}

-norms on classes of multivariate functions with mixed smoothness. In the second part of the paper we apply our general bounds to study the problem of universal sampling discretization.

本文第一部分研究了连续函数类的积分lp范数抽样离散化的绝对误差。我们用链技术的基本方法给出了给定函数类上的lp -范数抽样离散误差的一般上界，即该类一致范数中的熵数。作为一个例子，我们应用这些一般结果得到了混合光滑多变量函数类的lp -范数抽样离散化的新误差界。在论文的第二部分，我们应用我们的一般界来研究普遍抽样离散化问题。

引用次数: 0

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

IF 1.8 2区数学 Q1 MATHEMATICS

Journal of Complexity

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

Josef Dick , Takashi Goda , Kosuke Suzuki

In this paper, we present some new (in-)tractability results related to the integration problem in subspaces of the Wiener algebra over the d-dimensional unit cube. We show that intractability holds for multivariate integration in the standard Wiener algebra in the deterministic setting, in contrast to polynomial tractability in an unweighted subspace of the Wiener algebra recently shown by Goda (2023). Moreover, we prove that multivariate integration in the subspace of the Wiener algebra introduced by Goda is strongly polynomially tractable if we switch to the randomized setting, where we obtain a better ε-exponent than the one implied by the standard Monte Carlo method. We also identify subspaces in which multivariate integration in the deterministic setting are (strongly) polynomially tractable and we compare these results with the bound which can be obtained via Hoeffding's inequality.

在本文中，我们提出了与 d 维单位立方体上的维纳代数子空间中的积分问题有关的一些新（不）可操作性结果。我们证明，在确定性环境中，标准维纳代数中的多元积分问题是难以解决的，这与戈达（2023）最近证明的维纳代数非加权子空间中的多项式可计算性截然不同。此外，我们还证明，如果切换到随机设置，戈达引入的维纳代数子空间中的多变量积分具有很强的多项式可操作性，在随机设置中，我们得到的ε指数比标准蒙特卡罗方法隐含的指数更好。我们还确定了确定性设置中多元积分（强）多项式可控的子空间，并将这些结果与通过霍夫定不等式得到的约束进行了比较。

引用次数: 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区数学 Q1 MATHEMATICS

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区数学 Q1 MATHEMATICS

Journal of Complexity

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

Aafko Boonstra , Charlene Kalle

Let

L = {(L_{d})}_{d \in N}

be any ordered probability sequence, i.e., satisfying

0 < L_{d + 1} \leq L_{d}

for each

d \in N

and

\sum_{d \in N} L_{d} = 1

. We construct sequences

A = {(a_{i})}_{i \in N}

on the countably infinite alphabet

N

in which each possible block of digits

α_{1}, \dots, α_{k} \in N

k \in N

, occurs with frequency

\prod_{d = 1}^{k} L_{α_{d}}

. In other words, we construct L-normal sequences. These sequences can then be projected to normal numbers in various affine number systems, such as real numbers

x \in [0, 1]

that are normal in GLS number systems that correspond to the sequence L or higher dimensional variants. In particular, this construction provides a family of numbers that have a normal Lüroth expansion.

设L=(Ld)d∈N为任意有序概率序列，即对于每个d∈N，∑d∈NLd=1，满足0<；Ld+1≤Ld。我们在可数无限字母N上构造序列A=(ai)i∈N，其中每个可能的数字块α1，…，αk∈N, k∈N，以频率∏d=1k αd出现。换句话说，我们构造l -正规序列。然后可以将这些序列投影到各种仿射数系统中的正规数，例如实数x∈[0,1]，它在对应于序列L或高维变体的GLS数系统中是正规的。特别地，这种构造提供了一组具有正罗斯展开的数。

引用次数: 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区数学 Q1 MATHEMATICS

Journal of Complexity

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

Ariel Neufeld , Tuan Anh Nguyen , Sizhou Wu

Neufeld and Wu (2023) [49] developed a multilevel Picard (MLP) algorithm which can approximately solve general 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) [49] does not suffer from the curse of dimensionality. In this paper, we prove that the MLP algorithm in Neufeld and Wu (2023) [49] indeed can overcome the curse of dimensionality, i.e. that its computational complexity only grows polynomially in the dimension

d \in N

and the reciprocal of the accuracy ε, under some suitable assumptions on the nonlinear part of the corresponding PDE.

Neufeld和Wu（2023）开发了一种多电平Picard （MLP）算法，该算法可以近似求解具有梯度相关非线性的一般半线性抛物型偏微分方程，也允许相应偏微分方程的系数函数为非常数。通过引入Feynman-Kac表示和Bismut-Elworthy-Li公式驱动的特定随机不动点方程（SFPE），并利用PDE的唯一粘度解及其梯度识别SFPE唯一不动点的第一分量和第二分量，证明了算法的收敛性。然而，Neufeld和Wu（2023）提出的MLP模式是否不受维度诅咒的影响仍然是一个悬而未决的问题。在本文中，我们证明了Neufeld和Wu(2023)[49]中的MLP算法确实可以克服维数的诅咒，即在相应PDE的非线性部分的适当假设下，其计算复杂度仅在维数d∈N和精度ε的反比上多项式增长。

{"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

首页上一页

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

Journal of Complexity

全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.

﹀