Prior-aware and Context-guided Group Sampling for Active Probabilistic Subsampling
Beomgu Kang, Hyunseok Seo
Abstract
Subsampling significantly reduces the number of measurements, thereby streamlining data processing and transfer overhead, and shortening acquisition time across diverse real-world applications. The recently introduced Active Deep Probabilistic Subsampling (A-DPS) approach jointly optimizes both the subsampling pattern and the downstream task model, enabling instance-and subject-specific sampling trajectories and effective adaptation to new data at inference time. However, this approach does not fully leverage valuable dataset priors and relies on top-1 sampling, which can impede the optimization process. Herein, we enhance A-DPS by integrating a deterministic (fixed) prior-informed sampling pattern derived from the training dataset, along with group-based sampling via top-k sampling, to achieve more robust optimization-a method we call Prior-aware and context-guided Group-based Active DPS (PGA-DPS). We also provide a theoretical analysis supporting improved optimization via group sampling, and validate this with empirical results. We evaluated PGA-DPS on three tasks: classification, image reconstruction, and segmentation, using the MNIST, CIFAR-10, fastMRI knee, and hyperspectral AeroRIT datasets, respectively. In every case, PGA-DPS outperformed A-DPS, DPS, and all other sampling methods. Our code is available at https://github.com/B9Kang/PGADPS .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 07927713-63c2-4b8a-816d-0a85fa46ee21Builds on7
- Lipschitz constant estimation of Neural Networks via sparse polynomial optimizationFabian Latorre, Paul Rolland, Volkan CevherICLR 2020 · 154 citations
- Efficiently Computing Local Lipschitz Constants of Neural Networks via Bound PropagationZhouxing Shi, Yihan Wang, Huan Zhang, J. Zico Kolter et al.NeurIPS 2022 · 73 citations
- Experimental design for MRI by greedy policy searchTim Bakker, Herke van Hoof, Max WellingNeurIPS 2020 · 70 citations
- Learning Smooth Neural Functions via Lipschitz RegularizationHsueh-Ti Derek Liu, Francis Williams, Alec Jacobson, Sanja Fidler et al.SIGGRAPH 2022 · 63 citations
- Deep probabilistic subsampling for task-adaptive compressed sensingIris A. M. Huijben, Bastiaan S. Veeling, Ruud J. G. van SlounICLR 2020 · 47 citations
Related papers
- Active Deep Probabilistic SubsamplingHans Van Gorp, Iris A. M. Huijben, Bastiaan S. Veeling, Nicola Pezzotti et al.ICML 2021 · 27 citations
- Set Based Stochastic SubsamplingBruno Andreis, Seanie Lee, Tuan A. Nguyen, Juho Lee et al.ICML 2022
- Adaptive Sampling of k-Space in Magnetic Resonance for Rapid Pathology PredictionChen-Yu Yen, Raghav Singhal, Umang Sharma, Rajesh Ranganath et al.ICML 2024 · 8 citations
- Dynamic Sampling Network for Semantic SegmentationBin Fu, Junjun He, Zhengfu Zhang, Yu QiaoAAAI 2020 · 6 citations
- Transformers Can Do Bayesian InferenceSamuel Müller, Noah Hollmann, Sebastian Pineda-Arango, Josif Grabocka et al.ICLR 2022 · 287 citations
