Uri Shaham

Uri Shaham

Assistant Professor

Department of Computer Science, Bar Ilan University, Israel

About Me

I am a lab head and an assistant professor at the department of computer science at Bar Ilan university. I received a Ph.D. in statistics from Yale University in 2017, under the supervision of Prof. Ronald Coifman (Math), Prof. Sahand Negahban (Statistics), and Prof. Yuval Kluger (Computational Biology).

Between my graduation and 2023, I was an assistant professor adjunct at the center for outcome research and evaluation at Yale University. Before and after my Ph.D. studies, I worked for several years in the industry in various research, algorithms design, and advisory board roles. I also actively consult to several start-up companies in the fields of Machine Learning and Data Science.

Apart from my academic endeavors, until very recently I was also a commander of an infantry battalion in reserves in the Israeli Defense Force, and I am an amateur jazz pianist. When time permits, I also like to run marathons.

Research

Research Interests

My main area of interest is in developing methods for machine learning. In particular, a primary focus of mine lies in developing representation learning tools for understanding data, its latent properties, and extraction of meaningful information from it.

During the last ten years, my primary technical playground is deep learning, and my group works on a wide range of topics, such as multimodal learning, reinforcement learning, causal inference, and generalizable spectral methods. Two current major research interests of mine are multimodal representation learning from unpaired data, and causal reinforcement learning. Whenever possible, I aim to base my work on a solid mathematical and theoretical basis, and to contribute to the theoretical understanding of machine learning and deep learning.

Publications

Accepted Publications

Pre-prints

Teaching

Students

Post Docs

Ph.D. Students

A Note to Prospective Students

Are you curious about what data can tell us? Are you humble and eager to learn? Do you enjoy challenging yourself? Are you mentally strong enough to continue trying where most others give up? Do you belong to the top of your class in math? Are you a very good programmer? Are you willing to make a trip to the edge of your capabilities and then extend them further?

I am accepting a few M.Sc. and Ph.D. students. Prospective students should be available for full-time research, and will be required to work on campus at least 3 days a week. If you're interested, please email me, tell me about your interests, and attach your CV and transcript.

News

September 2026

“Unpaired Canonical Correlation Analysis” was accepted to Neurips. Kudos to Nir Ben-Ari!

September 2026

“Revisiting Batch Effect Correction: A Structured Problem Formulation and Novel Solutions” was accepted to Bioinformatics. Kudos to Avi Harrar!

September 2026

“PRISM-GEP: Viewing Single-Cell Expression through the Lens of Topic Modeling” was accepted to Bioinformatics. Kudos to Yanir Buznah and Tal Ishon!

April 2026

“Small Data, Big Noise: Adversarial Training for Robust Parameter-Efficient Fine-Tuning” was accepted to ACL (Findings). Kudos to Eitan Cohen and Idan Simai!

April 2026

“PRISM: PRIor from corpus Statistics for topic Modeling” was accepted to TMLR. Kudos to Tal Ishon!

January 2026

“Unsupervised Ensemble Learning Through Deep Energy-based Models” was accepted to AISTATS. Kudos to Ariel Maymon and Yanir Buznah!

January 2026

“RealStats: A Rigorous Real-Only Statistical Framework for Fake Image Detection” was accepted to AISTATS (spotlight!! - top 2.5%). Kudos to Haim Zisman!

January 2026

“Convexified Message-Passing Graph Neural Networks” was accepted to AISTATS. Kudos to Saar Cohen!

October 2025

“Learning Shared Representations from Unpaired Data” was accepted to NeurIPS. Kudos to Amitai Yacobi and Nir Ben Ari!

October 2025

“Turning Sand to Gold: Recycling Data to Bridge On-Policy and Off-Policy Learning via Causal Bound” was accepted to NeurIPS. Kudos to Tal Fiskus!

Contact