4 citations · 14 across the 7 of their papers we have counts for
7 papers
Using Sequential Statistical Tests for Efficient Hyperparameter Tuning
Philip Buczak, Andreas Groll, Markus Pauly +2
Hyperparameter tuning is one of the the most time-consuming parts in machine learning. Despite the existence of modern optimization algorithms that minimize the number of evaluatio…
Knowledge-driven Data Ecosystems Towards Data Transparency
Sandra Geisler, Maria-Esther Vidal, Cinzia Cappiello +9
A Data Ecosystem offers a keystone-player or alliance-driven infrastructure that enables the interaction of different stakeholders and the resolution of interoperability issues amo…
Mixin Composition Synthesis based on Intersection Types
Jan Bessai, Tzu-Chun Chen, Andrej Dudenhefner +3
We present a method for synthesizing compositions of mixins using type inhabitation in intersection types. First, recursively defined classes and mixins, which are functions over c…
Rank 3 Inhabitation of Intersection Types Revisited (Extended Version)
Andrej Dudenhefner, Jakob Rehof
We revisit the undecidability result of rank 3 intersection type inhabitation (Urzyczyn 2009) in pursuit of two goals. First, we strengthen the previous result by showing that inte…
The Algebraic Intersection Type Unification Problem
Andrej Dudenhefner, Moritz Martens, Jakob Rehof
The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unkno…
Proceedings Seventh Workshop on Intersection Types and Related Systems
Jakob Rehof
This volume contains a final and revised selection of papers presented at the Seventh Workshop on Intersection Types and Related Systems (ITRS 2014), held in Vienna (Austria) on Ju…
Using Inhabitation in Bounded Combinatory Logic with Intersection Types for Composition Synthesis
Boris Düdder, Oliver Garbe, Moritz Martens +2
We describe ongoing work on a framework for automatic composition synthesis from a repository of software components. This work is based on combinatory logic with intersection type…