Silvia Di Gregorio

Postdoc

Research Interests

Silvia's research lies in discrete optimization. During her doctoral studies, she focused mainly on nonlinear integer optimization: in particular on binary polynomial optimization exploiting polyhedral approaches and hypergraphs' theory. She is interested both in the theoretical foundations of integer and combinatorial optimization, as well as specific problems that arise from applications in computer vision.

Vita

Silvia obtained her B.Sc. degree in Mathematics at the University of Parma in 2014 and her M.Sc. degree in Mathematics at the University of Padova in 2016. After that, she moved to University of Wisconsin-Madison where she pursued the Ph.D. in Industrial and Systems Engineering with focus on optimization. She worked at the Wisconsin Institute for Discovery under the supervision of Professor Alberto Del Pia. She received the degree in December 2020. Silvia is currently a Research Associate at TU Dresden.

Publications

Stein D., Di Gregorio S. and Andres B. Partial Optimality in Cubic Correlation Clustering. International Conference on Machine Learning (ICML) 2023

@inproceedings{stein-2023-partial,
    author = {David Stein and Silvia Di Gregorio and Bjoern Andres},
    title = {Partial Optimality in Cubic Correlation Clustering},
    booktitle = {ICML},
    year = {2023},
    url = {https://proceedings.mlr.press/v202/stein23a.html},
}

🗎 @

Andres B., Di Gregorio S., Irmai J. and Lange J.-H. A Polyhedral Study of Lifted Multicuts. Discrete Optimization 47:100757, 2023

@article{andres-2023-a-polyhedral,
    author = {Bjoern Andres and Silvia {Di Gregorio} and Jannik Irmai and Jan-Hendrik Lange},
    title = {A polyhedral study of lifted multicuts},
    journal = {Discrete Optimization},
    volume = {47},
    pages = {100757},
    year = {2023},
    doi = {10.1016/j.disopt.2022.100757},
}

@

Del Pia A. and Di Gregorio S. On the complexity of binary polynomial optimization over acyclic hypergraphs. Algorithmica 85(8):2189-2213, 2023

🗎

Del Pia A. and Di Gregorio S. On the complexity of binary polynomial optimization over acyclic hypergraphs. Symposium on Discrete Algorithms (SODA) 2022

🗎

Fun stuff

Splitting my fun time between Star Wars and cooking homemade pasta and pizza.