全部

Spanning bipartite block designs

  • 演讲者:Ryoh Fuji-Hara(日本筑波大学)

  • 时间:2024-11-29 10:00-11:00

  • 地点:理学院大楼 M4009,腾讯会议ID:995 677 362

Abstract

We are inspired by an application in deep learning called the DropConnect method, which sparses edges in a complete bipartite graph (connections) to avoid overfitting, and its application to experimental design to improve estimation accuracy. We propose a combinatorial problem called Spanning Bipartite Block Design (SBBD) and show how to construct designs that satisfy the combinatorial requirements of SBBD.