top-k selection

LapSum - One Method to Differentiate Them All: Ranking, Sorting and Top-k Selection ICML 2025 La RoSA: Enhancing LLM Efficiency via Layerwise Rotated Sparse Activation ICML 2025 Learning Cascade Ranking as One Network ICML 2025 RTop-K: Ultra-Fast Row-Wise Top-K Selection for Neural Network Acceleration on GPUs ICLR 2025 Faster Differentially Private Top-k Selection: A Joint Exponential Mechanism with Pruning NeurIPS 2024 Combinatorial categorized bandits with expert rankings UAI 2023 Dual-Mode NAM: Effective Top-K Context Injection for End-to-End ASR Interspeech 2023 Fast, Differentiable and Sparse Top-k: a Convex Analysis Perspective ICML 2023 Tight Data Access Bounds for Private Top-k Selection ICML 2023 Top-k data selection via distributed sample quantile inference L4DC 2023 Adaptive Private-K-Selection with Adaptive K and Application to Multi-label PATE AISTATS 2022 A Joint Exponential Mechanism For Differentially Private Top-k ICML 2022 Differentially Private Histograms under Continual Observation: Streaming Selection into the Unknown AISTATS 2022 Oneshot Differentially Private Top-k Selection ICML 2021 Sample Complexity Bounds for Active Ranking from Multi-wise Comparisons NeurIPS 2021 Differentially Private Top-k Selection via Stability on Unknown Domain UAI 2020 Top-k Combinatorial Bandits with Full-Bandit Feedback ALT 2020 Exploring k out of Top ρ Fraction of Arms in Stochastic Bandits AISTATS 2019 Practical Differentially Private Top-k Selection with Pay-what-you-get Composition NeurIPS 2019 Efficient Techniques for Crowdsourced Top-k Lists IJCAI 2017 The Price of Selection in Differential Privacy COLT 2017 On Top-k Selection in Multi-Armed Bandits and Hidden Bipartite Graphs NeurIPS 2015 Predictive Simulation Framework of Stochastic Diffusion Model for Identifying Top-K Influential Nodes ACML 2013 Top-k Selection based on Adaptive Sampling of Noisy Preferences ICML 2013