VLDB 2026 Research / reviewers in the wild / expert
Briti Gangopadhyay
dblp:254/6480
· DBLP profile ↗
7ranked-venue papers
6as first author
7since 2021 · last 2025
0000-0002-6488-9326ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 6 · 5 first-author · 6 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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
3 papers |
Reinforcement learning · 64% Efficient and distributed learning · 26% Planning, search and constraint satisfaction · 10% | |
| Theoretical computer science
1 paper |
Algorithmic game theory and mechanism design · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational finance and economics · 100% |
Topics — the 10 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
safe reinforcement learning |
1.2 | 2 | 2023 | Safety Aware Neural Pruning for Deep Reinforcement Learning (Student Abstract) · AAAI 2023 Counterexample Guided RL Policy Refinement Using Bayesian Optimization · NeurIPS 2021 |
Machine learning › Reinforcement learning
imitation learning |
0.9 | 1 | 2025 | Auto-Bidding in Real-Time Auctions via Oracle Imitation Learning · KDD (2) 2025 |
Algorithmic game theory and mechanism design › mechanism design
auction design |
0.9 | 1 | 2025 | Auto-Bidding in Real-Time Auctions via Oracle Imitation Learning · KDD (2) 2025 |
Algorithmic game theory and mechanism design › online advertising
real-time bidding |
0.9 | 1 | 2025 | Auto-Bidding in Real-Time Auctions via Oracle Imitation Learning · KDD (2) 2025 |
Machine learning › Reinforcement learning
deep reinforcement learning |
0.7 | 1 | 2023 | Safety Aware Neural Pruning for Deep Reinforcement Learning (Student Abstract) · AAAI 2023 |
Machine learning › Efficient and distributed learning
model compression |
0.7 | 1 | 2023 | Safety Aware Neural Pruning for Deep Reinforcement Learning (Student Abstract) · AAAI 2023 |
Machine learning › Efficient and distributed learning › model compression
pruning |
0.7 | 1 | 2023 | Safety Aware Neural Pruning for Deep Reinforcement Learning (Student Abstract) · AAAI 2023 |
Machine learning › Reinforcement learning › policy optimization
policy refinement |
0.5 | 1 | 2021 | Counterexample Guided RL Policy Refinement Using Bayesian Optimization · NeurIPS 2021 |
Computational finance and economics › online advertising
auto-bidding |
0.3 | 1 | 2025 | Auto-Bidding in Real-Time Auctions via Oracle Imitation Learning · KDD (2) 2025 |
Computational finance and economics
online advertising |
0.3 | 1 | 2025 | Auto-Bidding in Real-Time Auctions via Oracle Imitation Learning · KDD (2) 2025 |
Methods — techniques the papers use, named apart from their topics
reinforcement learning · 2.6imitation learning · 2.6pruning · 0.7iterative weight refinement · 0.7gradient-based updates · 0.5counterexample-guided refinement · 0.5bayesian optimization · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Adaptive Budget Optimization for Multichannel Advertising Using Combinatorial Bandits
Briti Gangopadhyay, Zhao Wang 0009, Alberto Silvio Chiappa, Shingo Takamatsu |
AAMAS | 1 |
| 2025 | Auto-Bidding in Real-Time Auctions via Oracle Imitation Learning
Alberto Silvio Chiappa, Briti Gangopadhyay, Zhao Wang 0009, Shingo Takamatsu |
KDD (2) | 2 |
| 2023 | Safety Aware Neural Pruning for Deep Reinforcement Learning (Student Abstract)abstractNeural network pruning is a technique of network compression by removing weights of lower importance from an optimized neural network. Often, pruned networks are compared in terms of accuracy, which is realized in terms of rewards for Deep Reinforcement Learning (DRL) networks. However, networks that estimate control actions for safety-critical tasks, must also adhere to safety requirements along with obtaining rewards. We propose a methodology to iteratively refine the weights of a pruned neural network such that we get a sparse high-performance network without significant side effects on safety. Briti Gangopadhyay, Pallab Dasgupta, Soumyajit Dey |
AAAI | 1 |
| 2022 | PruVer: Verification Assisted Pruning for Deep Reinforcement Learning
Briti Gangopadhyay, Pallab Dasgupta, Soumyajit Dey |
PRICAI (1) | 1 |
| 2022 | Hierarchical Program-Triggered Reinforcement Learning Agents for Automated DrivingabstractRecent advances in Reinforcement Learning (RL) combined with Deep Learning (DL) have demonstrated impressive performance in complex tasks, including autonomous driving. The use of RL agents in autonomous driving leads to a smooth human-like driving experience, but the limited interpretability of Deep Reinforcement Learning (DRL) creates a verification and certification bottleneck. Instead of relying on RL agents to learn complex tasks, we propose HPRL - Hierarchical Program-triggered Reinforcement Learning, which uses a hierarchy consisting of a structured program along with multiple RL agents, each trained to perform a relatively simple task. The focus of verification shifts to the master program under simple guarantees from the RL agents, leading to a significantly more interpretable and verifiable implementation as compared to a complex RL agent. The evaluation of the framework is demonstrated on different driving tasks, and National Highway Traffic Safety Administration (NHTSA) pre-crash scenarios using CARLA, an open-source dynamic urban simulation environment. Briti Gangopadhyay, Harshit Soora, Pallab Dasgupta |
IEEE Trans. Intell. Transp. Syst. | 1 |
| 2021 | Counterexample Guided RL Policy Refinement Using Bayesian OptimizationabstractConstructing Reinforcement Learning (RL) policies that adhere to safety requirements is an emerging field of study. RL agents learn via trial and error with an objective to optimize a reward signal. Often policies that are designed to accumulate rewards do not satisfy safety specifications. We present a methodology for counterexample guided refinement of a trained RL policy against a given safety specification. Our approach has two main components. The first component is an approach to discover failure trajectories using Bayesian optimization over multiple parameters of uncertainty from a policy learnt in a model-free setting. The second component selectively modifies the failure points of the policy using gradient-based updates. The approach has been tested on several RL environments, and we demonstrate that the policy can be made to respect the safety specifications through such targeted changes. Briti Gangopadhyay, Pallab Dasgupta |
NeurIPS | 1 |
| 2021 | Semi-lexical languages: a formal basis for using domain knowledge to resolve ambiguities in deep-learning based computer vision
Briti Gangopadhyay, Somnath Hazra, Pallab Dasgupta |
Pattern Recognit. Lett. | 1 |