BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UM//UM*Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/Detroit
TZURL:http://tzurl.org/zoneinfo/America/Detroit
X-LIC-LOCATION:America/Detroit
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20070311T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20071104T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20251106T111012
DTSTART;TZID=America/Detroit:20251202T160000
DTEND;TZID=America/Detroit:20251202T173000
SUMMARY:Lecture / Discussion:Nam Center Colloquium Series | Homo juluensis: A Pan-Eastern Asian Middle Pleistocene Hominin
DESCRIPTION:Attend in person or via Zoom: https://myumi.ch/w9kqG.\n\nMiddle Pleistocene (~780\,000-~127\,000 years BP) fossils that cannot be easily assigned to Homo erectus\, H. neanderthalensis\, or H. sapiens have traditionally been lumped into a generic category like “archaic H. sapiens” (or H. heidelbergensis). How to classify these fossils has been the subject of intense debate over the past several decades\, a debate that is sometimes referred to simply as “The Muddle in the Middle.\" What is becoming increasingly clear is that multiple species of hominins were present across Eurasia and Africa during this time period. Here\, Bae will introduce Homo juluensis\, a new species of hominin that was present across eastern Asia that appeared as far north as southern Siberia\, as far south as Laos\, and even present in high altitudes (Qinghai-Tibet). In addition\, gaps in the paleoanthropological record (e.g.\, North Korea) will also be discussed as there is a good chance different types of hominins\, including H. juluensis\, were present in the region.\n   \nChristopher J. Bae is a professor of anthropology at the University of Hawai’i at Manoa. Bae has spent the past three decades researching the paleoanthropological record of eastern Asia\, particularly Korea\, China\, and Japan. He takes a multidisciplinary approach to his research working closely with paleontologists\, archaeologists\, geochronologists\, and paleoclimatologists. Bae is the recipient of the University of Hawaii Board of Regents’ Research Excellence Award and his research was recently acknowledged as one of the top ten University of Hawaii at Manoa stories for 2024.\n\nArticle related to this talk: https://myumi.ch/n1gG3\n\nIf there is anything we can do to make this event accessible to you\, please contact us at ncks.info@umich.edu. Please be aware that advance notice is necessary as some accommodations may require more time for the university to arrange.
UID:137735-21880660@events.umich.edu
URL:https://events.umich.edu/event/137735
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:Asian Languages And Cultures,History,Korea,Korean Studies
LOCATION:Weiser Hall - 10th Floor
CONTACT:
END:VEVENT
BEGIN:VEVENT
DTSTAMP:20251119T082914
DTSTART;TZID=America/Detroit:20251202T160000
DTEND;TZID=America/Detroit:20251202T170000
SUMMARY:Workshop / Seminar:Statistics Department Seminar Series: Ethan Xingyuan Fang\, Associate Professor\, Department of Biostatistics & Bioinformatics\, Duke University
DESCRIPTION:Abstract: We present a unified offline decision-making framework. In the first part\, we consider a class of assortment optimization problems in an offline data-driven setting. A firm does not know the underlying customer choice model but has access to an offline dataset consisting of the historically offered assortment set\, customer choice\, and revenue. The objective is to use the offline dataset to find an optimal assortment. Due to the combinatorial nature of assortment optimization\, the problem of insufficient data coverage is likely to occur in the offline dataset. Therefore\, designing a provably efficient offline learning algorithm becomes a significant challenge. To this end\, we propose an algorithm referred to as Pessimistic ASsortment opTimizAtion (PASTA) following the spirit of pessimism. We show that the algorithm identifies the optimal assortment by only requiring the offline data to cover the optimal assortment under general settings. In particular\, we establish a regret bound for the offline assortment optimization problem under the celebrated multinomial logit model and its generalizations\, where the regret is shown to be minimax optimal. We will also discuss other novel combinatorial uncertainty quantification problems of assortment optimization.
UID:141343-21888655@events.umich.edu
URL:https://events.umich.edu/event/141343
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:seminar
LOCATION:West Hall - 411
CONTACT:
END:VEVENT
END:VCALENDAR