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

Tal Reiss

dblp:276/6114 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 3 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
2 papers
Time series and sequential data · 70% Representation and self-supervised learning · 23% Transfer learning and domain adaptation · 7%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Time series and sequential data
anomaly detection
1.222023
Mean-Shifted Contrastive Loss for Anomaly Detection · AAAI 2023
PANDA: Adapting Pretrained Features for Anomaly Detection and Segmentation · CVPR 2021
Machine learning › Representation and self-supervised learning
contrastive learning
0.712023
Mean-Shifted Contrastive Loss for Anomaly Detection · AAAI 2023
Machine learning › Time series and sequential data › anomaly detection
deep anomaly detection
0.712023
Mean-Shifted Contrastive Loss for Anomaly Detection · AAAI 2023
Information retrieval › evaluation
benchmark dataset
0.712023
Efficient Discovery and Effective Evaluation of Visual Perceptual Similarity: A Benchmark and Beyond · ICCV 2023
Information retrieval › similarity measure
image similarity
0.712023
Efficient Discovery and Effective Evaluation of Visual Perceptual Similarity: A Benchmark and Beyond · ICCV 2023
Machine learning › Time series and sequential data › anomaly detection
one-class classification
0.112021
PANDA: Adapting Pretrained Features for Anomaly Detection and Segmentation · CVPR 2021

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

labeling procedure · 0.7fine-tuning · 0.7evaluation metrics · 0.7contrastive learning · 0.7self-supervised pretraining · 0.5elastic regularization · 0.5early stopping · 0.5DeepSVDD · 0.5
YearPublicationVenuePosition
2023 Mean-Shifted Contrastive Loss for Anomaly Detection
abstract
Deep anomaly detection methods learn representations that separate between normal and anomalous images. Although self-supervised representation learning is commonly used, small dataset sizes limit its effectiveness. It was previously shown that utilizing external, generic datasets (e.g. ImageNet classification) can significantly improve anomaly detection performance. One approach is outlier exposure, which fails when the external datasets do not resemble the anomalies. We take the approach of transferring representations pre-trained on external datasets for anomaly detection. Anomaly detection performance can be significantly improved by fine-tuning the pre-trained representations on the normal training images. In this paper, we first demonstrate and analyze that contrastive learning, the most popular self-supervised learning paradigm cannot be naively applied to pre-trained features. The reason is that pre-trained feature initialization causes poor conditioning for standard contrastive objectives, resulting in bad optimization dynamics. Based on our analysis, we provide a modified contrastive objective, the Mean-Shifted Contrastive Loss. Our method is highly effective and achieves a new state-of-the-art anomaly detection performance including 98.6% ROC-AUC on the CIFAR-10 dataset.
Tal Reiss, Yedid Hoshen
AAAI1
2023 Efficient Discovery and Effective Evaluation of Visual Perceptual Similarity: A Benchmark and Beyond
abstract
Visual similarity discovery (VSD) is an important task with broad e-commerce applications. Given an image of a certain object, the goal of VSD is to retrieve images of different objects with high perceptual visual similarity. Although being a highly addressed problem, the evaluation of proposed methods for VSD is often based on a proxy of an identification-retrieval task, evaluating the ability of a model to retrieve different images of the same object. We posit that evaluating VSD methods based on identification tasks is limited, and faithful evaluation must rely on expert annotations. In this paper, we introduce the first large-scale fashion visual similarity benchmark dataset, consisting of more than 110K expert-annotated image pairs. Besides this major contribution, we share insight from the challenges we faced while curating this dataset. Based on these insights, we propose a novel and efficient labeling procedure that can be applied to any dataset. Our analysis examines its limitations and inductive biases, and based on these findings, we propose metrics to mitigate those limitations. Though our primary focus lies on visual similarity, the methodologies we present have broader applications for discovering and evaluating perceptual similarity across various domains.
Oren Barkan, Tal Reiss, Jonathan Weill, Ori Katz, Roy Hirsch, Itzik Malkiel, Noam Koenigstein
ICCV2
2021 PANDA: Adapting Pretrained Features for Anomaly Detection and Segmentation
abstract
Anomaly detection methods require high-quality features. In recent years, the anomaly detection community has attempted to obtain better features using advances in deep self-supervised feature learning. Surprisingly, a very promising direction, using pre-trained deep features, has been mostly overlooked. In this paper, we first empirically establish the perhaps expected, but unreported result, that combining pre-trained features with simple anomaly detection and segmentation methods convincingly outperforms, much more complex, state-of-the-art methods.In order to obtain further performance gains in anomaly detection, we adapt pre-trained features to the target distribution. Although transfer learning methods are well established in multi-class classification problems, the one-class classification (OCC) setting is not as well explored. It turns out that naive adaptation methods, which typically work well in supervised learning, often result in catastrophic collapse (feature deterioration) and reduce performance in OCC settings. A popular OCC method, DeepSVDD, advocates using specialized architectures, but this limits the adaptation performance gain. We propose two methods for combating collapse: i) a variant of early stopping that dynamically learns the stopping iteration ii) elastic regularization inspired by continual learning. Our method, PANDA, outperforms the state-of-the-art in the OCC, outlier exposure and anomaly segmentation settings by large margins1.
Tal Reiss, Niv Cohen, Liron Bergman, Yedid Hoshen
CVPR1