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,742 papers · 148 categories

Trend · papers per month

168336503671 · Jun 202019922001200920172026
48 results for forming machines

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.

Proposes TSCI method to infer causal effects with weak or invalid instruments using machine learning.

problem Causal inference with weak or invalid instrumental variables.
method Two-stage curvature identification (TSCI) using machine learning.
result Asymptotically unbiased and Gaussian estimator for causal effects.

Human inertial thinking schemes can be formed through learning, which are then applied to quickly solve similar problems later. However, when problems are significantly different, inertial thinking generally presents the solutions that are definitely imperfect. In such cases, people will apply creative thinking, such a…

2018-03-01abs ↗pdf ↗

Proposes a framework to identify and correct model-form errors in nonlinear systems.

problem Model-form errors in nonlinear dynamical systems due to unknown or approximated governing equations.
method Uses a hybrid approach combining machine learning and Bayesian filtering to estimate and correct model-form errors.
result Improves the predictive capability of known but approximate governing equations for nonlinear dynamical systems.

Survey on closed-form Fisher-Rao distance expressions.

problem Finding closed-form expressions for Fisher-Rao distance.
method Collect and present examples of closed-form expressions for Fisher-Rao distance of discrete and continuous distributions.
result Presentation of closed-form expressions for Fisher-Rao distance of various distributions.

Unified bounds for sketched bilinear forms in machine learning and statistics.

problem Uniform bounds on sketched bilinear forms for modern analyses.
method Generic chaining and new techniques for handling suprema over pairs of sets.
result Improved convergence bounds for sketched Federated Learning and bandit algorithms.

A new SVM method for predicting time series labels.

problem Learning to predict labels from high-dimensional time series data.
method Extended SVM concept to continuous time series data, formulated as a convex optimization problem.
result Empirical results show the algorithm's effectiveness for analyzing long-term multivariate data.

A new method for compressive classification using bridge regression.

problem Efficient pattern classification with compact representation.
method Proposed a deterministic bridge regression solution for compressive classification.
result Validation of the proposed solution through numerical studies on simulated and real-world data.

The paper proposes a method to identify model uncertainty in mechanical presses using optimal design of experiments.

problem Model uncertainties in forming machines impair controller performance.
method Parameter identification, optimal design of experiments, and hypothesis testing.
result Identifies inconsistencies in parameter estimates as indicators of model uncertainty.

We present a new trace estimator of the matrix whose explicit form is not given but its matrix multiplication to a vector is available. The form of the estimator is similar to the Hutchison stochastic trace estimator, but instead of the random noise vectors in Hutchison estimator, we use small number of probing vectors…

2016-06-16abs ↗pdf ↗

Classifies spherical objects filled with water or air using acoustic echoes and Form Function.

problem Automatic recognition of spherical objects based on acoustic echoes.
method Form Function analysis of wideband sonar data, fed into a Multilayer Perceptron (MLP) classifier.
result Performance of the MLP classifier compared to SVM, highlighting the effectiveness of Form Function.

Universal learning machine is a theory trying to study machine learning from mathematical point of view. The outside world is reflected inside an universal learning machine according to pattern of incoming data. This is subjective pattern of learning machine. In [2,4], we discussed subjective spatial pattern, and estab…

2018-05-26abs ↗pdf ↗

A machine learning model captures non-Newtonian fluid dynamics from molecular details.

problem Creating accurate non-Newtonian fluid models from molecular data.
method Developed a machine learning framework that maps micro-scale polymer configurations to macro-scale fluid dynamics, preserving molecular fidelity.
result The deep non-Newtonian model (DeePN2^2) accurately predicts fluid behavior without empirical closures.

There has been growing interest in extending traditional vector-based machine learning techniques to their tensor forms. An example is the support tensor machine (STM) that utilizes a rank-one tensor to capture the data structure, thereby alleviating the overfitting and curse of dimensionality problems in the conventio…

2018-04-17abs ↗pdf ↗

The goal of machine learning is to provide solutions which are trained by data or by experience coming from the environment. Many training algorithms exist and some brilliant successes were achieved. But even in structured environments for machine learning (e.g. data mining or board games), most applications beyond the…

2011-05-10abs ↗pdf ↗

New Frank-Wolfe algorithm speeds up SVM-type multi-category learning.

problem Improving pattern recognition performance in multi-category SVM learning.
method Developed a new optimization algorithm based on Frank-Wolfe framework for MC-SVM variants.
result Closed-form solutions for direction finding and line search in the Frank-Wolfe framework for MC-SVM.

Paper converts deep networks to flat, equivalent kernel machines.

problem Capacity control and uniform convergence in deep learning.
method Push-forward transformation from deep networks to indefinite kernel machines.
result Flat network weights are Lp-norm regularized (0<p<1).

A method interprets black-box models using an ensemble of gradient boosting machines.

problem Local and global interpretation of black-box models.
method An ensemble of gradient boosting machines (GBMs) to form a generalized additive model.
result Efficiency and properties demonstrated on synthetic and real datasets.

Solves the challenge of retrieving item-specific financial information from Form 10-Q filings.

problem Retrieving item-specific information from Form 10-Q filings with varying formats and machine-readable hierarchy.
method Complements a rule-based algorithm with a Convolutional Neural Network (CNN) image classifier to itemize 10-Q files.
result Demonstrates a generalized pipeline for rapid data retrieval from a large volume of textual data.

Unified framework combines trace-induced quantum kernels for improved machine learning models.

problem Improving performance of quantum machine learning models using trace-induced kernels.
method Developed a unified framework combining various trace-induced quantum kernels, including global fidelity and local projected kernels, as Lego kernels.
result Local projected kernels can achieve comparable performance to global fidelity kernels with fewer quantum resources.

When machine predictors can achieve higher performance than the human decision-makers they support, improving the performance of human decision-makers is often conflated with improving machine accuracy. Here we propose a framework to directly support human decision-making, in which the role of machines is to reframe pr…

2019-05-29abs ↗pdf ↗

Gradient-based training and pruning for radial basis function networks in materials physics.

problem Interpretable and robust machine learning for materials physics problems.
method Gradient-based training and pruning of radial basis function networks with closed-form optimization criteria.
result Pruned models provide compact and interpretable versions of larger models, offering insights into atom-level migration processes.

New models predict mobility flows as well as complex machine learning but are simpler and interpretable.

problem Incomplete understanding and modeling of human mobility flows.
method Developed simple machine-learned, closed-form models of mobility.
result These models predict mobility flows more accurately than gravity or complex machine/deep learning models.

This work combines machine learning with physical models to solve inverse problems efficiently.

problem Solving inverse problems in the presence of missing physics and recovering parameters.
method Variational autoencoding with a physically structured decoder network and stochastic local approximations.
result The method accelerates inference for Bayesian inverse problems and acts as a regularizer encoding prior physical information.

The modern data analyst must cope with data encoded in various forms, vectors, matrices, strings, graphs, or more. Consequently, statistical and machine learning models tailored to different data encodings are important. We focus on data encoded as normalized vectors, so that their "direction" is more important than th…

2016-05-01abs ↗pdf ↗

New metrics solve machine learning limitations.

problem Previous success metrics restrict application to specific forms of machine learning.
method Define decomposable metrics as linear operations on probability distributions.
result Demonstrated theorems bounding success in various ways, generalizing existing results.

Communication costs, resulting from synchronization requirements during learning, can greatly slow down many parallel machine learning algorithms. In this paper, we present a parallel Markov chain Monte Carlo (MCMC) algorithm in which subsets of data are processed independently, with very little communication. First, w…

2013-11-19abs ↗pdf ↗

FiberNet integrates geometry into machine learning for clearer classification.

problem Lack of interpretability in traditional deep learning.
method Reformulates classification as geometric optimization on fiber bundles, introducing learnable Riemannian metrics and variational prototype optimization.
result Clear geometric interpretability and efficiency in classification.

Continuous formulation of machine learning models and algorithms.

problem Generalization error and implicit regularization in machine learning.
method Continuous formulation in calculus of variations and differential-integral equations, with new models and algorithms.
result Conventional models and algorithms can be recovered as particular discretizations.

Classification is an important supervised machine learning method, which is necessary and challenging issue for ecological research. It offers a way to classify a dataset into subsets that share common patterns. Notably, there are many classification algorithms to choose from, each making certain assumptions about the …

2018-12-21abs ↗pdf ↗

New Stein identity for q-Gaussians reduces gradient variance in machine learning.

problem Improving gradient estimators for non-Gaussian distributions.
method Deriving a new Stein identity for bounded-support q-Gaussians and simplifying previous results.
result Gradient estimators for q-Gaussians have nearly identical forms to Gaussian ones, reducing variance.

New methods improve uncertainty in machine learning predictions for asset returns.

problem Uncertainty in machine learning predictions for asset returns.
method Developed new methods to construct forecast confidence intervals for expected returns from neural networks.
result Neural network forecasts of expected returns have the same asymptotic distribution as classic nonparametric methods, enabling standard error calculation.