default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaghunandan H. Keshavan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]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- [c7]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 - [i8]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) - 2023
- [c6]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 - [i7]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) - [i6]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)
2010 – 2019
- 2010
- [j2]Raghunandan H. Keshavan, Andrea Montanari, Sewoong Oh:
Matrix Completion from Noisy Entries. J. Mach. Learn. Res. 11: 2057-2078 (2010) - [j1]Raghunandan H. Keshavan, Andrea Montanari, Sewoong Oh:
Matrix completion from a few entries. IEEE Trans. Inf. Theory 56(6): 2980-2998 (2010) - [c5]Raghunandan H. Keshavan, Andrea Montanari:
Regularization for matrix completion. ISIT 2010: 1503-1507
2000 – 2009
- 2009
- [c4]Raghunandan H. Keshavan, Andrea Montanari, Sewoong Oh:
Low-rank matrix completion with noisy observations: A quantitative comparison. Allerton 2009: 1216-1222 - [c3]Raghunandan H. Keshavan, Sewoong Oh, Andrea Montanari:
Matrix completion from a few entries. ISIT 2009: 324-328 - [c2]Raghunandan H. Keshavan, Andrea Montanari, Sewoong Oh:
Matrix Completion from Noisy Entries. NIPS 2009: 952-960 - [i5]Raghunandan H. Keshavan, Sewoong Oh, Andrea Montanari:
Matrix Completion from a Few Entries. CoRR abs/0901.3150 (2009) - [i4]Raghunandan H. Keshavan, Andrea Montanari, Sewoong Oh:
Matrix Completion from Noisy Entries. CoRR abs/0906.2027 (2009) - [i3]Raghunandan H. Keshavan, Andrea Montanari, Sewoong Oh:
Low-rank Matrix Completion with Noisy Observations: a Quantitative Comparison. CoRR abs/0910.0921 (2009) - [i2]Raghunandan H. Keshavan, Sewoong Oh:
A Gradient Descent Algorithm on the Grassman Manifold for Matrix Completion. CoRR abs/0910.5260 (2009) - 2008
- [c1]Raghunandan H. Keshavan, Andrea Montanari, Sewoong Oh:
Learning low rank matrices from O(n) entries. Allerton 2008: 1365-1372 - [i1]Raghunandan H. Keshavan, Andrea Montanari, Sewoong Oh:
Learning Low Rank Matrices from O(n) Entries. CoRR abs/0812.2599 (2008)
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-10-23 20:33 CEST 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:
