activity
20132026
most citedNeural Architecture Search: A Survey

1.8k citations · 1.8k across the 4 of their papers we have counts for

collaborators

6 papers

math.LO2026

An easy proof that there may be no P-points

David Chodounský, Osvaldo Guzmán, Jonathan Verner

We provide an easy proof that there are no P-points in the models obtained by adding many Silver reals with countable support to a model of CH.

math.CO2023

Characterisation of the big Ramsey degrees of the generic partial order

Martin Balko, David Chodounský, Natasha Dobrinen +4

As a result of 33 intercontinental Zoom calls, we characterise big Ramsey degrees of the generic partial order. This is an infinitary extension of the well known fact that finite p…

math.CO2021

Big Ramsey degrees and forbidden cycles

Martin Balko, David Chodounský, Jan Hubička +3

Using the Carlson-Simpson theorem, we give a new general condition for a structure in a finite binary relational language to have finite big Ramsey degrees

stat.ML2018★ 1.8k cited

Neural Architecture Search: A Survey

Thomas Elsken, Jan Hendrik Metzen, Frank Hutter

Deep Learning has enabled remarkable progress over the last years on a variety of tasks, such as image recognition, speech recognition, and machine translation. One crucial aspect…

math.LO2017

There are no P-points in Silver extensions

David Chodounský, Osvaldo Guzmán

We prove that after adding a Silver real no ultrafilter from the ground model can be extended to a P-point, and this remains to be the case in any further extension which has the S…

math.LO2013

Hausdorff gaps and towers in P(ω)/Fin

Piotr Borodulin-Nadzieja, David Chodounský

We define and study two classes of uncountable -chains: Hausdorff towers and Suslin towers. We discuss their existence in various models of set theory. Then, some of t…