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.
New study shows low-degree polynomial algorithms struggle at clause densities close to Fix's.
The Tsetlin Machine (TM) is an interpretable mechanism for pattern recognition that constructs conjunctive clauses from data. The clauses capture frequent patterns with high discriminating power, providing increasing expression power with each additional clause. However, the resulting accuracy gain comes at the cost of…
Faster Tsetlin Machines use clause indexing to speed inference and learning.
The Regression Tsetlin Machine (RTM) addresses the lack of interpretability impeding state-of-the-art nonlinear regression models. It does this by using conjunctive clauses in propositional logic to capture the underlying non-linear frequent patterns in the data. These, in turn, are combined into a continuous output th…
Statistical relational frameworks such as Markov logic networks and probabilistic soft logic (PSL) encode model structure with weighted first-order logical clauses. Learning these clauses from data is referred to as structure learning. Structure learning alleviates the manual cost of specifying models. However, this be…
Convolutional neural networks (CNNs) have obtained astounding successes for important pattern recognition tasks, but they suffer from high computational complexity and the lack of interpretability. The recent Tsetlin Machine (TM) attempts to address this lack by using easy-to-interpret conjunctive clauses in propositio…
ClauseLens uses reinforcement learning to price reinsurance treaties transparently and auditably.
The recently introduced Tsetlin Machine (TM) has provided competitive pattern recognition accuracy in several benchmarks, however, requires a 3-dimensional hyperparameter search. In this paper, we introduce the Multigranular Tsetlin Machine (MTM). The MTM eliminates the specificity hyperparameter, used by the TM to con…
We present a dataset and experiments on applying recurrent neural networks (RNNs) for guiding clause selection in the connection tableau proof calculus. The RNN encodes a sequence of literals from the current branch of the partial proof tree to a hidden vector state; using it, the system selects a clause for extending …
The recently introduced Tsetlin Machine (TM) has provided competitive pattern classification accuracy in several benchmarks, composing patterns with easy-to-interpret conjunctive clauses in propositional logic. In this paper, we go beyond pattern classification by introducing a new type of TMs, namely, the Regression T…
This paper works out fair values of stock loan model with automatic termination clause, cap and margin. This stock loan is treated as a generalized perpetual American option with possibly negative interest rate and some constraints. Since it helps a bank to control the risk, the banks charge less service fees compared …
Paper presents LLM-enhanced contract metadata extraction.
The paper introduces closed-form expressions for interpreting Tsetlin Machines.
Pricing Chinese convertible bonds using Monte Carlo simulation and dynamic programming.
Enhances neural networks with logical knowledge for better performance.
We present a case-study demonstrating the usefulness of Bayesian hierarchical mixture modelling for investigating cognitive processes. In sentence comprehension, it is widely assumed that the distance between linguistic co-dependents affects the latency of dependency resolution: the longer the distance, the longer the …
Insurance contracts for autonomous AI agents must be actuarially sound and resistant to gaming.
In this note we show how to replicate a stylized CDS with a repurchase agreement and an asset swap. The latter must be designed in such a way that, on default of the issuer, it is terminated with a zero close-out amount. This break clause can be priced using the well known unilateral credit/debit valuation adjustment f…
We present a stochastic-local volatility model for derivative contracts on commodity futures able to describe forward-curve and smile dynamics with a fast calibration to liquid market quotes. A parsimonious parametrization is introduced to deal with the limited number of options quoted in the market. Cleared commodity …
Seglearn is an open-source python package for machine learning time series or sequences using a sliding window segmentation approach. The implementation provides a flexible pipeline for tackling classification, regression, and forecasting problems with multivariate sequence and contextual data. This package is compatib…
We present a dialogue on Counterparty Credit Risk touching on Credit Value at Risk (Credit VaR), Potential Future Exposure (PFE), Expected Exposure (EE), Expected Positive Exposure (EPE), Credit Valuation Adjustment (CVA), Debit Valuation Adjustment (DVA), DVA Hedging, Closeout conventions, Netting clauses, Collateral …
Paper characterizes and represents pairwise causal background knowledge for improved causal inference.
Convolutional neural networks have been successfully applied to various NLP tasks. However, it is not obvious whether they model different linguistic patterns such as negation, intensification, and clause compositionality to help the decision-making process. In this paper, we apply visualization techniques to observe h…
Normal surface theory, a tool to represent surfaces in a triangulated 3-manifold combinatorially, is ubiquitous in computational 3-manifold theory. In this paper, we investigate a relaxed notion of normal surfaces where we remove the quadrilateral conditions. This yields normal surfaces that are no longer embedded. We …
The authors of (Cho et al., 2014a) have shown that the recently introduced neural network translation systems suffer from a significant drop in translation quality when translating long sentences, unlike existing phrase-based translation systems. In this paper, we propose a way to address this issue by automatically se…
Today, artificial intelligence systems driven by machine learning algorithms can be in a position to take important, and sometimes legally binding, decisions about our everyday lives. In many cases, however, these systems and their actions are neither regulated nor certified. To help counter the potential harm that suc…
Is an option to early terminate a swap at its market value worth zero? At first sight it is, but in presence of counterparty risk it depends on the criteria used to determine such market value. In case of a single uncollateralised swap transaction under ISDA between two defaultable counterparties, the additional unilat…
We present a fast and scalable algorithm to induce non-monotonic logic programs from statistical learning models. We reduce the problem of search for best clauses to instances of the High-Utility Itemset Mining (HUIM) problem. In the HUIM problem, feature values and their importance are treated as transactions and util…
Python package for functional data analysis.
Lifted Relational Neural Networks (LRNNs) describe relational domains using weighted first-order rules which act as templates for constructing feed-forward neural networks. While previous work has shown that using LRNNs can lead to state-of-the-art results in various ILP tasks, these results depended on hand-crafted ru…
We study an asset allocation stochastic problem with restriction for a defined-contribution pension plan during the accumulation phase. We consider a financial market with stochastic interest rate, composed of a risk-free asset, a real zero coupon bond price, the inflation-linked bond and the risky asset. A plan member…
Algorithm learns CNF formulas from random solutions under specific conditions.
We present an effective technique for training deep learning agents capable of negotiating on a set of clauses in a contract agreement using a simple communication protocol. We use Multi Agent Reinforcement Learning to train both agents simultaneously as they negotiate with each other in the training environment. We al…
The paper compares machine learning methods with traditional techniques for pricing and sensitivities of financial products with path-dependent structures.
This paper introduces scikit-hubness, a Python package for efficient nearest neighbor search in high-dimensional spaces. Hubness is an aspect of the curse of dimensionality, and is known to impair various learning tasks, including classification, clustering, and visualization. scikit-hubness provides algorithms for hub…
We depart from the usual methods for pricing contracts with the counterparty credit risk found in most of the existing literature. In effect, typically, these models do not account for either systemic effects or at-first-default contagion and postulate that the contract value at default equals either the risk-free valu…
Develops a machine-learning framework for optimal share repurchase hedging.
Paper improves text-to-SQL models with schema-aware denoising.
MCD reformulates conditional density estimation into binary classification.
Paper proposes MMC to avoid high-density bias in clustering.
New method minimizes robust density power-based divergences for general parametric densities.
Study on rank-one ECS manifolds, focusing on dilational type.
Modes and ridges of the probability density function behind observed data are useful geometric features. Mode-seeking clustering assigns cluster labels by associating data samples with the nearest modes, and estimation of density ridges enables us to find lower-dimensional structures hidden in data. A key technical cha…
Normalizing flows improve density estimation from noisy data.
Study exact minimax rates for density estimation over convex classes, extending previous work.
The paper proposes modern computational methods for optimizing reinsurance contracts.
Paper proposes machine unlearning method to forget user data from neural networks.
New method uses SoS densities and α-divergences for efficient sequential transport maps.