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 条
  • [1] Explicit learning curves for transduction and application to clustering and compression algorithms
    Derbeko, P
    El-Yaniv, R
    Meir, R
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2004, 22 : 117 - 142
  • [2] Explicit learning curves for transduction and application to clustering and compression algorithms
    Derbeko, P. (PHILIP@CS.TECHNION.AC.IL), 1600, American Association for Artificial Intelligence (22):
  • [3] New point compression algorithms for binary curves
    Lopez, Julio
    Dahab, Ricardo
    2006 IEEE INFORMATION THEORY WORKSHOP, 2006, : 126 - +
  • [4] CALCULATION OF LEARNING-CURVES FOR INCONSISTENT ALGORITHMS
    MEIR, R
    FONTANARI, JF
    PHYSICAL REVIEW A, 1992, 45 (12): : 8874 - 8884
  • [5] Interactive packages for learning image compression algorithms
    Khuri, Sami
    Hsu, Hsiu-Chin
    2000, ACM, New York
  • [6] Interactive packages for learning image compression algorithms
    Khuri, S
    Hsu, HC
    ITICSE 2000: PROCEEDINGS OF THE 5TH ANNUAL SIGCSE/SIGCUE CONFERENCE ON INNOVATION AND TECHNOLOGY IN COMPUTER SCIENCE EDUCATION, 2000, 32 (03): : 73 - 76
  • [7] Spectral Regularization Algorithms for Learning Large Incomplete Matrices
    Mazumder, Rahul
    Hastie, Trevor
    Tibshirani, Robert
    JOURNAL OF MACHINE LEARNING RESEARCH, 2010, 11 : 2287 - 2322
  • [8] Spectral regularization algorithms for learning large incomplete matrices
    Mazumder, Rahul
    Hastie, Trevor
    Tibshirani, Robert
    Journal of Machine Learning Research, 2010, 11 : 2287 - 2322
  • [9] Safe Exploration in Reinforcement Learning: A Generalized Formulation and Algorithms
    Wachi, Akifumi
    Hashimoto, Wataru
    Shen, Xun
    Hashimoto, Kazumune
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [10] "Learning-Compression" Algorithms for Neural Net Pruning
    Carreira-Perpinan, Miguel A.
    Idelbayev, Yerlan
    2018 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2018, : 8532 - 8541