EDBT 2026 Demo / reviewers in the wild / expert
Kaustubh Mani
dblp:192/1718
· DBLP profile ↗
7ranked-venue papers
4as first author
3since 2021 · last 2025
0009-0007-9467-3159ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 3 first-author · 3 since 2021Systems, architecture and hardware · 2 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorApplied, 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 |
Reinforcement learning · 56% Trustworthy machine learning · 29% 3D vision · 10% |
Topics — the 10 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning
uncertainty estimation |
1.1 | 2 | 2022 | f-Cal: Aleatoric uncertainty quantification for robot perception via calibrated neural regression · ICRA 2022 Sample Efficient Deep Reinforcement Learning via Uncertainty Estimation · ICLR 2022 |
Machine learning › Reinforcement learning › function approximation
representation learning for reinforcement learning |
0.9 | 1 | 2025 | Safety Representations for Safer Policy Learning · ICLR 2025 |
Machine learning › Reinforcement learning › safe reinforcement learning
safe exploration |
0.9 | 1 | 2025 | Safety Representations for Safer Policy Learning · ICLR 2025 |
Machine learning › Reinforcement learning
safe reinforcement learning |
0.9 | 1 | 2025 | Safety Representations for Safer Policy Learning · ICLR 2025 |
Computer vision › 3D vision › depth estimation
monocular depth estimation |
0.6 | 1 | 2022 | f-Cal: Aleatoric uncertainty quantification for robot perception via calibrated neural regression · ICRA 2022 |
Machine learning › Reinforcement learning › sample efficiency
sample-efficient reinforcement learning |
0.6 | 1 | 2022 | Sample Efficient Deep Reinforcement Learning via Uncertainty Estimation · ICLR 2022 |
Machine learning › Trustworthy machine learning › uncertainty estimation
uncertainty calibration |
0.6 | 1 | 2022 | f-Cal: Aleatoric uncertainty quantification for robot perception via calibrated neural regression · ICRA 2022 |
Machine learning › Reinforcement learning
deep reinforcement learning |
0.2 | 1 | 2022 | Sample Efficient Deep Reinforcement Learning via Uncertainty Estimation · ICLR 2022 |
Computer vision › Image recognition and object detection
object detection |
0.2 | 1 | 2022 | f-Cal: Aleatoric uncertainty quantification for robot perception via calibrated neural regression · ICRA 2022 |
Robotics › Autonomous driving
perception |
0.2 | 1 | 2022 | f-Cal: Aleatoric uncertainty quantification for robot perception via calibrated neural regression · ICRA 2022 |
Methods — techniques the papers use, named apart from their topics
state augmentation · 0.9uncertainty estimation · 0.6neural regression · 0.6f-divergence minimization · 0.6calibration · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Safety Representations for Safer Policy LearningabstractReinforcement learning algorithms typically necessitate extensive exploration of the state space to find optimal policies. However, in safety-critical applications, the risks associated with such exploration can lead to catastrophic consequences. Existing safe exploration methods attempt to mitigate this by imposing constraints, which often result in overly conservative behaviours and inefficient learning. Heavy penalties for early constraint violations can trap agents in local optima, deterring exploration of risky yet high-reward regions of the state space. To address this, we introduce a method that explicitly learns state-conditioned safety representations. By augmenting the state features with these safety representations, our approach naturally encourages safer exploration without being excessively cautious, resulting in more efficient and safer policy learning in safety-critical scenarios. Empirical evaluations across diverse environments show that our method significantly improves task performance while reducing constraint violations during training, underscoring its effectiveness in balancing exploration with safety. Kaustubh Mani, Vincent Mai, Charlie Gauthier, Annie S. Chen, Samer B. Nashed, Liam Paull |
ICLR | 1 |
| 2022 | Sample Efficient Deep Reinforcement Learning via Uncertainty Estimation
Vincent Mai, Kaustubh Mani, Liam Paull |
ICLR | 2 |
| 2022 | f-Cal: Aleatoric uncertainty quantification for robot perception via calibrated neural regressionabstractWhile modern deep neural networks are performant perception modules, performance (accuracy) alone is insufficient, particularly for safety-critical robotic applications such as self-driving vehicles. Robot autonomy stacks also require these otherwise blackbox models to produce reliable and calibrated measures of confidence on their predictions. Existing approaches estimate uncertainty from these neural network perception stacks by modifying network architectures, inference procedure, or loss functions. However, in general, these methods lack calibration, meaning that the predictive uncertainties do not faithfully represent the true underlying uncertainties (process noise). Our key insight is that calibration is only achieved by imposing constraints across multiple examples, such as those in a mini-batch; as opposed to existing approaches which only impose constraints per-sample, often leading to overconfident (thus miscalibrated) uncertainty estimates. By enforcing the distribution of outputs of a neural network to resemble a target distribution by minimizing an$f$-divergence, we obtain significantly better-calibrated models compared to prior approaches. Our approach, f-Cal, outperforms existing uncertainty calibration approaches on robot perception tasks such as object detection and monocular depth estimation over multiple real-world benchmarks. Dhaivat Bhatt, Kaustubh Mani, Dishank Bansal, Krishna Murthy Jatavallabhula, Hanju Lee, Liam Paull |
ICRA | 2 |
| 2020 | AutoLay: Benchmarking amodal layout estimation for autonomous drivingabstractGiven an image or a video captured from a monocular camera, amodal layout estimation is the task of predicting semantics and occupancy in bird's eye view. The term amodal implies we also reason about entities in the scene that are occluded or truncated in image space. While several recent efforts have tackled this problem, there is a lack of standardization in task specification, datasets, and evaluation protocols. We address these gaps with AutoLay, a dataset and benchmark for amodal layout estimation from monocular images. AutoLay encompasses driving imagery from two popular datasets: KITTI [1] and Argoverse [2]. In addition to fine-grained attributes such as lanes, sidewalks, and vehicles, we also provide semantically annotated 3D point clouds. We implement several baselines and bleeding edge approaches, and release our data and code.1. Kaustubh Mani, Narasimhan Sai Shankar, Krishna Murthy Jatavallabhula, K. Madhava Krishna |
IROS | 1 |
| 2020 | Mono Lay out: Amodal scene layout from a single imageabstractIn this paper, we address the novel, highly challenging problem of estimating the layout of a complex urban driving scenario. Given a single color image captured from a driving platform, we aim to predict the bird's eye view layout of the road and other traffic participants. The estimated layout should reason beyond what is visible in the image, and compensate for the loss of 3D information due to projection. We dub this problem amodal scene layout estimation, which involves hallucinating scene layout for even parts of the world that are occluded in the image. To this end, we present MonoLayout, a deep neural network for realtime amodal scene layout estimation from a single image. We represent scene layout as a multi-channel semantic occupancy grid, and leverage adversarial feature learning to hallucinate " plausible completions for occluded image parts. We extend several state-of-the-art approaches for road-layout estimation and vehicle occupancy estimation in bird's eye view to the amodal setup and thoroughly evaluate against them. By leveraging temporal sensor fusion to generate training labels, we significantly outperform current art over a number of datasets. Kaustubh Mani, Swapnil Daga, Shubhika Garg, Narasimhan Sai Shankar, Krishna Murthy Jatavallabhula, K. Madhava Krishna |
WACV | 1 |
| 2018 | Multi-Document Summarization Using Distributed Bag-of-Words ModelabstractAs the number of documents on the web is growing exponentially, multi-document summarization is becoming more and more important since it can provide the main ideas in a document set in short time. In this paper, we present an unsupervised centroid-based document-level reconstruction framework using distributed bag of words model. Specifically, our approach selects summary sentences in order to minimize the reconstruction error between the summary and the documents. We apply sentence selection and beam search, to further improve the performance of our model. Experimental results on two different datasets show significant performance gains compared with the state-of-the-art baselines. Kaustubh Mani, Ishan Verma, Hardik Meisheri, Lipika Dey |
WI | 1 |
| 2017 | BASS Net: Band-Adaptive Spectral-Spatial Feature Learning Neural Network for Hyperspectral Image ClassificationabstractDeep learning based land cover classification algorithms have recently been proposed in the literature. In hyperspectral images (HSIs), they face the challenges of large dimensionality, spatial variability of spectral signatures, and scarcity of labeled data. In this paper, we propose an end-to-end deep learning architecture that extracts band specific spectral-spatial features and performs land cover classification. The architecture has fewer independent connection weights and thus requires fewer training samples. The method is found to outperform the highest reported accuracies on popular HSI data sets. Anirban Santara, Kaustubh Mani, Pranoot Hatwar, Ankur Garg, Kirti Padia, Pabitra Mitra |
IEEE Trans. Geosci. Remote. Sens. | 2 |