Marwa El Halabi (2018)

Research Interests:

Convex optimization
Structured sparsity
Submodular and discrete optimization
Theoretical computer science

Biography

I received my diploma in Computer and Communication Engineering from the American University of Beirut in 2012. From September 2012 to August 2018 I was a doctoral assistant at EPFL. My PhD thesis, entitled Learning with Structured Sparsity: From Discrete to Convex and Back was supervised by Prof. Volkan Cevher.

Publications with LIONS (most recent)

Warning

Please note that the publication lists from Infoscience integrated into the EPFL website, lab or people pages are frozen following the launch of the new version of platform. The owners of these pages are invited to recreate their publication list from Infoscience. For any assistance, please consult the Infoscience help or contact support.

Learning with Structured Sparsity: From Discrete to Convex and Back.

M. El Halabi / V. Cevher (Dir.)

EPFL, 2018.

Detailed record

Full text – View at publisher

Combinatorial Penalties: Which structures are preserved by convex relaxations?

M. El Halabi; F. Bach; V. Cevher

2017. 21st International Conference on Artificial Intelligence and Statistics (AISTATS), Lanzarotte, Spain, April 9-11, 2017.

Detailed record

General Proximal Gradient Method: A Case for Non-Euclidean Norms

M. El Halabi; Y-P. Hsieh; B. Vu; Q. Nguyen; V. Cevher

2017.

Detailed record

An Efficient Streaming Algorithm for the Submodular Cover Problem

A. Norouzi Fard; A. Bazzi; M. El Halabi; I. Bogunovic; Y-P. Hsieh et al.

2016. The Thirtieth Annual Conference on Neural Information Processing Systems (NIPS).

Detailed record

Frank-Wolfe Works for Non-Lipschitz Continuous Gradient Objectives: Scalable Poisson Phase Retrieval

G. Odor; Y-H. Li; A. Yurtsever; Y-P. Hsieh; Q. Tran Dinh et al.

2016. 41st IEEE International Conference on Acoustics, Speech and Signal Processing. p. 6230-6234. DOI : 10.1109/ICASSP.2016.7472875.

Detailed record

Full text – View at publisher