Shashi Shekhar
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Shashi Shekhar has a total of 47 co-authors. Here are the top co-authors by number of shared publications:
- Arun Sharma
University of Minnesota, Twin Cities, Minneapolis, Minnesota, USA
9 shared publications - Majid Farhadloo
University of Minnesota, Minneapolis, Minnesota, USA
6 shared publications - Mingzhou Yang
University of Minnesota, Minneapolis, Minnesota, USA
5 shared publications - Subhankar Ghosh
University of Minnesota, Twin Cities Minneapolis, USA
5 shared publications - Shuai An
University of Minnesota-Twin Cities, Minneapolis, Minnesota, USA
4 shared publications - Yiqun Xie
University of Minnesota
4 shared publications
Latest Publications
- Open Access
- 3 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 14-24
DeTraj: A Trajectory Degradation Module for Robust Geospatial Anomaly Detection
- 3 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 14-24
Open AccessDeTraj: A Trajectory Degradation Module for Robust Geospatial Anomaly Detection
- Open Access
Towards Fine-Tuning-Based Site Calibration for Knowledge-Guided Machine Learning: A Summary of Results
Accurate and cost-effective quantification of the agroecosystem carbon cycle at decision-relevant scales is essential for climate mitigation and sustainable agriculture. However, both transfer learning and the exploitation of spatial variability in this field are challenging, as they involve heterogeneous data and complex cross-scale dependencies. Conventional approaches often rely on location-independent parameterizations and independent training, underutilizing transfer learning and spatial heterogeneity in the inputs, and limiting their applicability in regions with substantial variability. We propose FTBSC-KGML (Fine-Tuning-Based Site Calibration-Knowledge-Guided Machine Learning), a pretraining- and fine-tuning-based, spatial-variability-aware, and knowledge-guided machine learning framework that augments KGML-ag with a pretraining-fine-tuning process and site-specific parameters. Using a pretraining-fine-tuning process with remote-sensing GPP, climate, and soil covariates collected across multiple midwestern sites, FTBSC-KGML estimates land emissions while leveraging transfer learning and spatial heterogeneity. A key component is a spatial-heterogeneity-aware transfer-learning scheme, which is a globally pretrained model that is fine-tuned at each state or site to learn place-aware representations, thereby improving local accuracy under limited data without sacrificing interpretability. Empirically, FTBSC-KGML achieves lower validation error and greater consistency in explanatory power than a purely global model, thereby better capturing spatial variability across states. This work extends the prior SDSA-KGML framework.
Open AccessTowards Fine-Tuning-Based Site Calibration for Knowledge-Guided Machine Learning: A Summary of Results
Accurate and cost-effective quantification of the agroecosystem carbon cycle at decision-relevant scales is essential for climate mitigation and sustainable agriculture. However, both transfer learning and the exploitation of spatial variability in this field are challenging, as they involve heterogeneous data and complex cross-scale dependencies. Conventional approaches often rely on location-independent parameterizations and independent training, underutilizing transfer learning and spatial heterogeneity in the inputs, and limiting their applicability in regions with substantial variability. We propose FTBSC-KGML (Fine-Tuning-Based Site Calibration-Knowledge-Guided Machine Learning), a pretraining- and fine-tuning-based, spatial-variability-aware, and knowledge-guided machine learning framework that augments KGML-ag with a pretraining-fine-tuning process and site-specific parameters. Using a pretraining-fine-tuning process with remote-sensing GPP, climate, and soil covariates collected across multiple midwestern sites, FTBSC-KGML estimates land emissions while leveraging transfer learning and spatial heterogeneity. A key component is a spatial-heterogeneity-aware transfer-learning scheme, which is a globally pretrained model that is fine-tuned at each state or site to learn place-aware representations, thereby improving local accuracy under limited data without sacrificing interpretability. Empirically, FTBSC-KGML achieves lower validation error and greater consistency in explanatory power than a purely global model, thereby better capturing spatial variability across states. This work extends the prior SDSA-KGML framework.
- Open Access
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 382-395
Geo-lucid Conditional Diffusion Models for High Physical Fidelity Trajectory Generation
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 382-395
Open AccessGeo-lucid Conditional Diffusion Models for High Physical Fidelity Trajectory Generation
- Open Access
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 11-24
Towards Physics-informed Diffusion for Anomaly Detection in Trajectories: A Summary of Results
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 11-24
Open AccessTowards Physics-informed Diffusion for Anomaly Detection in Trajectories: A Summary of Results
- Open Access
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 43-55
Towards Recurring Co-traveling Pattern Detection: A Summary of Results
- 3 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 43-55
Open AccessTowards Recurring Co-traveling Pattern Detection: A Summary of Results
- Open Access
- 2 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 57-69
Towards Surrogate Models with Hybrid Spatial Neural Networks: A Summary of Results
- 2 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 57-69
Open AccessTowards Surrogate Models with Hybrid Spatial Neural Networks: A Summary of Results
- Open Access
- 2 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Towards Physics-guided Generative Foundation Models
- 2 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Open AccessTowards Physics-guided Generative Foundation Models
- Open Access
- 25 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 34-38
Discovering Super-Colocation Patterns: A Summary of Results
- 25 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 34-38
Open AccessDiscovering Super-Colocation Patterns: A Summary of Results
- Open Access
- 29 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 36-45
Towards Pareto-optimality with Multi-level Bi-objective Routing: A Summary of Results
Given an origin, a destination, and a directed graph in which each edge is associated with a pair of non-negative costs, the bi-objective routing problem aims to find the set of all Pareto-optimal paths. This problem is societally important due to several applications, such as route finding that considers both vehicle travel time and energy consumption. The problem is challenging due to the potentially large number of candidate Pareto-optimal paths to be enumerated during the search, making existing compute-on-demand methods inefficient due to their high time complexity. One way forward is the introduction of precomputation algorithms. However, the large size of the Pareto-optimal set makes it infeasible to precompute and store all-pair solutions. In addition, generalizing traditional single-objective hierarchical algorithms to bi-objective cases is nontrivial because of the non-comparability of candidate paths and the need to accommodate multiple Pareto-optimal paths for each node pair. To overcome these limitations, we propose Multi-Level Bi-Objective Routing (MBOR) algorithms using three novel ideas: boundary multigraph representation, Pareto frontier encoding, and two-dimensional cost-interval based pruning. Computational experiments using real road network data demonstrate that the proposed methods significantly outperform baseline methods in terms of online runtime and precomputation time.
- 29 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 36-45
Open AccessTowards Pareto-optimality with Multi-level Bi-objective Routing: A Summary of Results
Given an origin, a destination, and a directed graph in which each edge is associated with a pair of non-negative costs, the bi-objective routing problem aims to find the set of all Pareto-optimal paths. This problem is societally important due to several applications, such as route finding that considers both vehicle travel time and energy consumption. The problem is challenging due to the potentially large number of candidate Pareto-optimal paths to be enumerated during the search, making existing compute-on-demand methods inefficient due to their high time complexity. One way forward is the introduction of precomputation algorithms. However, the large size of the Pareto-optimal set makes it infeasible to precompute and store all-pair solutions. In addition, generalizing traditional single-objective hierarchical algorithms to bi-objective cases is nontrivial because of the non-comparability of candidate paths and the need to accommodate multiple Pareto-optimal paths for each node pair. To overcome these limitations, we propose Multi-Level Bi-Objective Routing (MBOR) algorithms using three novel ideas: boundary multigraph representation, Pareto frontier encoding, and two-dimensional cost-interval based pruning. Computational experiments using real road network data demonstrate that the proposed methods significantly outperform baseline methods in terms of online runtime and precomputation time.
- Open Access
- 29 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 372-383
Towards Kriging-informed Conditional Diffusion for Regional Sea-Level Data Downscaling: A Summary of Results
Given coarser-resolution projections from global climate models or satellite data, the downscaling problem aims to estimate finer-resolution regional climate data, capturing fine-scale spatial patterns and variability. Downscaling is any method to derive high-resolution data from low-resolution variables, often to provide more detailed and local predictions and analyses. This problem is societally crucial for effective adaptation, mitigation, and resilience against significant risks from climate change. The challenge arises from spatial heterogeneity and the need to recover finer-scale features while ensuring model generalization. Most downscaling methods [21] fail to capture the spatial dependencies at finer scales and underperform on real-world climate datasets, such as sea-level rise. We propose a novel Kriging-informed Conditional Diffusion Probabilistic Model (Ki-CDPM) to capture spatial variability while preserving fine-scale features. Experimental results on climate data show that our proposed method is more accurate than state-of-the-art downscaling techniques.
- 29 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 372-383
Open AccessTowards Kriging-informed Conditional Diffusion for Regional Sea-Level Data Downscaling: A Summary of Results
Given coarser-resolution projections from global climate models or satellite data, the downscaling problem aims to estimate finer-resolution regional climate data, capturing fine-scale spatial patterns and variability. Downscaling is any method to derive high-resolution data from low-resolution variables, often to provide more detailed and local predictions and analyses. This problem is societally crucial for effective adaptation, mitigation, and resilience against significant risks from climate change. The challenge arises from spatial heterogeneity and the need to recover finer-scale features while ensuring model generalization. Most downscaling methods [21] fail to capture the spatial dependencies at finer scales and underperform on real-world climate datasets, such as sea-level rise. We propose a novel Kriging-informed Conditional Diffusion Probabilistic Model (Ki-CDPM) to capture spatial variability while preserving fine-scale features. Experimental results on climate data show that our proposed method is more accurate than state-of-the-art downscaling techniques.