Tue, 14 May 2019
11:30
C4

TBA

Anand Pillay
(University of Notre Dame)
Tue, 19 Nov 2019

14:00 - 15:00
L6

Phase transitions in random regular graphs

Endre Csóka
Further Information

We analyze the asymptotic relative size of the largest independent set of a random d-regular graph on n → ∞ vertices. This problem is very different depending on d because of a surprising phase transition. This is somewhat similar to finding the density of ``water'' above and below its freezing point. These phase transitions are related to algorithmic thresholds, mixing properties, counting, graph reconstruction, graph limits and other questions. We are still far from a complete understanding of all these questions. Our tools are partially coming from statistical physics. 

Thu, 05 Dec 2019

11:30 - 12:30
C4

Universally defining finitely generated subrings of global fields

Nicolas Daans
(Antwerpen)
Abstract

   It is a long-standing open problem whether the ring of integers Z has an existential first-order definition in Q, the field of rational numbers. A few years ago, Jochen Koenigsmann proved that Z has a universal first-order definition in Q, building on earlier work by Bjorn Poonen. This result was later generalised to number fields by Jennifer Park and to global function fields of odd characteristic by Kirsten Eisenträger and Travis Morrison, who used classical machinery from number theory and class field theory related to the behaviour of quaternion algebras over global and local fields.


   In this talk, I will sketch a variation on the techniques used to obtain the aforementioned results. It allows for a relatively short and uniform treatment of global fields of all characteristics that is significantly less dependent on class field theory. Instead, a central role is played by Hilbert's Reciprocity Law for quaternion algebras. I will conclude with an example of a non-global set-up where the existence of a reciprocity law similarly yields universal definitions of certain subrings.

Tue, 05 Nov 2019

12:45 - 14:00
C5

Dimensionality reduction techniques for global optimization

Adilet Otemissov
((Oxford University))
Abstract

We consider the problem of global minimization with bound constraints. The problem is known to be intractable for large dimensions due to the exponential increase in the computational time for a linear increase in the dimension (also known as the “curse of dimensionality”). In this talk, we demonstrate that such challenges can be overcome for functions with low effective dimensionality — functions which are constant along certain linear subspaces. Such functions can often be found in applications, for example, in hyper-parameter optimization for neural networks, heuristic algorithms for combinatorial optimization problems and complex engineering simulations.

Extending the idea of random subspace embeddings in Wang et al. (2013), we introduce a new framework (called REGO) compatible with any global min- imization algorithm. Within REGO, a new low-dimensional problem is for- mulated with bound constraints in the reduced space. We provide probabilistic bounds for the success of REGO; these results indicate that the success is depen- dent upon the dimension of the embedded subspace and the intrinsic dimension of the function, but independent of the ambient dimension. Numerical results show that high success rates can be achieved with only one embedding and that rates are independent of the ambient dimension of the problem.

 

Time-integrated Neutrino Source Searches with 10 years of IceCube Data
Robertson, S Rongen, M Rott, C Ruhe, T Ryckbosch, D Rysewyk, D Safa, I Herrera, S Sandrock, A Sandroos, J Santander, M Sarkar, S Satalecka, K Schaufel, M Schieler, H Schlunder, P Schmidt, T Schneider, A Schneider, J Schröder, F Schumacher, L Sclafani, S Seckel, D Seunarine, S Physical Review Letters (06 Feb 2020)
Wed, 30 Oct 2019
12:00
N3.12

Applying Distributional Compositional Categorical Models of Meaning to Language Translation

Brian Tyrrell
((Oxford University))
Abstract

In 2010 Coecke, Sadrzadeh, and Clark formulated a new model of natural language which operates by combining the syntactics of grammar and the semantics of individual words to produce a unified ''meaning'' of sentences. This they did by using category theory to understand the component parts of language and to amalgamate the components together to form what they called a ''distributional compositional categorical model of meaning''. In this talk I shall introduce the model of Coecke et. al., and use it to compare the meaning of sentences in Irish and in English (and thus ascertain when a sentence is the translation of another sentence) using a cosine similarity score.

The Irish language is a member of the Gaelic family of languages, originating in Ireland and is the official language of the Republic of Ireland.

Subscribe to