Demo Data from VLDB 2026 / reviewers in the wild / expert
Srikanth Allu
dblp:120/7399
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2024
0000-0003-2841-4398ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 3 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
1 paper |
Segmentation and scene understanding · 67% Efficient and distributed learning · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning › inference efficiency
cost-aware inference |
0.8 | 1 | 2024 | Reinforcement Learning as a Parsimonious Alternative to Prediction Cascades: A Case Study on Image Segmentation · AAAI 2024 |
Computer vision › Segmentation and scene understanding › image segmentation
efficient segmentation |
0.8 | 1 | 2024 | Reinforcement Learning as a Parsimonious Alternative to Prediction Cascades: A Case Study on Image Segmentation · AAAI 2024 |
Computer vision › Segmentation and scene understanding
image segmentation |
0.8 | 1 | 2024 | Reinforcement Learning as a Parsimonious Alternative to Prediction Cascades: A Case Study on Image Segmentation · AAAI 2024 |
Methods — techniques the papers use, named apart from their topics
reinforcement learning · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Reinforcement Learning as a Parsimonious Alternative to Prediction Cascades: A Case Study on Image SegmentationabstractDeep learning architectures have achieved state-of-the-art (SOTA) performance on computer vision tasks such as object detection and image segmentation. This may be attributed to the use of over-parameterized, monolithic deep learning architectures executed on large datasets. Although such large architectures lead to increased accuracy, this is usually accompanied by a larger increase in computation and memory requirements during inference. While this is a non-issue in traditional machine learning (ML) pipelines, the recent confluence of machine learning and fields like the Internet of Things (IoT) has rendered such large architectures infeasible for execution in low-resource settings. For some datasets, large monolithic pipelines may be overkill for simpler inputs. To address this problem, previous efforts have proposed decision cascades where inputs are passed through models of increasing complexity until desired performance is achieved. However, we argue that cascaded prediction leads to sub-optimal throughput and increased computational cost due to wasteful intermediate computations. To address this, we propose PaSeR (Parsimonious Segmentation with Reinforcement Learning) a non-cascading, cost-aware learning pipeline as an efficient alternative to cascaded decision architectures. Through experimental evaluation on both real-world and standard datasets, we demonstrate that PaSeR achieves better accuracy while minimizing computational cost relative to cascaded models. Further, we introduce a new metric IoU/GigaFlop to evaluate the balance between cost and performance. On the real-world task of battery material phase segmentation, PaSeR yields a minimum performance improvement of 174% on the IoU/GigaFlop metric with respect to baselines. We also demonstrate PaSeR's adaptability to complementary models trained on a noisy MNIST dataset, where it achieved a minimum performance improvement on IoU/GigaFlop of 13.4% over SOTA models. Code and data are available at github.com/scailab/paser. Bharat Srikishan, Anika Tabassum, Srikanth Allu, Ramakrishnan Kannan, Nikhil Muralidhar |
AAAI | 3 |
| 2024 | Counter Data Paucity through Adversarial Invariance Encoding: A Case Study on Modeling Battery Thermal RunawayabstractLithium-ion batteries, widely used for their durability and high energy storage, face the risk of internal short circuits leading to catastrophic thermal runaway events. These events, triggered by external stimuli like mechanical loads, pose safety concerns in applications such as electric vehicles. Detecting and understanding thermal runaway events is crucial, but physics-driven models struggle to explain the non-linear evolution of battery temperature during these events, considering factors like material composition and state-of-charge. Due to the rarity of these events and the cost of data collection, we propose a deep learning (DL) model to predict battery temperature responses during thermal runaway. The challenge lies in the scarcity of data, making traditional DL models prone to overfitting and learning low-quality representations of the complex process.Our approach introduces a novel few-shot architecture that incorporates an adversarially governed invariant encoding process. This architecture aims to distill "invariant" relationships by addressing distributional shifts in data across various battery properties, facilitating the detection of thermal runaway events. Specifically, our results demonstrate that deep learning models conditioned on these "invariant" representations outperform state-of-the-art baselines, achieving a remarkable 96.8% performance improvement in terms of the popular metric MAPE. This framework presents a promising direction for enhancing battery safety modeling, particularly in the context of rare and complex events like thermal runaway. Our code and code and dataset used for the paper are public1. Anika Tabassum, Srikanth Allu, Ramakrishnan Kannan, Nikhil Muralidhar |
IEEE Big Data | 2 |
| 2022 | MatPhase: Material phase prediction for Li-ion Battery Reconstruction using Hierarchical Curriculum LearningabstractLi-ion Batteries (LIB), one of the most efficient energy storage devices, are used extensively in many industrial applications. These batteries consist of electrodes that are put together with heterogeneous material compositions. Imaging data of these battery electrodes obtained from X-ray tomography can explain the distribution of material constituents and allow reconstructions to study electron transport pathways. Such reconstructions of material constituents help quantify various associated properties of electrodes (e.g., volume-specific surface area, porosity) which determine the performance of batteries. These images often suffer from low image contrast between multiple material constituents, hence making it difficult for humans to distinguish and characterize these constituents through visual inspection. A minor error in detecting distributions of the material constituents can lead to magnified errors in the calculated parameters of material properties (e.g., porosity). We present MatPhase, a novel hierarchical curriculum learning technique to address the complex task of estimating material constituent distribution in battery electrodes. MatPhase comprises three modules: (i) an uncertainty-aware global model trained to yield inferences conditioned upon global knowledge of material distribution, (ii) a local model to capture relatively more fine-grained (local) distributional signals, (iii) an aggregator model to appropriately fuse the local and global effects towards obtaining the final distribution. On average, MatPhase improves prediction up to 8.5% relative to other sophisticated modeling pipelines and state-of-the-arts (SOTA) object detection models employed in the performance comparison. Anika Tabassum, Nikhil Muralidhar, Ramakrishnan Kannan, Srikanth Allu |
IEEE Big Data | 4 |