Marcin Szymczak

Marcin Szymczak

Auto-generated profile, based on publicly available information

Marcin Szymczak

RWTH Aachen University

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 September 2016 in ACM SIGPLAN Notices
Verified
Journal Article
Open access
JBJohannes Borgström
Johannes Borgström
ULUgo Dal Lago
Ugo Dal Lago
AGAndrew D. Gordon
Andrew D. Gordon
MSMarcin Szymczak
Marcin Szymczak
We develop the operational semantics of an untyped probabilistic λ-calculus with continuous distributions, and both hard and soft constraints,as a foundation for universal probabilistic programming languages such as Church, Anglican, and Venture. Our first contribution is to adapt the classic operational semantics of λ-calculus to a continuous setting via creating a measure space on terms and defining step-indexed approximations. We prove equivalence of big-step and small-step formulations of this distribution-based semantics . To move closer to inference techniques, we also define the sampling-based semantics of a term as a function from a trace of random samples to a value. We show that the distribution induced by integration over the space of traces equals the distribution-based semantics. Our second contribution is to formalize the implementation technique of trace Markov chain Monte Carlo (MCMC) for our calculus and to show its correctness. A key step is defining sufficient conditions for the distribution induced by trace MCMC to converge to the distribution-based semantics. To the best of our knowledge, this is the first rigorous correctness proof for trace MCMC for a higher-order functional language, or for a language with soft constraints.

1 August 2020
Verified
Book Chapter
Closed access
PDF file
MSMarcin Szymczak
Marcin Szymczak
JKJoost-Pieter Katoen
Joost-Pieter Katoen

1 January 2016 in Information Fusion
Verified
Journal Article
Closed access
ABAntoon Bronselaer
Antoon Bronselaer
MSMarcin Szymczak
Marcin Szymczak
SZSławomir Zadrożny
Sławomir Zadrożny
Guy De TréGuy De Tré
Guy De Tré

1 June 2013
Verified
Conference Paper
Open access
MSMarcin Szymczak
Marcin Szymczak
SZSlawomir Zadrozny
Slawomir Zadrozny
Guy De TréGuy De Tré
Guy De Tré
Preserving data quality is an important issue in data collection management. One of the crucial issues hereby is the detection of duplicate objects (called coreferent objects) which describe the same entity, but in different ways. In this paper we present a method for detecting coreferent objects in metadata, in particular in XML schemas. Our approach consists in comparing the paths from a root element to a given element in the schema. Each path precisely defines the context and location of a specific element in the schema. Path matching is based on the comparison of the different steps of which paths are composed. The uncertainty about the matching of steps is expressed with possibilistic truth values and aggregated using the Sugeno integral. The discovered coreference of paths can help for determining the coreference of different XML schemas.