No article text was recorded for this version.
parallelized subset selection
Version 1 of 123 papers33 conceptsfrozen 2026-10-04
Papers in this version
- Blog: DIRECT: Deep Active Learning under Imbalance and Label Noise
- Blog: Parallel Delaunay Refinement: Algorithms and Analyses
- Blog: Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization
- Blog: Fast Feature Selection with Fairness Constraints
- Blog: Fast Parallel Algorithms for Statistical Subset Selection Problems
- Blog: Adaptive Sampling for Fast Constrained Maximization of Submodular Functions
- Blog: SFPruner: Single-Forward Visual Token Subset Selection for Resource-Efficient Multimodal Foundation Model Inference
- Blog: Une implémentation GPU de la méthode de recherche approximative FlyHash
- Blog: The Adaptive Complexity of Maximizing a Gross Substitutes Valuation
- Blog: Parallelizing greedy for submodular set function maximization in matroids and beyond
- Blog: Simple and sharp analysis of k-means||
- Blog: Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
- Blog: Batch greedy maximization of non-submodular functions: Guarantees and applications to experimental design
- Blog: Submodular Function Maximization in Parallel via the Multilinear Relaxation
- Blog: Parallel and Efficient Hierarchical k-Median Clustering
- Blog: A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
- Blog: An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation
- Blog: Breaking Barriers: Combinatorial Algorithms for Non-Monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation
- Blog: Parallel chen-han (PCH) algorithm for discrete geodesics
- Blog: gIM: GPU Accelerated RIS-Based Influence Maximization Algorithm
- Blog: Placement of Loading Stations for Electric Vehicles: No Detours Necessary!
- Blog: Improved Parallel Algorithm for Minimum Cost Submodular Cover Problem
- Blog: Efficient Large-Scale Approximate Nearest Neighbor Search on OpenCL FPGA
History & citation
Current · Permanent link
- This direction split from Parallel Submodular Maximization via Adaptive Threshold Sampling (61% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_parallelized_subset_selection_45813dcf,
title = {parallelized subset selection},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/parallelized-subset-selection/rdr_45813dcf2963497fa67f75421496efe4},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_parallelized_subset_selection_45813dcf_v1,
title = {parallelized subset selection},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/parallelized-subset-selection/rdr_45813dcf2963497fa67f75421496efe4/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}