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 条
  • [1] Near G-optimal Tchakaloff designs
    Len Bos
    Federico Piazzon
    Marco Vianello
    Computational Statistics, 2020, 35 : 803 - 819
  • [2] Near G-optimal Tchakaloff designs
    Bos, Len
    Piazzon, Federico
    Vianello, Marco
    COMPUTATIONAL STATISTICS, 2020, 35 (02) : 803 - 819
  • [3] On some classes of optimal and near-optimal polynomial codes
    Aydin, N
    Ray-Chaudhuri, DK
    FINITE FIELDS AND THEIR APPLICATIONS, 2004, 10 (01) : 24 - 35
  • [4] Near-optimal Nonlinear Regression Trees
    Bertsimas, Dimitris
    Dunn, Jack
    Wang, Yuchen
    OPERATIONS RESEARCH LETTERS, 2021, 49 (02) : 201 - 206
  • [5] Quickly finding near-optimal storage designs
    Anderson, E
    Spence, S
    Swaminathan, R
    Kallahalla, M
    Wang, Q
    ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2005, 23 (04): : 337 - 374
  • [6] Constructions of Batch Codes with Near-Optimal Redundancy
    Vardy, Alexander
    Yaakobi, Eitan
    2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 1197 - 1201
  • [7] Near-optimal depth-constrained codes
    Gupta, P
    Prabhakar, B
    Boyd, S
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (12) : 3294 - 3298
  • [8] Near-optimal peak sidelobe binary codes
    Ferrara, Matthew A.
    2006 IEEE RADAR CONFERENCE, VOLS 1 AND 2, 2006, : 400 - 403
  • [9] Near-Optimal Multi-Version Codes
    Khabbazian, Majid
    2015 53RD ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2015, : 728 - 732
  • [10] Scalable and Near-Optimal ε-Tube Clusterwise Regression
    Chembu, Aravinth
    Sanner, Scott
    Khalil, Elias B.
    INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH, CPAIOR 2023, 2023, 13884 : 254 - 263