BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//IFDS - ECPv6.0.1.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:IFDS
X-ORIGINAL-URL:https://ifds.info
X-WR-CALDESC:Events for IFDS
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20210314T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20211107T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20220313T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20221106T090000
END:STANDARD
TZID:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:20210314T080000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:20211107T070000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:20220313T080000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:20221106T070000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220218T123000
DTEND;TZID=America/Los_Angeles:20220218T133000
DTSTAMP:20260407T052603
CREATED:20220325T194026Z
LAST-MODIFIED:20220325T195105Z
UID:1900-1645187400-1645191000@ifds.info
SUMMARY:ML Opt @ UW: Yifang Chen
DESCRIPTION:Speaker: Yifang Chen  \nTitle: Active Multi-Task Representation Learning \nAbstract: To leverage the power of big data from source tasks and overcome the scarcity of the target task samples\, representation learning based on multi-task pretraining has become a standard approach in many applications. However\, up until now\, choosing which source tasks to include in the multi-task learning has been more art than science. In this paper\, we give the first formal study on resource task sampling by leveraging the techniques from active learning. We propose an algorithm that iteratively estimates the relevance of each source task to the target task and samples from each source task based on the estimated relevance. Theoretically\, we show that for the linear representation class\, to achieve the same error rate\, our algorithm can save up to a textit{number of source tasks} factor in the source task sample complexity\, compared with the naive uniform sampling from all source tasks. We also provide experiments on real-world computer vision datasets to illustrate the effectiveness of our proposed method on both linear and convolutional neural network representation classes. 
URL:https://ifds.info/event/ml-opt-uw-yifang-chen/
CATEGORIES:MLOpt@UWash
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20220216T123000
DTEND;TZID=America/Chicago:20220216T133000
DTSTAMP:20260407T052603
CREATED:20220119T203515Z
LAST-MODIFIED:20220119T205129Z
UID:1789-1645014600-1645018200@ifds.info
SUMMARY:SILO: Victor M Zavala
DESCRIPTION:
URL:https://ifds.info/event/victor-m-zavala/
LOCATION:Orchard View Room\, 330 N. Orchard Street\, 3rd Floor NE\, Madison\, Wisconsin\, 53715\, United States
CATEGORIES:SILO
ORGANIZER;CN="Rob%20Nowak":MAILTO:rdnowak@wisc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220216T120000
DTEND;TZID=America/Los_Angeles:20220216T130000
DTSTAMP:20260407T052603
CREATED:20210921T203244Z
LAST-MODIFIED:20210921T203302Z
UID:1686-1645012800-1645016400@ifds.info
SUMMARY:E & A SIG:
DESCRIPTION:
URL:https://ifds.info/event/e-a-sig-5/
CATEGORIES:E & A SIG
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20220214T140000
DTEND;TZID=America/Chicago:20220214T140000
DTSTAMP:20260407T052603
CREATED:20230313T142147Z
LAST-MODIFIED:20230313T142147Z
UID:2427-1644847200-1644847200@ifds.info
SUMMARY:IFDS Ideas Forum
DESCRIPTION:
URL:https://ifds.info/event/ifds-ideas-forum-7/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20220214T123000
DTEND;TZID=America/Chicago:20220214T133000
DTSTAMP:20260407T052603
CREATED:20220119T200612Z
LAST-MODIFIED:20220119T201137Z
UID:1755-1644841800-1644845400@ifds.info
SUMMARY:IFDS Ideas Forum: TBD
DESCRIPTION:
URL:https://ifds.info/event/ifds-ideas-forum-3/
LOCATION:Orchard View Room\, 330 N. Orchard Street\, 3rd Floor NE\, Madison\, Wisconsin\, 53715\, United States
CATEGORIES:IFDS Ideas Forum
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220211T123000
DTEND;TZID=America/Los_Angeles:20220211T133000
DTSTAMP:20260407T052603
CREATED:20220325T195326Z
LAST-MODIFIED:20220325T195446Z
UID:1910-1644582600-1644586200@ifds.info
SUMMARY:ML Opt@ UW: Vincent Roulet
DESCRIPTION:Speaker: Vincent Roulet \nTitle: Complexity Bounds of Iterative Linearization Algorithms for Discrete-Time Nonlinear Control \nAbstract: We revisit the nonlinear optimization approach to discrete-time nonlinear control and optimization algorithms based on iterative linearization. While widely popular in many domains\, these algorithms have mainly been analyzed from an asymptotic viewpoint. We establish non-asymptotic complexity bounds and global convergence for a class of generalized Gauss-Newton algorithms relying on iterative linearization of the nonlinear control problem\, henceforth calling iterative linear quadratic regulator or differential dynamic programming algorithms as subroutines. The sufficient conditions for global convergence are examined for multi-rate sampling schemes given the existence of a feedback linearization scheme. We illustrate the algorithms in synthetic experiments and provide a software library based on reverse-mode automatic differentiation to reproduce the numerical results.
URL:https://ifds.info/event/ml-opt-uw-vincent-roulet/
CATEGORIES:MLOpt@UWash
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20220209T123000
DTEND;TZID=America/Chicago:20220209T133000
DTSTAMP:20260407T052603
CREATED:20220119T203515Z
LAST-MODIFIED:20220119T205017Z
UID:1788-1644409800-1644413400@ifds.info
SUMMARY:SILO: Yea-Seul Kim
DESCRIPTION:
URL:https://ifds.info/event/yea-seul-kim/
LOCATION:Orchard View Room\, 330 N. Orchard Street\, 3rd Floor NE\, Madison\, Wisconsin\, 53715\, United States
CATEGORIES:SILO
ORGANIZER;CN="Rob%20Nowak":MAILTO:rdnowak@wisc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20220207T140000
DTEND;TZID=America/Chicago:20220207T140000
DTSTAMP:20260407T052603
CREATED:20230313T142147Z
LAST-MODIFIED:20230313T142147Z
UID:2426-1644242400-1644242400@ifds.info
SUMMARY:IFDS Ideas Forum
DESCRIPTION:Rare Gems: Finding Lottery Tickets at Initialization
URL:https://ifds.info/event/ifds-ideas-forum-6/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20220207T123000
DTEND;TZID=America/Chicago:20220207T133000
DTSTAMP:20260407T052603
CREATED:20220119T200612Z
LAST-MODIFIED:20220204T164344Z
UID:1754-1644237000-1644240600@ifds.info
SUMMARY:IFDS Ideas Forum: Rare Gems: Finding Lottery Tickets at Initialization
DESCRIPTION:Title: Rare Gems: Finding Lottery Tickets at InitializationSpeaker: Jy-Yong SoonTime+location: Monday 7 Feb 2022\, 12:30-13:30 Orchard View Room\n \nAbstract: It has been widely observed that large neural networks can be pruned to a small fraction of their original size\, with little loss in accuracy\, by typically following a time-consuming “train\, prune\, re-train” approach. Frankle and Carbin in 2019 conjecture that we can avoid this by training lottery tickets\, i.e.\, special sparse subnetworks found at initialization\, that can be trained to high accuracy. However\, a subsequent line of work presents concrete evidence that current algorithms for finding trainable networks at initialization\, fail simple baseline comparisons\, e.g.\, against training random sparse subnetworks. Finding lottery tickets that train to better accuracy compared to simple baselines remains open. In this work\, we resolve this open problem by discovering rare gems: subnetworks at initialization that attain considerable accuracy\, even before training. Refining these rare gems – by means of fine-tuning – beats current baselines and leads to accuracy competitive or better than magnitude pruning methods.Bio:Jy-yong is a post-doctoral researcher in the Department of Electrical and Computer Engineering (ECE) at the University of Wisconsin-Madison\, working with Prof. Dimitris Papailiopoulos and Prof. Kangwook Lee. He is interested in the intersection of machine learning\, information theory\, and distributed algorithms. He received his Ph.D. degree in 2020 from KAIST\, under the supervision of Prof. Jaekyun Moon. He is a recipient of the IEEE ICC Best Paper Award\, Qualcomm Innovation Awards\, and NRF Korea Post-doctoral Fellowship.
URL:https://ifds.info/event/ifds-ideas-forum-2/
LOCATION:Orchard View Room\, 330 N. Orchard Street\, 3rd Floor NE\, Madison\, Wisconsin\, 53715\, United States
CATEGORIES:IFDS Ideas Forum
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220204T123000
DTEND;TZID=America/Los_Angeles:20220204T133000
DTSTAMP:20260407T052603
CREATED:20220325T195559Z
LAST-MODIFIED:20220325T195650Z
UID:1915-1643977800-1643981400@ifds.info
SUMMARY:IFDS Monthly All-Hands: Rebecca Willett
DESCRIPTION:Speaker: Prof. Rebecca Willett\, Statistics and CS\, University of Chicago   \nTitle: The Role of Linear Layers in Nonlinear Interpolating Networks   \nAbstract: In this discussion\, we will explore the implicit bias of overparameterized neural networks of depth greater than two layers. Our framework considers a family of networks of varying depth that all have the same capacity but different implicitly defined representation costs. The representation cost of a function induced by a neural network architecture is the minimum sum of squared weights needed for the network to represent the function; it reflects the function space bias associated with the architecture. Our results show that adding linear layers to a ReLU network yields a representation cost that reflects a complex interplay between the alignment and sparsity of ReLU units. Specifically\, using a neural network to fit training data with minimum representation cost yields an interpolating function that is constant in directions perpendicular to a low-dimensional subspace on which a parsimonious interpolant exists. This is joint work with Greg Ongie.
URL:https://ifds.info/event/ifds-monthly-all-hands-rebecca-willett/
CATEGORIES:Monthly All-Hands
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20220202T123000
DTEND;TZID=America/Chicago:20220202T133000
DTSTAMP:20260407T052603
CREATED:20220119T203515Z
LAST-MODIFIED:20220119T203750Z
UID:1787-1643805000-1643808600@ifds.info
SUMMARY:SILO: Kassem Fawaz
DESCRIPTION:
URL:https://ifds.info/event/kassem-fawaz/
LOCATION:Orchard View Room\, 330 N. Orchard Street\, 3rd Floor NE\, Madison\, Wisconsin\, 53715\, United States
CATEGORIES:SILO
ORGANIZER;CN="Rob%20Nowak":MAILTO:rdnowak@wisc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20220131T140000
DTEND;TZID=America/Chicago:20220131T140000
DTSTAMP:20260407T052603
CREATED:20230313T142147Z
LAST-MODIFIED:20230313T142147Z
UID:2425-1643637600-1643637600@ifds.info
SUMMARY:IFDS Ideas Forum
DESCRIPTION:Lightning talks for ICML+COLT submissions
URL:https://ifds.info/event/ifds-ideas-forum-5/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20220131T123000
DTEND;TZID=America/Chicago:20220131T133000
DTSTAMP:20260407T052603
CREATED:20220119T200612Z
LAST-MODIFIED:20220119T200918Z
UID:1753-1643632200-1643635800@ifds.info
SUMMARY:IFDS Ideas Forum
DESCRIPTION:
URL:https://ifds.info/event/ifds-ideas-forum/
LOCATION:Orchard View Room\, 330 N. Orchard Street\, 3rd Floor NE\, Madison\, Wisconsin\, 53715\, United States
CATEGORIES:IFDS Ideas Forum
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20220126T123000
DTEND;TZID=America/Chicago:20220126T133000
DTSTAMP:20260407T052603
CREATED:20220119T204000Z
LAST-MODIFIED:20220119T204011Z
UID:1804-1643200200-1643203800@ifds.info
SUMMARY:SILO: Csaba Szepesvari
DESCRIPTION:
URL:https://ifds.info/event/silo-csaba-szepesvari/
LOCATION:Orchard View Room\, 330 N. Orchard Street\, 3rd Floor NE\, Madison\, Wisconsin\, 53715\, United States
CATEGORIES:SILO
ORGANIZER;CN="Rob%20Nowak":MAILTO:rdnowak@wisc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20220121T123000
DTEND;TZID=America/Chicago:20220121T133000
DTSTAMP:20260407T052603
CREATED:20220325T195836Z
LAST-MODIFIED:20220325T195856Z
UID:1919-1642768200-1642771800@ifds.info
SUMMARY:ML Opt@ UW: Lang Liu
DESCRIPTION:Speaker: Lang Liu \nTitle: The Sample Complexity of Statistical Comparison Between Generative Models \nAbstract: The spectacular success of deep generative models calls for quantitative tools to measure their statistical performance. Divergence frontiers have recently been proposed as an evaluation framework for generative models. Although practically successful\, the sample complexity of the empirical estimator of divergence frontiers is unknown. We establish non-asymptotic bounds on the sample complexity of divergence frontiers\, providing theoretical guidance on their estimation procedure.
URL:https://ifds.info/event/ml-opt-uw-lang-liu/
CATEGORIES:MLOpt@UWash
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220119T120000
DTEND;TZID=America/Los_Angeles:20220119T130000
DTSTAMP:20260407T052603
CREATED:20210921T203152Z
LAST-MODIFIED:20210921T203341Z
UID:1684-1642593600-1642597200@ifds.info
SUMMARY:E & A SIG:
DESCRIPTION:
URL:https://ifds.info/event/e-a-sig-4/
CATEGORIES:E & A SIG
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220114T123000
DTEND;TZID=America/Los_Angeles:20220114T133000
DTSTAMP:20260407T052603
CREATED:20220325T200020Z
LAST-MODIFIED:20220325T200040Z
UID:1923-1642163400-1642167000@ifds.info
SUMMARY:ML Opt@ UW: Yue Sun
DESCRIPTION:Speaker: Yue Sun   \nTitle: Analysis of Policy Gradient Descent for Control: Global Optimality via Convex Parameterization   \nAbstract: Policy gradient descent is a popular approach in reinforcement learning due to its simplicity. Recent work has investigated the optimality and convergence properties of this method when applied in certain control problems. In this work\, we connect policy gradient descent (applied to a nonconvex problem formulation) with classical convex parameterizations in control theory\, to show the gradient dominance property for the nonconvex cost function. Such a connection between nonconvex and convex landscapes holds for continuous/discrete time LQR\, distributed optimal control\, minimizing the $cL_2$ gain\, among others. To the best of our knowledge\, this work offers the first result unifying the landscape analysis of a broad class of control problems.
URL:https://ifds.info/event/ml-opt-uw-yue-sun/
CATEGORIES:MLOpt@UWash
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20220107T153000
DTEND;TZID=America/Chicago:20220107T163000
DTSTAMP:20260407T052603
CREATED:20220106T152210Z
LAST-MODIFIED:20220130T024429Z
UID:1739-1641569400-1641573000@ifds.info
SUMMARY:IFDS All-Hands: Sébastien Roche
DESCRIPTION:Title: Phylogenomics: “Inverting” Random Trees\n\nSpeaker: Sebastien Roch\, UW-Madison\, Department of Mathematics\n\nAbstract: The estimation of species phylogenies from genome-scale data is an important step in modern evolutionary studies. This estimation is complicated by the fact that genes evolve under biological processes that produce discordant trees. Such processes include horizontal gene transfer\, incomplete lineage sorting\, and gene duplication and loss\, all of which can be modeled using certain random tree distributions. I will discuss recent results on the identifiability\, or “invertibility”\, of these probabilistic models. I will also consider the large-sample properties of species tree estimation methods in this context. Based partly on joint works with Max Bacharach\, Brandon Legried\, Erin Molloy\, Elchanan Mossel\, Allan Sly\, Tandy Warnow\, Shuqi Yu.  \n\nBio: Sebastien Roch is a Professor in the Department of Mathematics at University of Wisconsin-Madison\, where he is also affiliated with the Department of Statistics and the Theory of Computing. He earned his Ph.D. in Statistics from the University of California\, Berkeley under the guidance of Elchanan Mossel. From 2007-2009\, he was a Postdoctoral Researcher at Microsoft Research. From 2009-2012\, he was a tenure-track Assistant Professor in the Department of Mathematics at the University of California-Los Angeles. He is the recipient of an NSF CAREER Award and of an Alfred P. Sloan Fellowship. He was a Kavli Fellow of the National Academy of Sciences in 2014 and 2017\, and was a 2018 Simons Fellow. He also received the Best Paper Award at RECOMB 2018. His research interests lie at the interface of applied probability\, statistics\, and theoretical computer science with an emphasis on biological applications.
URL:https://ifds.info/event/ifds-all-hands-sebastien-roche/
LOCATION:Zoom
CATEGORIES:Monthly All-Hands
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220107T123000
DTEND;TZID=America/Los_Angeles:20220107T133000
DTSTAMP:20260407T052603
CREATED:20220325T200214Z
LAST-MODIFIED:20220325T200231Z
UID:1927-1641558600-1641562200@ifds.info
SUMMARY:IFDS Monthly All-Hands: Sebastien Roch
DESCRIPTION:Speaker: Prof. Sebastien Roch\, UW-Madison\, Department of Mathematics   \nTitle: Phylogenomics: “Inverting” Random Trees   \nAbstract: The estimation of species phylogenies from genome-scale data is an important step in modern evolutionary studies. This estimation is complicated by the fact that genes evolve under biological processes that produce discordant trees. Such processes include horizontal gene transfer\, incomplete lineage sorting\, and gene duplication and loss\, all of which can be modeled using certain random tree distributions. I will discuss recent results on the identifiability\, or “invertibility”\, of these probabilistic models. I will also consider the large-sample properties of species tree estimation methods in this context. Based partly on joint works with Max Bacharach\, Brandon Legried\, Erin Molloy\, Elchanan Mossel\, Allan Sly\, Tandy Warnow\, Shuqi Yu.    
URL:https://ifds.info/event/ifds-monthly-all-hands-sebastien-roch/
CATEGORIES:Monthly All-Hands
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20211215T123000
DTEND;TZID=America/Chicago:20211215T123000
DTSTAMP:20260407T052603
CREATED:20210909T195406Z
LAST-MODIFIED:20210909T195406Z
UID:1672-1639571400-1639571400@ifds.info
SUMMARY:SILO-TBA
DESCRIPTION:
URL:https://ifds.info/event/silo-tba-4/
CATEGORIES:SILO
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20211215T120000
DTEND;TZID=America/Los_Angeles:20211215T130000
DTSTAMP:20260407T052603
CREATED:20210921T203029Z
LAST-MODIFIED:20210921T203407Z
UID:1682-1639569600-1639573200@ifds.info
SUMMARY:E & A SIG:
DESCRIPTION:
URL:https://ifds.info/event/e-a-sig-3/
CATEGORIES:E & A SIG
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20211213T123000
DTEND;TZID=America/Chicago:20211213T130000
DTSTAMP:20260407T052603
CREATED:20210909T193613Z
LAST-MODIFIED:20211025T191917Z
UID:1652-1639398600-1639400400@ifds.info
SUMMARY:IFDS Ideas Forum-Max Bacharach
DESCRIPTION:UNTIL FURTHER NOTICE: Seminars are hybrid in-person and via zoom.
URL:https://ifds.info/event/ifds-ideas-forum-12132021/
LOCATION:Orchard View Room\, 330 N. Orchard Street\, 3rd Floor NE\, Madison\, Wisconsin\, 53715\, United States
CATEGORIES:IFDS Ideas Forum
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20211208T123000
DTEND;TZID=America/Chicago:20211208T123000
DTSTAMP:20260407T052603
CREATED:20210909T195405Z
LAST-MODIFIED:20211025T192443Z
UID:1671-1638966600-1638966600@ifds.info
SUMMARY:SILO-Jose Miguel Ponciano
DESCRIPTION:
URL:https://ifds.info/event/silo-12082021/
CATEGORIES:SILO
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20211206T123000
DTEND;TZID=America/Chicago:20211206T130000
DTSTAMP:20260407T052603
CREATED:20210909T193458Z
LAST-MODIFIED:20211025T191900Z
UID:1649-1638793800-1638795600@ifds.info
SUMMARY:IFDS Ideas Forum-Julian Katz-Samuels
DESCRIPTION:UNTIL FURTHER NOTICE: Seminars are hybrid in-person and via zoom.
URL:https://ifds.info/event/ifds-ideas-forum-12062021/
LOCATION:Orchard View Room\, 330 N. Orchard Street\, 3rd Floor NE\, Madison\, Wisconsin\, 53715\, United States
CATEGORIES:IFDS Ideas Forum
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20211203T133000
DTEND;TZID=America/Los_Angeles:20211203T143000
DTSTAMP:20260407T052603
CREATED:20211201T172618Z
LAST-MODIFIED:20211201T172618Z
UID:1720-1638538200-1638541800@ifds.info
SUMMARY:IFDS All-Hands: Marcella Gomez\, UCSC Applied Math
DESCRIPTION:Title: Open problems in mathematical modeling and control of wound healing  \nAbstract:  Wound healing consists of a series of overlapping biological process with sophisticated coordination to promote wound closure.  Our research work currently focuses on the task of accelerating wound healing by targeting and artificially manipulating key biological processes.  In particular\, we aim to develop models and control architectures for real-time feedback control for accelerated wound closure. In this talk\, I discuss the progress and challenges of working with a complex biological process with limited data\, as well as\, developing feedback control algorithms for systems interfaced with a bioelectronic device and limited observable states. \nBio: Marcella M. Gomez is an associate professor at UC Santa Cruz in the department of Applied Mathematics. She received her PhD from Caltech in 2015 and a B.S. from UC Berkeley in 2009; both degrees in Mechanical Engineering. Her research interests are in synthetic and systems biology. In particular\, she is interested in developing data-driven methods and foundations for modeling and control of complex biological systems.  \nZoom link via email or contact organizer.
URL:https://ifds.info/event/ifds-all-hands-marcella-gomez-ucsc-applied-math/
CATEGORIES:Monthly All-Hands
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20211201T123000
DTEND;TZID=America/Chicago:20211201T123000
DTSTAMP:20260407T052603
CREATED:20210909T195405Z
LAST-MODIFIED:20210909T195405Z
UID:1670-1638361800-1638361800@ifds.info
SUMMARY:SILO-Jerry Zhu
DESCRIPTION:
URL:https://ifds.info/event/silo-jerry-zhu/
CATEGORIES:SILO
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20211129T123000
DTEND;TZID=America/Chicago:20211129T130000
DTSTAMP:20260407T052603
CREATED:20210909T193353Z
LAST-MODIFIED:20211025T191831Z
UID:1647-1638189000-1638190800@ifds.info
SUMMARY:IFDS Ideas Forum-Sijia Fang & Yuetian Luo
DESCRIPTION:UNTIL FURTHER NOTICE: Seminars are hybrid in-person and via zoom.
URL:https://ifds.info/event/ifds-ideas-forum-11292021/
LOCATION:Orchard View Room\, 330 N. Orchard Street\, 3rd Floor NE\, Madison\, Wisconsin\, 53715\, United States
CATEGORIES:IFDS Ideas Forum
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20211124T123000
DTEND;TZID=America/Chicago:20211124T123000
DTSTAMP:20260407T052603
CREATED:20210909T195404Z
LAST-MODIFIED:20210909T195404Z
UID:1669-1637757000-1637757000@ifds.info
SUMMARY:SILO-Yudong Chen
DESCRIPTION:
URL:https://ifds.info/event/silo-yudong-chen/
CATEGORIES:SILO
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20211122T123000
DTEND;TZID=America/Chicago:20211122T130000
DTSTAMP:20260407T052603
CREATED:20210909T193245Z
LAST-MODIFIED:20211025T191806Z
UID:1645-1637584200-1637586000@ifds.info
SUMMARY:IFDS Ideas Forum-Yuchen Zeng & Liu Yang
DESCRIPTION:UNTIL FURTHER NOTICE: Seminars are hybrid in-person and via zoom.
URL:https://ifds.info/event/ifds-ideas-forum-11222021/
LOCATION:Orchard View Room\, 330 N. Orchard Street\, 3rd Floor NE\, Madison\, Wisconsin\, 53715\, United States
CATEGORIES:IFDS Ideas Forum
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20211117T123000
DTEND;TZID=America/Chicago:20211117T123000
DTSTAMP:20260407T052603
CREATED:20210909T195404Z
LAST-MODIFIED:20210909T195404Z
UID:1668-1637152200-1637152200@ifds.info
SUMMARY:SILO-Keith Levin
DESCRIPTION:
URL:https://ifds.info/event/silo-keith-levin/
CATEGORIES:SILO
END:VEVENT
END:VCALENDAR