activity
20152023
most citedSample complexity of learning Mahalanobis distance metrics

20 citations · 32 across the 6 of their papers we have counts for

collaborators

8 papers

cs.CL2023

Contrastive Loss is All You Need to Recover Analogies as Parallel Lines

Narutatsu Ri, Fei-Tzin Lee, Nakul Verma

While static word embedding models are known to represent linguistic analogies as parallel lines in high-dimensional space, the underlying mechanism as to why they result in such g…

cs.LG2022

Improving Model Training via Self-learned Label Representations

Xiao Yu, Nakul Verma

Modern neural network architectures have shown remarkable success in several large-scale classification and prediction tasks. Part of the success of these architectures is their fl…

cs.LG20194 cited

Meta-Learning to Cluster

Yibo Jiang, Nakul Verma

Clustering is one of the most fundamental and wide-spread techniques in exploratory data analysis. Yet, the basic approach to clustering has not really changed: a practitioner hand…

cs.LG20192 cited

Model-Agnostic Meta-Learning using Runge-Kutta Methods

Daniel Jiwoong Im, Yibo Jiang, Nakul Verma

Meta-learning has emerged as an important framework for learning new tasks from just a few examples. The success of any meta-learning model depends on (i) its fast adaptation to ne…

cs.LG20196 cited

Metric Learning on Manifolds

Max Aalto, Nakul Verma

Recent literature has shown that symbolic data, such as text and graphs, is often better represented by points on a curved manifold, rather than in Euclidean space. However, geomet…

cs.LG2019

Noise-tolerant fair classification

Alexandre Louis Lamy, Ziyuan Zhong, Aditya Krishna Menon +1

Fairness-aware learning involves designing algorithms that do not discriminate with respect to some sensitive feature (e.g., race or gender). Existing work on the problem operates…