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

Prabhu Teja Sivaprasad

dblp:251/9110 · DBLP profile ↗
← Back
3ranked-venue papers
2as 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 · 3 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 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
2 papers
Transfer learning and domain adaptation · 39% Segmentation and scene understanding · 39% Optimization for machine learning · 17%

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

TopicWeightPapersLastEvidence papers
Computer vision › Segmentation and scene understanding › semantic segmentation › transfer learning for semantic segmentation
domain adaptive semantic segmentation
0.512021
Uncertainty Reduction for Model Adaptation in Semantic Segmentation · CVPR 2021
Machine learning › Transfer learning and domain adaptation
model adaptation
0.512021
Uncertainty Reduction for Model Adaptation in Semantic Segmentation · CVPR 2021
Computer vision › Segmentation and scene understanding
semantic segmentation
0.512021
Uncertainty Reduction for Model Adaptation in Semantic Segmentation · CVPR 2021
Machine learning › Transfer learning and domain adaptation › domain adaptation
unsupervised domain adaptation
0.512021
Uncertainty Reduction for Model Adaptation in Semantic Segmentation · CVPR 2021
Machine learning › Optimization for machine learning
optimizer benchmarking
0.412020
Optimizer Benchmarking Needs to Account for Hyperparameter Tuning · ICML 2020

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

noise robustness · 0.5feature representation learning · 0.5entropy minimization · 0.5automatic hyperparameter search · 0.4
YearPublicationVenuePosition
2022 PAUMER: Patch Pausing Transformer for Semantic Segmentation
Evann Courdier, Prabhu Teja Sivaprasad, François Fleuret
BMVC2
2021 Uncertainty Reduction for Model Adaptation in Semantic Segmentation
abstract
Traditional methods for Unsupervised Domain Adaptation (UDA) targeting semantic segmentation exploit information common to the source and target domains, using both labeled source data and unlabeled target data. In this paper, we investigate a setting where the source data is un-available, but the classifier trained on the source data is; hence named "model adaptation". Such a scenario arises when data sharing is prohibited, for instance, because of privacy, or Intellectual Property (IP) issues.To tackle this problem, we propose a method that reduces the uncertainty of predictions on the target domain data. We accomplish this in two ways: minimizing the entropy of the predicted posterior, and maximizing the noise robustness of the feature representation. We show the efficacy of our method on the transfer of segmentation from computer generated images to real-world driving images, and transfer between data collected in different cities, and surprisingly reach performance comparable with that of the methods that have access to source data.
Prabhu Teja Sivaprasad, François Fleuret
CVPR1
2020 Optimizer Benchmarking Needs to Account for Hyperparameter Tuning
abstract
The performance of optimizers, particularly in deep learning, depends considerably on their chosen hyperparameter configuration. The efficacy of optimizers is often studied under near-optimal problem-specific hyperparameters, and finding these settings may be prohibitively costly for practitioners. In this work, we argue that a fair assessment of optimizers’ performance must take the computational cost of hyperparameter tuning into account, i.e., how easy it is to find good hyperparameter configurations using an automatic hyperparameter search. Evaluating a variety of optimizers on an extensive set of standard datasets and architectures, our results indicate that Adam is the most practical solution, particularly in low-budget scenarios.
Prabhu Teja Sivaprasad, Florian Mai, Thijs Vogels, Martin Jaggi, François Fleuret
ICML1