6 citations · 32 across the 37 of their papers we have counts for
10 papers · 1 filter
Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methods
Constantine Caramanis, Dimitris Fotakis, Alkis Kalavasis +2
Deep Neural Networks and Reinforcement Learning methods have empirically shown great promise in tackling challenging combinatorial problems. In those methods a deep neural network…
Fairness Aware Counterfactuals for Subgroups
Loukas Kavouras, Konstantinos Tsopelas, Giorgos Giannopoulos +6
In this work, we present Fairness Aware Counterfactuals for Subgroups (FACTS), a framework for auditing subgroup fairness through counterfactual explanations. We start with revisit…
Perfect Sampling from Pairwise Comparisons
Dimitris Fotakis, Alkis Kalavasis, Christos Tzamos
In this work, we study how to efficiently obtain perfect samples from a discrete distribution given access only to pairwise comparisons of elements of its support. Sp…
Label Ranking through Nonparametric Regression
Dimitris Fotakis, Alkis Kalavasis, Eleni Psaroudaki
Label Ranking (LR) corresponds to the problem of learning a hypothesis that maps features to rankings over a finite set of labels. We adopt a nonparametric regression approach to L…
Efficient Algorithms for Learning from Coarse Labels
Dimitris Fotakis, Alkis Kalavasis, Vasilis Kontonis +1
For many learning problems one may not have access to fine grained label information; e.g., an image can be labeled as husky, dog, or even animal depending on the expertise of the…
Efficient Online Learning for Dynamic k-Clustering
Dimitris Fotakis, Georgios Piliouras, Stratis Skoulakis
We study dynamic clustering problems from the perspective of online learning. We consider an online learning problem, called \textit{Dynamic -Clustering}, in which centers a…