CaTchDes: MATLAB codes for Caratheodory-Tchakaloff Near-Optimal Regression Designs

被引:4
|
作者
Bos, Len [1 ]
Vianello, Marco [2 ]
机构
[1] Univ Verona, Dept Comp Sci, Verona, Italy
[2] Univ Padua, Dept Math, Padua, Italy
关键词
Near-Optimal Regression Designs; Tchakaloff theorem; Caratheodory-Tchakaloff measure concentration;
D O I
10.1016/j.softx.2019.100349
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We provide a MATLAB package for the computation of near-optimal sampling sets and weights (designs) for nth degree polynomial regression on discretizations of planar, surface and solid domains. This topic has strong connections with computational statistics and approximation theory. Optimality has two aspects that are here treated together: the cardinality of the sampling set, and the quality of the regressor (its prediction variance in statistical terms, its uniform operator norm in approximation theoretic terms). The regressor quality is measured by a threshold (design G-optimality) and reached by a standard multiplicative algorithm. Low sampling cardinality is then obtained via Caratheodory-Tchakaloff discrete measure concentration. All the steps are carried out using native MATLAB functions, such as the qr factorization and the 1 sqnonneg quadratic minimizer. (C) 2019 The Authors. Published by Elsevier B.V.
引用
收藏
页数:3
相关论文
共 50 条
  • [31] Near-Optimal Designs of Hybrid Massive MIMO Systems from Lattice Decoding
    Lu, Hsiao-feng
    2022 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS, ISITA, 2022, : 129 - 133
  • [32] MicroarrayDesigner: an online search tool and repository for near-optimal microarray experimental designs
    Ahmet Sacan
    Nilgun Ferhatosmanoglu
    Hakan Ferhatosmanoglu
    BMC Bioinformatics, 10
  • [33] MicroarrayDesigner: an online search tool and repository for near-optimal microarray experimental designs
    Sacan, Ahmet
    Ferhatosmanoglu, Nilgun
    Ferhatosmanoglu, Hakan
    BMC BIOINFORMATICS, 2009, 10 : 304
  • [34] OptGS: An R Package for Finding Near-Optimal Group-Sequential Designs
    Wason, James M. S.
    JOURNAL OF STATISTICAL SOFTWARE, 2015, 66 (02):
  • [35] Reduced-complexity algorithms for near-optimal decoding of turbo TCM codes
    Sybis, M.
    Tyczka, P.
    Papaharalabos, S.
    Mathiopoulos, P. T.
    ELECTRONICS LETTERS, 2009, 45 (05) : 278 - 279
  • [36] Arikan Meets Shannon: Polar Codes with Near-Optimal Convergence to Channel Capacity
    Guruswami, Venkatesan
    Riazanov, Andrii
    Ye, Min
    PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20), 2020, : 552 - 564
  • [37] Arikan Meets Shannon: Polar Codes With Near-Optimal Convergence to Channel Capacity
    Guruswami, Venkatesan
    Riazanov, Andrii
    Ye, Min
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (05) : 2877 - 2919
  • [38] Near-Optimal Secret Sharing and Error Correcting Codes in AC0
    Cheng, Kuan
    Ishai, Yuval
    Li, Xin
    THEORY OF CRYPTOGRAPHY, TCC 2017, PT II, 2017, 10678 : 424 - 458
  • [39] Near-Optimal Algorithms for Gaussians with Huber Contamination: Mean Estimation and Linear Regression
    Diakonikolas, Ilias
    Kane, Daniel M.
    Pensia, Ankit
    Pittas, Thanasis
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [40] A Near-Optimal Test of Association that Combines Case-Control and Affected Pedigree Designs
    Wang, Meng
    Stewart, William C. L.
    GENETIC EPIDEMIOLOGY, 2015, 39 (07) : 588 - 588