arXiv:2007.04451
Online probabilistic label trees
원문 초록
We introduce online probabilistic label trees (OPLTs), an algorithm that trains a label tree classifier in a fully online manner without any prior knowledge about the number of training instances, their features and labels. OPLTs are characterized by low time and space complexity as well as strong theoretical guarantees. They can be used for online multi-label and multi-class classification, including the very challenging scenarios of one- or few-shot learning. We demonstrate the attractiveness of OPLTs in a wide empirical study on several instances of the tasks mentioned above.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
A Comprehensive Evaluation of Large Language Models on Mental Illnesses in Arabic Context
SQL-o1: Automatic Text-to-SQL Program Synthesis via Self-Reward Heuristic Search
Few-Shot Learning by Explicit Physics Integration: An Application to Groundwater Heat Transport
Universal Music Representations? Evaluating Foundation Models on World Music Corpora
GeoVision Labeler: Zero-Shot Geospatial Classification with Vision and Language Models
Chameleon: A MatMul-Free Temporal Convolutional Network Accelerator for End-to-End Few-Shot and Continual Learning from Sequential Data
토론
이 논문과 연결된 포럼 글이 아직 없습니다.