A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Paper finds Dutch Draw optimal baseline for binary classification.
Study on efficiency of Dutch auctions on blockchains considering various parameters.
New measure predicts Dutch housing market downturns.
Paper presents a universal baseline for binary prediction models.
Improved negation detection in Dutch clinical texts using machine learning.
This paper examines three independent explanatory variables and their relation with cost overrun in order to decide whether this is different for Dutch infrastructure projects compared to worldwide findings. The three independent variables are project type (road, rail, and fixed link projects), project size (measured i…
This thesis evaluates text-based vs audio-based classification of mental health interviews.
Solves the Sleeping Beauty problem as a 'thirder' using the Kelly Criterion.
West Frisian lemmatizer, POS tagger, and parser created.
Contemporary debates on filter bubbles and polarization in public and social media raise the question to what extent news media of the past exhibited biases. This paper specifically examines bias related to gender in six Dutch national newspapers between 1950 and 1990. We measure bias related to gender by comparing loc…
Cost overruns in transport infrastructure projects know no geographical limits, overruns are a global phenomenon. Nevertheless, the size of cost overruns varies with location. In the Netherlands, cost overruns appear to be smaller compared to the rest of the world. This paper tests whether Dutch projects perform signif…
Using a methodology similar to that used the in the worldwide research, the cost performance of Dutch large-scale transport infrastructure projects is determined. In the Netherlands, cost overruns are as common as cost underruns but because cost overruns are larger than cost underruns projects on average have a cost ov…
Information extraction is an important task in NLP, enabling the automatic extraction of data for relational database filling. Historically, research and data was produced for English text, followed in subsequent years by datasets in Arabic, Chinese (ACE/OntoNotes), Dutch, Spanish, German (CoNLL evaluations), and many …
Study optimal auction formats for maximizing MEV on Ethereum.
Thomas Rot discusses a topology theorem at a math conference.
Spectral analysis detects structural changes in financial networks.
New concept of k-holes in simple drawings and convex drawings.
Develops a method to optimize tax codes with practical constraints.
We construct two examples of shareholder networks in which shareholders are connected if they have shares in the same company. We do this for the shareholders in Turkish companies and we compare this against the network formed from the shareholdings in Dutch companies. We analyse the properties of these two networks in…
Conditional random fields (CRFs) have been shown to be one of the most successful approaches to sequence labeling. Various linear-chain neural CRFs (NCRFs) are developed to implement the non-linear node potentials in CRFs, but still keeping the linear-chain hidden structure. In this paper, we propose NCRF transducers, …
VQ-DRAW compresses images and generates realistic samples.
In this paper we study speaker linking (a.k.a.\ partitioning) given constraints of the distribution of speaker identities over speech recordings. Specifically, we show that the intractable partitioning problem becomes tractable when the constraints pre-partition the data in smaller cliques with non-overlapping speakers…
Rotation systems can't always be drawn in surfaces.
In many contexts, it can be useful for domain experts to understand to what extent predictions made by a machine learning model can be trusted. In particular, estimates of trustworthiness can be useful for fraud analysts who process machine learning-generated alerts of fraudulent transactions. In this work, we present …
We present a system for identifying conceptual shifts between visual categories, which will form the basis for a co-creative drawing system to help users draw more creative sketches. The system recognizes human sketches and matches them to structurally similar sketches from categories to which they do not belong. This …
We propose a restricted collapsed draw (RCD) sampler, a general Markov chain Monte Carlo sampler of simultaneous draws from a hierarchical Chinese restaurant process (HCRP) with restriction. Models that require simultaneous draws from a hierarchical Dirichlet process with restriction, such as infinite Hidden markov mod…
Examines how meridians and parallels help in map drawing.
Criteria found for graph drawings on surfaces.
We present sketch-rnn, a recurrent neural network (RNN) able to construct stroke-based drawings of common objects. The model is trained on thousands of crude human-drawn images representing hundreds of classes. We outline a framework for conditional and unconditional sketch generation, and describe new robust training …
CoSE models complex drawings by treating strokes as a collection that can be composed.
Detects out-of-distribution sentences in Neural Machine Translation.
The Clock Drawing Test (CDT) is a rapid, inexpensive, and popular neuropsychological screening tool for cognitive conditions. The Digital Clock Drawing Test (dCDT) uses novel software to analyze data from a digitizing ballpoint pen that reports its position with considerable spatial and temporal precision, making possi…
There are three main thrusts to this article: a new proof of Levi's Enlargement Lemma for pseudoline arrangements in the real projective plane; a new characterization of pseudolinear drawings of the complete graph; and proofs that pseudolinear and convex drawings of have O and O, respect…
This note provides an elementary proof of the folklore fact that draws from a Dirichlet distribution (with parameters less than 1) are typically sparse (most coordinates are small).
A {\em good drawing\/} of is a drawing of the complete graph with vertices in the sphere such that: no two edges with a common end cross; no two edges cross more than once; and no three edges all cross at the same point. Gioan's Theorem asserts that any two good drawings of that have the same rotations …
The financial crisis clearly illustrated the importance of characterizing the level of 'systemic' risk associated with an entire credit network, rather than with single institutions. However, the interplay between financial distress and topological changes is still poorly understood. Here we analyze the quarterly inter…
Quasi-experimental research designs, such as regression discontinuity and interrupted time series, allow for causal inference in the absence of a randomized controlled trial, at the cost of additional assumptions. In this paper, we provide a framework for discontinuity-based designs using Bayesian model comparison and …
Efficient methods estimate bid and value distributions in auctions.
We study a bad arm existing checking problem in which a player's task is to judge whether a positive arm exists or not among given K arms by drawing as small number of arms as possible. Here, an arm is positive if its expected loss suffered by drawing the arm is at least a given threshold. This problem is a formalizati…
In this paper, we explore creative image generation constrained by small data. To partially automate the creation of cartoon sketches consistent with a specific designer's style, where acquiring a very large original image set is impossible or cost prohibitive, we exploit domain specific knowledge for a huge reduction …
Dynamic rule-based investment strategies outperform static ones in pension schemes.
New method learns high-quality Laplacian representations for reinforcement learning.
CupNet prunes neural nets for cup-shaped data.
A new method for spotting symbols in CAD images reduces annotation costs and improves accuracy.
New bounds show limitations of sample-wise information-theoretic generalization.
Mathematical analysis shows Delisle-Euler map methods are optimal.
Stress, edge crossings, and crossing angles play an important role in the quality and readability of graph drawings. Most standard graph drawing algorithms optimize one of these criteria which may lead to layouts that are deficient in other criteria. We introduce an optimization framework, Stress-Plus-X (SPX), that sim…
Can certain shapes be drawn with a pencil and eraser?