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 条
  • [21] Near-optimal probabilistic search via submodularity and sparse regression
    Kuo-Shih Tseng
    Bérénice Mettler
    Autonomous Robots, 2017, 41 : 205 - 229
  • [22] Near-optimal probabilistic search via submodularity and sparse regression
    Tseng, Kuo-Shih
    Mettler, Berenice
    AUTONOMOUS ROBOTS, 2017, 41 (01) : 205 - 229
  • [23] Adaptive Hard Thresholding for Near-optimal Consistent Robust Regression
    Suggala, Arun Sai
    Bhatia, Kush
    Ravikumar, Pradeep
    Jain, Prateek
    CONFERENCE ON LEARNING THEORY, VOL 99, 2019, 99
  • [24] On Near-Optimal Codebook and Receiver Designs for MIMO-SCMA Schemes
    Chen, Yen-Ming
    Hsu, Yu-Chen
    Wu, Meng-Chen
    Singh, Rupender
    Chang, Yuan-Chu
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2022, 21 (12) : 10724 - 10738
  • [25] Finding near-optimal Bayesian experimental designs via genetic algorithms
    Hamada, M
    Martz, HF
    Reese, CS
    Wilson, AG
    AMERICAN STATISTICIAN, 2001, 55 (03): : 175 - 181
  • [26] Approximate generalized Steiner systems and near-optimal constant weight codes
    Miao, Liu
    Chong, Shangguan
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2025, 209
  • [27] Near-Optimal Codes for Information Embedding in Gray-Scale Signals
    Zhang, Weiming
    Zhang, Xinpeng
    Wang, Shuozhong
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (03) : 1262 - 1270
  • [28] LDGM Codes-Based Near-Optimal Coding for Adaptive Steganography
    Yao, Qiyi
    Zhang, Weiming
    Chen, Kejiang
    Yu, Nenghai
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2024, 72 (04) : 2138 - 2151
  • [29] Linear-time encodable/decodable codes with near-optimal rate
    Guruswami, V
    Indyk, P
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (10) : 3393 - 3400
  • [30] NEAR-OPTIMAL WEIGHTS IN NONPARAMETRIC REGRESSION UNDER SOME COMMON RESTRICTIONS
    HOLIDAY, DB
    STATISTICS & PROBABILITY LETTERS, 1995, 22 (01) : 33 - 42