Jakub Pachocki

Affiliations:
  • OpenAI, San Francisco, CA, USA
  • Harvard University, Cambridge, MA, USA
  • Carnegie Mellon University, School of Computer Science, Pittsburgh, PA, USA (PhD)
  • University of Warsaw, Faculty of Mathematics, Informatics and Mechanics, Poland


According to our database1, Jakub Pachocki authored at least 27 papers between 2013 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Tensor Programs V: Tuning Large Neural Networks via Zero-Shot Hyperparameter Transfer.
CoRR, 2022

2021
Tuning Large Neural Networks via Zero-Shot Hyperparameter Transfer.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Online Row Sampling.
Theory Comput., 2020

Learning dexterous in-hand manipulation.
Int. J. Robotics Res., 2020

2019
Dota 2 with Large Scale Deep Reinforcement Learning.
CoRR, 2019

Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2019

2018
On the string consensus problem and the Manhattan sequence consensus problem.
Theor. Comput. Sci., 2018

Constant Arboricity Spectral Sparsifiers.
CoRR, 2018

Learning Dexterous In-Hand Manipulation.
CoRR, 2018

Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Emergent Complexity via Multi-Agent Competition.
Proceedings of the 6th International Conference on Learning Representations, 2018

2017
Tight Lower Bounds on Graph Embedding Problems.
J. ACM, 2017

Optimal lower bounds for universal relation, samplers, and finding duplicates.
CoRR, 2017

Scalable Motif-aware Graph Clustering.
Proceedings of the 26th International Conference on World Wide Web, 2017

A Framework for Analyzing Resparsification Algorithms.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Optimal Lower Bounds for Universal Relation, and for Samplers and Finding Duplicates in Streams.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016
Analysis of Resparsification.
CoRR, 2016

Routing under balance.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Geometric median in nearly linear time.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Tight Bounds for Graph Homomorphism and Subgraph Isomorphism.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
The Hardness of Subgraph Isomorphism.
CoRR, 2015

Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling.
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

2014
Efficient counting of square substrings in a tree.
Theor. Comput. Sci., 2014

Stretching Stretch.
CoRR, 2014

Preconditioning in Expectation.
CoRR, 2014

Solving SDD linear systems in nearly <i>m</i>log<sup>1/2</sup><i>n</i> time.
Proceedings of the Symposium on Theory of Computing, 2014

2013
A note on efficient computation of all Abelian periods in a string.
Inf. Process. Lett., 2013


  Loading...