Loading Events

Past Events

Events Search and Views Navigation

November 2021

Eindhoven SPOR Seminar

Nov 23, 2021, 15:45 - 16:45
Online (Zoom)

Matthias Mnich (TUHH) Mean-Payoff Games: A Powerful Tool between Mathematics and Computer Science, between Theory and Applications Mean-payoff games are a powerful tool for modeling the verification process of large pieces of software, like those developed for performing experiments at the Large Hadron Collider, the world's largest and highest-energy particle collider at CERN. From a theory perspective, mean-payoff games are two player deterministic zero-sum games with full information that were introduced by Ehrenfeucht and Mycielski 1979. The determination of winning…

Find out more »

December 2021

Eindhoven SPOR Seminar

Dec 21, 2021, 15:45 - 16:45
Online (Zoom)

Botond Szabo (Bocconi University) On distributed estimation and testing In recent years, the amount of available information has become so vast in certain fields of applications that it is infeasible or undesirable to carry out all the computations on a single server. This has motivated the design and study of distributed statistical or learning approaches. In distributed methods, the data is split amongst different administrative units and computations are carried out locally in parallel to each other. The outcome of…

Find out more »

February 2022

Eindhoven SPOR Seminar

Feb 22, 15:45 - 16:45
Online (Zoom)

Adam Zsolt Wagner (Tel Aviv University) Constructions in combinatorics via neural networks Recently, significant progress has been made in the area of machine learning algorithms, and they have quickly become some of the most exciting tools in a scientist’s toolbox. In particular, recent advances in the field of reinforcement learning have led computers to reach superhuman level play in Atari games and Go, purely through self-play. In this talk I will give a basic introduction to neural networks and reinforcement…

Find out more »

April 2022

Eindhoven SPOR seminar

Apr 26, 15:45 - 16:45
Online (Zoom)

Karl Rohe (UW Madison) Vintage Factor Analysis with Varimax Performs Statistical Inference Psychologists developed Multiple Factor Analysis to decompose multivariate data into a small number of interpretable factors without any a priori knowledge about those factors. In this form of factor analysis, the Varimax "factor rotation" is a key step to make the factors interpretable. Charles Spearman and many others objected to factor rotations because the factors seem to be rotationally invariant. This is an historical enigma because factor rotations…

Find out more »

May 2022

Eindhoven SPOR Seminar

May 17, 15:45 - 16:45
MF 11-12 (4th floor MetaForum Building, TU/e)

Rik Versendaal (UU)  Sampling simple random graphs under degree and edge-weight constraints In , the problem was studied of sampling simple random graphs with degree constraints, which is typically a hard problem. Therefore, the authors proposed a sequential algorithm that samples such graphs asymptotically uniformly at random, when the number n of vertices tends to infinity. In this talk, we will extend the algorithm in to also include edge-weights. More specifically, we first assign random weights to all edges according…

Find out more »

Data-driven decision-support tools for pandemic preparedness

May 20, 13:00 - 17:00
Academiagebouw Utrecht, Domplein 29
Utrecht, 3512 JE Netherlands

leveraging mobility, symptoms, and behavior data   Summary During this event (Academiagebouw Utrecht)of approximately 50 participants, we will bring together representatives of science, industry, and government that are interested in the development, usage, and evaluation of data-driven decision-support tools for pandemics. Also, the event serves as the closure of our ZonMw-funded research project in which we developed a predictive dashboard for local corona outbreaks. The partners in this project are Eindhoven University of Technology, Leiden University Medical Center, Utrecht University,…

Find out more »

Workshop: "Safe, Anytime-Valid Inference (SAVI) and Game-theoretic Statistics"

May 30 - Jun 3
MF 11-12 (4th floor MetaForum Building, TU/e)

Summary A large fraction of published research in top journals in applied sciences such as medicine and psychology has been claimed as irreproducable. In light of this 'replicability crisis', traditional methods for hypothesis testing, most notably those based on p-values, have come under intense scrutiny. One central problem is the following: if our test result is promising but nonconclusive (say, p = 0.07) we cannot simply decide to gather a few more data points. While this practice is ubiquitous in…

Find out more »

Eindhoven SPOR Seminar

May 31, 15:45 - 16:45

Dirk Fahland (TU/e) New research challenges for statistics, probability theory, and optimization in process mining The field of Process Mining aims at getting insights into processes and organizations by building understandable models from event logs. The field originated from formal language theory, specifically Petri nets, an input event logs as a finite (weighted) sample of an infinite formal language, and analysis as optimization problems over graphs that can be constructed from the input. Problems are primarily solved by heuristic search…

Find out more »

June 2022

Special Edition of the Queueing Colloquium

Jun 8
Eurandom, Metaforum
Eindhoven, Netherlands
+ Google Map

Summary On the occassion of the 60th birthday of Ivo Adan and Jacques Resing, we are organizing a special edition of the well-known Queueing Colloquium. Ivo and Jacques are prominent members of the Queueing community in The Netherlands and worldwide, the authors of the renowned lecture notes "Queueing Systems". Five distinguished researchers and close collaborators of Ivo and Jacques have agreed to give talks at this celebratory event, which will make this colloquium scientifically, as well as socially, a very…

Find out more »

Workshop: "Separating Integer Points in Polyhedra: Theory and Applications"

Jun 30 - Jul 1
Eurandom, Metaforum
Eindhoven, Netherlands
+ Google Map

Summary Integral polyhedra are one of the central objects of integer programming, as they allow to solve combinatorial optimization problems by means of linear programming. Finding outer descriptions of integral polyhedra associated with discrete problems, however, is a challenging task and in many cases such descriptions are not known or exponentially large. To circumvent these problems, a lot of effort has been spent to find descriptions in alternative spaces, leading to groundbreaking insights on practically relevant combinatorial optimization problems. Moreover, if no small formulation of such polyhedra exists, alternative…

Find out more »
+ Export Events