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

Yuval Benjamini

dblp:182/2094 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
4since 2021 · last 2024
—ORCID · unresolved

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

Artificial intelligence and machine learning · 4 · 3 since 2021Applied, interdisciplinary, general and emerging computing · 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
Trustworthy machine learning · 43% Learning theory · 25% Transfer learning and domain adaptation · 16%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 87% Computational science and engineering · 13%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
out-of-distribution generalization
0.812024
Class Distribution Shifts in Zero-Shot Learning: Learning Robust Representations · NeurIPS 2024
Machine learning › Trustworthy machine learning
robustness
0.812024
Class Distribution Shifts in Zero-Shot Learning: Learning Robust Representations · NeurIPS 2024
Machine learning › Representation and self-supervised learning › representation learning
robust representation learning
0.812024
Class Distribution Shifts in Zero-Shot Learning: Learning Robust Representations · NeurIPS 2024
Machine learning › Transfer learning and domain adaptation
zero-shot learning
0.812024
Class Distribution Shifts in Zero-Shot Learning: Learning Robust Representations · NeurIPS 2024
Bioinformatics and computational biology › epigenomics
DNA methylation
0.612022
Modeling dependency structures in 450k DNA methylation data · Bioinform. 2022
Bioinformatics and computational biology
epigenomics
0.612022
Modeling dependency structures in 450k DNA methylation data · Bioinform. 2022
Machine learning › Trustworthy machine learning › open-world recognition
open-set recognition
0.512021
Predicting Classification Accuracy When Adding New Unobserved Classes · ICLR 2021
Machine learning › Learning theory
classification
0.312018
Extrapolating Expected Accuracies for Large Multi-Class Problems · J. Mach. Learn. Res. 2018
Computational science and engineering › spatial statistics
spatial dependency modeling
0.212022
Modeling dependency structures in 450k DNA methylation data · Bioinform. 2022

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

hierarchical sampling · 0.8environment balancing penalization · 0.8statistical modeling · 0.6classification accuracy prediction · 0.5nonparametric regression · 0.3
YearPublicationVenuePosition
2024 Confident Feature Ranking
abstract
Machine learning models are widely applied in various fields. Stakeholders often use post-hoc feature importance methods to better understand the input features’ contribution to the models’ predictions. The interpretation of the importance values provided by these methods is frequently based on the relative order of the features (their ranking) rather than the importance values themselves. Since the order may be unstable, we present a framework for quantifying the uncertainty in global importance values. We propose a novel method for the post-hoc interpretation of feature importance values that is based on the framework and pairwise comparisons of the feature importance values. This method produces simultaneous confidence intervals for the features’ ranks, which include the “true” (infinite sample) ranks with high probability, and enables the selection of the set of top-k important features.
Bitya Neuhof, Yuval Benjamini
AISTATS2
2024 Class Distribution Shifts in Zero-Shot Learning: Learning Robust Representations
abstract
Zero-shot learning methods typically assume that the new, unseen classes encountered during deployment come from the same distribution as the the classes in the training set. However, real-world scenarios often involve class distribution shifts (e.g., in age or gender for person identification), posing challenges for zero-shot classifiers that rely on learned representations from training classes. In this work, we propose and analyze a model that assumes that the attribute responsible for the shift is unknown in advance. We show that in this setting, standard training may lead to non-robust representations. To mitigate this, we develop an algorithm for learning robust representations in which (a) synthetic data environments are constructed via hierarchical sampling, and (b) environment balancing penalization, inspired by out-of-distribution problems, is applied. We show that our algorithm improves generalization to diverse class distributions in both simulations and experiments on real-world datasets.
Yuli Slavutsky, Yuval Benjamini
NeurIPS2
2022 Modeling dependency structures in 450k DNA methylation data
abstract
MOTIVATION: DNA methylation has been shown to be spatially dependent across chromosomes. Previous studies have focused on the influence of genomic context on the dependency structure, while not considering differences in dependency structure between individuals. RESULTS: We modeled spatial dependency with a flexible framework to quantify the dependency structure, focusing on inter-individual differences by exploring the association between dependency parameters and technical and biological variables. The model was applied to a subset of the Finnish Twin Cohort study (N = 1611 individuals). The estimates of the dependency parameters varied considerably across individuals, but were generally consistent across chromosomes within individuals. The variation in dependency parameters was associated with bisulfite conversion plate, zygosity, sex and age. The age differences presumably reflect accumulated environmental exposures and/or accumulated small methylation differences caused by stochastic mitotic events, establishing recognizable, individual patterns more strongly seen in older individuals. AVAILABILITY AND IMPLEMENTATION: The twin dataset used in the current study are located in the Biobank of the National Institute for Health and Welfare, Finland. All the biobanked data are publicly available for use by qualified researchers following a standardized application procedure (https://thl.fi/en/web/thl-biobank/for-researchers). A R-script for fitting the dependency structure to publicly available DNA methylation data with the software used in this article is provided in supplementary data. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Haakon E. Nustad, Ingelin Steinsland, Miina Ollikainen, Emma Cazaly, Jaakko Kaprio, Yuval Benjamini, Kristina Gervin, Robert Lyle
Bioinform.6
2021 Predicting Classification Accuracy When Adding New Unobserved Classes
Yuli Slavutsky, Yuval Benjamini
ICLR2
2018 Extrapolating Expected Accuracies for Large Multi-Class Problems
abstract
The difficulty of multi-class classification generally increases with the number of classes. Using data for a small set of the classes, can we predict how well the classifier scales as the number of classes increases? We propose a framework for studying this question, assuming that classes in both sets are sampled from the same population and that the classifier is based on independently learned scoring functions. Under this framework, we can express the classification accuracy on a set of $k$ classes as the $(k - 1)$st moment of a discriminability function; the discriminability function itself does not depend on $k$. We leverage this result to develop a non-parametric regression estimator for the discriminability function, which can extrapolate accuracy results to larger unobserved sets. We also formalize an alternative approach that extrapolates accuracy separately for each class, and identify tradeoffs between the two methods. We show that both methods can accurately predict classifier performance on label sets up to ten times the size of the original set, both in simulations as well as in realistic face recognition or character recognition tasks.
Charles Zheng 0001, Rakesh Achanta, Yuval Benjamini
J. Mach. Learn. Res.3