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

Mariya I. Vasileva

dblp:217/2360 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
2since 2021 · last 2023
0009-0008-8410-7871ORCID · reported

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

Artificial intelligence and machine learning · 5 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 5 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 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
5 papers
Trustworthy machine learning · 29% Representation and self-supervised learning · 22% Generative modeling · 13%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
depth estimation
0.712023
HandsOff: Labeled Dataset Generation With No Additional Human Annotations · CVPR 2023
Computer vision › Segmentation and scene understanding
semantic segmentation
0.712023
HandsOff: Labeled Dataset Generation With No Additional Human Annotations · CVPR 2023
Machine learning › Trustworthy machine learning › fairness
algorithmic fairness
0.412020
The Dark Side of Machine Learning Algorithms: How and Why They Can Leverage Bias, and What Can Be Done to Pursue Algorithmic Fairness · KDD 2020
Machine learning › Trustworthy machine learning
fairness
0.412020
The Dark Side of Machine Learning Algorithms: How and Why They Can Leverage Bias, and What Can Be Done to Pursue Algorithmic Fairness · KDD 2020
Machine learning › Trustworthy machine learning
interpretability
0.412020
Why Do These Match? Explaining the Behavior of Image Similarity Models · ECCV (11) 2020
Machine learning › Representation and self-supervised learning › representation learning › metric learning
conditional similarity learning
0.412019
Learning Similarity Conditions Without Explicit Supervision · ICCV 2019
Machine learning › Representation and self-supervised learning › representation learning
metric learning
0.412019
Learning Similarity Conditions Without Explicit Supervision · ICCV 2019
Machine learning › Trustworthy machine learning › fairness › algorithmic bias
bias in machine learning
0.112020
The Dark Side of Machine Learning Algorithms: How and Why They Can Leverage Bias, and What Can Be Done to Pursue Algorithmic Fairness · KDD 2020
Computer vision › Image recognition and object detection
image similarity
0.112020
Why Do These Match? Explaining the Behavior of Image Similarity Models · ECCV (11) 2020

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

generative adversarial network · 0.7GAN inversion · 0.7latent variable modeling · 0.4contrastive learning · 0.4metric learning · 0.3
YearPublicationVenuePosition
2023 HandsOff: Labeled Dataset Generation With No Additional Human Annotations
abstract
Recent work leverages the expressive power of generative adversarial networks (GANs) to generate labeled synthetic datasets. These dataset generation methods often require new annotations of synthetic images, which forces practitioners to seek out annotators, curate a set of synthetic images, and ensure the quality of generated labels. We introduce the HandsOff framework, a technique capable of producing an unlimited number of synthetic images and corresponding labels after being trained on less than 50 preexisting labeled images. Our framework avoids the practical drawbacks of prior work by unifying the field of GAN inversion with dataset generation. We generate datasets with rich pixel-wise labels in multiple challenging domains such as faces, cars, full-body human poses, and urban driving scenes. Our method achieves state-of-the-art performance in semantic segmentation, keypoint detection, and depth estimation compared to prior dataset generation approaches and transfer learning baselines. We additionally showcase its ability to address broad challenges in model development which stem from fixed, hand-annotated datasets, such as the long-tail problem in semantic segmentation. Project page: austinxu87.github.io/handsoff.
Austin Xu, Mariya I. Vasileva, Achal Dave, Arjun Seshadri
CVPR2
2023 OutfitTransformer: Learning Outfit Representations for Fashion Recommendation
abstract
Learning an effective outfit-level representation is critical for predicting the compatibility of items in an outfit, and retrieving complementary items for a partial outfit. We present a framework, OutfitTransformer, that uses the pro-posed task-specific tokens and leverages the self-attention mechanism to learn effective outfit-level representations en-coding the compatibility relations between all items in the entire outfit for addressing both compatibility prediction and complementary item retrieval. For compatibility pre-diction, we design an outfit token to capture a global out-fit representation and train the framework using a classification loss. For complementary item retrieval, we design a target item token that additionally takes the target item specification (in the form of a category or text description) into consideration. We train our framework using a pro-posed set-wise outfit ranking loss to generate a target item embedding given an outfit, and a target item specification as inputs. The generated target item embedding is then used to retrieve compatible items that match the rest of the out-fit. Additionally, we adopt a pre-training approach and a curriculum learning strategy to improve retrieval performance. Experiments show that our approach outperforms state-of-the-art methods on compatibility prediction, fill-in-the-blank, and complementary item retrieval tasks.
Rohan Sarkar, Navaneeth Bodla, Mariya I. Vasileva, Yen-Liang Lin, Anurag Beniwal, Alan Lu, Gérard G. Medioni
WACV3
2020 Why Do These Match? Explaining the Behavior of Image Similarity Models
Bryan A. Plummer, Mariya I. Vasileva, Vitali Petsiuk, Kate Saenko, David A. Forsyth
ECCV (11)2
2020 The Dark Side of Machine Learning Algorithms: How and Why They Can Leverage Bias, and What Can Be Done to Pursue Algorithmic Fairness
abstract
Machine learning and access to big data are revolutionizing the way many industries operate, providing analytics and automation to many aspects of real-world practical tasks that were previously thought to be necessarily manual. With the pervasiveness of artificial intelligence and machine learning over the past decade, and their epidemic spread in a variety of applications, algorithmic fairness has become a prominent open research problem. For instance, machine learning is used in courts to assess the probability that a defendant recommits a crime; in the medical domain to assist with diagnosis or predict predisposition to certain diseases; in social welfare systems; and autonomous vehicles. The decision making processes in these real-world applications have a direct effect on people's lives, and can cause harm to society if the machine learning algorithms deployed are not designed with considerations to fairness.
Mariya I. Vasileva
KDD1
2019 Learning Similarity Conditions Without Explicit Supervision
abstract
Many real-world tasks require models to compare images along multiple similarity conditions (e.g. similarity in color, category or shape). Existing methods often reason about these complex similarity relationships by learning condition-aware embeddings. While such embeddings aid models in learning different notions of similarity, they also limit their capability to generalize to unseen categories since they require explicit labels at test time. To address this deficiency, we propose an approach that jointly learns representations for the different similarity conditions and their contributions as a latent variable without explicit supervision. Comprehensive experiments across three datasets, Polyvore-Outfits, Maryland-Polyvore and UT-Zappos50k, demonstrate the effectiveness of our approach: our model outperforms the state-of-the-art methods, even those that are strongly supervised with pre-defined similarity conditions, on fill-in-the-blank, outfit compatibility prediction and triplet prediction tasks. Finally, we show that our model learns different visually-relevant semantic sub-spaces that allow it to generalize well to unseen categories.
Reuben Tan, Mariya I. Vasileva, Kate Saenko, Bryan A. Plummer
ICCV2
2018 Learning Type-Aware Embeddings for Fashion Compatibility
Mariya I. Vasileva, Bryan A. Plummer, Krishna Dusad, Shreya Rajpal, Ranjitha Kumar, David A. Forsyth
ECCV (16)1