Medical applications challenge today's text categorization techniques by demanding both high accuracy and ease-of-interpretation. Although deep learning has provided a leap ahead in accuracy, this leap comes at the sacrifice of interpretability. To address this accuracy-interpretability challenge, we here introduce, fo…
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,742 papers · 148 categories
Trend · papers per month
48 results for “Tsetlin Machine”
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…
A fast model estimates future prices from orderbook data.
problem Estimating future prices from orderbook data.
method Hyperdimensional vector Tsetlin machine framework for fast estimation.
result Demonstrated robust estimate of future prices.
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…
WTM reduces clause usage and computation time for pattern recognition.
problem High computation time and memory usage in Tsetlin Machine.
method Weighting clauses and using binomial sampling to reduce complexity.
result WTM achieves similar accuracy with fewer clauses and faster training.
Improved RTM uses integer weights to reduce computation and increase interpretability.
problem Lack of interpretability in nonlinear regression models.
method Integer weighted RTM clauses, combined with a novel learning scheme.
result Significantly reduced computation cost with improved accuracy.
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…
This paper is devoted to an elementary new construction of -singular Gelfand-Tsetlin modules using complex geometry. We introduce a universal ring together with the vector space with basis formed from some local distributi…
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…
Complete integrability from Poisson-Nijenhuis structures on compact hermitian symmetric spacesmath.SG
We study a class of Poisson-Nijenhuis systems defined on compact hermitian symmetric spaces, where the Nijenhuis tensor is defined as the composition of Kirillov-Konstant-Souriau symplectic form with the so called Bruhat-Poisson structure. We determine its spectrum. In the case of Grassmannians the eigenvalues are the …
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…
Introduces generalized hyperpolygons and their geometric and algebraic properties.
problem Understanding moduli spaces of generalized hyperpolygons.
method Representation of a comet-shaped quiver, associated meromorphic Higgs bundles, Hitchin systems, and integrable Hamiltonian systems.
result Generalized hyperpolygons admit the structure of a completely integrable Hamiltonian system.
Reservoir Memory Machines solve benchmark tasks faster than Neural Turing Machines.
problem Training Neural Turing Machines is hard and limits their applicability.
method Proposes Reservoir Memory Machines, combining neural network flexibility with Turing machine capabilities, but with faster training via alignment and linear regression.
result Reservoir Memory Machines solve benchmark tasks as well as Neural Turing Machines but are much faster to train.
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…
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…
The paper reviews machine learning safety techniques for autonomous vehicles.
problem Challenges in machine learning safety for autonomous vehicles.
method Organizes practical safety techniques to complement engineering safety.
result Enhances dependability and safety of machine learning algorithms in autonomous vehicles.
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 …
Application of fuzzy support vector machine in stock price forecast. Support vector machine is a new type of machine learning method proposed in 1990s. It can deal with classification and regression problems very successfully. Due to the excellent learning performance of support vector machine, the technology has becom…
Boltzmann machines as two-dimensional tensor networkscond-mat.stat-mech
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.
MLBench: How Good Are Machine Learning Clouds for Binary Classification Tasks on Structured Data?cs.DC
We conduct an empirical study of machine learning functionalities provided by major cloud service providers, which we call machine learning clouds. Machine learning clouds hold the promise of hiding all the sophistication of running large-scale machine learning: Instead of specifying how to run a machine learning task,…
Market incentivizes parties to share high-quality data for collaborative machine learning tasks.
problem Fair revenue distribution and data replication threats in collaborative machine learning markets.
method Introduces a novel payment division function robust to replication and customized output models.
result Validated assumptions and showed approximate satisfaction for commonly used models.
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.
DoubleML implements machine learning for causal inference in R.
problem Estimating causal effects in regression models with high-dimensional data.
method Double machine learning framework with Neyman orthogonality and sample splitting.
result Valid inference on causal parameters using machine learning methods.
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…
Quantum computers can speed up machine learning optimization problems.
problem Long computation times and high resource requirements for classical optimization algorithms in machine learning.
method Developed a mathematical model to leverage quantum parallelism for machine learning.
result Quantum machine learning applied to a 3D time-varying image demonstrated significant speedup.
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…
Survey on distributed machine learning to handle large data.
problem Training large models requires vast amounts of data.
method Distribute workload across multiple machines.
result Efficient parallelization and coherent model creation.
Machine learning explores symmetries in field theory and algebra.
problem Understanding symmetries in field theory and algebra.
method Using neural networks to analyze conformal field theory and Lie algebra representation theory.
result Recent advances in machine learning have uncovered new symmetries.
Optimal Transport enhances machine learning with new methods.
problem Comparing and manipulating probability distributions in machine learning.
method Probabilistic framework rooted in rich history and theory.
result New solutions in generative modeling and transfer learning.
AI can learn true probabilities if data and assumptions align.
problem Understanding when AI models can accurately represent true objective probabilities.
method Proved conditions under which AI can learn true probabilities.
result Conditions for learning true probabilities are identified.
Product Kanerva Machines dynamically combine smaller models for better memory organization.
problem Limited organization in the Kanerva Machine.
method Introducing Product Kanerva Machines that dynamically combine multiple smaller Kanerva Machines.
result Product Kanerva Machines can discover spatial tunings that approximately factorize simple images by object.
R package for machine learning in survival analysis.
problem Limited machine learning interfaces for survival analysis.
method Provides a comprehensive machine learning interface for survival analysis.
result Systematic infrastructure for survival modeling and evaluation.
This paper reviews quantum machine learning from NISQ to fault tolerance.
problem The challenges and opportunities in quantum machine learning.
method Comprehensive review of quantum machine learning concepts.
result Coverage of NISQ and fault-tolerant quantum computing approaches.
pystacked combines machine learning models for improved predictions.
problem Improving machine learning model performance through stacking.
method Stacked generalization using Python's scikit-learn with various base learners.
result Enhanced predictive models through combining multiple machine learning algorithms.
A new process model for machine learning applications with quality assurance.
problem Lack of standard process model for machine learning applications.
method Six-phase process model with quality assurance methodology.
result Proposes a new process model for machine learning applications.
Julia accelerates machine learning in various fields with balance of efficiency and simplicity.
problem Efficiency and simplicity in machine learning algorithms.
method Developed and applied Julia language in machine learning.
result Julia balances efficiency and simplicity for machine learning.
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.
This guide introduces machine learning for medical data analysis.
problem Handling large, complex datasets in healthcare.
method Explains common machine learning algorithms and tasks.
result Illustrates machine learning applications in healthcare.
Machine learning boosts physics research, especially at high energy experiments.
problem Finding new fundamental physics in high energy experiments.
method Review of machine learning methods and applications in high energy physics.
result Modern machine learning techniques have expanded the scope of physics research.
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…
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.
Machine learning aids epidemiologists in analyzing big data.
problem Handling large, complex data in epidemiology.
method Explains principles and methods of supervised and unsupervised learning.
result Develops strategies for model evaluation and hyperparameter optimization.
The R package psvmSDR: A Unified Algorithm for Sufficient Dimension Reduction via Principal Machinesstat.CO
R package psvmSDR simplifies SDR computation for machine learning.
problem Sufficient dimension reduction in machine learning.
method Principal machine (PM) generalized from PSVM.
result Efficient computation of SDR estimators in various scenarios.
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.