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

Anindya Bhadra

dblp:88/11012 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
4since 2021 · last 2025
0000-0003-0636-5273ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 2 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

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
Probabilistic and Bayesian machine learning · 63% Learning theory · 26% Kernel, tree and ensemble methods · 11%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › deep probabilistic models › bayesian deep learning
bayesian neural networks
0.912025
Deep Kernel Posterior Learning under Infinite Variance Prior Weights · ICLR 2025
Machine learning › Kernel, tree and ensemble methods › kernel methods › kernel learning
deep kernel process
0.912025
Deep Kernel Posterior Learning under Infinite Variance Prior Weights · ICLR 2025
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process
0.912025
Deep Kernel Posterior Learning under Infinite Variance Prior Weights · ICLR 2025
Machine learning › Learning theory › neural network theory
infinite-width limit
0.912025
Deep Kernel Posterior Learning under Infinite Variance Prior Weights · ICLR 2025
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference
bayesian model selection
0.812024
Evidence Estimation in Gaussian Graphical Models Using a Telescoping Block Decomposition of the Precision Matrix · J. Mach. Learn. Res. 2024
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
gaussian graphical model
0.812024
Evidence Estimation in Gaussian Graphical Models Using a Telescoping Block Decomposition of the Precision Matrix · J. Mach. Learn. Res. 2024
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models
0.812024
Evidence Estimation in Gaussian Graphical Models Using a Telescoping Block Decomposition of the Precision Matrix · J. Mach. Learn. Res. 2024
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › bayesian model selection
marginal likelihood estimation
0.812024
Evidence Estimation in Gaussian Graphical Models Using a Telescoping Block Decomposition of the Precision Matrix · J. Mach. Learn. Res. 2024
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression › probabilistic regression
bayesian regression
0.412019
Prediction Risk for the Horseshoe Regression · J. Mach. Learn. Res. 2019
Machine learning › Learning theory
statistical learning theory
0.412019
Prediction Risk for the Horseshoe Regression · J. Mach. Learn. Res. 2019

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

bayesian inference · 1.2alpha-stable processes · 0.9telescoping block decomposition · 0.8chib's technique · 0.8global-local shrinkage · 0.4
YearPublicationVenuePosition
2025 Deep Kernel Posterior Learning under Infinite Variance Prior Weights
abstract
Neal (1996) proved that infinitely wide shallow Bayesian neural networks (BNN) converge to Gaussian processes (GP), when the network weights have bounded prior variance. Cho & Saul (2009) provided a useful recursive formula for deep kernel processes for relating the covariance kernel of each layer to the layer immediately below. Moreover, they worked out the form of the layer-wise covariance kernel in an explicit manner for several common activation functions, including the ReLU. Subsequent works have made the connection between these two works, and provided useful results on the covariance kernel of a deep GP arising as wide limits of various deep Bayesian network architectures. However, recent works, including Aitchison et al. (2021), have highlighted that the covariance kernels obtained in this manner are deterministic and hence, precludes any possibility of representation learning, which amounts to learning a non-degenerate posterior of a random kernel given the data. To address this, they propose adding artificial noise to the kernel to retain stochasticity, and develop deep kernel Wishart and inverse Wishart processes. Nonetheless, this artificial noise injection could be critiqued in that it would not naturally emerge in a classic BNN architecture under an infinite-width limit. To address this, we show that a Bayesian deep neural network, where each layer width approaches infinity, and all network weights are elliptically distributed with infinite variance, converges to a process with $\alpha$-stable marginals in each layer that has a conditionally Gaussian representation. These conditional random covariance kernels could be recursively linked in the manner of Cho & Saul (2009), even though marginally the process exhibits stable behavior, and hence covariances are not even necessarily defined. We also provide useful generalizations of the recent results of Loría & Bhadra (2024) on shallow networks to multi-layer networks, and remedy the prohibitive computational burden of their approach. The computational and statistical benefits over competing approaches stand out in simulations and in demonstrations on benchmark data sets.
Jorge Loría, Anindya Bhadra
ICLR2
2024 Posterior Inference on Shallow Infinitely Wide Bayesian Neural Networks under Weights with Unbounded Variance
abstract
From the classical and influential works of Neal (1996), it is known that the infinite width scaling limit of a Bayesian neural network with one hidden layer is a Gaussian process, when the network weights have bounded prior variance. Neal’s result has been extended to networks with multiple hidden layers and to convolutional neural networks, also with Gaussian process scaling limits. The tractable properties of Gaussian processes then allow straightforward posterior inference and uncertainty quantification, considerably simplifying the study of the limit process compared to a network of finite width. Neural network weights with unbounded variance, however, pose unique challenges. In this case, the classical central limit theorem breaks down and it is well known that the scaling limit is an $\alpha$-stable process under suitable conditions. However, current literature is primarily limited to forward simulations under these processes and the problem of posterior inference under such a scaling limit remains largely unaddressed, unlike in the Gaussian process case. To this end, our contribution is an interpretable and computationally efficient procedure for posterior inference, using a conditionally Gaussian representation, that then allows full use of the Gaussian process machinery for tractable posterior inference and uncertainty quantification in the non-Gaussian regime.
Jorge Loría, Anindya Bhadra
UAI2
2024 Evidence Estimation in Gaussian Graphical Models Using a Telescoping Block Decomposition of the Precision Matrix
abstract
Marginal likelihood, also known as model evidence, is a fundamental quantity in Bayesian statistics. It is used for model selection using Bayes factors or for empirical Bayes tuning of prior hyper-parameters. Yet, the calculation of evidence has remained a longstanding open problem in Gaussian graphical models. Currently, the only feasible solutions that exist are for special cases such as the Wishart or G-Wishart, in moderate dimensions. We develop an approach based on a novel telescoping block decomposition of the precision matrix that allows the estimation of evidence by application of Chib's technique under a very broad class of priors under mild requirements. Specifically, the requirements are: (a) the priors on the diagonal terms on the precision matrix can be written as gamma or scale mixtures of gamma random variables and (b) those on the off-diagonal terms can be represented as normal or scale mixtures of normal. This includes structured priors such as the Wishart or G-Wishart, and more recently introduced element-wise priors, such as the Bayesian graphical lasso and the graphical horseshoe. Among these, the true marginal is known in an analytically closed form for Wishart, providing a useful validation of our approach. For the general setting of the other three, and several more priors satisfying conditions (a) and (b) above, the calculation of evidence has remained an open question that this article resolves under a unifying framework.
Anindya Bhadra, Ksheera Sagar, David Rowe, Sayantan Banerjee, Jyotishka Datta
J. Mach. Learn. Res.1
2022 A Laplace Mixture Representation of the Horseshoe and Some Implications
abstract
The horseshoe prior, defined as a half Cauchy scale mixture of normal, provides a state of the art approach to Bayesian sparse signal recovery. We provide a new representation of the horseshoe density as a scale mixture of the Laplace density, explicitly identifying the mixing measure. Using the celebrated Bernstein–Widder theorem and a result due to Bochner, our representation immediately establishes the complete monotonicity of the horseshoe density and strong concavity of the corresponding penalty. Consequently, the equivalence between local linear approximation and expectation–maximization algorithms for finding the posterior mode under the horseshoe penalized regression is established. Further, the resultant estimate is shown to be sparse.
Ksheera Sagar, Anindya Bhadra
IEEE Signal Process. Lett.2
2019 Prediction Risk for the Horseshoe Regression
abstract
We show that prediction performance for global-local shrinkage regression can overcome two major difficulties of global shrinkage regression: (i) the amount of relative shrinkage is monotone in the singular values of the design matrix and (ii) the shrinkage is determined by a single tuning parameter. Specifically, we show that the horseshoe regression, with heavy-tailed component-specific local shrinkage parameters, in conjunction with a global parameter providing shrinkage towards zero, alleviates both these difficulties and consequently, results in an improved risk for prediction. Numerical demonstrations of improved prediction over competing approaches in simulations and in a pharmacogenomics data set confirm our theoretical findings.
Anindya Bhadra, Jyotishka Datta, Yunfan Li 0005, Brandon T. Willard
J. Mach. Learn. Res.1
2010 Forcing Versus Feedback: Epidemic Malaria and Monsoon Rains in Northwest India
abstract
Malaria epidemics in regions with seasonal windows of transmission can vary greatly in size from year to year. A central question has been whether these interannual cycles are driven by climate, are instead generated by the intrinsic dynamics of the disease, or result from the resonance of these two mechanisms. This corresponds to the more general inverse problem of identifying the respective roles of external forcings vs. internal feedbacks from time series for nonlinear and noisy systems. We propose here a quantitative approach to formally compare rival hypotheses on climate vs. disease dynamics, or external forcings vs. internal feedbacks, that combines dynamical models with recently developed, computational inference methods. The interannual patterns of epidemic malaria are investigated here for desert regions of northwest India, with extensive epidemiological records for Plasmodium falciparum malaria for the past two decades. We formulate a dynamical model of malaria transmission that explicitly incorporates rainfall, and we rely on recent advances on parameter estimation for nonlinear and stochastic dynamical systems based on sequential Monte Carlo methods. Results show a significant effect of rainfall in the inter-annual variability of epidemic malaria that involves a threshold in the disease response. The model exhibits high prediction skill for yearly cases in the malaria transmission season following the monsoonal rains. Consideration of a more complex model with clinical immunity demonstrates the robustness of the findings and suggests a role of infected individuals that lack clinical symptoms as a reservoir for transmission. Our results indicate that the nonlinear dynamics of the disease itself play a role at the seasonal, but not the interannual, time scales. They illustrate the feasibility of forecasting malaria epidemics in desert and semi-arid regions of India based on climate variability. This approach should be applicable to malaria in other locations, to other infectious diseases, and to other nonlinear systems under forcing.
Karina Laneri, Anindya Bhadra, Edward L. Ionides, Menno J. Bouma, Ramesh C. Dhiman, Rajpal S. Yadav, Mercedes Pascual
PLoS Comput. Biol.2