conftrace_

top-k selection

20 papers

Explore in graph

Co-occurring keywords

differential privacy (1016) exponential mechanism (30) sample complexity (1169) privacy-preserving algorithm (12) combinatorial bandit (37) lower bound (173) regret bound (1926) convex optimization (1321) private algorithm (14) approximate accuracy (1)

Papers

Faster Differentially Private Top-$k$ Selection: A Joint Exponential Mechanism with Pruning NIPS 2024
Dual-Mode NAM: Effective Top-K Context Injection for End-to-End ASR INTERSPEECH 2023
Tight Data Access Bounds for Private Top-$k$ Selection ICML 2023
Fast, Differentiable and Sparse Top-k: a Convex Analysis Perspective ICML 2023
Combinatorial categorized bandits with expert rankings UAI 2023
Top-k data selection via distributed sample quantile inference L4DC 2023
Differentially Private Histograms under Continual Observation: Streaming Selection into the Unknown AISTATS 2022
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
Oneshot Differentially Private Top-k Selection ICML 2021
Sample Complexity Bounds for Active Ranking from Multi-wise Comparisons NIPS 2021
Top-$k$ Combinatorial Bandits with Full-Bandit Feedback ALT 2020
Differentially Private Top-k Selection via Stability on Unknown Domain UAI 2020
Practical Differentially Private Top-k Selection with Pay-what-you-get Composition NIPS 2019
Exploring $k$ out of Top $ρ$ Fraction of Arms in Stochastic Bandits AISTATS 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 NIPS 2015
Top-k Selection based on Adaptive Sampling of Noisy Preferences ICML 2013
Predictive Simulation Framework of Stochastic Diffusion Model for Identifying Top-K Influential Nodes ACML 2013