Show simple item record

dc.contributor.authorBhaskar, Umang
dc.descriptionPresented on October 18, 2019 at 11:00 a.m. in the Groseclose Building, Room 402.en_US
dc.descriptionUmang Bhaskar is a faculty member in the School of Technology and Computer Science at the Tata Institute of Fundamental Research. His primary research is on algorithmic game theory, the study of computational problems that arise when multiple rational agents interact, each trying to optimize its own objective.en_US
dc.descriptionRuntime: 56:41 minutesen_US
dc.description.abstractIn partial function extension, we are given a partial function consisting of points from a domain and a function value at each point. Our objective is to determine if this partial function can be extended to a total function defined on the domain, that additionally satisfies a given property, such as convexity. This basic problem underlies research questions in many areas, such as learning, property testing, and game theory. We present bounds on the complexity of partial function extension to subadditive, submodular, and convex functions, and present applications to learning as well as property testing for these functions. This is joint work with Gunjan Kumar.en_US
dc.format.extent56:41 minutes
dc.relation.ispartofseriesARC Colloquiumen_US
dc.subjectPartial function extensionen_US
dc.titlePartial Function Extension with Applications to Learning and Property Testingen_US
dc.contributor.corporatenameGeorgia Institute of Technology. Algorithms, Randomness and Complexity Centeren_US
dc.contributor.corporatenameTata Institute of Fundamental Researchen_US

Files in this item


This item appears in the following Collection(s)

  • ARC Talks and Events [88]
    Distinguished lectures, colloquia, seminars and speakers of interest to the ARC community

Show simple item record