Demo Data from EDBT 2026 / reviewers in the wild / expert
Gaurav Menghani
dblp:137/0537
· DBLP profile ↗
4ranked-venue papers
1as first author
4since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 1 first-author · 4 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
4 papers |
Efficient and distributed learning · 51% Trustworthy machine learning · 16% Learning theory · 15% |
Topics — the 10 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning › model compression
knowledge distillation |
1.9 | 3 | 2023 | SLaM: Student-Label Mixing for Distillation with Unlabeled Examples · NeurIPS 2023 Robust Active Distillation · ICLR 2023 Weighted Distillation with Unlabeled Examples · NeurIPS 2022 |
Machine learning › Efficient and distributed learning
model compression |
0.9 | 1 | 2025 | LAuReL: Learned Augmented Residual Layer · ICML 2025 |
Machine learning › Efficient and distributed learning › parameter-efficient learning
parameter-efficient architecture |
0.9 | 1 | 2025 | LAuReL: Learned Augmented Residual Layer · ICML 2025 |
Machine learning › Deep learning architectures and training › skip connections
residual connection |
0.9 | 1 | 2025 | LAuReL: Learned Augmented Residual Layer · ICML 2025 |
Machine learning › Trustworthy machine learning › robustness
learning with noisy labels |
0.7 | 1 | 2023 | SLaM: Student-Label Mixing for Distillation with Unlabeled Examples · NeurIPS 2023 |
Machine learning › Efficient and distributed learning › model compression › knowledge distillation
robust distillation |
0.7 | 1 | 2023 | Robust Active Distillation · ICLR 2023 |
Machine learning › Trustworthy machine learning
robustness |
0.7 | 1 | 2023 | Robust Active Distillation · ICLR 2023 |
Machine learning › Learning theory
sample complexity |
0.7 | 1 | 2023 | SLaM: Student-Label Mixing for Distillation with Unlabeled Examples · NeurIPS 2023 |
Natural language and speech › Language models and text generation
large language model |
0.3 | 1 | 2025 | LAuReL: Learned Augmented Residual Layer · ICML 2025 |
Machine learning › Deep learning architectures and training
teacher-student framework |
0.2 | 1 | 2023 | SLaM: Student-Label Mixing for Distillation with Unlabeled Examples · NeurIPS 2023 |
Methods — techniques the papers use, named apart from their topics
transformer · 0.9residual connections · 0.9student-label mixing · 0.7knowledge distillation · 0.7forward loss-adjustment · 0.7active learning · 0.7importance weighting · 0.6debiasing reweighting · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | LAuReL: Learned Augmented Residual LayerabstractOne of the core pillars of efficient deep learning methods are architectural improvements, such as residual/skip connections, which have led to significantly better model convergence and quality. Since their introduction, residual connections have become ubiquitous not only in convolutional neural networks but also in transformer-based architectures, the backbone of LLMs. In this paper, we introduce the Learned Augmented Residual Layer (LAuReL) — a novel generalization of the canonical residual connection — designed to serve as an in-situ replacement while outperforming it in both model quality and footprint metrics. Our experiments show that LAuReL can enhance quality for both vision and language models while adding fewer parameters and incurring less latency and memory overhead than naively increasing parameter count. For example, on the ImageNet-1K task, LAuReL achieves the same model quality improvements as naively adding an extra layer while using $2.6 \times$ fewer parameters. Similarly, when pre-training 1B and 4B parameter LLMs, LAuReL improves performance on a variety of challenging downstream evaluation tasks by 2.54% to 20.05%, while adding only 0.012% and 0.1% additional parameters, respectively. Gaurav Menghani, Sanjiv Kumar |
ICML | 1 |
| 2023 | Robust Active Distillation
Cenk Baykal, Khoa Trinh, Fotis Iliopoulos, Gaurav Menghani, Erik Vee |
ICLR | 4 |
| 2023 | SLaM: Student-Label Mixing for Distillation with Unlabeled ExamplesabstractKnowledge distillation with unlabeled examples is a powerful training paradigm for generating compact and lightweight student models in applications where the amount of labeled data is limited but one has access to a large pool of unlabeled data. In this setting, a large teacher model generates "soft" pseudo-labels for the unlabeled dataset which are then used for training the student model. Despite its success in a wide variety of applications, a shortcoming of this approach is that the teacher's pseudo-labels are often noisy, leading to impaired student performance. In this paper, we present a principled method for knowledge distillation with unlabeled examples that we call Student-Label Mixing (SLaM) and we show that it consistently improves over prior approaches by evaluating it on several standard benchmarks.
Finally, we show that SLaM comes with theoretical guarantees; along the way we give an algorithm improving the best-known sample complexity for learning halfspaces with margin under random classification noise,
and provide the first convergence analysis for so-called ``forward loss-adjustment" methods. Vasilis Kontonis, Fotis Iliopoulos, Khoa Trinh, Cenk Baykal, Gaurav Menghani, Erik Vee |
NeurIPS | 5 |
| 2022 | Weighted Distillation with Unlabeled ExamplesabstractDistillation with unlabeled examples is a popular and powerful method for training deep neural networks in settings where the amount of labeled data is limited: A large “teacher” neural network is trained on the labeled data available, and then it is used to generate labels on an unlabeled dataset (typically much larger in size). These labels are then utilized to train the smaller “student” model which will actually be deployed. Naturally, the success of the approach depends on the quality of the teacher’s labels, since the student could be confused if trained on inaccurate data. This paper proposes a principled approach for addressing this issue based on a “debiasing" reweighting of the student’s loss function tailored to the distillation training paradigm. Our method is hyper-parameter free, data-agnostic, and simple to implement. We demonstrate significant improvements on popular academic datasets and we accompany our results with a theoretical analysis which rigorously justifies the performance of our method in certain settings. Fotis Iliopoulos, Vasilis Kontonis, Cenk Baykal, Gaurav Menghani, Khoa Trinh, Erik Vee |
NeurIPS | 4 |