Остановите войну!
for scientists:
default search action
Prateek Jain 0002
- > Home > Persons > Prateek Jain 0002
Publications
- 2023
- [i92]Devvrit, Sneha Kudugunta, Aditya Kusupati, Tim Dettmers, Kaifeng Chen, Inderjit S. Dhillon, Yulia Tsvetkov, Hannaneh Hajishirzi, Sham M. Kakade, Ali Farhadi, Prateek Jain:
MatFormer: Nested Transformer for Elastic Inference. CoRR abs/2310.07707 (2023) - [i91]Ramnath Kumar, Anshul Mittal, Nilesh Gupta, Aditya Kusupati, Inderjit S. Dhillon, Prateek Jain:
EHI: End-to-end Learning of Hierarchical Index for Efficient Dense Retrieval. CoRR abs/2310.08891 (2023) - [i90]Nilesh Gupta, Devvrit Khatri, Ankit S. Rawat, Srinadh Bhojanapalli, Prateek Jain, Inderjit S. Dhillon:
Efficacy of Dual-Encoders for Extreme Multi-Label Classification. CoRR abs/2310.10636 (2023) - 2022
- [c109]Anish Acharya, Abolfazl Hashemi, Prateek Jain, Sujay Sanghavi, Inderjit S. Dhillon, Ufuk Topcu:
Robust Training in High Dimensions via Block Coordinate Geometric Median Descent. AISTATS 2022: 11145-11168 - [c104]Devvrit, Aditya Sinha, Inderjit S. Dhillon, Prateek Jain:
S3GC: Scalable Self-Supervised Graph Clustering. NeurIPS 2022 - 2021
- [i70]Anish Acharya, Abolfazl Hashemi, Prateek Jain, Sujay Sanghavi, Inderjit S. Dhillon, Ufuk Topcu:
Robust Training in High Dimensions via Block Coordinate Geometric Median Descent. CoRR abs/2106.08882 (2021) - 2019
- [c79]Kai Zhong, Zhao Song, Prateek Jain, Inderjit S. Dhillon:
Provable Non-linear Inductive Matrix Completion. NeurIPS 2019: 11435-11445 - 2018
- [i47]Kai Zhong, Zhao Song, Prateek Jain, Inderjit S. Dhillon:
Nonlinear Inductive Matrix Completion based on One-layer Neural Networks. CoRR abs/1805.10477 (2018) - 2017
- [j8]Prateek Jain, Ambuj Tewari, Inderjit S. Dhillon:
Partial Hard Thresholding. IEEE Trans. Inf. Theory 63(5): 3029-3038 (2017) - [c58]Kai Zhong, Zhao Song, Prateek Jain, Peter L. Bartlett, Inderjit S. Dhillon:
Recovery Guarantees for One-hidden-layer Neural Networks. ICML 2017: 4140-4149 - [i44]Kai Zhong, Zhao Song, Prateek Jain, Peter L. Bartlett, Inderjit S. Dhillon:
Recovery Guarantees for One-hidden-layer Neural Networks. CoRR abs/1706.03175 (2017) - 2016
- [c51]Prateek Jain, Nikhil Rao, Inderjit S. Dhillon:
Structured Sparse Regression via Greedy Hard Thresholding. NIPS 2016: 1516-1524 - [c50]Kai Zhong, Prateek Jain, Inderjit S. Dhillon:
Mixed Linear Regression with Multiple Components. NIPS 2016: 2190-2198 - [i38]Prateek Jain, Nikhil Rao, Inderjit S. Dhillon:
Structured Sparse Regression via Greedy Hard-Thresholding. CoRR abs/1602.06042 (2016) - 2015
- [c47]Kai Zhong, Prateek Jain, Inderjit S. Dhillon:
Efficient Matrix Sensing Using Rank-1 Gaussian Measurements. ALT 2015: 3-18 - 2014
- [c35]Hsiang-Fu Yu, Prateek Jain, Purushottam Kar, Inderjit S. Dhillon:
Large-scale Multi-label Learning with Missing Labels. ICML 2014: 593-601 - 2013
- [i14]Prateek Jain, Inderjit S. Dhillon:
Provable Inductive Matrix Completion. CoRR abs/1306.0626 (2013) - [i12]Hsiang-Fu Yu, Prateek Jain, Inderjit S. Dhillon:
Large-scale Multi-label Learning with Missing Labels. CoRR abs/1307.5101 (2013) - 2012
- [j3]Prateek Jain, Brian Kulis, Jason V. Davis, Inderjit S. Dhillon:
Metric and Kernel Learning Using a Linear Transformation. J. Mach. Learn. Res. 13: 519-547 (2012) - 2011
- [c16]Prateek Jain, Ambuj Tewari, Inderjit S. Dhillon:
Orthogonal Matching Pursuit with Replacement. NIPS 2011: 1215-1223 - [i6]Prateek Jain, Ambuj Tewari, Inderjit S. Dhillon:
Orthogonal Matching Pursuit with Replacement. CoRR abs/1106.2774 (2011) - 2010
- [c12]Prateek Jain, Raghu Meka, Inderjit S. Dhillon:
Guaranteed Rank Minimization via Singular Value Projection. NIPS 2010: 937-945 - [c11]Prateek Jain, Brian Kulis, Inderjit S. Dhillon:
Inductive Regularized Learning of Kernel Functions. NIPS 2010: 946-954 - 2009
- [c9]Zhengdong Lu, Prateek Jain, Inderjit S. Dhillon:
Geometry-aware metric learning. ICML 2009: 673-680 - [c8]Raghu Meka, Prateek Jain, Inderjit S. Dhillon:
Matrix Completion from Power-Law Distributed Samples. NIPS 2009: 1258-1266 - [i2]Raghu Meka, Prateek Jain, Inderjit S. Dhillon:
Guaranteed Rank Minimization via Singular Value Projection. CoRR abs/0909.5457 (2009) - [i1]Prateek Jain, Brian Kulis, Jason V. Davis, Inderjit S. Dhillon:
Metric and Kernel Learning using a Linear Transformation. CoRR abs/0910.5932 (2009) - 2008
- [j1]Prateek Jain, Raghu Meka, Inderjit S. Dhillon:
Simultaneous Unsupervised Learning of Disparate Clusterings. Stat. Anal. Data Min. 1(3): 195-210 (2008) - [c6]Raghu Meka, Prateek Jain, Constantine Caramanis, Inderjit S. Dhillon:
Rank minimization via online learning. ICML 2008: 656-663 - [c5]Prateek Jain, Brian Kulis, Inderjit S. Dhillon, Kristen Grauman:
Online Metric Learning and Fast Similarity Search. NIPS 2008: 761-768 - [c4]Prateek Jain, Raghu Meka, Inderjit S. Dhillon:
Simultaneous Unsupervised Learning of Disparate Clusterings. SDM 2008: 858-869 - 2007
- [c3]Jason V. Davis, Brian Kulis, Prateek Jain, Suvrit Sra, Inderjit S. Dhillon:
Information-theoretic metric learning. ICML 2007: 209-216
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-04-25 05:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint