BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Eurandom - ECPv4.7.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Eurandom
X-ORIGINAL-URL:https://www.eurandom.tue.nl
X-WR-CALDESC:Events for Eurandom
BEGIN:VEVENT
DTSTART;TZID=UTC+0:20181211T110000
DTEND;TZID=UTC+0:20181211T114500
DTSTAMP:20181210T170249
CREATED:20181130T130640Z
LAST-MODIFIED:20181130T130702Z
UID:2369-1544526000-1544528700@www.eurandom.tue.nl
SUMMARY:Eindhoven Stochastics Seminar
DESCRIPTION:Ziv Scully (Carnegie Mellon University) \nSOAP: One Clean Analysis of All Age-Based Scheduling Policies \nWe consider an extremely broad class of M/G/1 scheduling policies called SOAP: Schedule Ordered by Age-based Priority. The SOAP policies include almost all scheduling policies in the literature as well as an infinite number of variants which have never been analyzed\, or maybe not even conceived. SOAP policies range from classic policies\, like first-come\, first-serve (FCFS)\, foreground-background (FB)\, class-based priority\, and shortest remaining processing time (SRPT); to much more complicated scheduling rules\, such as shortest expected remaining processing time (SERPT)\, the famously complex Gittins index policy\, and other policies in which a job's priority changes arbitrarily with its age. While the response time of policies in the former category is well understood\, policies in the latter category have resisted response time analysis. We present a universal analysis of all SOAP policies\, deriving the mean and Laplace-Stieltjes transform of response time. \n \nhttp://www.win.tue.nl/StoSem/ \n \n
URL:https://www.eurandom.tue.nl/event/eindhoven-stochastics-seminar-5/
LOCATION:MF 12 (4th floor MetaForum Building\, TU/e
CATEGORIES:STO Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC+0:20181211T124500
DTEND;TZID=UTC+0:20181211T134500
DTSTAMP:20181210T170249
CREATED:20181205T105010Z
LAST-MODIFIED:20181205T105037Z
UID:2378-1544532300-1544535900@www.eurandom.tue.nl
SUMMARY:Eindhoven Stochastics Colloquium
DESCRIPTION:Stefan Klootwijk (University of Twente) \nOn Random Shortest Path Metrics \nSimple heuristics often show a remarkable performance in practice for optimization problems. Worst-case analysis often falls short of explaining this performance. Because of this\, "beyond worst-case analysis" of algorithms has recently gained a lot of attention\, including probabilistic analysis of algorithms. The instances of many optimization problems are essentially a discrete metric space. Probabilistic analysis for such metric optimization problems has nevertheless mostly been conducted on instances drawn from Euclidean space\, which provides a structure that is usually heavily exploited in the analysis. However\, most instances from practice are not Euclidean. Little work has been done on metric instances drawn from other\, more realistic\, distributions. \nIn this talk we take a look at another class of metric spaces\, namely random shortest path metrics. A random shortest path metric is constructed by drawing independent random edge weights for each edge in a given graph and setting the distance between every pair of vertices to the length of a shortest path between them with respect to the drawn weights. This model is also known as first passage percolation. We derive some properties of such metrics\, and look at the performance of some simple heuristics for the minimum distance perfect matching problem\, the traveling salesman problem\, and the k-median problem on instances obtained from such metrics. \nhttp://www.win.tue.nl/StoSem/ \n
URL:https://www.eurandom.tue.nl/event/eindhoven-stochastics-colloquium-2/
LOCATION:MF 12 (4th floor MetaForum Building\, TU/e
CATEGORIES:STO Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20181217
DTEND;VALUE=DATE:20181220
DTSTAMP:20181210T170249
CREATED:20181001T090917Z
LAST-MODIFIED:20181025T113204Z
UID:2249-1545004800-1545263999@www.eurandom.tue.nl
SUMMARY:20th Anniversary Eurandom
DESCRIPTION: \nSummary\nThis year Eurandom is celebrating it's twentieth anniversary!! Hard to believe it is already so long ago that the new \nEuropean Unit for Research and Analysis of Non-Deterministic Operational Models \nwas established in Eindhoven\, on the campus of the Eindhoven University of Technology. \nMany postdocs and PhD students have come to Eurandom to start and develop their careers. Friendships were formed\, serious work and research were alternated with fun and social events. There has always been a very good atmosphere in the office and among all Eurandom-mers. \nIt is that atmosphere and friendship that we want to celebrate. We are inviting all Eurandom-mers to come and participate in the workshop\, to be held on December 17-18-19\, 2018. \nThe programme outline will be: \n\nMonday\, Tuesday morning\, Wednesday morning talks by alumni. These talks should be given in the format of the EPPS seminars (accessible to all your colleagues!)\nTuesday afternoon we will be organizing a social event for the alumni\nWednesday afternoon will be for a more general public. We will invite some special speakers\, who have a close connection with Eurandom\nAnd of course we will end this special occasion with drinks and snacks\n\n \nTo give us some idea how many guests to expect\, we kindly ask you to register for this celebration. \nLINK TO REGISTRATION \nWe hope to welcome many of you at our present location MetaForum\, 4th floor. \n
URL:https://www.eurandom.tue.nl/event/20th-anniversary-eurandom/
LOCATION:MF 11-12 (4th floor MetaForum Building\, TU/e)
CATEGORIES:Workshop
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20190319
DTEND;VALUE=DATE:20190323
DTSTAMP:20181210T170249
CREATED:20181112T134508Z
LAST-MODIFIED:20181130T174734Z
UID:2339-1552953600-1553299199@www.eurandom.tue.nl
SUMMARY:YES X : "Understanding Deep Learning: Generalization\, Approximation and Optimization"
DESCRIPTION:Summary\nDuring the last decade\, deep learning has drawn increasing attention both in machine learning and statistics because of its superb empirical performance in various fields of application\, including speech and image recognition\, natural language processing\, social network filtering\, bioinformatics\, drug design and board games (e.g. Alpha go\, Alpha zero). This raises important and fundamental questions on why these methods are so successful\, and to what extent they can be applied to a wide range of problems. \nAlthough theoretical results from the 1980s and 1990s already describe the statistical behavior of small neural networks if we assume their parameters can be optimized exactly\, this situation is far from what happens in practice. Instead\, two crucial features of modern applications are that the number of parameters is much larger than the sample size\, and that non-convexity fundamentally prevents optimization methods from finding the globally optimal parameters. In fact\, it has become clear that the statistical properties of deep learning are inextricably intertwined with how their parameters are being optimized. To explain the behavior of modern deep learning it is therefore necessary to understand the subtle interplay between generalization\, approximation and optimization. Developing such an understanding is particularly important if deep learning is to play a role in more sensitive application areas such as medical practice\, self-driving cars\, air-traffic control\, and so on. \nThe aim of the workshop is to give a balanced representation of the most recent advances on these topics\, from theory to applications\, and spanning both statistics\, optimization and machine learning topics. The workshop targets primarily (but not exclusively) young researchers\, in particular PhD students\, postdocs and junior early stage researchers. The workshop will take place over 4 days and consists of tutorial courses given by four world experts in the field\, each being comprised of roughly of 3 hours of lectures. Furthermore\, some of the junior participants will be given the opportunity to present their current work during the workshop by giving a short (30 minutes) oral presentation and possibly poster presentations (depending on the number of submissions). \nOrganizers\n\n\n\nPaulo de Andrade Serra\nTU Eindhoven\n\n\nRui Pires da Silva Castro\nTU Eindhoven\n\n\nTim van Erven\nLeiden University\n\n\nBotond Szabo\nLeiden University\n\n\n\nSpeakers\n\n\n\nPeter Bartlett\nUniversity of California - Berkeley\n\n\nJason D. Lee\nMarshall School of Business\n\n\nJohannes Schmidt-Hieber\nUniversity of Twente\n\n\nNathan Srebro\nToyota Technological Institute at Chicago and University of Chicago\n\n\n\n \nProgramme\nt.b.a. \n \nAbstracts\nto follow \n \nRegistration\nwill open soon \n \nPractical Information\nLink to information page \n \n
URL:https://www.eurandom.tue.nl/event/yes-x-deep-learning-foundations/
LOCATION:Eurandom\, Metaforum\, Eindhoven\, Netherlands
CATEGORIES:YES
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20190325
DTEND;VALUE=DATE:20190330
DTSTAMP:20181210T170249
CREATED:20181107T130305Z
LAST-MODIFIED:20181210T104208Z
UID:2318-1553472000-1553903999@www.eurandom.tue.nl
SUMMARY:YEP XV "Information Diffusion on Random Networks"
DESCRIPTION:Summary\nThe "Information diffusion on random graphs" workshop is the 15th workshop in the ‘Young European Probabilists’ yearly workshops. \nDiffusion processes in networks manifests themselves in many real-life scenarios\, such as epidemic spreading\, viral marketing and power blackouts. This YEP workshop focuses information diffusion on networks. The phenomenon of information diffusion recently attracted vast attention across a wide range of research fields\, including mathematics\, physics\, computer science\, and social sciences. Therefore\, this YEP will focus not only on purely probabilistic aspects\, but also take an algorithmic and application perspective. The aim of the workshop is to bring together junior and senior researchers from probability and from other fields\, and to bridge the corresponding scientific communities. \nThe workshop will have three mini courses by internationally renowned researchers\, giving an opportunity to junior as well as senior attendants to learn about a new topic related to information diffusion. Other than that\, the workshop will consist of invited talks by junior and senior researchers. \n \nOrganizers\nRemco van der Hofstad (TU Eindhoven / Eurandom)\nNelly Litvak (University of Twente / TU Eindhoven)\nClara Stegehuis (TU Eindhoven) \n \nSpeakers\nTutorial speakers: \n\n\n\nFrank Ball\nUniversity of Nottingham\n\n\nMia Deijfen\nStockholm University\n\n\nRenaud Lambiotte\nUniversity of Oxford\n\n\n\n \n \nInvited speakers: \n\n\n\nClaudio Castellano\nSapienza\, Rome\n\n\nEric Cator\nRadboud University Nijmegen\n\n\nWei Chen\nMicrosoft Research Asia\n\n\nPetter Holme\nTokyo Institute of Technolofy\n\n\nLasse Leskelä\nAalto University\n\n\nMarton Karsai\nENS Lyon\n\n\nJuliá Komjathy\nTU Eindhoven\n\n\nNaoki Masuda\nBristol University\n\n\nPeter Mörters\nCologna University\n\n\nDavid Sirl\nUniversity of Nottingham\n\n\nChi Tran\nUniversité des Sciences et Technologies de Lille\n\n\nDaniel Valesin\nUniversity of Groningen\n\n\nRose Yu\nNortheastern University\n\n\n\nContributed talks/posters\nDuring the conference we have a few slots available for contributed talks by participants. If you wish to apply for a contributed talk\, please send your title and abstract to koorn@eurandom.tue.nl.\nWe will also organize a poster session. If you would like to present a poster\, you can indicate this on the registration form. \n \nFunding possibilities\nFor this workshop\, we have reserved a limited budget that can be used to cover the local accommodation expenses of the speakers\, especially for young participants with limited resources. Speakers are encouraged to apply for the funding by sending an email to Patty Koorn at Koorn@eurandom.tue.nl. The deadline for the funding application is on\nDecember 15. Funding applications will be treated on a first come first served basis. \n \nProgramme\nt.b.a. \n \nAbstracts\nwill follow soon \n \nRegistration\nLink to the online registration form: REGISTRATION \nPractical Information\nInformation on travel\, location etc. : INFORMATION \n
URL:https://www.eurandom.tue.nl/event/yep-xv-information-diffusion-on-random-networks/
LOCATION:Eurandom\, Metaforum\, Eindhoven\, Netherlands
CATEGORIES:YEP
END:VEVENT
END:VCALENDAR