Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jamshid Sourati

dblp:120/7065 · DBLP profile ↗
← Back
7ranked-venue papers
5as first author
2since 2021 · last 2025
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Efficient and distributed learning · 54% Learning theory · 28% Trustworthy machine learning · 17%
Computer graphics and multimedia
1 paper
Image and video processing · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
active learning
1.232022
Towards Robust and Reproducible Active Learning using Neural Networks · CVPR 2022
A Probabilistic Active Learning Algorithm Based on Fisher Information Ratio · IEEE Trans. Pattern Anal. Mach. Intell. 2018
Asymptotic Analysis of Objectives Based on Fisher Information in Active Learning · J. Mach. Learn. Res. 2017
Machine learning › Efficient and distributed learning › active learning
query selection
0.622018
A Probabilistic Active Learning Algorithm Based on Fisher Information Ratio · IEEE Trans. Pattern Anal. Mach. Intell. 2018
Asymptotic Analysis of Objectives Based on Fisher Information in Active Learning · J. Mach. Learn. Res. 2017
Machine learning › Learning theory
fisher information
0.312018
A Probabilistic Active Learning Algorithm Based on Fisher Information Ratio · IEEE Trans. Pattern Anal. Mach. Intell. 2018
Machine learning › Learning theory
information-theoretic learning
0.312018
A Probabilistic Active Learning Algorithm Based on Fisher Information Ratio · IEEE Trans. Pattern Anal. Mach. Intell. 2018
Machine learning › Learning theory › statistical learning theory
asymptotic analysis
0.312017
Asymptotic Analysis of Objectives Based on Fisher Information in Active Learning · J. Mach. Learn. Res. 2017
Image and video processing
image segmentation
0.212014
Accelerated Learning-Based Interactive Image Segmentation Using Pairwise Constraints · IEEE Trans. Image Process. 2014
Image and video processing › image segmentation
interactive segmentation
0.212014
Accelerated Learning-Based Interactive Image Segmentation Using Pairwise Constraints · IEEE Trans. Image Process. 2014

Methods — techniques the papers use, named apart from their topics

uncertainty sampling · 0.6diversity sampling · 0.6committee-based sampling · 0.6fisher information ratio · 0.3fisher information · 0.3asymptotic analysis · 0.3subsampling · 0.2eigendecomposition · 0.2constrained spectral clustering · 0.2active learning · 0.2
YearPublicationVenuePosition
2025 Leveraging Hidden Patterns in Open-Ended Community Health Workers' Notes to Improve Prediction of Patient Readmission
abstract
Patient readmissions to Emergency Departments (EDs) pose significant challenges to healthcare systems, often indicating suboptimal care transitions, inadequate patient education, or insufficient post-discharge support. These unplanned readmissions not only compromise patient outcomes but also contribute to escalating healthcare costs. In response, healthcare providers are increasingly seeking predictive models to identify at-risk patients and implement preventive strategies. While advanced deep learning models have shown promise in predicting readmission risks, their "black-box" nature and substantial data requirements often limit clinical applicability due to a lack of interpretability. This study investigates the integration of Machine Learning (ML) and natural language processing (NLP) techniques to enhance the accuracy and explainability of patient readmission risk predictions. Utilizing data from the Sinai Urban Health Institute (SUHI), we analysed both structured data including demographics, interaction logs, social determinants of health (SDoH) survey answers and unstructured data, specifically notes capturing conversations between patients and Community Health Workers (CHWs). Our findings indicate that incorporating unstructured textual data improved model performance, with the area under the receiver operating characteristic curve (AUC) increasing from 0.68 to 0.74. This enhancement suggests that patient-CHW conversations capture critical, non-medical factors influencing readmissions, such as personal needs and social support deficits, which are not typically recorded in standard medical records. The study underscores the value of integrating patient-CHW contact notes into predictive modelling, helping to highlight the important role of community health in informing targeted interventions to reduce preventable readmissions.
Naveen Kumar Reddy Veeramreddy, Ankita Mishra, Navika Maglani, Sameer Shaik, Kelly McCabe, Jacob D. Furst, Daniela Raicu, Roselyne Tchoua, Jamshid Sourati
eScience9
2022 Towards Robust and Reproducible Active Learning using Neural Networks
abstract
Active learning (AL) is a promising ML paradigm that has the potential to parse through large unlabeled data and help reduce annotation cost in domains where labeling data can be prohibitive. Recently proposed neural network based AL methods use different heuristics to accomplish this goal. In this study, we demonstrate that under identical experimental settings, different types of AL algorithms (uncertainty based, diversity based, and committee based) produce an inconsistent gain over random sampling baseline. Through a variety of experiments, controlling for sources of stochasticity, we show that variance in performance metrics achieved by AL algorithms can lead to results that are not consistent with the previously reported results. We also found that under strong regularization, AL methods show marginal or no advantage over the random sampling baseline under a variety of experimental conditions. Finally, we conclude with a set of recommendations on how to assess the results using a new AL algorithm to ensure results are reproducible and robust under changes in experimental conditions. We share our codes to facilitate AL evaluations. We believe our findings and recommendations will help advance reproducible research in AL using neural networks.
Prateek Munjal, Nasir Hayat, Munawar Hayat, Jamshid Sourati, Shadab Khan
CVPR4
2019 Intelligent Labeling Based on Fisher Information for Medical Image Segmentation Using Deep Learning
abstract
Deep convolutional neural networks (CNN) have recently achieved superior performance at the task of medical image segmentation compared to classic models. However, training a generalizable CNN requires a large amount of training data, which is difficult, expensive, and time-consuming to obtain in medical settings. Active Learning (AL) algorithms can facilitate training CNN models by proposing a small number of the most informative data samples to be annotated to achieve a rapid increase in performance. We proposed a new active learning method based on Fisher information (FI) for CNNs for the first time. Using efficient backpropagation methods for computing gradients together with a novel low-dimensional approximation of FI enabled us to compute FI for CNNs with a large number of parameters. We evaluated the proposed method for brain extraction with a patch-wise segmentation CNN model in two different learning scenarios: universal active learning and active semi-automatic segmentation. In both scenarios, an initial model was obtained using labeled training subjects of a source data set and the goal was to annotate a small subset of new samples to build a model that performs well on the target subject(s). The target data sets included images that differed from the source data by either age group (e.g. newborns with different image contrast) or underlying pathology that was not available in the source data. In comparison to several recently proposed AL methods and brain extraction baselines, the results showed that FI-based AL outperformed the competing methods in improving the performance of the model after labeling a very small portion of target data set (<0.25%).
Jamshid Sourati, Ali Gholipour, Jennifer G. Dy, Xavier Tomas-Fernandez, Sila Kurugol, Simon K. Warfield
IEEE Trans. Medical Imaging1
2018 A Probabilistic Active Learning Algorithm Based on Fisher Information Ratio
abstract
The task of labeling samples is demanding and expensive. Active learning aims to generate the smallest possible training data set that results in a classifier with high performance in the test phase. It usually consists of two steps of selecting a set of queries and requesting their labels. Among the suggested objectives to score the query sets, information theoretic measures have become very popular. Yet among them, those based on Fisher information (FI) have the advantage of considering the diversity among the queries and tractable computations. In this work, we provide a practical algorithm based on Fisher information ratio to obtain query distribution for a general framework where, in contrast to the previous FI-based querying methods, we make no assumptions over the test distribution. The empirical results on synthetic and real-world data sets indicate that this algorithm gives competitive results.
Jamshid Sourati, Murat Akçakaya, Deniz Erdogmus, Todd K. Leen, Jennifer G. Dy
IEEE Trans. Pattern Anal. Mach. Intell.1
2017 Asymptotic Analysis of Objectives Based on Fisher Information in Active Learning
abstract
Obtaining labels can be costly and time-consuming. Active learning allows a learning algorithm to intelligently query samples to be labeled for a more efficient learning. Fisher information ratio (FIR) has been used as an objective for selecting queries. However, little is known about the theory behind the use of FIR for active learning. There is a gap between the underlying theory and the motivation of its usage in practice. In this paper, we attempt to fill this gap and provide a rigorous framework for analyzing existing FIR-based active learning methods. In particular, we show that FIR can be asymptotically viewed as an upper bound of the expected variance of the log-likelihood ratio. Additionally, our analysis suggests a unifying framework that not only enables us to make theoretical comparisons among the existing querying methods based on FIR, but also allows us to give insight into the development of new active learning approaches based on this objective.
Jamshid Sourati, Murat Akçakaya, Todd K. Leen, Deniz Erdogmus, Jennifer G. Dy
J. Mach. Learn. Res.1
2014 Accelerated Learning-Based Interactive Image Segmentation Using Pairwise Constraints
abstract
Algorithms for fully automatic segmentation of images are often not sufficiently generic with suitable accuracy, and fully manual segmentation is not practical in many settings. There is a need for semiautomatic algorithms, which are capable of interacting with the user and taking into account the collected feedback. Typically, such methods have simply incorporated user feedback directly. Here, we employ active learning of optimal queries to guide user interaction. Our work in this paper is based on constrained spectral clustering that iteratively incorporates user feedback by propagating it through the calculated affinities. The original framework does not scale well to large data sets, and hence is not straightforward to apply to interactive image segmentation. In order to address this issue, we adopt advanced numerical methods for eigen-decomposition implemented over a subsampling scheme. Our key innovation, however, is an active learning strategy that chooses pairwise queries to present to the user in order to increase the rate of learning from the feedback. Performance evaluation is carried out on the Berkeley segmentation and Graz-02 image data sets, confirming that convergence to high accuracy levels is realizable in relatively few iterations.
Jamshid Sourati, Deniz Erdogmus, Jennifer G. Dy, Dana H. Brooks
IEEE Trans. Image Process.1
2012 Unsupervised wrinkle detection in reflectance confocal microscopy images of the human skin
abstract
Reflectance confocal microscopy (RCM) is a non-invasive and in-vivo imaging modality, which can take images from different depths of the human skin. A challenging problem is to detect a clinically important subsurface section of the skin, the Dermis/Epidermis junction, in RCM images. This is a tough problem because of the huge variation of texture and intensity features across both intersubject and intrasubject tissues. On the other hand, there's almost no wrinkle-free part of the skin. This well-known phenomenon can be used as a histological clue for guessing the probability of being Dermis or Epidermis in the neighboring regions. In this paper, we develop a two-step wrinkle detector for RCM images. By analyzing the results on different RCM images, we conclude it has high sensitivity and specificity, but a relatively lower Jaccard index.
Jamshid Sourati, Dana H. Brooks, Jennifer G. Dy, Esra Ataer Cansizoglu, Deniz Erdogmus, Milind Rajadhyaksha
ICASSP1