← Search

Leonidas Tsepenekas

9 accepted papers

2024

SHAP@k: Efficient and Probably Approximately Correct (PAC) Identification of Top-K Features

AAAI 2024technical

The SHAP framework provides a principled method to explain the predictions of a model by computing feature importance. Motivated by applications in finance, we introduce the Top-k Identification Problem (TkIP) (and its ordered variant TkIP- O), where the objective is to identify the subset (or order…

Cited by 3SourcePDFScholar
2023

Comparing Apples to Oranges: Learning Similarity Functions for Data Produced by Different Distributions

NeurIPS 2023poster

Similarity functions measure how comparable pairs of elements are, and play a key role in a wide variety of applications, e.g., notions of Individual Fairness abiding by the seminal paradigm of Dwork et al., as well as Clustering problems. However, access to an accurate similarity function should no…

Cited by 1SourcePDFScholar
2023

Efficient and Equitable Deployment of Mobile Vaccine Distribution Centers

IJCAI 2023poster

Vaccines have proven to be extremely effective in preventing the spread of COVID-19 and potentially ending the pandemic. Lack of access caused many people not getting vaccinated early, so states such as Virginia deployed mobile vaccination sites in order to distribute vaccines across the state. Here…

Cited by 1SourcePDFScholar
2022

A New Notion of Individually Fair Clustering: $α$-Equitable $k$-Center

AISTATS 2022poster

Clustering is a fundamental problem in unsupervised machine learning, and due to its numerous societal implications fair variants of it have recently received significant attention. In this work we introduce a novel definition of individual fairness for clustering problems. Specifically, in our mode…

2022

Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks

AISTATS 2022poster

The spread of an epidemic is often modeled by an SIR random process on a social network graph. The MinInfEdge problem for optimal social distancing involves minimizing the expected number of infections, when we are allowed to break at most B edges; similarly the MinInfNode problem involves removing…

Cited by 7SourcePDFScholar
2022

Fair Disaster Containment via Graph-Cut Problems

AISTATS 2022poster

Graph cut problems are fundamental in combinatorial Optimization, and are a central object of study in both theory and practice. Further, the study of fairness in Algorithmic Design and Machine Learning has recently received significant attention, with many different notions proposed and analyzed fo…

Cited by 8SourcePDFScholar
2021

Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints

AAAI 2021technical

Metric clustering is fundamental in areas ranging from Combinatorial Optimization and Data Mining, to Machine Learning and Operations Research. However, in a variety of situations we may have additional requirements or knowledge, distinct from the underlying metric, regarding which pairs of points s…

2020

A Pairwise Fair and Community-preserving Approach to k-Center Clustering

ICML 2020poster

Clustering is a foundational problem in machine learning with numerous applications. As machine learning increases in ubiquity as a backend for automated systems, concerns about fairness arise. Much of the current literature on fairness deals with discrimination against protected classes in supervis…