Fairness in Submodular Maximization over a Matroid Constraint

no code implementations • 21 Dec 2023 • Marwa El Halabi, Jakub Tarnawski, Ashkan Norouzi-Fard, Thuy-Duong Vuong

Submodular maximization over a matroid constraint is a fundamental problem with various applications in machine learning.

Attribute Decision Making +1

Fairness in Streaming Submodular Maximization over a Matroid Constraint

1 code implementation • 24 May 2023 • Marwa El Halabi, Federico Fusco, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski

Streaming submodular maximization is a natural model for the task of selecting a representative subset from a large-scale dataset.

Clustering Fairness +1

Difference of Submodular Minimization via DC Programming

1 code implementation • 18 May 2023 • Marwa El Halabi, George Orfanides, Tim Hoheisel

We introduce variants of DCA and its complete form (CDCA) that we apply to the DC program corresponding to DS minimization.

feature selection

Data-Efficient Structured Pruning via Submodular Optimization

1 code implementation • 9 Mar 2022 • Marwa El Halabi, Suraj Srinivas, Simon Lacoste-Julien

Structured pruning is an effective approach for compressing large pre-trained neural networks without significantly affecting their performance.

Fairness in Streaming Submodular Maximization: Algorithms and Hardness

1 code implementation • NeurIPS 2020 • Marwa El Halabi, Slobodan Mitrović, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski

Submodular maximization has become established as the method of choice for the task of selecting representative and diverse summaries of data.

BIG-bench Machine Learning Clustering +2

Optimal approximation for unconstrained non-submodular minimization

1 code implementation • ICML 2020 • Marwa El Halabi, Stefanie Jegelka

Submodular function minimization is well studied, and existing algorithms solve it exactly or up to arbitrary accuracy.

Bayesian Optimization Sparse Learning

Combinatorial Penalties: Which structures are preserved by convex relaxations?

no code implementations • 17 Oct 2017 • Marwa El Halabi, Francis Bach, Volkan Cevher

We consider the homogeneous and the non-homogeneous convex relaxations for combinatorial penalty functions defined on support sets.

A totally unimodular view of structured sparsity

no code implementations • 7 Nov 2014 • Marwa El Halabi, Volkan Cevher

This paper describes a simple framework for structured sparse recovery based on convex optimization.