Matrices, Compression, Learning Curves: Formulation, and the GROUPNTEACH Algorithms

被引:1
|
作者
Hooi, Bryan [1 ]
Song, Hyun Ah [1 ]
Papalexakis, Evangelos [1 ]
Agrawal, Rakesh [2 ]
Faloutsos, Christos [1 ]
机构
[1] Carnegie Mellon Univ, Pittsburgh, PA 15213 USA
[2] Data Insights Labs, San Francisco, CA USA
关键词
D O I
10.1007/978-3-319-31750-2_30
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Suppose you are a teacher, and have to convey a set of object-property pairs ('lions eat meat'). A good teacher will convey a lot of information, with little effort on the student side. What is the best and most intuitive way to convey this information to the student, without the student being overwhelmed? A related, harder problem is: how can we assign a numerical score to each lesson plan (i.e., way of conveying information)? Here, we give a formal definition of this problem of forming learning units and we provide a metric for comparing different approaches based on information theory. We also design an algorithm, GROUPNTEACH, for this problem. Our proposed GROUPNTEACH is scalable (near-linear in the dataset size); it is effective, achieving excellent results on real data, both with respect to our proposed metric, but also with respect to encoding length; and it is intuitive, conforming to wellknown educational principles. Experiments on real and synthetic datasets demonstrate the effectiveness of GROUPNTEACH.
引用
收藏
页码:376 / 387
页数:12
相关论文
共 50 条
  • [21] Biological learning curves outperform existing ones in artificial intelligence algorithms
    Uzan, Herut
    Sardi, Shira
    Goldental, Amir
    Vardi, Roni
    Kanter, Ido
    SCIENTIFIC REPORTS, 2019, 9 (1)
  • [22] Linear Algebraic Formulation of Edge-centric K-truss Algorithms with Adjacency Matrices
    Low, Tze Meng
    Spampinato, Daniele G.
    Kutuluru, Anurag
    Sridhar, Upasana
    Popovici, Doru Thom
    Franchetti, Franz
    McMillan, Scott
    2018 IEEE HIGH PERFORMANCE EXTREME COMPUTING CONFERENCE (HPEC), 2018,
  • [23] Biological learning curves outperform existing ones in artificial intelligence algorithms
    Herut Uzan
    Shira Sardi
    Amir Goldental
    Roni Vardi
    Ido Kanter
    Scientific Reports, 9
  • [24] LEARNING-CURVES FOR ERROR MINIMUM AND MAXIMUM-LIKELIHOOD ALGORITHMS
    KABASHIMA, Y
    SHINOMOTO, S
    NEURAL COMPUTATION, 1992, 4 (05) : 712 - 719
  • [25] Neural learning algorithms based on mappings: The case of the unitary group of matrices
    Fiori, Simone
    Artificial Neural Networks - ICANN 2007, Pt 1, Proceedings, 2007, 4668 : 858 - 863
  • [26] Limiting compression curves
    Sridharan, A
    Prakash, K
    GEOTECHNICAL TESTING JOURNAL, 2001, 24 (03): : 330 - 333
  • [27] Compression of transfer matrices
    Lundow, PH
    DISCRETE MATHEMATICS, 2001, 231 (1-3) : 321 - 329
  • [28] Learning of couplings for random asymmetric kinetic Ising models revisited: random correlation matrices and learning curves
    Bachschmid-Romano, Ludovica
    Opper, Manfred
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2015,
  • [29] Efficient Compression of Far Field Matrices in Multipole Algorithms based on Spherical Harmonics and Radiating Modes
    Schroder, Arne
    Bruns, Heinz-D.
    Schuster, Christian
    ADVANCED ELECTROMAGNETICS, 2012, 1 (02) : 5 - 11
  • [30] PERIOD MATRICES OF HYPERELLIPTIC CURVES
    SCHINDLER, B
    MANUSCRIPTA MATHEMATICA, 1993, 78 (04) : 369 - 380