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.

Debojyoti Dey

dblp:207/8406 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0002-7579-3450ORCID · reported

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

Artificial intelligence and machine learning · 1 · 1 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
1 paper
Probabilistic and Bayesian machine learning · 50% Learning theory · 50%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression
generalized linear model
0.712023
Corruption-Tolerant Algorithms for Generalized Linear Models · AAAI 2023
Machine learning › Learning theory › statistical estimation › robust statistics
robust regression
0.712023
Corruption-Tolerant Algorithms for Generalized Linear Models · AAAI 2023
Mathematical optimization › statistical estimation
maximum likelihood estimation
0.712023
Corruption-Tolerant Algorithms for Generalized Linear Models · AAAI 2023

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

weighted maximum likelihood · 1.3variance reduction · 1.3sequential variance-altered MLE · 1.3
YearPublicationVenuePosition
2023 Corruption-Tolerant Algorithms for Generalized Linear Models
abstract
This paper presents SVAM (Sequential Variance-Altered MLE), a unified framework for learning generalized linear models under adversarial label corruption in training data. SVAM extends to tasks such as least squares regression, logistic regression, and gamma regression, whereas many existing works on learning with label corruptions focus only on least squares regression. SVAM is based on a novel variance reduction technique that may be of independent interest and works by iteratively solving weighted MLEs over variance-altered versions of the GLM objective. SVAM offers provable model recovery guarantees superior to the state-of-the-art for robust regression even when a constant fraction of training labels are adversarially corrupted. SVAM also empirically outperforms several existing problem-specific techniques for robust regression and classification. Code for SVAM is available at https://github.com/purushottamkar/svam/
Bhaskar Mukhoty, Debojyoti Dey, Purushottam Kar
AAAI2