activity
20182026
most citedScalable and Robust Sparse Subspace Clustering Using Randomized Clustering and Multilayer Graphs

34 citations · 69 across the 8 of their papers we have counts for

collaborators

9 papers

cs.CV2026

How Do Diffusion Classifiers Decide? A Bias-Centric Evaluation

Saba Fathi, Fardin Ayar, Maryam Abdolali +3

Diffusion models have recently been repurposed for zero-shot classification, giving rise to diffusion classifiers that identify the best-matching text prompt by minimizing the nois…

cs.CL2026

Language Models as Interfaces, Not Oracles: A Hybrid LLM-ML System for Pediatric Appendicitis

Soheyl Bateni, Maryam Abdolali

Large language models (LLMs) can make clinical decision support more accessible by interpreting free-text documentation, but their direct use as diagnostic engines is limited by se…

cs.LG2026

Trust, Don't Trust, or Flip: Robust Preference-Based Reinforcement Learning with Multi-Expert Feedback

Seyed Amir Hosseini, Maryam Abdolali, Amirhosein Tavakkoli +4

Preference-based reinforcement learning (PBRL) offers a promising alternative to explicit reward engineering by learning from pairwise trajectory comparisons. However, real-world p…

cs.LG2025

Adapt, Agree, Aggregate: Semi-Supervised Ensemble Labeling for Graph Convolutional Networks

Maryam Abdolali, Romina Zakerian, Behnam Roshanfekr +2

In this paper, we propose a novel framework that combines ensemble learning with augmented graph structures to improve the performance and robustness of semi-supervised node classi…

math.NA2024★ 2 cited

Dual Simplex Volume Maximization for Simplex-Structured Matrix Factorization

Maryam Abdolali, Giovanni Barbarino, Nicolas Gillis

Simplex-structured matrix factorization (SSMF) is a generalization of nonnegative matrix factorization, a fundamental interpretable data analysis model, and has applications in hyp…

cs.LG2022★ 3 cited

Revisiting data augmentation for subspace clustering

Maryam Abdolali, Nicolas Gillis

Subspace clustering is the classical problem of clustering a collection of data samples that approximately lie around several low-dimensional subspaces. The current state-of-the-ar…

cs.LG2020★ 18 cited

Simplex-Structured Matrix Factorization: Sparsity-based Identifiability and Provably Correct Algorithms

Maryam Abdolali, Nicolas Gillis

In this paper, we provide novel algorithms with identifiability guarantees for simplex-structured matrix factorization (SSMF), a generalization of nonnegative matrix factorization.…

cs.CV2019★ 12 cited

Neither Global Nor Local: A Hierarchical Robust Subspace Clustering For Image Data

Maryam Abdolali, Mohammad Rahmati

In this paper, we consider the problem of subspace clustering in presence of contiguous noise, occlusion and disguise. We argue that self-expressive representation of data in curre…

cs.CV2018★ 34 cited

Scalable and Robust Sparse Subspace Clustering Using Randomized Clustering and Multilayer Graphs

Maryam Abdolali, Nicolas Gillis, Mohammad Rahmati

Sparse subspace clustering (SSC) is one of the current state-of-the-art methods for partitioning data points into the union of subspaces, with strong theoretical guarantees. Howeve…