Search Results for author: Leonidas Tsepenekas

Found 9 papers, 3 papers with code

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

no code implementations10 Jul 2023 Sanjay Kariyappa, Leonidas Tsepenekas, Freddy Lécué, Daniele Magazzeni

While any method to compute SHAP values with uncertainty estimates (such as KernelSHAP and SamplingSHAP) can be trivially adapted to solve TkIP, doing so is highly sample inefficient.

Feature Importance Multi-Armed Bandits

Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks

no code implementations16 Feb 2022 Amy Babay, Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti

The second is a Sample Average Approximation (SAA) based algorithm, which we analyze for the Chung-Lu random graph model.

Epidemiology

Deploying Vaccine Distribution Sites for Improved Accessibility and Equity to Support Pandemic Response

1 code implementation9 Feb 2022 George Li, Ann Li, Madhav Marathe, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti

In response to COVID-19, many countries have mandated social distancing and banned large group gatherings in order to slow down the spread of SARS-CoV-2.

Fair Disaster Containment via Graph-Cut Problems

no code implementations9 Jun 2021 Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti

Graph cut problems are fundamental in Combinatorial Optimization, and are a central object of study in both theory and practice.

Combinatorial Optimization Fairness

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

1 code implementation9 Jun 2021 Darshan Chakrabarti, John P. Dickerson, Seyed A. Esmaeili, Aravind Srinivasan, Leonidas Tsepenekas

Clustering is a fundamental problem in unsupervised machine learning, and fair variants of it have recently received significant attention due to its societal implications.

Clustering Fairness

Approximating Two-Stage Stochastic Supplier Problems

no code implementations7 Aug 2020 Brian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti

The main focus of this paper is radius-based (supplier) clustering in the two-stage stochastic setting with recourse, where the inherent stochasticity of the model comes in the form of a budget constraint.

Data Structures and Algorithms

Probabilistic Fair Clustering

no code implementations NeurIPS 2020 Seyed A. Esmaeili, Brian Brubach, Leonidas Tsepenekas, John P. Dickerson

In fair clustering problems, vertices are endowed with a color (e. g., membership in a group), and the features of a valid clustering might also include the representation of colors in that clustering.

Clustering valid

Cannot find the paper you are looking for? You can Submit a new open access paper.