University Seminar: Logic Across Disciplines- Computing VC-density

Title: Computing VC-density
Speaker: Vince Guingona, Towsen University-
Date and time: Friday, November 22, 11:00am-12 noon
Place: Phillips Hall (801 22nd Street), Room 736

Abstract: We consider the problem of computing Vapnik-Chervonenkis Density (VC-density) of uniformly definable families of sets in models of certain theories.  VC-density is a measurement of the complexity of set systems that is closely related to multiple notions of learning in theoretical machine learning theory.  In this talk, we survey some earlier results, including computing VC-density in weakly o-minimal theories and strongly minimal theories from a paper by Aschenbrenner, Dolich, Haskell, MacPherson, and Starchenko and computing VC-density in algebraically closed valued fields from a paper by Basu and Patel.  Finally, we examine some results of mine on computing VC-density in VC-minimal theories.