Chao Yan

most citedThe Sample Complexity of Distribution-Free Parity Learning in the Robust Shuffle Model

2 citations · 2 across the 3 of their papers we have counts for

collaborators

3 papers

cs.LG2021★ 2 cited

The Sample Complexity of Distribution-Free Parity Learning in the Robust Shuffle Model

Kobbi Nissim, Chao Yan

We provide a lowerbound on the sample complexity of distribution-free parity learning in the realizable case in the shuffle model of differential privacy. Namely, we show that the…

math.CO2019

Least $Q$ -eigenvalues of nonbipartite 2-connected graphs

Guanglong Yu, by Lin Sun, Chao Yan +2

Among all simple nonbipartite 2-connected graphs and among all nonbipartite $θ$ -graphs, the minimum least $Q$ -eigenvalues are completely determined, respectively.

math.CO2019

On the spectral radii of the unicyclic hypergraphs with fixed matching number

Guanglong Yu, Chao Yan, Yarong Wu +1

We determine the unique hypergraphs with maximum spectral radius among all connected $k$ -uniform ( $k \geq 3$ ) unicyclic hypergraphs with matching number at least $z$ , and among all…

The Sample Complexity of Distribution-Free Parity Learning in the Robust Shuffle Model

Least Q-eigenvalues of nonbipartite 2-connected graphs

On the spectral radii of the unicyclic hypergraphs with fixed matching number

Least $Q$ -eigenvalues of nonbipartite 2-connected graphs