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

Prateek Jaiswal

dblp:235/4678 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
2since 2021 · last 2023
—ORCID · unresolved

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

Artificial intelligence and machine learning · 3 · 2 first-author · 2 since 2021Security and privacy · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Human-computer interaction and ubiquitous 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
2 papers
Probabilistic and Bayesian machine learning · 78% Learning theory · 22%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning
bayesian decision theory
0.712023
On the Statistical Consistency of Risk-Sensitive Bayesian Decision-Making · NeurIPS 2023
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference › variational inference
variational bayesian inference
0.712023
On the Statistical Consistency of Risk-Sensitive Bayesian Decision-Making · NeurIPS 2023
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference
approximate bayesian inference
0.412020
Asymptotic Consistency of α-Rényi-Approximate Posteriors · J. Mach. Learn. Res. 2020
Machine learning › Learning theory › statistical estimation
asymptotic consistency
0.412020
Asymptotic Consistency of α-Rényi-Approximate Posteriors · J. Mach. Learn. Res. 2020
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › bayesian asymptotics
posterior consistency
0.412020
Asymptotic Consistency of α-Rényi-Approximate Posteriors · J. Mach. Learn. Res. 2020
Machine learning › Learning theory › statistical estimation
statistical consistency
0.212023
On the Statistical Consistency of Risk-Sensitive Bayesian Decision-Making · NeurIPS 2023

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

entropic risk measure · 0.7dual representation · 0.7rényi divergence · 0.4asymptotic analysis · 0.4
YearPublicationVenuePosition
2023 On the Statistical Consistency of Risk-Sensitive Bayesian Decision-Making
abstract
We study data-driven decision-making problems in the Bayesian framework, where the expectation in the Bayes risk is replaced by a risk-sensitive entropic risk measure with respect to the posterior distribution. We focus on problems where calculating the posterior distribution is intractable, a typical situation in modern applications with large datasets and complex data generating models. We leverage a dual representation of the entropic risk measure to introduce a novel risk-sensitive variational Bayesian (RSVB) framework for jointly computing a risk-sensitive posterior approximation and the corresponding decision rule. Our general framework includes \textit{loss-calibrated} VB (Lacoste-Julien et al. [2011] ) as a special case. We also study the impact of these computational approximations on the predictive performance of the inferred decision rules. We compute the convergence rates of the RSVB approximate posterior and the corresponding optimal value. We illustrate our theoretical findings in parametric and nonparametric settings with the help of three examples.
Prateek Jaiswal, Harsha Honnappa, Vinayak A. Rao
NeurIPS1
2022 Facial De-morphing: Extracting Component Faces from a Single Morph
abstract
A face morph is created by strategically combining two or more face images corresponding to multiple identities. The intention is for the morphed image to match with multiple identities. Current morph attack detection strategies can detect morphs but cannot recover the images or identities used in creating them. The task of deducing the individual face images from a morphed face image is known as demorphing. Existing work in de-morphing assume the availability of a reference image pertaining to one identity in order to recover the image of the accomplice - i.e., the other identity. In this work, we propose a novel de-morphing method that can recover images of both identities simultaneously from a single morphed face image without needing a reference image or prior information about the morphing process. We propose a generative adversarial network that achieves single image-based de-morphing with a surprisingly high degree of visual realism and biometric similarity with the original face images. We demonstrate the performance of our method on landmark-based morphs and generative model-based morphs with promising results.
Sudipta Banerjee, Prateek Jaiswal, Arun Ross
IJCB2
2020 Asymptotic Consistency of α-Rényi-Approximate Posteriors
Prateek Jaiswal, Vinayak A. Rao, Harsha Honnappa
J. Mach. Learn. Res.1