activity
20082026
most citedBest Friends Forever (BFF): Finding Lasting Dense Subgraphs

42 citations · 174 across the 28 of their papers we have counts for

collaborators
Showing cs.LGShow all

6 papers · 1 filter

cs.LG2025

Understanding the Interplay between Memorization and Learning in Large Language Models

Bishwamittra Ghosh, Soumi Das, Qinyuan Wu +4

We investigate foundational questions about the interplay between memorization and learning in large language models (LLMs). When an LLM generates a string, can we disentangle the…

cs.LG2025★ 4 cited

A QUBO Framework for Team Formation

Karan Vombatkere, Evimaria Terzi, Theodoros Lappas

The team formation problem assumes a set of experts and a task, where each expert has a set of skills and the task requires some skills. The objective is to find a set of experts t…

cs.LG2024

FACEGroup: Feasible and Actionable Counterfactual Explanations for Group Fairness

Christos Fragkathoulas, Vasiliki Papanikou, Evaggelia Pitoura +1

Counterfactual explanations assess unfairness by revealing how inputs must change to achieve a desired outcome. This paper introduces the first graph-based framework for generating…

cs.LG2023★ 1 cited

Online Submodular Maximization via Online Convex Optimization

Tareq Si Salem, Gözde Özcan, Iasonas Nikolaou +2

We study monotone submodular maximization under general matroid constraints in the online setting. We prove that online optimization of a large class of submodular functions, namel…

cs.LG2017★ 19 cited

Matrix completion with queries

Natali Ruchansky, Mark Crovella, Evimaria Terzi

In many applications, e.g., recommender systems and traffic monitoring, the data comes in the form of a matrix that is only partially observed and low rank. A fundamental data-anal…

cs.LG2017

Targeted matrix completion

Natali Ruchansky, Mark Crovella, Evimaria Terzi

Matrix completion is a problem that arises in many data-analysis settings where the input consists of a partially-observed matrix (e.g., recommender systems, traffic matrix analysi…