default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPratik Worah
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i14]Pratik Worah:
Enhancing selectivity using Wasserstein distance based reweighing. CoRR abs/2401.11562 (2024)- 2023
- [j6]Benjamin Grimmer
, Haihao Lu, Pratik Worah, Vahab Mirrokni:
The landscape of the proximal point method for nonconvex-nonconcave minimax optimization. Math. Program. 201(1): 373-407 (2023) - [c16]Matthew Fahrbach, Adel Javanmard, Vahab Mirrokni, Pratik Worah:
Learning Rate Schedules in the Presence of Distribution Shift. ICML 2023: 9523-9546 - [c15]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah:
Description Complexity of Regular Distributions. EC 2023: 959 - [c14]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah:
Pricing Query Complexity of Revenue Maximization. SODA 2023: 399-415 - [i13]Matthew Fahrbach, Adel Javanmard, Vahab Mirrokni, Pratik Worah:
Learning Rate Schedules in the Presence of Distribution Shift. CoRR abs/2303.15634 (2023) - [i12]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah:
Description Complexity of Regular Distributions. CoRR abs/2305.05590 (2023) - 2022
- [c13]Benjamin Grimmer, Haihao Lu, Pratik Worah, Vahab S. Mirrokni:
Limiting Behaviors of Nonconvex-Nonconcave Minimax Optimization via Continuous-Time Systems. ALT 2022: 465-487 - 2021
- [c12]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah:
Learning to Price Against a Moving Target. ICML 2021: 6223-6232 - [i11]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah:
Learning to Price Against a Moving Target. CoRR abs/2106.04689 (2021) - [i10]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah:
Pricing Query Complexity of Revenue Maximization. CoRR abs/2111.03158 (2021) - 2020
- [i9]Benjamin Grimmer, Haihao Lu, Pratik Worah, Vahab S. Mirrokni:
The Landscape of Nonconvex-Nonconcave Minimax Optimization. CoRR abs/2006.08667 (2020) - [i8]Benjamin Grimmer, Haihao Lu, Pratik Worah, Vahab S. Mirrokni:
Limiting Behaviors of Nonconvex-Nonconcave Minimax Optimization via Continuous-Time Systems. CoRR abs/2010.10628 (2020)
2010 – 2019
- 2018
- [c11]Pratik Worah:
A control version of the Freidlin-Wentzell Theorem. ACC 2018: 3951-3954 - [c10]Kishore Papineni, Pratik Worah:
A Dynamical System on Bipartite Graphs. CIKM 2018: 1479-1482 - [c9]Jeffrey Pennington, Pratik Worah:
The Spectrum of the Fisher Information Matrix of a Single-Hidden-Layer Neural Network. NeurIPS 2018: 5415-5424 - 2017
- [c8]Jeffrey Pennington, Pratik Worah:
Nonlinear random matrix theory for deep learning. NIPS 2017: 2637-2646 - 2015
- [j5]Pratik Worah:
Rank bounds for a hierarchy of Lovász and Schrijver. J. Comb. Optim. 30(3): 689-709 (2015) - 2014
- [c7]Subhash Khot, Madhur Tulsiani, Pratik Worah:
The Complexity of Somewhat Approximation Resistant Predicates. ICALP (1) 2014: 689-700 - [c6]Subhash Khot, Madhur Tulsiani, Pratik Worah:
A characterization of strong approximation resistance. STOC 2014: 634-643 - 2013
- [j4]Timothy D. LeSaulnier, Noah Prince, Paul S. Wenger, Douglas B. West, Pratik Worah:
Total Acquisition in Graphs. SIAM J. Discret. Math. 27(4): 1800-1819 (2013) - [c5]Madhur Tulsiani, Pratik Worah:
LS+ Lower Bounds from Pairwise Independence. CCC 2013: 121-132 - [i7]Subhash Khot, Madhur Tulsiani, Pratik Worah:
A Characterization of Strong Approximation Resistance. CoRR abs/1305.5500 (2013) - [i6]Subhash Khot, Madhur Tulsiani, Pratik Worah:
A Characterization of Strong Approximation Resistance. Electron. Colloquium Comput. Complex. TR13 (2013) - [i5]Subhash Khot, Madhur Tulsiani, Pratik Worah:
A Characterization of Approximation Resistance. Electron. Colloquium Comput. Complex. TR13 (2013) - [i4]Pratik Worah:
A Short Excursion into Semi-Algebraic Hierarchies. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [i3]Subhash Khot, Madhur Tulsiani, Pratik Worah:
The Complexity of Somewhat Approximation Resistant Predicates. Electron. Colloquium Comput. Complex. TR12 (2012) - [i2]Madhur Tulsiani, Pratik Worah:
$LS_+$ Lower Bounds from Pairwise Independence. Electron. Colloquium Comput. Complex. TR12 (2012) - [i1]Pratik Worah:
Rank Bounds for a Hierarchy of Lovász and Schrijver. Electron. Colloquium Comput. Complex. TR12 (2012) - 2010
- [j3]Jeff Erickson, Pratik Worah:
Computing the Shortest Essential Cycle. Discret. Comput. Geom. 44(4): 912-930 (2010)
2000 – 2009
- 2008
- [j2]Tracy Grauman, Stephen G. Hartke, Adam S. Jobson, William B. Kinnersley, Douglas B. West, Lesley Wiglesworth, Pratik Worah, Hehui Wu:
The hub number of a graph. Inf. Process. Lett. 108(4): 226-228 (2008) - [c4]Erin W. Chambers, Jeff Erickson, Pratik Worah:
Testing contractibility in planar rips complexes. SCG 2008: 251-259 - 2007
- [j1]Pratik Worah, Sandeep Sen:
A linear time deterministic algorithm to find a small subset that approximates the centroid. Inf. Process. Lett. 105(1): 17-19 (2007) - 2006
- [c3]Marieke Huisman, Pratik Worah, Kim Sunesen:
A Temporal Logic Characterisation of Observational Determinism. CSFW 2006: 3 - 2004
- [c2]Gurashish Singh Brar, Susmit Biswas, Sudipta Kundu, Arijit Mukhopadhyay, Pratik Worah, Anupam Basu:
OaSis: An Application Specific Operating System for an Embedded Environment. VLSI Design 2004: 776-779 - [c1]Arijit Mukhopadhyay, Saptarshi Biswas, Pratik Worah, Ramasish Das, Susmit Biswas, Anupam Basu:
Katha-Mala: A Voice Output Communication Aid for the Children with Severe Speech and Multiple Disorders (SSMI). VLSI Design 2004: 951-
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-04-25 05:55 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:
