Jakub Pachocki

According to our database, Jakub Pachocki authored at least 28 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A Note on the Maximum Number of k-Powers in a Finite Word.

Shuo Li, Jakub Pachocki, Jakub Radoszewski

Electron. J. Comb., 2024

2022

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

Greg Yang, Edward J. Hu, Igor Babuschkin, Szymon Sidor, Xiaodong Liu, David Farhi, Nick Ryder, Jakub Pachocki, Weizhu Chen, Jianfeng Gao

CoRR, 2022

2021

Tuning Large Neural Networks via Zero-Shot Hyperparameter Transfer.

Ge Yang, Edward J. Hu, Igor Babuschkin, Szymon Sidor, Xiaodong Liu, David Farhi, Nick Ryder, Jakub Pachocki, Weizhu Chen, Jianfeng Gao

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020

Online Row Sampling.

Michael B. Cohen, Cameron Musco, Jakub Pachocki

Theory Comput., 2020

Learning dexterous in-hand manipulation.

Marcin Andrychowicz, Bowen Baker, Maciek Chociej, Rafal Józefowicz, Bob McGrew, Jakub Pachocki, Arthur Petron, Matthias Plappert, Glenn Powell, Alex Ray, Jonas Schneider, Szymon Sidor, Josh Tobin, Peter Welinder, Lilian Weng, Wojciech Zaremba

Int. J. Robotics Res., 2020

2019

Dota 2 with Large Scale Deep Reinforcement Learning.

Christopher Berner, Greg Brockman, Brooke Chan, Vicki Cheung, Przemyslaw Debiak, Christy Dennison, David Farhi, Quirin Fischer, Shariq Hashme, Christopher Hesse, Rafal Józefowicz, Scott Gray, Catherine Olsson, Jakub Pachocki, Michael Petrov, Henrique Pondé de Oliveira Pinto, Jonathan Raiman, Tim Salimans, Jeremy Schlatter, Jonas Schneider, Szymon Sidor, Ilya Sutskever, Jie Tang, Filip Wolski, Susan Zhang

CoRR, 2019

Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries.

Charalampos E. Tsourakakis, Tianyi Chen, Naonori Kakimura, Jakub Pachocki

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2019

2018

On the string consensus problem and the Manhattan sequence consensus problem.

Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen

Theor. Comput. Sci., 2018

Constant Arboricity Spectral Sparsifiers.

Timothy Chu, Michael B. Cohen, Jakub W. Pachocki, Richard Peng

CoRR, 2018

Learning Dexterous In-Hand Manipulation.

OpenAI, Marcin Andrychowicz, Bowen Baker, Maciek Chociej, Rafal Józefowicz, Bob McGrew, Jakub Pachocki, Arthur Petron, Matthias Plappert, Glenn Powell, Alex Ray, Jonas Schneider, Szymon Sidor, Josh Tobin, Peter Welinder, Lilian Weng, Wojciech Zaremba

CoRR, 2018

Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners.

Jakub Pachocki, Liam Roditty, Aaron Sidford, Roei Tov, Virginia Vassilevska Williams

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Emergent Complexity via Multi-Agent Competition.

Trapit Bansal, Jakub Pachocki, Szymon Sidor, Ilya Sutskever, Igor Mordatch

Proceedings of the 6th International Conference on Learning Representations, 2018

2017

Tight Lower Bounds on Graph Embedding Problems.

Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala

J. ACM, 2017

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

Jelani Nelson, Jakub Pachocki, Zhengyu Wang

CoRR, 2017

Scalable Motif-aware Graph Clustering.

Charalampos E. Tsourakakis, Jakub Pachocki, Michael Mitzenmacher

Proceedings of the 26th International Conference on World Wide Web, 2017

A Framework for Analyzing Resparsification Algorithms.

Rasmus Kyng, Jakub Pachocki, Richard Peng, Sushant Sachdeva

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.

Michael Kapralov, Jelani Nelson, Jakub Pachocki, Zhengyu Wang, David P. Woodruff, Mobin Yahyazadeh

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

Analysis of Resparsification.

Jakub Pachocki

CoRR, 2016

Routing under balance.

Alina Ene, Gary L. Miller, Jakub Pachocki, Aaron Sidford

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Geometric median in nearly linear time.

Michael B. Cohen, Yin Tat Lee, Gary L. Miller, Jakub Pachocki, Aaron Sidford

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Tight Bounds for Graph Homomorphism and Subgraph Isomorphism.

Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

The Hardness of Subgraph Isomorphism.

Marek Cygan, Jakub Pachocki, Arkadiusz Socala

CoRR, 2015

Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling.

Michael Mitzenmacher, Jakub Pachocki, Richard Peng, Charalampos E. Tsourakakis, Shen Chen Xu

Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

2014

Efficient counting of square substrings in a tree.

Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen

Theor. Comput. Sci., 2014

Stretching Stretch.

Michael B. Cohen, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Shen Chen Xu

CoRR, 2014

Preconditioning in Expectation.

Michael B. Cohen, Rasmus Kyng, Jakub W. Pachocki, Richard Peng, Anup B. Rao

CoRR, 2014

Solving SDD linear systems in nearly <i>m</i>log^1/2<i>n</i> time.

Michael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup B. Rao, Shen Chen Xu

Proceedings of the Symposium on Theory of Computing, 2014

2013

A note on efficient computation of all Abelian periods in a string.

Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen

Inf. Process. Lett., 2013