Search Results for author:
Found 6 papers, 1 papers with code
Fair k-Centers via Maximum Matching
The field of algorithms has seen a push for fairness, or the removal of inherent bias, in recent history.
Conformal Predictions Enhanced Expert-guided Meshing with Graph Neural Networks
We demonstrate that the addition of conformal predictions effectively enables the model to avoid under-refinement, hence failure, in CFD meshing even for weak and less accurate models.
Automated Code generation for Information Technology Tasks in YAML through Large Language Models
This work focuses on the generation of Ansible-YAML, a widely used markup language for IT Automation.
An Efficient Algorithm for Fair Multi-Agent Multi-Armed Bandit with Low Regret
This is an improvement to the previous approach, which has regret bound of $\tilde{O}( \min(NK, \sqrt{N} K^{3/2})\sqrt{T})$.
Locally Private $k$-Means Clustering with Constant Multiplicative Approximation and Near-Optimal Additive Error
Recent work on this problem in the locally private setting achieves constant multiplicative approximation with additive error $\tilde{O} (n^{1/2 + a} \cdot k \cdot \max \{\sqrt{d}, \sqrt{k} \})$ and proves a lower bound of $\Omega(\sqrt{n})$ on the additive error for any solution with a constant number of rounds.
Differentially Private Clustering via Maximum Coverage
This paper studies the problem of clustering in metric spaces while preserving the privacy of individual data.
