Barnabás Janzer

activity

20172025

most citedGeneralizations of the Ruzsa-Szemerédi and rainbow Turán problems for cliques

18 citations · 39 across the 17 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

math.CO2021★ 1 cited

A note on saturation for $k$ -wise intersecting families

Barnabás Janzer

A family $F$ of subsets of ${1, \dots, n}$ is called $k$ -wise intersecting if any $k$ members of $F$ have non-empty intersection, and it is called maximal $k$ -w…

cs.LG2021★ 4 cited

On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function

Gellért Weisz, Philip Amortila, Barnabás Janzer +3

We consider local planning in fixed-horizon MDPs with a generative model under the assumption that the optimal value function lies close to the span of a feature map. The generativ…

A note on saturation for k-wise intersecting families

On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function

A note on saturation for $k$ -wise intersecting families