Research
On-device research index

arXiv research

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.

168,657 papers · 148 categories

Trend · papers per month

120240359479 · Jun 202019922001200920172026
48 results for Tsetlin machine

Faster Tsetlin Machines use clause indexing to speed inference and learning.

problem Overfitting and slow inference in Tsetlin Machines.
method Introduced a look-up table that indexes clauses based on feature falsification, enabling faster evaluation of clauses.
result Up to 15 times faster classification and three times faster learning on MNIST and Fashion-MNIST.

The paper introduces closed-form expressions for interpreting Tsetlin Machines.

problem Interpreting complex Tsetlin Machines with a large number of clauses.
method Developed closed-form expressions for local and global interpretability of Tsetlin Machines.
result The expressions enable real-time feature importance assessment and data clustering.

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…

2019-09-16abs ↗pdf ↗

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…

2019-05-23abs ↗pdf ↗

The purpose of this note is to give a simple description of a (complete) family of functions in involution on certain hermitian symmetric spaces. This family, obtained via bi-hamiltonian approach using the Bruhat Poisson structure, is especially simple for the projective spaces, where the formulas in terms of the momen…

2001-02-26abs ↗pdf ↗

We consider the moduli space M_r of polygons with fixed side lengths in five-dimensional eucledian space. We analyze the local structure of its singularities and exhibit a real-analytic equivalence between M_r and a weighted quotient of the n-fold product of the quaternionic projective line HP^1 by the diagonal PSL(2,H…

2002-02-17abs ↗pdf ↗

We introduce the notion of generalized hyperpolygon, which arises as a representation, in the sense of Nakajima, of a comet-shaped quiver. We identify these representations with rigid geometric figures, namely pairs of polygons: one in the Lie algebra of a compact group and the other in its complexification. To such da…

2020-01-19abs ↗pdf ↗

The current processes for building machine learning systems require practitioners with deep knowledge of machine learning. This significantly limits the number of machine learning systems that can be created and has led to a mismatch between the demand for machine learning systems and the ability for organizations to b…

2017-07-21abs ↗pdf ↗

We generalize a support vector machine to a support spinor machine by using the mathematical structure of wedge product over vector machine in order to extend field from vector field to spinor field. The separated hyperplane is extended to Kolmogorov space in time series data which allow us to extend a structure of sup…

2017-09-11abs ↗pdf ↗

The preceding paper constructed tangle machines as diagrammatic models, and illustrated their utility with a number of examples. The information content of a tangle machine is contained in characteristic quantities associated to equivalence classes of tangle machines, which are called invariants. This paper constructs …

2014-04-10abs ↗pdf ↗

Autonomous vehicles rely on machine learning to solve challenging tasks in perception and motion planning. However, automotive software safety standards have not fully evolved to address the challenges of machine learning safety such as interpretability, verification, and performance limitations. In this paper, we revi…

2019-12-20abs ↗pdf ↗

RBM and DBM are represented as 2D tensor networks, revealing their expressive power and efficiency.

problem Understanding and optimizing RBM and DBM models.
method Representing RBM and DBM as 2D tensor networks and developing an efficient tensor network contraction algorithm.
result The proposed algorithm for computing partition functions is more accurate than state-of-the-art methods.

A new machine learning model uses score matching to estimate probability densities efficiently.

problem Estimating probability density functions is challenging.
method Introduced a product Jacobi-Theta Boltzmann machine (pJTBM) and used score matching for efficient fitting.
result The pJTBM can fit probability densities more efficiently than the RTBM using score matching.

Machine learning develops rapidly, which has made many theoretical breakthroughs and is widely applied in various fields. Optimization, as an important part of machine learning, has attracted much attention of researchers. With the exponential growth of data amount and the increase of model complexity, optimization met…

2019-06-17abs ↗pdf ↗

In this chapter, we provide a brief overview of applying machine learning techniques for clinical prediction tasks. We begin with a quick introduction to the concepts of machine learning and outline some of the most common machine learning algorithms. Next, we demonstrate how to apply the algorithms with appropriate to…

2019-09-19abs ↗pdf ↗

Study examines challenges and applications of machine learning in finance.

problem Challenges in applying machine learning to financial research due to market idiosyncrasies and methodological differences.
method Discussion of adjustments needed to conventional machine learning methodology to account for financial market peculiarities.
result Machine learning can be unified with financial research as a robust complement to econometric methods.

This paper explores causal analysis in machine learning for better interpretability.

problem The lack of causality in traditional interpretable machine learning models.
method An overview of causal approaches for interpretable machine learning.
result Causal analysis improves the interpretability of machine learning models.

In recent years, Neural Turing Machines have gathered attention by joining the flexibility of neural networks with the computational capabilities of Turing machines. However, Neural Turing Machines are notoriously hard to train, which limits their applicability. We propose reservoir memory machines, which are still abl…

2020-02-12abs ↗pdf ↗

Missing responses is a missing data format in which outcomes are not always observed. In this work we develop kernel machines that can handle missing responses. First, we propose a kernel machine family that uses mainly the complete cases. For the quadratic loss, we then propose a family of doubly-robust kernel machine…

2018-06-07abs ↗pdf ↗

Matched Machine Learning combines machine learning and matching for causal inference.

problem Non-interpretable methods for causal inference.
method Combines machine learning and matching for interpretable causal inference.
result Performs as well as black-box machine learning methods and better than existing matching methods.

This paper explores how machine learning can improve life insurance risk assessment.

problem Limited use of machine learning in life insurance due to statistical models' efficiency.
method Review and extension of traditional actuarial methodologies with machine learning techniques.
result Developed Python library for life insurance data, improving risk modeling.

Machine learning impacts computational math, offering new functions approximations.

problem Machine learning's black box nature hinders further progress in computational math.
method Analyzes machine learning's impact on computational math and vice versa.
result Integrating computational math with machine learning can enhance both fields.