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

Maya Kabkab

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

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

Artificial intelligence and machine learning · 4 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 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
3 papers
Generative modeling · 30% Trustworthy machine learning · 26% 3D vision · 23%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
depth estimation
0.612022
R4D: Utilizing Reference Objects for Long-Range Distance Estimation · ICLR 2022
Machine learning › Trustworthy machine learning › adversarial machine learning
adversarial defense
0.312018
Defense-GAN: Protecting Classifiers Against Adversarial Attacks Using Generative Models · ICLR (Poster) 2018
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.312018
Defense-GAN: Protecting Classifiers Against Adversarial Attacks Using Generative Models · ICLR (Poster) 2018
Machine learning › Generative modeling
generative adversarial network
0.312018
Defense-GAN: Protecting Classifiers Against Adversarial Attacks Using Generative Models · ICLR (Poster) 2018
Computer vision › Image recognition and object detection
task-aware reconstruction
0.312018
Task-Aware Compressed Sensing With Generative Adversarial Networks · AAAI 2018
Computer vision › Image recognition and object detection
object detection
0.212022
R4D: Utilizing Reference Objects for Long-Range Distance Estimation · ICLR 2022
Machine learning › Generative modeling
latent space regularization
0.112018
Task-Aware Compressed Sensing With Generative Adversarial Networks · AAAI 2018

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

generative adversarial network · 0.7reference object utilization · 0.6compressed sensing · 0.3
YearPublicationVenuePosition
2022 R4D: Utilizing Reference Objects for Long-Range Distance Estimation
Yingwei Li 0002, Tiffany L. Chen, Maya Kabkab, Ruichi Yu, Longlong Jing, Yurong You, Hang Zhao 0021
ICLR3
2018 Task-Aware Compressed Sensing With Generative Adversarial Networks
abstract
In recent years, neural network approaches have been widely adopted for machine learning tasks, with applications in computer vision. More recently, unsupervised generative models based on neural networks have been successfully applied to model data distributions via low-dimensional latent spaces. In this paper, we use Generative Adversarial Networks (GANs) to impose structure in compressed sensing problems, replacing the usual sparsity constraint. We propose to train the GANs in a task-aware fashion, specifically for reconstruction tasks. We also show that it is possible to train our model without using any (or much) non-compressed data. Finally, we show that the latent space of the GAN carries discriminative information and can further be regularized to generate input features for general inference tasks. We demonstrate the effectiveness of our method on a variety of reconstruction and classification problems.
Maya Kabkab, Pouya Samangouei, Rama Chellappa
AAAI1
2018 Defense-GAN: Protecting Classifiers Against Adversarial Attacks Using Generative Models
Pouya Samangouei, Maya Kabkab, Rama Chellappa
ICLR (Poster)2
2016 On the size of Convolutional Neural Networks and generalization performance
abstract
While Convolutional Neural Networks (CNNs) have recently achieved impressive results on many classification tasks, it is still unclear why they perform so well and how to properly design them. In this work, we investigate the effect of the convolutional depth of a CNN on its generalization performance for binary classification problems. We prove a sufficient condition -polynomial in the depth of the CNN- on the training database size to guarantee such performance. We empirically test our theory on the problem of gender classification and explore the effect of varying the CNN depth, as well as the training distribution and set size.
Maya Kabkab, Emily Morgan Hand, Rama Chellappa
ICPR1