Co-occurring keywords · papers mentioning both
Papers
Conditional Probabilistic Bipolar Argumentation Framework: Explanations, Complexity and Approximation
AAAI 2026
Breaking the $n^1.5$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition
ICML 2025
Differentially Private Continual Release of Histograms and Related Queries
AISTATS 2025
Differentially Private Space-Efficient Algorithms for Counting Distinct Elements in the Turnstile Model
ICML 2025
Differentially Private Synthetic Graphs Preserving Triangle-Motif Cuts
COLT 2025
PREM: Privately Answering Statistical Queries with Relative Error
COLT 2025
Continual Counting with Gradual Privacy Expiration
NeurIPS 2024
Counting Distinct Elements in the Turnstile Model with Differential Privacy under Continual Observation
NeurIPS 2023
Differentially Private Hierarchical Clustering with Provable Approximation Guarantees
ICML 2023
Maximizing submodular functions under submodular constraints
UAI 2023
Better Private Algorithms for Correlation Clustering
COLT 2022
Locally Private k-Means Clustering with Constant Multiplicative Approximation and Near-Optimal Additive Error
AAAI 2022
Additive Error Guarantees for Weighted Low Rank Approximation
ICML 2021
Differentially Private Correlation Clustering
ICML 2021
Differentially Private k-Means via Exponential Mechanism and Max Cover
AAAI 2021
Locally Private k-Means Clustering
JMLR 2021
A Graph Theoretic Additive Approximation of Optimal Transport
NeurIPS 2019
Measuring the Likelihood of Numerical Constraints
IJCAI 2019
Sublinear Time Low-Rank Approximation of Distance Matrices
NeurIPS 2018