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 条
  • [41] Near-Optimal Deviation-Proof Medium Access Control Designs in Wireless Networks
    Khoa Tran Phan
    Park, Jaeok
    van der Schaar, Mihaela
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2012, 20 (05) : 1581 - 1594
  • [42] Near-Optimal Rate Adaptation Based on Spinal Codes for Incremental Redundancy Truncated HARQ
    Duan, Ruifeng
    Liu, Rongke
    Wang, Yan
    Sun, Jingyun
    Wang, Runxin
    2014 9TH INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND NETWORKING IN CHINA (CHINACOM), 2014, : 256 - 261
  • [43] Near-Optimal Finite-Length Scaling for Polar Codes over Large Alphabets
    Pfister, Henry D.
    Urbanke, Rudiger
    2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 215 - 219
  • [44] Near-Optimal Finite-Length Scaling for Polar Codes Over Large Alphabets
    Pfister, Henry D.
    Urbanke, Ruediger L.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (09) : 5643 - 5655
  • [45] Low-complexity near-optimal detection of dc2-balanced codes
    Immink, K. A. S.
    ELECTRONICS LETTERS, 2016, 52 (09) : 719 - U88
  • [46] A simple approach to near-optimal multiple transmit antenna space-time codes
    Wu, KY
    Leung, WK
    Ping, L
    2003 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5: NEW FRONTIERS IN TELECOMMUNICATIONS, 2003, : 2603 - 2607
  • [47] High-Performance General Functional Regenerating Codes with Near-Optimal Repair Bandwidth
    Liu, Qing
    Feng, Dan
    Hu, Yuchong
    Shi, Zhan
    Fu, Min
    ACM TRANSACTIONS ON STORAGE, 2017, 13 (02)
  • [48] Reinforcement Learning for Near-Optimal Design of Zero-Delay Codes for Markov Sources
    Cregg, Liam
    Linder, Tamas
    Yuksel, Serdar
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (11) : 8399 - 8413
  • [49] Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization
    Guruswami, Venkatesan
    Jiang, Haotian
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 1077 - 1081
  • [50] Near-Optimal Designs of Hybrid Precoding and Combining for Massive MIMO Systems From Lattice Decoding
    Lu, Hsiao-Feng
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2023, 72 (08) : 10521 - 10533