Scalable Graph Attention-based Instance Selection via Mini-Batch Sampling and Hierarchical Hashing
Zahiriddin Rustamov, Ayham Zaitouny, Nazar Zaki

TL;DR
This paper presents a scalable graph attention-based instance selection method that efficiently reduces large datasets by using mini-batch sampling and hierarchical hashing, maintaining or improving model performance.
Contribution
It introduces a novel GAIS framework with two scalable graph construction techniques, enabling effective instance selection in large, high-dimensional datasets.
Findings
Achieves over 96% data reduction while preserving performance.
Mini-batch sampling offers optimal efficiency for large datasets.
Multi-view hashing captures complex relationships effectively.
Abstract
Instance selection (IS) addresses the critical challenge of reducing dataset size while keeping informative characteristics, becoming increasingly important as datasets grow to millions of instances. Current IS methods often struggle with capturing complex relationships in high-dimensional spaces and scale with large datasets. This paper introduces a graph attention-based instance selection (GAIS) method that uses attention mechanisms to identify informative instances through their structural relationships in graph representations. We present two approaches for scalable graph construction: a distance-based mini-batch sampling technique that achieves dataset-size-independent complexity through strategic batch processing, and a hierarchical hashing approach that enables efficient similarity computation through random projections. The mini-batch approach keeps class distributions through…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsSoftmax · Attention Is All You Need
