{"total":20,"rows":[{"id":"2202.01402","title":"GALAXY: Graph-based Active Learning at the Extreme","created":"2022-02-03","cited_by_count":29,"area":null},{"id":"2110.14854","title":"RIM: Reliable Influence-based Active Learning on Graphs","created":"2021-10-28","cited_by_count":23,"area":null},{"id":"2103.10547","title":"Data driven semi-supervised learning","created":"2021-03-18","cited_by_count":14,"area":null},{"id":"2201.09391","title":"Partition-Based Active Learning for Graph Neural Networks","created":"2022-01-23","cited_by_count":12,"area":null},{"id":"2405.01462","title":"Uncertainty for Active Learning on Graphs","created":"2024-05-02","cited_by_count":12,"area":null},{"id":"2102.00504","title":"Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries","created":"2021-01-31","cited_by_count":9,"area":null},{"id":"2110.07739","title":"Model-Change Active Learning in Graph-Based Semi-Supervised Learning","created":"2021-10-14","cited_by_count":8,"area":null},{"id":"2210.15786","title":"Poisson Reweighted Laplacian Uncertainty Sampling for Graph-based Active Learning","created":"2022-10-27","cited_by_count":6,"area":null},{"id":"2108.01152","title":"Maximizing and Satisficing in Multi-armed Bandits with Graph Information","created":"2021-08-02","cited_by_count":5,"area":null},{"id":"2111.08861","title":"A label-efficient two-sample test","created":"2021-11-17","cited_by_count":4,"area":null},{"id":"2405.00853","title":"Efficient Algorithms for Learning Monophonic Halfspaces in Graphs","created":"2024-05-01","cited_by_count":3,"area":null},{"id":"2408.07941","title":"Robust Offline Active Learning on Graphs","created":"2024-08-15","cited_by_count":3,"area":null},{"id":"2501.03568","title":"Advanced Tutorial: Label-Efficient Two-Sample Tests","created":"2025-01-07","cited_by_count":2,"area":null},{"id":"2409.08211","title":"Graph Laplacian-based Bayesian Multi-fidelity Modeling","created":"2024-09-12","cited_by_count":1,"area":null},{"id":"2409.09475","title":"MALADY: Multiclass Active Learning with Auction Dynamics on Graphs","created":"2024-09-14","cited_by_count":1,"area":null},{"id":"2506.23186","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","created":"2025-06-29","cited_by_count":1,"area":null},{"id":"2110.09585","title":"A-Optimal Active Learning","created":"2021-10-18","cited_by_count":0,"area":null},{"id":"2303.02721","title":"Active learning using region-based sampling","created":"2023-03-05","cited_by_count":0,"area":null},{"id":"2605.18623","title":"An Approximation Algorithm for Graph Label Selection","created":"2026-05-18","cited_by_count":0,"area":null},{"id":"2607.04869","title":"Active Learning on Adversarially Corrupted Graphs","created":"2026-07-06","cited_by_count":0,"area":null}],"next_cursor":null}