Shirin Saeedi Bidokhti



I am an assistant professor in the Department of Electrical and Systems Engineering (ESE ), with a secondary appointment in the Department of Computer and Information Systems (CIS ). I am an affiliate of the Warren Center for Network and Data Sciences. I received my M.Sc. and Ph.D. degrees in Computer and Communication Sciences from the Swiss Federal Institute of Technology (EPFL). Before joining UPenn, I was a postdoctoral fellow at Stanford University and Technical University of Munich. I have also held visiting researcher positions at Pennsylvania State University, ETH Zurich, and University of California at Los Angeles.

My research interests include information theory, networking, data compression and learning.

Curriculum Vitae
Bio

NEWS

September 2024 – Our paper Group Testing with Correlation under Edge-Faulty Graphs has been accepted in IT Transactions.

September 2024 – I’m happy to give a talk at the Rutgers ECE colloquium on “Learning-Based Data Compression: Fundamental Limits and Algorithms.”

July 2024 – Check out our paper titled Group Testing with General Correlation Using Hypergraphs, which will be presented at ISIT 2024.

April 2024 – Our paper on Decentralized Learning Strategies for Estimation Error Minimization with Graph Neural Networks is available on arXiv!

May 2024 – I’m excited to give an invited talk at the IEEE Communication Theory Workshop (CTW) on “Neural Compression with Lattice Transform Coding.”

March 2024 – Check out our new paper titled Approaching Rate-Distortion Limits in Neural Compression with Lattice Transform Coding on arXiv.

March 2024 – I’m excited to give an invited talk at the International Zurich Seminar (IZS) on “Neural Compression with Lattice Transform Coding.”

December 2023 – Check out our paper titled Protect or Prevent? A Practicable Framework for the Dilemmas of COVID-19 Vaccine Prioritization on MedRxiv.

November 2023 – I’m excited to give an invited talk at the IT forum at Stanford on “Learning-Based Data Compression: Fundamental Limits and Algorithms.”

July 2023 – Congratulations to Xingran Chen for successfully defending his dissertation and joining the University of Electronic Science and Technology in China as an Assistant Professor.

July 2023 – Check out our paper titled Text + Sketch: Image Compression at Ultra Low Rates, presented at ICML (Workshop on Neural Compression).

July 2023 – Check out our paper titled Compression with Unlabeled Graph Side Information" , to be presented at ISIT 2023.

July 2023 – Our paper titled Capturing COVID-19 Spread and Interplay with Multi-Hop Contact Tracing Intervention" is accepted in PLOS ONE.

June 2023 2023 North American School of Information Theory at Penn

June 2023 – Check out our paper titled On a Relation Between Rate-Distortion Theory and Optimal Transport" , accepted in ICLR (Tiny Papers).

May 2023 Honored to be a recipient of the 2023 IEEE Communications Society & Information Theory Society Joint Paper Award for our paper “Age of Information in Random Access Channels” , IEEE Transactions on Information Theory, Vol. 68, No. 10, pp. 6548-6568, October 2022, along with my PhD student Xingran Chen, and Konstantinos Gatsis, and Hamed Hassani.

December 2022  – Check out our paper titled  Optimal Capacity-Constrained COVID-19 Vaccination for Heterogeneous Populations , presented at CDC 2022.

October 2022  – Our paper titled “ Age of Information in Random Access Channels is now accepted in IT Transaction.

October 2022  – Check out our paper titled  "Tracing and Testing Multiple Generations of Contacts to COVID-19 Cases: Cost-Benefit Trade-Offs", published in Royal Society Open Science.

August 2022  – Honored to give my Goldsmith lecture on “Neural Compression: Algorithms and Fundamental Limits” at the East Asian School of Information Theory.

April 2022  – Check out our paper "Neural Estimation of the Rate-Distortion Function for Massive Datasets to be presented at ISIT 2022.

April 2022  – Check out our paper "Group Testing With Correlation via Edge-Faulty Graphs to be presented at ISIT 2022.

April 2022  – Check out our paper Bounds on the Capacity of the Multiple Access Diamond Channel With Cooperating Base-Stations to be presented at ISIT 2022.

July 2021  – Excited about the launch of TILOS, a New NSF Artificial Intelligence Research Institute Focused on Optimization (check out Penn Engineering Today's story by Evan Lerner).

July 2021  – Check out our paper titled On the Timeliness of Arithmetic Coding presented at ISIT 2021.

July 2021  – Check out our paper titled Timely Broadcasting in Erasure Networks: Age-Rate Tradeoffs presented at ISIT 2021.

May 2021  – Check out our paper titled Real-time sampling and estimation on random access channels: Age of Information and Beyond presented at INFOCOM 2021.

January 2021  – Happy to be a recipient of an NSF CAREER Award, see the news story here.

July 2020  – Check out our paper titled Age of information in random access channels presented at ISIT 2020.

August 2019  – Check out our paper titled Benefits of coding on age of information in broadcast networks presented at ITW 2019.

July 2019  – Check out our paper titled Non-asymptotic coded slotted ALOHA presented at ISIT 2019.

December 2018  – Happy to be a recipient of an NSF-CRII Award.

July 2018  – Check out our paper titled On Universal Compression with Constant Random Access presented at ISIT 2018.





Contact

In person :Walnut 3401, Room 455C
Phone :215-573-2225
email :saeedi@seas.upenn.edu