Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Dota 2 with Large Scale Deep Reinforcement Learning.

C. Berner, G. Brockman, B. Chan, V. Cheung, P. Debiak, C. Dennison, D. Farhi, Q. Fischer, S. Hashme, C. Hesse, R. Józefowicz, S. Gray, C. Olsson, J. Pachocki, M. Petrov, H. de Oliveira Pinto, J. Raiman, T. Salimans, J. Schlatter, J. Schneider, S. Sidor, I. Sutskever, J. Tang, F. Wolski, and S. Zhang. CoRR, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jakub Mácha

Analytische Theorien der Metapher: Untersuchungen zum Konzept der metaphorischen BedeutungJ. Mácha. Uni Hannover, (2009)

Jakub Kopycki

Jakub Novák

Jakub Limanowski

Jakub Hodek

Other publications of authors with the same name

On the string consensus problem and the Manhattan sequence consensus problem.T. Kociumaka, J. Pachocki, J. Radoszewski, W. Rytter, and T. Walen. Theor. Comput. Sci., (2018)Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries.C. Tsourakakis, T. Chen, N. Kakimura, and J. Pachocki. ECML/PKDD (1), volume 11906 of Lecture Notes in Computer Science, page 378-394. Springer, (2019)Efficient counting of square substrings in a tree.T. Kociumaka, J. Pachocki, J. Radoszewski, W. Rytter, and T. Walen. Theor. Comput. Sci., (2014)Scalable motif-aware graph clustering.C. Tsourakakis, J. Pachocki, and M. Mitzenmacher. CoRR, (2016)Efficient Counting of Square Substrings in a Tree.T. Kociumaka, J. Pachocki, J. Radoszewski, W. Rytter, and T. Walen. ISAAC, volume 7676 of Lecture Notes in Computer Science, page 207-216. Springer, (2012)Emergent Complexity via Multi-Agent Competition.T. Bansal, J. Pachocki, S. Sidor, I. Sutskever, and I. Mordatch. ICLR (Poster), OpenReview.net, (2018)Tight Lower Bounds on Graph Embedding Problems.M. Cygan, F. Fomin, A. Golovnev, A. Kulikov, I. Mihajlin, J. Pachocki, and A. Socala. CoRR, (2016)Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion QueriesT. E., C. Tianyi, K. Naonori, and P. Jakub. (2019)Tight Bounds for Graph Homomorphism and Subgraph Isomorphism.M. Cygan, F. Fomin, A. Golovnev, A. Kulikov, I. Mihajlin, J. Pachocki, and A. Socala. SODA, page 1643-1649. SIAM, (2016)Tuning Large Neural Networks via Zero-Shot Hyperparameter Transfer.G. Yang, E. Hu, I. Babuschkin, S. Sidor, X. Liu, D. Farhi, N. Ryder, J. Pachocki, W. Chen, and J. Gao. NeurIPS, page 17084-17097. (2021)

BibSonomy

Disambiguation of "Pachocki, Jakub"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Dota 2 with Large Scale Deep Reinforcement Learning.

Please choose a person to relate this publication to

Jakub Mácha

Jakub Kopycki

Jakub Novák

Jakub Limanowski

Jakub Hodek

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Pachocki, Jakub"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Dota 2 with Large Scale Deep Reinforcement Learning.

Please choose a person to relate this publication to

Jakub Mácha

Jakub Kopycki

Jakub Novák

Jakub Limanowski

Jakub Hodek

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Dota 2 with Large Scale Deep Reinforcement Learning.