Pratik Worah

Orcid: 0000-0002-2739-1246

According to our database1, Pratik Worah authored at least 27 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Enhancing selectivity using Wasserstein distance based reweighing.
CoRR, 2024

2023
The landscape of the proximal point method for nonconvex-nonconcave minimax optimization.
Math. Program., 2023

Pricing Query Complexity of Revenue Maximization.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Description Complexity of Regular Distributions.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Learning Rate Schedules in the Presence of Distribution Shift.
Proceedings of the International Conference on Machine Learning, 2023

2022
Limiting Behaviors of Nonconvex-Nonconcave Minimax Optimization via Continuous-Time Systems.
Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

2021
Learning to Price Against a Moving Target.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
The Landscape of Nonconvex-Nonconcave Minimax Optimization.
CoRR, 2020

2018
The Spectrum of the Fisher Information Matrix of a Single-Hidden-Layer Neural Network.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

A Dynamical System on Bipartite Graphs.
Proceedings of the 27th ACM International Conference on Information and Knowledge Management, 2018

A control version of the Freidlin-Wentzell Theorem.
Proceedings of the 2018 Annual American Control Conference, 2018

2017
Nonlinear random matrix theory for deep learning.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

2013
Total Acquisition in Graphs.
SIAM J. Discret. Math., 2013

A Short Excursion into Semi-Algebraic Hierarchies.
Electron. Colloquium Comput. Complex., 2013

A Characterization of Approximation Resistance.
Electron. Colloquium Comput. Complex., 2013

A Characterization of Strong Approximation Resistance.
Electron. Colloquium Comput. Complex., 2013

LS+ Lower Bounds from Pairwise Independence.
Proceedings of the 28th Conference on Computational Complexity, 2013

2012
Rank Bounds for a Hierarchy of Lovász and Schrijver.
Electron. Colloquium Comput. Complex., 2012

$LS_+$ Lower Bounds from Pairwise Independence.
Electron. Colloquium Comput. Complex., 2012

The Complexity of Somewhat Approximation Resistant Predicates.
Electron. Colloquium Comput. Complex., 2012

2010
Computing the Shortest Essential Cycle.
Discret. Comput. Geom., 2010

2008
The hub number of a graph.
Inf. Process. Lett., 2008

Testing contractibility in planar rips complexes.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007
A linear time deterministic algorithm to find a small subset that approximates the centroid.
Inf. Process. Lett., 2007

2006
A Temporal Logic Characterisation of Observational Determinism.
Proceedings of the 19th IEEE Computer Security Foundations Workshop, 2006

2004
Katha-Mala: A Voice Output Communication Aid for the Children with Severe Speech and Multiple Disorders (SSMI).
Proceedings of the 17th International Conference on VLSI Design (VLSI Design 2004), 2004

OaSis: An Application Specific Operating System for an Embedded Environment.
Proceedings of the 17th International Conference on VLSI Design (VLSI Design 2004), 2004


  Loading...