Orpaz Goldstein

dblp:212/0896 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
2since 2021 · last 2023
0000-0002-9764-1618ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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
2 papers
Trustworthy machine learning · 40% Learning paradigms · 26% Probabilistic and Bayesian machine learning · 20%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › missing data
missing data imputation
0.612022
Generative Imputation and Stochastic Prediction · IEEE Trans. Pattern Anal. Mach. Intell. 2022
Machine learning › Trustworthy machine learning › uncertainty estimation › uncertainty-aware learning
uncertainty-aware classification
0.612022
Generative Imputation and Stochastic Prediction · IEEE Trans. Pattern Anal. Mach. Intell. 2022
Machine learning › Trustworthy machine learning
uncertainty estimation
0.612022
Generative Imputation and Stochastic Prediction · IEEE Trans. Pattern Anal. Mach. Intell. 2022
Machine learning › Learning theory › query learning
budgeted learning
0.412019
Opportunistic Learning: Budgeted Cost-Sensitive Learning from Data Streams · ICLR (Poster) 2019
Machine learning › Learning paradigms
cost-sensitive learning
0.412019
Opportunistic Learning: Budgeted Cost-Sensitive Learning from Data Streams · ICLR (Poster) 2019
Machine learning › Learning paradigms › incremental learning
streaming learning
0.412019
Opportunistic Learning: Budgeted Cost-Sensitive Learning from Data Streams · ICLR (Poster) 2019

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

predictor networks · 0.6generative adversarial network · 0.6discriminator network · 0.6opportunistic learning · 0.4
YearPublicationVenuePosition
2023 Semantics Guided Contrastive Learning of Transformers for Zero-shot Temporal Activity Detection
abstract
Zero-shot temporal activity detection (ZSTAD) is the problem of simultaneous temporal localization and classification of activity segments that are previously unseen during training. This is achieved by transferring the knowledge learned from semantically-related seen activities. This ability to reason about unseen concepts without supervision makes ZSTAD very promising for applications where the acquisition of annotated training videos is difficult. In this paper, we design a transformer-based framework titled TranZAD, which streamlines the detection of unseen activities by casting ZSTAD as a direct set-prediction problem, removing the need for hand-crafted designs and manual post-processing. We show how a semantic information-guided contrastive learning strategy can effectively train TranZAD for the zero-shot setting, enabling the efficient transfer of knowledge from the seen to the unseen activities. To reduce confusion between unseen activities and unrelated background information in videos, we introduce a more efficient method of computing the background class embedding by dynamically adapting it as part of the end-to-end learning. Additionally, unlike existing work on ZSTAD, we do not assume the knowledge of which classes are unseen during training and use the visual and semantic information of only the seen classes for the knowledge transfer. This makes TranZAD more viable for practical scenarios, which we evaluate by conducting extensive experiments on Thumos’14 and Charades.
Sayak Nag, Orpaz Goldstein, Amit K. Roy-Chowdhury
WACV2
2022 Generative Imputation and Stochastic Prediction
abstract
In many machine learning applications, we are faced with incomplete datasets. In the literature, missing data imputation techniques have been mostly concerned with filling missing values. However, the existence of missing values is synonymous with uncertainties not only over the distribution of missing values but also over target class assignments that require careful consideration. In this paper, we propose a simple and effective method for imputing missing features and estimating the distribution of target assignments given incomplete data. In order to make imputations, we train a simple and effective generator network to generate imputations that a discriminator network is tasked to distinguish. Following this, a predictor network is trained using the imputed samples from the generator network to capture the classification uncertainties and make predictions accordingly. The proposed method is evaluated on CIFAR-10 and MNIST image datasets as well as five real-world tabular classification datasets, under different missingness rates and structures. Our experimental results show the effectiveness of the proposed method in generating imputations as well as providing estimates for the class uncertainties in a classification task when faced with missing values.
Mohammad Kachuee, Kimmo Kärkkäinen, Orpaz Goldstein, Sajad Darabi, Majid Sarrafzadeh
IEEE Trans. Pattern Anal. Mach. Intell.3
2020 Target-Focused Feature Selection Using Uncertainty Measurements in Healthcare Data
abstract
Healthcare big data remains under-utilized due to various incompatibility issues between the domains of data analytics and healthcare. The lack of generalizable iterative feature acquisition methods under budget and machine learning models that allow reasoning with a model’s uncertainty are two examples. Meanwhile, a boost to the available data is currently under way with the rapid growth in the Internet of Things applications and personalized healthcare. For the healthcare domain to be able to adopt models that take advantage of this big data, machine learning models should be coupled with more informative, germane feature acquisition methods, consequently adding robustness to the model’s results. We introduce an approach to feature selection that is based on Bayesian learning, allowing us to report the level of uncertainty in the model, combined with false-positive and false-negative rates. In addition, measuring target-specific uncertainty lifts the restriction on feature selection being target agnostic, allowing for feature acquisition based on a target of focus. We show that acquiring features for a specific target is at least as good as deep learning feature selection methods and common linear feature selection approaches for small non-sparse datasets, and surpasses these when faced with real-world data that is larger in scale and sparseness.
Orpaz Goldstein, Mohammad Kachuee, Kimmo Kärkkäinen, Majid Sarrafzadeh
ACM Trans. Comput. Heal.1
2019 Opportunistic Learning: Budgeted Cost-Sensitive Learning from Data Streams
Mohammad Kachuee, Orpaz Goldstein, Kimmo Kärkkäinen, Sajad Darabi, Majid Sarrafzadeh
ICLR (Poster)2