arXiv research

DisCoveR efficiently discovers declarative process models from event logs.

We describe DyNet, a toolkit for implementing neural network models based on dynamic declaration of network structure. In the static declaration strategy that is used in toolkits like Theano, CNTK, and TensorFlow, the user first defines a computation graph (a symbolic representation of the computation), and then exampl…

Ludwig simplifies deep learning for non-experts.

We study the pricing problem for corporate defaultable bond from the viewpoint of the investors outside the firm that could not exactly know about the information of the firm. We consider the problem for pricing of corporate defaultable bond in the case when the firm value is only declared in some fixed discrete time a…

We propose a technique for declaratively specifying strategies for semi-supervised learning (SSL). The proposed method can be used to specify ensembles of semi-supervised learning, as well as agreement constraints and entropic regularization constraints between these learners, and can be used to model both well-known h…

We propose a general approach to modeling semi-supervised learning (SSL) algorithms. Specifically, we present a declarative language for modeling both traditional supervised classification tasks and many SSL heuristics, including both well-known heuristics such as co-training and novel domain-specific heuristics. In ad…

In this paper, we consider sequential online prediction (SOP) for streaming data in the presence of outliers and change points. We propose an INstant TEmporal structure Learning (INTEL) algorithm to address this problem. Our INTEL algorithm is developed based on a full consideration of the duality between online predic…

Probabilistic programming allows specification of probabilistic models in a declarative manner. Recently, several new software systems and languages for probabilistic programming have been developed on the basis of newly developed and improved methods for approximate inference in probabilistic models. In this contribut…

Blang simplifies Bayesian analysis for non-standard data types.

New architecture separates object state and behavior for better game dynamics.

This article presents the use of Answer Set Programming (ASP) to mine sequential patterns. ASP is a high-level declarative logic programming paradigm for high level encoding combinatorial and optimization problem solving as well as knowledge representation and reasoning. Thus, ASP is a good candidate for implementing p…

TensorFlow Probability introduces JointDistributions for probabilistic programming.

LIC compiles probabilistic models to generate efficient MCMC proposals.

We build deep RL agents that execute declarative programs expressed in formal language. The agents learn to ground the terms in this language in their environment, and can generalize their behavior at test time to execute new programs that refer to objects that were not referenced during training. The agents develop di…

Two kernel Stein tests control decision errors in non-parametric model comparison.

Comment on a theorem about surface determination from map data.

In situations like tax declarations or analyzes of household budgets we would like to automatically evaluate credibility of exogenous variable (declared income) based on some available (endogenous) variables - we want to build a model and train it on provided data sample to predict (conditional) probability distributio…

With pressure to increase graduation rates and reduce time to degree in higher education, it is important to identify at-risk students early. Automated early warning systems are therefore highly desirable. In this paper, we use unsupervised clustering techniques to predict the graduation status of declared majors in fi…

We consider an insurance entity endowed with an initial capital and a surplus process modelled as a Brownian motion with drift. It is assumed that the company seeks to maximise the cumulated value of expected discounted dividends, which are declared or paid in a foreign currency. The currency fluctuation is modelled as…

A new method for math reasoning that allows for iterative correction.

Forecastability measures predictive information across horizons.

The Euclidean cone metrics coming from q-differentials on a closed surface of genus g > 1 define an equivalence relation on homotopy classes of closed curves declaring two to be equivalent if they have the equal length in every such metric. We prove an analog of the result of Randol for hyperbolic metrics (building on …

There are no solid arguments to sustain that digital currencies are the future of online payments or the disruptive technology that some of its former participants declared when used to face critiques. This paper aims to solve the cryptocurrency puzzle from a behavioral finance perspective by finding the parallelism be…

Improved portfolio optimization reduces sensitivity to neural network initialization.

In this paper, we study the concept of Parisian ruin under the hybrid observation scheme model introduced by Li et al. \cite{binetal2016}. Under this model, the process is observed at Poisson arrival times whenever the business is financially healthy and it is continuously observed when it goes below $0$. The Parisian …

In his 1954 paper about the initial value problem for 2D hyperbolic nonlinear PDEs, P. Lax declared that he had "a strong reason to believe" that there must exist a well-defined class of "not genuinely nonlinear" nonlinear PDEs. In 1978 G. Boillat coined the term "completely exceptional" to denote it. In the case of $2…

Combining deep neural networks with structured logic rules is desirable to harness flexibility and reduce uninterpretability of the neural models. We propose a general framework capable of enhancing various types of neural networks (e.g., CNNs and RNNs) with declarative first-order logic rules. Specifically, we develop…

Asymmetry PRISM outperforms CPU and GPU solvers for institutional rebalancing.

CUBE explains models by balanced experiments and contrasts.

Today, the dominant paradigm for training neural networks involves minimizing task loss on a large dataset. Using world knowledge to inform a model, and yet retain the ability to perform end-to-end training remains an open question. In this paper, we present a novel framework for introducing declarative knowledge to ne…

In this paper we examine the process involved in the design and implementation of a port-graph model to be used for the analysis of an agent-based rational negligence model. Rational negligence describes the phenomenon that occurred during the financial crisis of 2008 whereby investors chose to trade asset-backed secur…

Tensor models decode human perception and memory using SPO triples.

We propose a novel non-parametric adaptive anomaly detection algorithm for high dimensional data based on rank-SVM. Data points are first ranked based on scores derived from nearest neighbor graphs on n-point nominal data. We then train a rank-SVM using this ranked data. A test-point is declared as an anomaly at alpha-…

A partial order on prime knots can be defined by declaring $J\ge K$ if there exists an epimorphism from the knot group of $J$ onto the knot group of $K$. Suppose that $J$ is a 2-bridge knot that is strictly greater than $m$ distinct, nontrivial knots. In this paper we determine a lower bound on the crossing number of $…

Study explores how labour income impacts optimal bankruptcy strategy.

The large majority of risk-sharing transactions involve few agents, each of whom can heavily influence the structure and the prices of securities. This paper proposes a game where agents' strategic sets consist of all possible sharing securities and pricing kernels that are consistent with Arrow-Debreu sharing rules. F…

We propose a non-parametric anomaly detection algorithm for high dimensional data. We score each datapoint by its average $K$-NN distance, and rank them accordingly. We then train limited complexity models to imitate these scores based on the max-margin learning-to-rank framework. A test-point is declared as an anomaly…

The restricted isometry property (RIP) for design matrices gives guarantees for optimal recovery in sparse linear models. It is of high interest in compressed sensing and statistical learning. This property is particularly important for computationally efficient recovery methods. As a consequence, even though it is in …

We propose a non-parametric anomaly detection algorithm for high dimensional data. We first rank scores derived from nearest neighbor graphs on $n$-point nominal training data. We then train limited complexity models to imitate these scores based on the max-margin learning-to-rank framework. A test-point is declared as…

The tangent bundle $T^kM$ of order $k$, of a smooth Banach manifold $M$ consists of all equivalent classes of curves that agree up to their accelerations of order $k$. For a Banach manifold $M$ and a natural number $k$ first we determine a smooth manifold structure on $T^kM$ which also offers a fiber bundle structure f…

Examines SOFR derivatives pricing and hedging post-LIBOR discontinuation.

ModSSC unifies semi-supervised classification for various data types.

Study compares DSPy teleprompter algorithms for aligning LLM evaluations with human annotations.

Dynamic neural network toolkits such as PyTorch, DyNet, and Chainer offer more flexibility for implementing models that cope with data of varying dimensions and structure, relative to toolkits that operate on statically declared computations (e.g., TensorFlow, CNTK, and Theano). However, existing toolkits - both static…

Tree-AMP simplifies inference in complex tree-structured models.

Future robots should follow human social norms in order to be useful and accepted in human society. In this paper, we leverage already existing social knowledge in human societies by capturing it in our framework through the notion of social norms. We show how norms can be used to guide a reinforcement learning agent t…

The crossing matrix of a braid on $N$ strands is the $N\times N$ integer matrix with zero diagonal whose $i,j$ entry is the algebraic number (positive minus negative) of crossings by strand $i$ over strand $j$ . When restricted to the subgroup of pure braids, this defines a homomorphism onto the additive subgroup of $N…

Study geometrically measures to decide if modular companions are conformally equivalent.