default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikhil Mehta 0002
Person information
- affiliation (PhD 2020): Duke University, Durham, NC, USA
- affiliation (former): Google
- affiliation (former): Meta
- affiliation (former): IIT Kanpur, Department of Aerospace Engineering, India
Other persons with the same name
- Nikhil Mehta 0001 — University of North Carolina Greensboro, School of Business and Economics, NC, USA (and 3 more)
- Nikhil Mehta 0003 — Purdue University, Department of Computer Science, West Lafayette, IN, USA
- Nikhil Mehta 0004
![[0000-0002-7277-8466]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-7277-8466")
— NVIDIA, USA (and 1 more) - Nikhil Mehta 0005 — Columbia University, Department of Computer Science, New York, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Yuwei Cao, Nikhil Mehta, Xinyang Yi, Raghunandan Hulikal Keshavan, Lukasz Heldt, Lichan Hong, Ed H. Chi, Maheswaran Sathiamoorthy:
Aligning Large Language Models with Recommendation Knowledge. NAACL-HLT (Findings) 2024: 1051-1066- [c13]Anima Singh, Trung Vu, Nikhil Mehta, Raghunandan H. Keshavan, Maheswaran Sathiamoorthy, Yilin Zheng, Lichan Hong, Lukasz Heldt, Li Wei, Devansh Tandon, Ed H. Chi, Xinyang Yi:
Better Generalization with Semantic IDs: A Case Study in Ranking for Recommendations. RecSys 2024: 1039-1044 - [c12]Nikhil Mehta, Kevin J. Liang, Jing Huang, Fu-Jen Chu, Li Yin, Tal Hassner:
HyperMix: Out-of-Distribution Detection and Classification in Few-Shot Settings. WACV 2024: 2399-2409 - [c11]Vinay Kumar Verma, Nikhil Mehta, Kevin J. Liang, Aakansha Mishra, Lawrence Carin:
Meta-Learned Attribute Self-Interaction Network for Continual and Generalized Zero-Shot Learning. WACV 2024: 2709-2719 - [i18]Yuwei Cao, Nikhil Mehta, Xinyang Yi, Raghunandan H. Keshavan, Lukasz Heldt, Lichan Hong, Ed H. Chi, Maheswaran Sathiamoorthy:
Aligning Large Language Models with Recommendation Knowledge. CoRR abs/2404.00245 (2024) - [i17]Dong-Ho Lee, Adam Kraft, Long Jin, Nikhil Mehta, Taibai Xu, Lichan Hong, Ed H. Chi, Xinyang Yi:
STAR: A Simple Training-free Approach for Recommendations using Large Language Models. CoRR abs/2410.16458 (2024) - 2023
- [c10]Shashank Rajput, Nikhil Mehta, Anima Singh, Raghunandan Hulikal Keshavan, Trung Vu, Lukasz Heldt, Lichan Hong, Yi Tay, Vinh Q. Tran, Jonah Samost, Maciej Kula, Ed H. Chi, Mahesh Sathiamoorthy:
Recommender Systems with Generative Retrieval. NeurIPS 2023 - [c9]Vinay Kumar Verma, Nikhil Mehta, Shijing Si, Ricardo Henao, Lawrence Carin:
Pushing the Efficiency Limit Using Structured Sparse Convolutions. WACV 2023: 6492-6502 - [i16]Shashank Rajput, Nikhil Mehta, Anima Singh, Raghunandan H. Keshavan, Trung Vu, Lukasz Heldt, Lichan Hong, Yi Tay, Vinh Q. Tran, Jonah Samost, Maciej Kula, Ed H. Chi, Maheswaran Sathiamoorthy:
Recommender Systems with Generative Retrieval. CoRR abs/2305.05065 (2023) - [i15]Wang-Cheng Kang, Jianmo Ni, Nikhil Mehta, Maheswaran Sathiamoorthy, Lichan Hong, Ed H. Chi, Derek Zhiyuan Cheng:
Do LLMs Understand User Preferences? Evaluating LLMs On User Rating Prediction. CoRR abs/2305.06474 (2023) - [i14]Anima Singh, Trung Vu, Raghunandan H. Keshavan, Nikhil Mehta, Xinyang Yi, Lichan Hong, Lukasz Heldt, Li Wei, Ed H. Chi, Maheswaran Sathiamoorthy:
Better Generalization with Semantic IDs: A case study in Ranking for Recommendations. CoRR abs/2306.08121 (2023) - [i13]Nikhil Mehta, Anima Singh, Xinyang Yi, Sagar Jain, Lichan Hong, Ed H. Chi:
Density Weighting for Multi-Interest Personalized Recommendation. CoRR abs/2308.01563 (2023) - [i12]Vinay Kumar Verma, Nikhil Mehta, Kevin J. Liang, Aakansha Mishra, Lawrence Carin:
Meta-Learned Attribute Self-Interaction Network for Continual and Generalized Zero-Shot Learning. CoRR abs/2312.01167 (2023) - [i11]Nikhil Mehta, Kevin J. Liang, Jing Huang, Fu-Jen Chu, Li Yin, Tal Hassner:
HyperMix: Out-of-Distribution Detection and Classification in Few-Shot Settings. CoRR abs/2312.15086 (2023) - 2022
- [b1]Nikhil Mehta:
Towards Efficient Continual Learning in Deep Neural Networks. Duke University, Durham, NC, USA, 2022 - [j1]Weituo Hao, Nikhil Mehta, Kevin J. Liang, Pengyu Cheng, Mostafa El-Khamy, Lawrence Carin:
WAFFLe: Weight Anonymized Factorization for Federated Learning. IEEE Access 10: 49207-49218 (2022) - [i10]Dhanasekar Sundararaman, Nikhil Mehta, Lawrence Carin:
Pseudo-OOD training for robust language models. CoRR abs/2210.09132 (2022) - [i9]Vinay Kumar Verma, Nikhil Mehta, Shijing Si, Ricardo Henao, Lawrence Carin:
Pushing the Efficiency Limit Using Structured Sparse Convolutions. CoRR abs/2210.12818 (2022) - 2021
- [c8]Nikhil Mehta, Kevin J. Liang, Vinay Kumar Verma, Lawrence Carin:
Continual Learning using a Bayesian Nonparametric Dictionary of Weight Factors. AISTATS 2021: 100-108 - [c7]Serge Assaad, Shuxi Zeng, Chenyang Tao, Shounak Datta, Nikhil Mehta, Ricardo Henao, Fan Li, Lawrence Carin:
Counterfactual Representation Learning with Balancing Weights. AISTATS 2021: 1972-1980 - [c6]Vinay Kumar Verma, Kevin J. Liang, Nikhil Mehta, Piyush Rai, Lawrence Carin:
Efficient Feature Transformations for Discriminative and Generative Continual Learning. CVPR 2021: 13865-13875 - [i8]Vinay Kumar Verma, Kevin J. Liang, Nikhil Mehta, Lawrence Carin:
Meta-Learned Attribute Self-Gating for Continual Generalized Zero-Shot Learning. CoRR abs/2102.11856 (2021) - [i7]Vinay Kumar Verma, Kevin J. Liang, Nikhil Mehta, Piyush Rai, Lawrence Carin:
Efficient Feature Transformations for Discriminative and Generative Continual Learning. CoRR abs/2103.13558 (2021) - 2020
- [c5]Arindam Sarkar, Nikhil Mehta, Piyush Rai:
Graph Representation Learning via Ladder Gamma Variational Autoencoders. AAAI 2020: 5604-5611 - [c4]Paidamoyo Chapfuwa, Chunyuan Li, Nikhil Mehta, Lawrence Carin, Ricardo Henao:
Survival cluster analysis. CHIL 2020: 60-68 - [i6]Paidamoyo Chapfuwa, Chunyuan Li, Nikhil Mehta, Lawrence Carin, Ricardo Henao:
Survival Cluster Analysis. CoRR abs/2003.00355 (2020) - [i5]Nikhil Mehta, Kevin J. Liang, Lawrence Carin:
Bayesian Nonparametric Weight Factorization for Continual Learning. CoRR abs/2004.10098 (2020) - [i4]Weituo Hao, Nikhil Mehta, Kevin J. Liang, Pengyu Cheng, Mostafa El-Khamy, Lawrence Carin:
WAFFLe: Weight Anonymized Factorization for Federated Learning. CoRR abs/2008.05687 (2020) - [i3]Serge Assaad, Shuxi Zeng, Chenyang Tao, Shounak Datta, Nikhil Mehta, Ricardo Henao, Fan Li, Lawrence Carin:
Counterfactual Representation Learning with Balancing Weights. CoRR abs/2010.12618 (2020)
2010 – 2019
- 2019
- [c3]Rajat Panda, Ankit Pensia, Nikhil Mehta, Mingyuan Zhou, Piyush Rai:
Deep Topic Models for Multi-label Learning. AISTATS 2019: 2849-2857 - [c2]Nikhil Mehta, Lawrence Carin, Piyush Rai:
Stochastic Blockmodels meet Graph Neural Networks. ICML 2019: 4466-4474 - [i2]Nikhil Mehta, Lawrence Carin, Piyush Rai:
Stochastic Blockmodels meet Graph Neural Networks. CoRR abs/1905.05738 (2019) - 2018
- [c1]Nikhil Mehta, James R. McBride, Gaurav Pandey:
Robust and Fast 3D Scan Alignment Using Mutual Information. ICRA 2018: 1-8 - 2017
- [i1]Nikhil Mehta, James R. McBride, Gaurav Pandey:
Robust and Fast 3D Scan Alignment using Mutual Information. CoRR abs/1709.06948 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-12 21:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
