Papers with Code 아카이브
Data Summarization
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 0
- 보존된 평가 기록
- 0
Data Summarization is a central problem in the area of machine learning, where we want to compute a small summary of the data.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Sequential estimation of Spearman rank correlation using Hermite series estimators
Introduction to Core-sets: an Updated Survey
Very Fast Streaming Submodular Function Maximization
Semi-supervised Batch Active Learning via Bilevel Optimization
Deep Submodular Networks for Extractive Data Summarization
Fair and Representative Subset Selection from Data Streams
A Principled Approach to Data Valuation for Federated Learning
$β$-Cores: Robust Large-Scale Bayesian Data Summarization in the Presence of Outliers
Fast and Private Submodular and $k$-Submodular Functions Maximization with Matroid Constraints
Understanding collections of related datasets using dependent MMD coresets
Flexible Dataset Distillation: Learn Labels Instead of Images
Deuteros 2.0: Peptide-level significance testing of data from hydrogen deuterium exchange mass spectrometry
Non-Adaptive Adaptive Sampling on Turnstile Streams
How to Solve Fair $k$-Center in Massive Data Models
Regularized Submodular Maximization at Scale
CO-Optimal Transport
Streaming Submodular Maximization under a $k$-Set System Constraint
Scalability vs. Utility: Do We Have to Sacrifice One for the Other in Data Importance Quantification?
Differentially Private Distributed Data Summarization under Covariate Shift
Soft-Label Dataset Distillation and Text Dataset Distillation
Fast and Accurate Least-Mean-Squares Solvers
apricot: Submodular selection for data summarization in Python
Submodular Streaming in All its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity
Distributed Maximization of Submodular plus Diversity Functions for Multi-label Feature Selection on Huge Datasets
Fair k-Center Clustering for Data Summarization
Real-Time EEG Classification via Coresets for BCI Applications
Iterative Projection and Matching: Finding Structure-preserving Representatives and Its Application to Computer Vision
Fast determinantal point processes via distortion-free intermediate sampling
Interpreting Black Box Predictions using Fisher Kernels
Network Modeling and Pathway Inference from Incomplete Data ("PathInf")
Coverage-Based Designs Improve Sample Mining and Hyper-Parameter Optimization
Data Summarization at Scale: A Two-Stage Submodular Approach
A Mixed Hierarchical Attention based Encoder-Decoder Approach for Standard Table Summarization
Differentiable Submodular Maximization
Fair and Diverse DPP-based Data Summarization
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.