Demo Data from EDBT 2026 / reviewers in the wild / expert
Antonio Barbalau
dblp:267/1609
· DBLP profile ↗
6ranked-venue papers
3as first author
4since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 6 · 3 first-author · 4 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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
4 papers |
Trustworthy machine learning · 35% Information extraction and text analysis · 24% Video understanding and tracking · 10% | |
| Network and information security
2 papers |
Digital forensics and information hiding · 57% Security and privacy of machine learning · 43% |
Topics — the 11 heaviest of 14, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Information extraction and text analysis › text mining › authorship analysis
authorship verification |
0.6 | 1 | 2022 | Rethinking the Authorship Verification Experimental Setups · EMNLP 2022 |
Machine learning › Trustworthy machine learning › fairness
bias evaluation |
0.6 | 1 | 2022 | Rethinking the Authorship Verification Experimental Setups · EMNLP 2022 |
Machine learning › Trustworthy machine learning › interpretability
explainable AI |
0.6 | 1 | 2022 | Rethinking the Authorship Verification Experimental Setups · EMNLP 2022 |
Machine learning › Trustworthy machine learning
interpretability |
0.6 | 1 | 2022 | Rethinking the Authorship Verification Experimental Setups · EMNLP 2022 |
Natural language and speech › Information extraction and text analysis › text mining
stylometry |
0.6 | 1 | 2022 | VeriDark: A Large-Scale Benchmark for Authorship Verification on the Dark Web · NeurIPS 2022 |
Digital forensics and information hiding › authorship attribution
authorship verification |
0.6 | 1 | 2022 | VeriDark: A Large-Scale Benchmark for Authorship Verification on the Dark Web · NeurIPS 2022 |
Machine learning › Representation and self-supervised learning › representation learning › joint representation learning › multi-task representation learning
multi-task self-supervised learning |
0.5 | 1 | 2021 | Anomaly Detection in Video via Self-Supervised and Multi-Task Learning · CVPR 2021 |
Computer vision › Video understanding and tracking
video anomaly detection |
0.5 | 1 | 2021 | Anomaly Detection in Video via Self-Supervised and Multi-Task Learning · CVPR 2021 |
Machine learning › Efficient and distributed learning › model compression
knowledge distillation |
0.4 | 1 | 2020 | Black-Box Ripper: Copying black-box models using generative evolutionary algorithms · NeurIPS 2020 |
Machine learning › Deep learning architectures and training
teacher-student framework |
0.4 | 1 | 2020 | Black-Box Ripper: Copying black-box models using generative evolutionary algorithms · NeurIPS 2020 |
Security and privacy of machine learning
model stealing |
0.4 | 1 | 2020 | Black-Box Ripper: Copying black-box models using generative evolutionary algorithms · NeurIPS 2020 |
Methods — techniques the papers use, named apart from their topics
knowledge distillation · 1.4NLP baselines · 1.1explainable AI · 0.6BERT · 0.6object detection · 0.53d convolutional neural network · 0.5evolutionary strategy · 0.4evolutionary strategies · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | SSMTL++: Revisiting self-supervised multi-task learning for video anomaly detection
Antonio Barbalau, Radu Tudor Ionescu, Mariana-Iuliana Georgescu, Jacob V. Dueholm, Bharathkumar Ramachandra, Kamal Nasrollahi, Fahad Shahbaz Khan, Thomas B. Moeslund, Mubarak Shah |
Comput. Vis. Image Underst. | 1 |
| 2022 | Rethinking the Authorship Verification Experimental SetupsabstractOne of the main drivers of the recent advances in authorship verification is the PAN large-scale authorship dataset.Despite generating significant progress in the field, inconsistent performance differences between the closed and open test sets have been reported.To this end, we improve the experimental setup by proposing five new public splits over the PAN dataset, specifically designed to isolate and identify biases related to the text topic and to the author's writing style.We evaluate several BERT-like baselines on these splits, showing that such models are competitive with authorship verification state-of-the-art methods.Furthermore, using explainable AI, we find that these baselines are biased towards named entities.We show that models trained without the named entities obtain better results and generalize better when tested on DarkReddit, our new dataset for authorship verification.Test split O2D2 * O2D2 BERT Naive † Comp.† Closed 93.5 96.4 95.6 75.6 72.2 Clopen 94.0 96.0 97.4 74.1 71.1 Open UA 92.6 92.6 90.2 78.6 68.5 Open UF 91.4 95.1 91.6 79.9 79.0 Open All 80.6 67.5 88.7 75.6 76.9 PAN Closed 93.3 93.5 -74.7 74.2 PAN Open 93.3 94.4 -75.3 74. Florin Brad, Andrei Manolache, Elena Burceanu, Antonio Barbalau, Radu Tudor Ionescu, Marius Popescu |
EMNLP | 4 |
| 2022 | VeriDark: A Large-Scale Benchmark for Authorship Verification on the Dark WebabstractThe Dark Web represents a hotbed for illicit activity, where users communicate on different market forums in order to exchange goods and services. Law enforcement agencies benefit from forensic tools that perform authorship analysis, in order to identify and profile users based on their textual content. However, authorship analysis has been traditionally studied using corpora featuring literary texts such as fragments from novels or fan fiction, which may not be suitable in a cybercrime context. Moreover, the few works that employ authorship analysis tools for cybercrime prevention usually employ ad-hoc experimental setups and datasets. To address these issues, we release VeriDark: a benchmark comprised of three large scale authorship verification datasets and one authorship identification dataset obtained from user activity from either Dark Web related Reddit communities or popular illicit Dark Web market forums. We evaluate competitive NLP baselines on the three datasets and perform an analysis of the predictions to better understand the limitations of such approaches. We make the datasets and baselines publicly available at https://github.com/bit-ml/VeriDark . Andrei Manolache, Florin Brad, Antonio Barbalau, Radu Tudor Ionescu, Marius Popescu |
NeurIPS | 3 |
| 2021 | Anomaly Detection in Video via Self-Supervised and Multi-Task LearningabstractAnomaly detection in video is a challenging computer vision problem. Due to the lack of anomalous events at training time, anomaly detection requires the design of learning methods without full supervision. In this paper, we approach anomalous event detection in video through self-supervised and multi-task learning at the object level. We first utilize a pre-trained detector to detect objects. Then, we train a 3D convolutional neural network to produce discriminative anomaly-specific information by jointly learning multiple proxy tasks: three self-supervised and one based on knowledge distillation. The self-supervised tasks are: (i) discrimination of forward/backward moving objects (arrow of time), (ii) discrimination of objects in consecutive/intermittent frames (motion irregularity) and (iii) reconstruction of object-specific appearance information. The knowledge distillation task takes into account both classification and detection information, generating large prediction discrepancies between teacher and student models when anomalies occur. To the best of our knowledge, we are the first to approach anomalous event detection in video as a multi-task learning problem, integrating multiple self-supervised and knowledge distillation proxy tasks in a single architecture. Our lightweight architecture outperforms the state-of-the-art methods on three benchmarks: Avenue, ShanghaiTech and UCSD Ped2. Additionally, we perform an ablation study demonstrating the importance of integrating self-supervised learning and normality-specific distillation in a multi-task learning setting. Mariana-Iuliana Georgescu, Antonio Barbalau, Radu Tudor Ionescu, Fahad Shahbaz Khan, Marius Popescu, Mubarak Shah |
CVPR | 2 |
| 2020 | Black-Box Ripper: Copying black-box models using generative evolutionary algorithmsabstractWe study the task of replicating the functionality of black-box neural models, for which we only know the output class probabilities provided for a set of input images. We assume back-propagation through the black-box model is not possible and its training images are not available, e.g. the model could be exposed only through an API. In this context, we present a teacher-student framework that can distill the black-box (teacher) model into a student model with minimal accuracy loss. To generate useful data samples for training the student, our framework (i) learns to generate images on a proxy data set (with images and classes different from those used to train the black-box) and (ii) applies an evolutionary strategy to make sure that each generated data sample exhibits a high response for a specific class when given as input to the black box. Our framework is compared with several baseline and state-of-the-art methods on three benchmark data sets. The empirical evidence indicates that our model is superior to the considered baselines. Although our method does not back-propagate through the black-box network, it generally surpasses state-of-the-art methods that regard the teacher as a glass-box model. Our code is available at: https://github.com/antoniobarbalau/black-box-ripper. Antonio Barbalau, Adrian Cosma, Radu Tudor Ionescu, Marius Popescu |
NeurIPS | 1 |
| 2020 | A Generic and Model-Agnostic Exemplar Synthetization Framework for Explainable AI
Antonio Barbalau, Adrian Cosma, Radu Tudor Ionescu, Marius Popescu |
ECML/PKDD (2) | 1 |