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.

Sanket R. Jantre

dblp:312/7589 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
7since 2021 · last 2025
0000-0003-3611-0255ORCID · verified

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

Artificial intelligence and machine learning · 5 · 2 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 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
Efficient and distributed learning · 33% Trustworthy machine learning · 33% Language models and text generation · 17%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Environmental and earth informatics · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Environmental and earth informatics
climate modeling
1.522025
ClimSim-Online: A Large Multi-Scale Dataset and Framework for Hybrid Physics-ML Climate Emulation · J. Mach. Learn. Res. 2025
ClimSim: A large multi-scale dataset for hybrid physics-ML climate emulation · NeurIPS 2023
Natural language and speech › Language models and text generation
large language model fine-tuning
0.912025
C-LoRA: Contextual Low-Rank Adaptation for Uncertainty Estimation in Large Language Models · NeurIPS 2025
Machine learning › Efficient and distributed learning › parameter-efficient fine-tuning
low-rank adaptation
0.912025
C-LoRA: Contextual Low-Rank Adaptation for Uncertainty Estimation in Large Language Models · NeurIPS 2025
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning
0.912025
C-LoRA: Contextual Low-Rank Adaptation for Uncertainty Estimation in Large Language Models · NeurIPS 2025
Machine learning › Deep learning architectures and training
scientific machine learning
0.912025
ClimSim-Online: A Large Multi-Scale Dataset and Framework for Hybrid Physics-ML Climate Emulation · J. Mach. Learn. Res. 2025
Machine learning › Trustworthy machine learning › uncertainty estimation
uncertainty calibration
0.912025
C-LoRA: Contextual Low-Rank Adaptation for Uncertainty Estimation in Large Language Models · NeurIPS 2025
Machine learning › Trustworthy machine learning
uncertainty estimation
0.912025
C-LoRA: Contextual Low-Rank Adaptation for Uncertainty Estimation in Large Language Models · NeurIPS 2025
Environmental and earth informatics
climate science
0.712023
ClimSim: A large multi-scale dataset for hybrid physics-ML climate emulation · NeurIPS 2023
Data mining
dataset construction
0.712023
ClimSim: A large multi-scale dataset for hybrid physics-ML climate emulation · NeurIPS 2023

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

machine learning emulators · 1.7containerized pipeline · 1.7stochastic regression · 1.3regression baseline · 1.3variational inference · 0.9low-rank adaptation · 0.9bayesian inference · 0.9
YearPublicationVenuePosition
2025 C-LoRA: Contextual Low-Rank Adaptation for Uncertainty Estimation in Large Language Models
abstract
Low-Rank Adaptation (LoRA) offers a cost-effective solution for fine-tuning large language models (LLMs), but it often produces overconfident predictions in data-scarce few-shot settings. To address this issue, several classical statistical learning approaches have been repurposed for scalable uncertainty-aware LoRA fine-tuning. However, these approaches neglect how input characteristics affect the predictive uncertainty estimates. To address this limitation, we propose Contextual Low-Rank Adaptation (**C-LoRA**) as a novel uncertainty-aware and parameter efficient fine-tuning approach, by developing new lightweight LoRA modules contextualized to each input data sample to dynamically adapt uncertainty estimates. Incorporating data-driven contexts into the parameter posteriors, C-LoRA mitigates overfitting, achieves well-calibrated uncertainties, and yields robust predictions. Extensive experiments on LLaMA2-7B models demonstrate that C-LoRA consistently outperforms the state-of-the-art uncertainty-aware LoRA methods in both uncertainty quantification and model generalization. Ablation studies further confirm the critical role of our contextual modules in capturing sample-specific uncertainties. C-LoRA sets a new standard for robust, uncertainty-aware LLM fine-tuning in few-shot regimes. Although our experiments are limited to 7B models, our method is architecture-agnostic and, in principle, applies beyond this scale; studying its scaling to larger models remains an open problem. Our code is available at https://github.com/ahra99/c_lora.
Amir Hossein Rahmati, Sanket R. Jantre, Byung-Jun Yoon, Nathan M. Urban, Xiaoning Qian
NeurIPS2
2025 ClimSim-Online: A Large Multi-Scale Dataset and Framework for Hybrid Physics-ML Climate Emulation
abstract
Modern climate projections lack adequate spatial and temporal resolution due to computational constraints, leading to inaccuracies in representing critical processes like thunderstorms that occur on the sub-resolution scale. Hybrid methods combining physics with machine learning (ML) offer faster, higher fidelity climate simulations by outsourcing compute-hungry, high-resolution simulations to ML emulators. However, these hybrid physics-ML simulations require domain-specific data and workflows that have been inaccessible to many ML experts. This paper is an extended version of our NeurIPS award-winning ClimSim dataset paper. The ClimSim dataset includes 5.7 billion pairs of multivariate input/output vectors spanning ten years at high temporal resolution, capturing the influence of high-resolution, high-fidelity physics on a host climate simulator's macro-scale state. In this extended version, we introduce a significant new contribution in Section 5, which provides a cross-platform, containerized pipeline to integrate ML models into operational climate simulators for hybrid testing. We also implement various baselines of ML models and hybrid simulators to highlight the ML challenges of building stable, skillful emulators. The data (https://huggingface.co/datasets/LEAP/ClimSim_high-res, also in a low-resolution version at https://huggingface.co/datasets/LEAP/ClimSim_low-res and an aquaplanet version at https://huggingface.co/datasets/LEAP/ClimSim_low-res_aqua-planet) and code (https://leap-stc.github.io/ClimSim and https://github.com/leap-stc/climsim-online) are publicly released to support the development of hybrid physics-ML and high-fidelity climate simulations.
Sungduk Yu, Zeyuan Hu 0005, Akshay Subramaniam, Walter M. Hannah, Liran Peng, Zhiyuan Jerry Lin, Mohamed Aziz Bhouri, Ritwik Gupta, Björn Lütjens, Justus C. Will, Gunnar Behrens, Julius Busecke, Nora Loose, Charles Stern, Tom Beucler, Bryce E. Harrop, Helge Heuer, Benjamin R. Hillman, Andrea M. Jenney, Nana Liu, Alistair White, Zhiming Kuang, Fiaz Ahmed, Elizabeth A. Barnes, Noah D. Brenowitz, Christopher S. Bretherton, Veronika Eyring, Savannah L. Ferretti, Nicholas J. Lutsko, Pierre Gentine, Stephan Mandt, J. David Neelin, Rose Yu, Laure Zanna, Nathan M. Urban, Janni Yuval, Ryan Abernathey, Pierre Baldi, Wayne Chuang, Fernando Iglesias-Suarez, Sanket R. Jantre, Po-Lun Ma, Sara Shamekh, Michael S. Pritchard
J. Mach. Learn. Res.43
2025 Spike-and-Slab Shrinkage Priors for Structurally Sparse Bayesian Neural Networks
abstract
Network complexity and computational efficiency have become increasingly significant aspects of deep learning. Sparse deep learning addresses these challenges by recovering a sparse representation of the underlying target function by reducing heavily overparameterized deep neural networks. Specifically, deep neural architectures compressed via structured sparsity (e.g., node sparsity) provide low-latency inference, higher data throughput, and reduced energy consumption. In this article, we explore two well-established shrinkage techniques, Lasso and Horseshoe, for model compression in Bayesian neural networks (BNNs). To this end, we propose structurally sparse BNNs, which systematically prune excessive nodes with the following: 1) spike-and-slab group Lasso (SS-GL) and 2) SS group Horseshoe (SS-GHS) priors, and develop computationally tractable variational inference, including continuous relaxation of Bernoulli variables. We establish the contraction rates of the variational posterior of our proposed models as a function of the network topology, layerwise node cardinalities, and bounds on the network weights. We empirically demonstrate the competitive performance of our models compared with the baseline models in prediction accuracy, model compression, and inference latency.
Sanket R. Jantre, Shrijita Bhattacharya, Tapabrata Maiti
IEEE Trans. Neural Networks Learn. Syst.1
2024 Learning Active Subspaces for Effective and Scalable Uncertainty Quantification in Deep Neural Networks
abstract
Bayesian inference for neural networks, or Bayesian deep learning, has the potential to provide well-calibrated predictions with quantified uncertainty and robustness. However, the main hurdle for Bayesian deep learning is its computational complexity due to the high dimensionality of the parameter space. In this work, we propose a novel scheme that addresses this limitation by constructing a low-dimensional subspace of the neural network parameters–referred to as an active subspace–by identifying the parameter directions that have the most significant influence on the output of the neural network. We demonstrate that the significantly reduced active subspace enables effective and scalable Bayesian inference via either Monte Carlo (MC) sampling methods, otherwise computationally intractable, or variational inference. Empirically, our approach provides reliable predictions with robust uncertainty estimates for various regression tasks.
Sanket R. Jantre, Nathan M. Urban, Xiaoning Qian, Byung-Jun Yoon
ICASSP1
2023 ClimSim: A large multi-scale dataset for hybrid physics-ML climate emulation
abstract
Modern climate projections lack adequate spatial and temporal resolution due to computational constraints. A consequence is inaccurate and imprecise predictions of critical processes such as storms. Hybrid methods that combine physics with machine learning (ML) have introduced a new generation of higher fidelity climate simulators that can sidestep Moore's Law by outsourcing compute-hungry, short, high-resolution simulations to ML emulators. However, this hybrid ML-physics simulation approach requires domain-specific treatment and has been inaccessible to ML experts because of lack of training data and relevant, easy-to-use workflows. We present ClimSim, the largest-ever dataset designed for hybrid ML-physics research. It comprises multi-scale climate simulations, developed by a consortium of climate scientists and ML researchers. It consists of 5.7 billion pairs of multivariate input and output vectors that isolate the influence of locally-nested, high-resolution, high-fidelity physics on a host climate simulator's macro-scale physical state.The dataset is global in coverage, spans multiple years at high sampling frequency, and is designed such that resulting emulators are compatible with downstream coupling into operational climate simulators. We implement a range of deterministic and stochastic regression baselines to highlight the ML challenges and their scoring. The data (https://huggingface.co/datasets/LEAP/ClimSim_high-res) and code (https://leap-stc.github.io/ClimSim) are released openly to support the development of hybrid ML-physics and high-fidelity climate simulations for the benefit of science and society.
Sungduk Yu, Walter M. Hannah, Liran Peng, Zhiyuan Jerry Lin, Mohamed Aziz Bhouri, Ritwik Gupta, Björn Lütjens, Justus C. Will, Gunnar Behrens, Julius Busecke, Nora Loose, Charles Stern, Tom Beucler, Bryce E. Harrop, Benjamin R. Hillman, Andrea M. Jenney, Savannah L. Ferretti, Nana Liu, Anima Anandkumar, Noah D. Brenowitz, Veronika Eyring, Nicholas Geneva, Pierre Gentine, Stephan Mandt, Jaideep Pathak, Akshay Subramaniam, Carl Vondrick, Rose Yu, Laure Zanna, Ryan Abernathey, Fiaz Ahmed, David C. Bader, Pierre Baldi, Elizabeth A. Barnes, Christopher S. Bretherton, Peter M. Caldwell, Wayne Chuang, Yilun Han, Fernando Iglesias-Suarez, Sanket R. Jantre, Karthik Kashinath, Marat Khairoutdinov, Thorsten Kurth, Nicholas J. Lutsko, Po-Lun Ma, Griffin Mooers, J. David Neelin, David A. Randall, Sara Shamekh, Nathan M. Urban, Janni Yuval, Mike Pritchard
NeurIPS42
2023 Layer adaptive node selection in Bayesian neural networks: Statistical guarantees and implementation details
Sanket R. Jantre, Shrijita Bhattacharya, Tapabrata Maiti
Neural Networks1
2021 Low-Rank Tensor Regression for X-Ray Tomography
abstract
Tomographic imaging is useful for revealing the internal structure of a 3D sample. Classical reconstruction methods treat the object of interest as a vector to estimate its value. Such an approach, however, can be inefficient in analyzing high-dimensional data because of the underexploration of the underlying structure. In this work, we propose to apply tensor-based regression model to perform tomographic reconstruction. Furthermore, we explore the low-rank structure embedded in the corresponding tensor form. As a result, our proposed method efficiently reduces the dimensionality of the unknown parameters, which is particularly beneficial for ill-posed inverse problem suffering from insufficient data. We demonstrate the robustness of our proposed approach on synthetic noise-free as well as on Gaussian noise-added data.
Sanket R. Jantre, Zichao Wendy Di
ICIP1