Search Results for author:
Found 3 papers, 0 papers with code
On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function
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.
Large hypergraphs without tight cycles
An $r$-uniform tight cycle of length $\ell>r$ is a hypergraph with vertices $v_1,\dots, v_\ell$ and edges $\{v_i, v_{i+1},\dots, v_{i+r-1}\}$ (for all $i$), with the indices taken modulo $\ell$.
Combinatorics
A New Upper Bound for Cancellative Pairs
A pair $(\mathcal{A},\mathcal{B})$ of families of subsets of an $n$-element set is called cancellative if whenever $A, A'\in\mathcal{A}$ and $B\in\mathcal{B}$ satisfy $A\cup B=A'\cup B$, then $A=A'$, and whenever $A\in\mathcal{A}$ and $B, B'\in\mathcal{B}$ satisfy $A\cup B=A\cup B'$, then $B=B'$.
Combinatorics 05D05
