Demo Data from EDBT 2026 / reviewers in the wild / expert
Taneesh Gupta
dblp:323/5638
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 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
2 papers |
Language models and text generation · 40% Efficient and distributed learning · 20% 3D vision · 17% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
active learning |
0.9 | 1 | 2025 | AMPO: Active Multi Preference Optimization for Self-play Preference Selection · ICML 2025 |
Natural language and speech › Language models and text generation
alignment |
0.9 | 1 | 2025 | AMPO: Active Multi Preference Optimization for Self-play Preference Selection · ICML 2025 |
Natural language and speech › Language models and text generation
preference optimization |
0.9 | 1 | 2025 | AMPO: Active Multi Preference Optimization for Self-play Preference Selection · ICML 2025 |
Robotics › Robot navigation and mapping
map prediction |
0.8 | 1 | 2024 | Map It Anywhere: Empowering BEV Map Prediction using Large-scale Public Datasets · NeurIPS 2024 |
Robotics › Autonomous driving
perception |
0.2 | 1 | 2024 | Map It Anywhere: Empowering BEV Map Prediction using Large-scale Public Datasets · NeurIPS 2024 |
Methods — techniques the papers use, named apart from their topics
group-contrastive loss · 0.9active subset selection · 0.9pre-training · 0.8camera model-agnostic learning · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | AMPO: Active Multi Preference Optimization for Self-play Preference SelectionabstractMulti-preference optimization enriches language-model alignment beyond pairwise preferences by contrasting entire sets of helpful and undesired responses, enabling richer training signals for large language models. During self-play alignment, these models often produce numerous candidate answers per query, making it computationally infeasible to include all of them in the training objective. We propose Active Multi-Preference Optimization (AMPO), which combines on-policy generation, a multi-preference group-contrastive loss, and active subset selection. Specifically, we score and embed large candidate pools of responses, then pick a small but informative subset—covering reward extremes and distinct semantic clusters—for preference optimization.The resulting contrastive-training scheme identifies not only the best and worst answers but also subtle, underexplored modes crucial for robust alignment. Theoretically, we provide guarantees of expected reward maximization using our active selection method. Empirically, AMPO achieves state-of-the-art results on AlpacaEval with Llama 8B and Mistral 7B. We release our datasets [here](https://huggingface.co/Multi-preference-Optimization). Taneesh Gupta, Rahul Madhavan, Xuchao Zhang, Chetan Bansal, Saravan Rajmohan |
ICML | 1 |
| 2024 | Map It Anywhere: Empowering BEV Map Prediction using Large-scale Public DatasetsabstractTop-down Bird's Eye View (BEV) maps are a popular perception representation for ground robot navigation due to their richness and flexibility for downstream tasks. While recent methods have shown promise for predicting BEV maps from First-Person View (FPV) images, their generalizability is limited to small regions captured by current autonomous vehicle-based datasets. In this context, we show that a more scalable approach towards generalizable map prediction can be enabled by using two large-scale crowd-sourced mapping platforms, Mapillary for FPV images and OpenStreetMap for BEV semantic maps.We introduce Map It Anywhere (MIA), a data engine that enables seamless curation and modeling of labeled map prediction data from existing open-source map platforms. Using our MIA data engine, we display the ease of automatically collecting a 1.2 million FPV & BEV pair dataset encompassing diverse geographies, landscapes, environmental factors, camera models & capture scenarios. We further train a simple camera model-agnostic model on this data for BEV map prediction.Extensive evaluations using established benchmarks and our dataset show that the data curated by MIA enables effective pretraining for generalizable BEV map prediction, with zero-shot performance far exceeding baselines trained on existing datasets by 35%. Our analysis highlights the promise of using large-scale public maps for developing & testing generalizable BEV perception, paving the way for more robust autonomous navigation.Website: mapitanywhere.github.io Cherie Ho, Jiaye Zou, Omar Alama, Sai Mitheran Jagadesh Kumar, Cheng-Yu Chiang, Taneesh Gupta, Chen Wang 0033, Nikhil Varma Keetha, Katia P. Sycara, Sebastian A. Scherer |
NeurIPS | 6 |
| 2023 | On Designing Light-Weight Object Trackers Through Network Pruning: Use CNNS or Transformers?abstractObject trackers deployed on low-power devices need to be light-weight, however, most of the current state-of-the-art (SOTA) methods rely on using compute-heavy backbones built using CNNs or Transformers. Large sizes of such models do not allow their deployment in low-power conditions and designing compressed variants of large tracking models is of great importance. This paper demonstrates how highly compressed light-weight object trackers can be designed using neural architectural pruning of large CNN and Transformer based trackers. Further, a comparative study on architectural choices best suited to design lightweight trackers is provided. A comparison between SOTA trackers using CNNs, Transformers as well as the combination of the two is presented to study their stability at various compression ratios. Finally results for extreme pruning scenarios going as low as 1% in some cases are shown to study the limits of network pruning in object tracking. This work provides deeper insights into designing highly efficient trackers from existing SOTA methods.1 Saksham Aggarwal, Taneesh Gupta, Pawan Kumar Sahu, Arnav Chavan, Rishabh Tiwari, Dilip K. Prasad |
ICASSP | 2 |