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

Hamid Jalalzai

dblp:231/7655 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
2since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 3 first-author · 2 since 2021Graphics, 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
Learning theory · 29% Representation and self-supervised learning · 19% Information extraction and text analysis · 19%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Network and information security
1 paper
Security and privacy of machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Security and privacy of machine learning
membership inference
0.612022
Leveraging Adversarial Examples to Quantify Membership Information Leakage · CVPR 2022
Data mining
anomaly detection
0.512021
Feature Clustering for Support Identification in Extreme Regions · ICML 2021
Data mining
clustering
0.512021
Feature Clustering for Support Identification in Extreme Regions · ICML 2021
Data mining › clustering
feature clustering
0.512021
Feature Clustering for Support Identification in Extreme Regions · ICML 2021
Machine learning › Representation and self-supervised learning
text embedding
0.412020
Heavy-tailed Representations, Text Polarity Classification & Data Augmentation · NeurIPS 2020
Natural language and speech › Language models and text generation
text generation
0.412020
Heavy-tailed Representations, Text Polarity Classification & Data Augmentation · NeurIPS 2020
Machine learning › Learning theory
classification
0.312018
On Binary Classification in Extreme Regions · NeurIPS 2018
Machine learning › Learning theory › high-dimensional statistics
heavy-tailed distribution
0.312018
On Binary Classification in Extreme Regions · NeurIPS 2018
Machine learning › Trustworthy machine learning › robustness
adversarial examples
0.212022
Leveraging Adversarial Examples to Quantify Membership Information Leakage · CVPR 2022
Machine learning › Probabilistic and Bayesian machine learning
extreme value theory
0.112021
Feature Clustering for Support Identification in Extreme Regions · ICML 2021

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

membership inference · 1.1adversarial perturbation · 1.1optimization-based support identification · 1.0scale invariance · 0.4multivariate extreme value theory · 0.4maximal deviation inequality · 0.3empirical risk minimization · 0.3
YearPublicationVenuePosition
2022 Leveraging Adversarial Examples to Quantify Membership Information Leakage
abstract
The use of personal data for training machine learning systems comes with a privacy threat and measuring the level of privacy of a model is one of the major challenges in machine learning today. Identifying training data based on a trained model is a standard way of measuring the privacy risks induced by the model. We develop a novel approach to address the problem of membership inference in pattern recognition models, relying on information provided by adversarial examples. The strategy we propose consists of measuring the magnitude of a perturbation necessary to build an adversarial example. Indeed, we argue that this quantity reflects the likelihood of belonging to the training data. Extensive numerical experiments on multivariate data and an array of state-of-the-art target models show that our method performs comparable or even outperforms state-of-the-art strategies, but without requiring any additional training samples.
Ganesh Del Grosso, Hamid Jalalzai, Georg Pichler, Catuscia Palamidessi, Pablo Piantanida
CVPR2
2021 Feature Clustering for Support Identification in Extreme Regions
abstract
Understanding the complex structure of multivariate extremes is a major challenge in various fields from portfolio monitoring and environmental risk management to insurance. In the framework of multivariate Extreme Value Theory, a common characterization of extremes’ dependence structure is the angular measure. It is a suitable measure to work in extreme regions as it provides meaningful insights concerning the subregions where extremes tend to concentrate their mass. The present paper develops a novel optimization-based approach to assess the dependence structure of extremes. This support identification scheme rewrites as estimating clusters of features which best capture the support of extremes. The dimension reduction technique we provide is applied to statistical learning tasks such as feature clustering and anomaly detection. Numerical experiments provide strong empirical evidence of the relevance of our approach.
Hamid Jalalzai, Rémi Leluc
ICML1
2020 Heavy-tailed Representations, Text Polarity Classification & Data Augmentation
abstract
The dominant approaches to text representation in natural language rely on learning embeddings on massive corpora which have convenient properties such as compositionality and distance preservation. In this paper, we develop a novel method to learn a heavy-tailed embedding with desirable regularity properties regarding the distributional tails, which allows to analyze the points far away from the distribution bulk using the framework of multivariate extreme value theory. In particular, a classifier dedicated to the tails of the proposed embedding is obtained which exhibits a scale invariance property exploited in a novel text generation method for label preserving dataset augmentation. Experiments on synthetic and real text data show the relevance of the proposed framework and confirm that this method generates meaningful sentences with controllable attribute, e.g. positive or negative sentiments.
Hamid Jalalzai, Pierre Colombo, Chloé Clavel, Éric Gaussier, Giovanna Varni, Emmanuel Vignon, Anne Sabourin
NeurIPS1
2018 On Binary Classification in Extreme Regions
abstract
In pattern recognition, a random label Y is to be predicted based upon observing a random vector X valued in $\mathbb{R}^d$ with d>1 by means of a classification rule with minimum probability of error. In a wide variety of applications, ranging from finance/insurance to environmental sciences through teletraffic data analysis for instance, extreme (i.e. very large) observations X are of crucial importance, while contributing in a negligible manner to the (empirical) error however, simply because of their rarity. As a consequence, empirical risk minimizers generally perform very poorly in extreme regions. It is the purpose of this paper to develop a general framework for classification in the extremes. Precisely, under non-parametric heavy-tail assumptions for the class distributions, we prove that a natural and asymptotic notion of risk, accounting for predictive performance in extreme regions of the input space, can be defined and show that minimizers of an empirical version of a non-asymptotic approximant of this dedicated risk, based on a fraction of the largest observations, lead to classification rules with good generalization capacity, by means of maximal deviation inequalities in low probability regions. Beyond theoretical results, numerical experiments are presented in order to illustrate the relevance of the approach developed.
Hamid Jalalzai, Stéphan Clémençon, Anne Sabourin
NeurIPS1