Babak Salimi

Babak Salimi

Auto-generated profile, based on publicly available information

Babak Salimi

University of California, San Diego, San Diego, CA, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 May 2024 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
APAlireza Pirhadi
Alireza Pirhadi
MMMohammad Hossein Moslemi
Mohammad Hossein Moslemi
ACAlexander Cloninger
Alexander Cloninger
MMMostafa Milani
Mostafa Milani
BSBabak Salimi
Babak Salimi
Ensuring Conditional Independence (CI) constraints is pivotal for the development of fair and trustworthy machine learning models. In this paper, we introduce OTClean, a framework that harnesses optimal transport theory for data repair under CI constraints. Optimal transport theory provides a rigorous framework for measuring the discrepancy between probability distributions, thereby ensuring control over data utility. We formulate the data repair problem concerning CIs as a Quadratically Constrained Linear Program (QCLP) and propose an alternating method for its solution. However, this approach faces scalability issues due to the computational cost associated with computing optimal transport distances, such as the Wasserstein distance. To overcome these scalability challenges, we reframe our problem as a regularized optimization problem, enabling us to develop an iterative algorithm inspired by Sinkhorn's matrix scaling algorithm, which efficiently addresses high-dimensional and large-scale data. Through extensive experiments, we demonstrate the efficacy and efficiency of our proposed methods, showcasing their practical utility in real-world data cleaning and preprocessing tasks. Furthermore, we provide comparisons with traditional approaches, highlighting the superiority of our techniques in terms of preserving data utility while ensuring adherence to the desired CI constraints.


2 April 2026 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
YGYarden Gabbay
Yarden Gabbay
HGHaoquan Guan
Haoquan Guan
SAShaull Almagor
Shaull Almagor
EREl Kindi Rezig
El Kindi Rezig
BYBrit Youngmann
Brit Youngmann
BSBabak Salimi
Babak Salimi
Causal analyses derived from observational data underpin high-stakes decisions in domains such as healthcare, public policy, and economics. Yet such conclusions can be surprisingly fragile: even minor data errors - duplicate records, or entry mistakes - may drastically alter causal relationships. This raises a fundamental question: how robust is a causal claim to small, targeted modifications in the data? Addressing this question is essential for ensuring the reliability, interpretability, and reproducibility of empirical findings. We introduce SubCure , a framework for robustness auditing via cardinality repairs . Given a causal query and a user-specified target range for the estimated effect, SubCure identifies a small set of tuples or subpopulations whose removal shifts the estimate into the desired range. This process not only quantifies the sensitivity of causal conclusions but also pinpoints the specific regions of the data that drive those conclusions. We formalize this problem under both tuple- and pattern-level deletion settings and show both are NP-complete. To scale to large datasets, we develop efficient algorithms that incorporate machine unlearning techniques to incrementally update causal estimates without retraining from scratch. We evaluate SubCure across four real-world datasets covering diverse application domains. In each case, it uncovers compact, high-impact subsets whose removal significantly shifts the causal conclusions—revealing vulnerabilities that traditional methods fail to detect. Our results demonstrate that cardinality repair is a powerful and general-purpose tool for stress-testing causal analyses and guarding against misleading claims rooted in ordinary data imperfections.

24 May 2023
Verified
Conference Paper
Open access
IRIndrajit Ray
Indrajit Ray
BTBhavani Thuraisingham
Bhavani Thuraisingham
JVJaideep Vaidya
Jaideep Vaidya
SMSharad Mehrotra
Sharad Mehrotra
VAVijayalakshmi Atluri
Vijayalakshmi Atluri
VSVivek Kumar Singh
Vivek Kumar Singh
Our vision is to achieve societally responsible secure and trustworthy cyberspace that puts algorithmic and technological checks and balances on the indiscriminate sharing and analysis of data. We achieve this vision in a holistic manner by framing research directions with four major considerations: (i) Expanding knowledge and understanding of security and privacy perceptions and expectations in vulnerable groups, which significantly contribute to their unwillingness to share data, and use that knowledge to drive research in (a) mitigating missing/imbalanced data problems, (b) understanding and modeling security and privacy risks of data sharing, and (c) modeling utility of data sharing. (ii) Developing a risk-adaptive, policy model capable of capturing and articulating security and privacy expectations of users that are relevant in a particular context and develops associated technology to ensure provenance and accountability. (iii) Developing robust AI/ML algorithms that are transparent and explainable with respect to fairness and bias to reduce/eliminate discrimination, misuse, privacy violations, or other cyber-crimes. (iv) Developing models and techniques for a nuanced, contextually adaptive, and graded privacy paradigm that allows trade-offs between privacy and utility. Towards this, in this paper we present the SAFE-PASS framework to provide Stewardship, Advocacy, Fairness and Empowerment in Privacy, Accountability, Security, and Safety for Vulnerable Groups.

22 June 2025
Verified
Conference Paper
Open access
NCNoam Chen
Noam Chen
AZAnna Zeng
Anna Zeng
MCMichael Cafarella
Michael Cafarella
BKBatya Kenig
Batya Kenig
MMMarkos Markakis
Markos Markakis
BSBabak Salimi
Babak Salimi