On lower bounds for integration of multivariate permutation-invariant functions

被引:5
|
作者
Weimar, Markus [1 ]
机构
[1] Univ Marburg, Fac Math & Comp Sci, D-35032 Marburg, Germany
关键词
Permutation-invariance; Integration; Information complexity; Tractability; Lower bounds;
D O I
10.1016/j.jco.2013.10.003
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this note we study multivariate integration for permutationinvariant functions from a certain Banach space Ed,a of Korobov type in the worst case setting. We present a lower error bound which particularly implies that in dimension d every cubature rule which reduces the initial error necessarily uses at least d + 1 function values. Since this holds independently of the number of permutation-invariant coordinates, this shows that the integration problem can never be strongly polynomially tractable in this setting. Our assertions generalize results due to Sloan and Woiniakowski (1997) [3]. Moreover, for large smoothness parameters a our bound cannot be improved. Finally, we extend our results to the case of permutation-invariant functions from Korobov-type spaces equipped with product weights. (C) 2013 Published by Elsevier Inc.
引用
收藏
页码:87 / 97
页数:11
相关论文
共 50 条
  • [1] Rank-1 lattice rules for multivariate integration in spaces of permutation-invariant functions Error bounds and tractability
    Nuyens, Dirk
    Suryanarayana, Gowri
    Weimar, Markus
    ADVANCES IN COMPUTATIONAL MATHEMATICS, 2016, 42 (01) : 55 - 84
  • [2] Construction of Quasi-Monte Carlo Rules for Multivariate Integration in Spaces of Permutation-Invariant Functions
    Dirk Nuyens
    Gowri Suryanarayana
    Markus Weimar
    Constructive Approximation, 2017, 45 : 311 - 344
  • [3] Construction of Quasi-Monte Carlo Rules for Multivariate Integration in Spaces of Permutation-Invariant Functions
    Nuyens, Dirk
    Suryanarayana, Gowri
    Weimar, Markus
    CONSTRUCTIVE APPROXIMATION, 2017, 45 (02) : 311 - 344
  • [4] Rank-1 lattice rules for multivariate integration in spaces of permutation-invariant functionsError bounds and tractability
    Dirk Nuyens
    Gowri Suryanarayana
    Markus Weimar
    Advances in Computational Mathematics, 2016, 42 : 55 - 84
  • [5] Universal Representation of Permutation-Invariant Functions on Vectors and Tensors
    Tabaghi, Puoya
    Wang, Yusu
    INTERNATIONAL CONFERENCE ON ALGORITHMIC LEARNING THEORY, VOL 237, 2024, 237
  • [6] Risk Bounds for Learning Multiple Components with Permutation-Invariant Losses
    Lauer, Fabien
    INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 108, 2020, 108 : 1178 - 1186
  • [7] Quantum and Classical Communication Complexity of Permutation-Invariant Functions
    Guan, Ziyi
    Huang, Yunqi
    Yao, Penghui
    Ye, Zekun
    41ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, STACS 2024, 2024, 289
  • [8] Permutation-invariant quantum codes
    Ouyang, Yingkai
    PHYSICAL REVIEW A, 2014, 90 (06):
  • [9] Permutation-invariant linear classifiers
    Lausser, Ludwig
    Szekely, Robin
    Kestler, Hans A.
    MACHINE LEARNING, 2024, 113 (10) : 7195 - 7221
  • [10] Agnostic Learning in Permutation-Invariant Domains
    Wimmer, Karl
    ACM TRANSACTIONS ON ALGORITHMS, 2016, 12 (04)