Marwa El Halabi
12 papers · 2015–2025 · 3 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+4 more ↓ Show less ↑
π£ Hot Topic Early Bird π Conference Polyglot Β· Bronze π Academic Marathon Β· Half π Interdisciplinary Bridge Β· Bronze πΊοΈ Taxonomy Completionist (18)
π§¬
Topic Evolution
π
Century Club Β· Bronze
β
The Questioner
ποΈ
Keyword Collector
(62)
Venues
Top co-authors
Research topics
Mathematics & Optimization
(10)
Optimization
(10)
Machine Learning
(9)
Application Areas
(6)
Optimization & Theory Β· Machine Learning
(6)
Deep Learning
(2)
Optimization & Theory Β· Deep Learning
(2)
Artificial Intelligence
(1)
Computer Science
(1)
Architectures
(1)
Core AI
(1)
Core Methods
(1)
Foundations
(1)
Mathematics
(1)
Techniques
(1)
Keywords
combinatorial optimization
(3)
streaming algorithm
(3)
approximation algorithm
(3)
submodular maximization
(3)
convex relaxation
(2)
fair machine learning
(2)
matroid constraint
(2)
submodular optimization
(2)
dc programming
(1)
structured sparsity
(1)
dynamic programming
(1)
impossibility result
(1)
submodular minimization
(1)
support recovery
(1)
feature selection
(1)
data stream
(1)
cardinality constraint
(1)
greedy algorithm
(1)
representative selection
(1)
linear programming
(1)
Papers
Discrete and Continuous Difference of Submodular Minimization
ICML 2025
GuidedQuant: Large Language Model Quantization via Exploiting End Loss Guidance
ICML 2025
Fairness in Submodular Maximization over a Matroid Constraint
AISTATS 2024
LayerMerge: Neural Network Depth Compression through Layer Pruning and Merging
ICML 2024
Difference of submodular minimization via DC programming
ICML 2023
Fairness in Streaming Submodular Maximization over a Matroid Constraint
ICML 2023
Data-Efficient Structured Pruning via Submodular Optimization
NeurIPS 2022
Fairness in Streaming Submodular Maximization: Algorithms and Hardness
NeurIPS 2020
Optimal approximation for unconstrained non-submodular minimization
ICML 2020
Combinatorial Penalties: Which structures are preserved by convex relaxations?
AISTATS 2018
An Efficient Streaming Algorithm for the Submodular Cover Problem
NeurIPS 2016
A totally unimodular view of structured sparsity
AISTATS 2015