default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrateek Jain 0002
- > Home > Persons > Prateek Jain 0002
Publications
- 2023
[c110]Aniket Rege, Aditya Kusupati, Sharan Ranjit S, Alan Fan, Qingqing Cao, Sham M. Kakade, Prateek Jain, Ali Farhadi:
AdANNS: A Framework for Adaptive Semantic Search. NeurIPS 2023- [i94]Aniket Rege, Aditya Kusupati, Sharan Ranjit S, Alan Fan, Qingqing Cao, Sham M. Kakade, Prateek Jain, Ali Farhadi:
AdANNS: A Framework for Adaptive Semantic Search. CoRR abs/2305.19435 (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) - 2022
- [c103]Aditya Kusupati, Gantavya Bhatt, Aniket Rege, Matthew Wallingford, Aditya Sinha, Vivek Ramanujan, William Howard-Snyder, Kaifeng Chen, Sham M. Kakade, Prateek Jain, Ali Farhadi:
Matryoshka Representation Learning. NeurIPS 2022 - [i87]Aditya Kusupati, Gantavya Bhatt, Aniket Rege, Matthew Wallingford, Aditya Sinha, Vivek Ramanujan, William Howard-Snyder
, Kaifeng Chen, Sham M. Kakade, Prateek Jain, Ali Farhadi:
Matryoshka Representations for Adaptive Deployment. CoRR abs/2205.13147 (2022) - 2021
- [c96]Aditya Kusupati, Matthew Wallingford, Vivek Ramanujan, Raghav Somani, Jae Sung Park, Krishna Pillutla, Prateek Jain, Sham M. Kakade, Ali Farhadi:
LLC: Accurate, Multi-purpose Learnt Low-dimensional Binary Codes. NeurIPS 2021: 23900-23913 - [i71]Aditya Kusupati, Matthew Wallingford, Vivek Ramanujan, Raghav Somani, Jae Sung Park, Krishna Pillutla, Prateek Jain, Sham M. Kakade, Ali Farhadi:
LLC: Accurate, Multi-purpose Learnt Low-dimensional Binary Codes. CoRR abs/2106.01487 (2021) - 2020
- [c92]Aditya Kusupati, Vivek Ramanujan, Raghav Somani, Mitchell Wortsman, Prateek Jain, Sham M. Kakade, Ali Farhadi:
Soft Threshold Weight Reparameterization for Learnable Sparsity. ICML 2020: 5544-5555 - [i65]Aditya Kusupati, Vivek Ramanujan, Raghav Somani, Mitchell Wortsman, Prateek Jain, Sham M. Kakade, Ali Farhadi:
Soft Threshold Weight Reparameterization for Learnable Sparsity. CoRR abs/2002.03231 (2020) - 2019
- [c81]Rong Ge, Prateek Jain, Sham M. Kakade, Rahul Kidambi, Dheeraj M. Nagaraj, Praneeth Netrapalli:
Open Problem: Do Good Algorithms Necessarily Query Bad Points? COLT 2019: 3190-3193 - 2018
- [c75]Prateek Jain, Sham M. Kakade, Rahul Kidambi, Praneeth Netrapalli, Aaron Sidford:
Accelerating Stochastic Gradient Descent for Least Squares Regression. COLT 2018: 545-604 - [c72]Rahul Kidambi, Praneeth Netrapalli, Prateek Jain, Sham M. Kakade:
On the insufficiency of existing momentum schemes for Stochastic Optimization. ICLR 2018 - [c70]Rahul Kidambi, Praneeth Netrapalli, Prateek Jain, Sham M. Kakade:
On the Insufficiency of Existing Momentum Schemes for Stochastic Optimization. ITA 2018: 1-9 - [i49]Rahul Kidambi, Praneeth Netrapalli, Prateek Jain, Sham M. Kakade:
On the insufficiency of existing momentum schemes for Stochastic Optimization. CoRR abs/1803.05591 (2018) - 2017
- [j9]Prateek Jain, Sham M. Kakade, Rahul Kidambi, Praneeth Netrapalli, Aaron Sidford:
Parallelizing Stochastic Gradient Descent for Least Squares Regression: Mini-batching, Averaging, and Model Misspecification. J. Mach. Learn. Res. 18: 223:1-223:42 (2017) - [c65]Prateek Jain, Chi Jin, Sham M. Kakade, Praneeth Netrapalli:
Global Convergence of Non-Convex Gradient Descent for Computing Matrix Squareroot. AISTATS 2017: 479-488 - [c62]Prateek Jain, Sham M. Kakade, Rahul Kidambi, Praneeth Netrapalli, Venkata Krishna Pillutla, Aaron Sidford:
A Markov Chain Theory Approach to Characterizing the Minimax Optimality of Stochastic Gradient Descent (for Least Squares). FSTTCS 2017: 2:1-2:10 - [i45]Prateek Jain, Sham M. Kakade, Rahul Kidambi, Praneeth Netrapalli, Aaron Sidford:
Accelerating Stochastic Gradient Descent. CoRR abs/1704.08227 (2017) - [i41]Prateek Jain, Sham M. Kakade, Rahul Kidambi, Praneeth Netrapalli, Venkata Krishna Pillutla, Aaron Sidford:
A Markov Chain Theory Approach to Characterizing the Minimax Optimality of Stochastic Gradient Descent (for Least Squares). CoRR abs/1710.09430 (2017) - 2016
- [c53]Prateek Jain, Chi Jin, Sham M. Kakade, Praneeth Netrapalli, Aaron Sidford:
Streaming PCA: Matching Matrix Bernstein and Near-Optimal Finite Sample Guarantees for Oja's Algorithm. COLT 2016: 1147-1164 - [i37]Prateek Jain, Chi Jin, Sham M. Kakade, Praneeth Netrapalli, Aaron Sidford:
Matching Matrix Bernstein with Little Memory: Near-Optimal Finite Sample Guarantees for Oja's Algorithm. CoRR abs/1602.06929 (2016) - [i32]Prateek Jain, Sham M. Kakade, Rahul Kidambi, Praneeth Netrapalli, Aaron Sidford:
Parallelizing Stochastic Approximation Through Mini-Batching and Tail-Averaging. CoRR abs/1610.03774 (2016) - 2015
- [i26]Prateek Jain, Chi Jin, Sham M. Kakade, Praneeth Netrapalli:
Computing Matrix Squareroot via Non Convex Local Search. CoRR abs/1507.05854 (2015)
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-09-13 00:43 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:
