Search Results for author:
Found 5 papers, 2 papers with code
Towards Human-AI Complementarity with Predictions Sets
Then, we show that the problem of finding the optimal prediction sets under which the human experts achieve the highest average accuracy is NP-hard.
Prediction-Powered Ranking of Large Language Models
Using pairwise comparisons made by humans in the LMSYS Chatbot Arena platform and pairwise comparisons made by three strong large language models, we empirically demonstrate the effectivity of our framework and show that the rank-sets constructed using only pairwise comparisons by the strong large language models are often inconsistent with (the distribution of) human pairwise preferences.
Diversity-aware clustering: Computational Complexity and Approximation Algorithms
We present parameterized approximation algorithms with approximation ratios $1+ \frac{2}{e}$, $1+\frac{8}{e}$ and $3$ for diversity-aware $k$-median, diversity-aware $k$-means and diversity-aware $k$-supplier, respectively.
Finding path motifs in large temporal graphs using algebraic fingerprints
In particular, given a vertex-colored temporal graph and a multiset of colors as a query, we search for temporal paths in the graph that contain the colors specified in the query.
