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.

169,051 papers · 148 categories

Trend · papers per month

18.8%37.5%56.3%75.0% · Mar 199319922001200920172026
48 results for classical ML

We translate ML pipelines into neural networks to optimize multiple models together.

problem Isolated training of ML pipelines limits joint optimization of multiple models.
method Propose translating ML pipelines into neural networks and fine-tuning them jointly.
result Fine-tuning translated pipelines increases final accuracy.

This study compares feature importance and explainability in quantum vs classical ML models.

problem Lack of transparency in ML models, especially in sensitive fields.
method Comparison of classical ML (SVM, Random Forest) and hybrid quantum ML (VQC, QSVC) models using feature importance and explainability methods.
result Quantum ML models provide insights similar to classical models but with unique quantum features.

Study uses ML techniques to reveal quantum-like features in classical systems.

problem Understanding the intuition behind unsupervised ML in physical systems.
method Three ML techniques applied to adjacency matrices of 2D particulate systems.
result ML techniques reveal quantum-like features in classical systems.

Study compares quantum and classical ML in crypto trading, finding hybrid models outperform.

problem Comparing quantum and classical machine learning in crypto trading strategies.
method Backtesting 10 models across multiple crypto assets using classical ML, quantum ML, hybrid models, and transformer models.
result Hybrid quantum models achieve superior performance with 13.99% return and 1.76 Sharpe ratio.

A ML model accurately replicates chaotic dynamics across various parameters.

problem Replicating chaotic characteristics of non-linear dynamics using machine learning.
method A ML model trained to predict one-step-ahead states from historic states captures bifurcation diagrams and Lyapunov exponents universally.
result Variational quantum circuit outperforms classical models in reproducing long-term chaotic characteristics.

SAR evaluates ML-based linear regression models for statistical significance.

problem Lack of formal statistical significance in ML-based regression models.
method Statistical Agnostic Regression (SAR) using concentration inequalities and worst-case scenario analysis.
result SAR provides a threshold for statistical significance without assuming underlying assumptions.

Modern ML methods show unexpected behaviors that contradict classical statistics.

problem Modern machine learning methods exhibit behaviors at odds with classical statistical intuitions.
method Comparison between fixed and random design settings in ML and statistics.
result Moving from fixed to random designs reveals new insights into bias-variance tradeoffs and overfitting.

What is a systematic way to efficiently apply a wide spectrum of advanced ML programs to industrial scale problems, using Big Models (up to 100s of billions of parameters) on Big Data (up to terabytes or petabytes)? Modern parallelization strategies employ fine-grained operations and scheduling beyond the classic bulk-…

2013-12-30abs ↗pdf ↗

Optimization algorithm CoCo improves causal inference from diverse data.

problem Identifying true causal relationships from data with spurious associations.
method CoCo optimizes for causal inference using environments with invariant causal relationships.
result CoCo provides more accurate causal estimates and predictions.

A new ML method predicts long-time-step molecular dynamics, preserving symplectic and time-reversible properties.

problem Limited computational efficiency in long-time-step molecular dynamics simulations.
method Learning data-driven structure-preserving maps to generate long time-step classical dynamics.
result The method eliminates artifacts like lack of energy conservation and loss of equipartition.

Machine learning (ML) models may be deemed confidential due to their sensitive training data, commercial value, or use in security applications. Increasingly often, confidential ML models are being deployed with publicly accessible query interfaces. ML-as-a-service ("predictive analytics") systems are an example: Some …

2016-09-09abs ↗pdf ↗

Molecular Dynamics (MD) simulation is widely used to analyze the properties of molecules and materials. Most practical applications, such as comparison with experimental measurements, designing drug molecules, or optimizing materials, rely on statistical quantities, which may be prohibitively expensive to compute from …

2018-12-18abs ↗pdf ↗

Paper proposes mechanism learning to reverse causal inference in ML.

problem Machine learning models learn associational, not causal, relationships.
method Causally weighted Gaussian mixture models (CW-GMMs).
result CW-GMMs can deconfound observational data for reverse causal inference.

This paper compares deep transfer learning with classical ML in low-shot text classification.

problem Low-shot text classification with limited labeled data.
method Comparison of BERT and top classical ML approaches on a sentiment classification task.
result BERT outperforms classical ML by 9.7% on average with 100 labeled examples per class.

Quantum circuits explained using Shapley values for better understanding.

problem Improving the explainability of quantum machine learning circuits.
method Applying Shapley values to quantify gate importance in quantum circuits.
result Quantum circuits can be explained by their gate importance, enhancing understanding and interpretability.

Researchers validate ML scenario generators by checking dependencies and detecting memorization effects.

problem Validation of machine learning-based scenario generators differs from classical methods due to data-driven dependencies.
method Two novel validation aspects: checking dependencies and detecting memorization effects. Novel memorization ratio introduced.
result Validation methods successfully detect dependencies and memorization effects in ML-based scenario generators.

Study finds physical priors don't significantly improve ML models for learning latent dynamics.

problem Learning latent dynamics from visual observations without access to the underlying state.
method Benchmarked 17 datasets with visual observations of physical systems using various physically inspired methods alongside baselines.
result Physical priors do not significantly improve standard techniques for learning latent dynamics.

This work explores using deep NNs to learn quantum systems from probability distributions.

problem Learning quantum systems from limited probability distribution data.
method Using deep neural networks to reconstruct quantum Hamiltonian from probability distributions.
result Deep neural networks can learn quantum Hamiltonians from probability distributions.

ML models predict extreme events in the Hénon map with accuracy scaling with system parameters.

problem Predicting extreme events in chaotic dynamical systems like the Hénon map.
method Used machine learning algorithms to analyze and forecast extreme events in the Hénon map.
result The success rate of ML models depends on prediction time, number of training samples, and network size, with scaling relations to the system's topological entropy.

The paper proposes a method to create domain-invariant representations using Wasserstein distance.

problem Domain shifts in training data affect machine learning model performance across different domains.
method The method combines classification/regression losses with a GAN-type discriminator to minimize the Wasserstein distance between domains.
result The approach produces the highest minimum classification accuracy and most invariant representation across domains.

The study uses ML and AI to forecast pension fund mortality, outperforming traditional methods.

problem Incorporating longevity risk into pension fund financial assessments.
method Employed actuarial learning with ML/AI techniques (regression trees, random forest, boosting, XGBoost, CatBoost, neural networks) on actuarial data.
result ML/AI algorithms outperform the Lee-Carter model in mortality forecasting for pension funds.

The purpose of this contribution is to point out connections between recent ideas about gerbes and gerbal actions (as higher categorical extension of representation theory) and old discussion in quantum field theory on commutator anomalies, gauge group extensions, and 3-cocycles. The unifying concept is the classical o…

2008-12-09abs ↗pdf ↗

Develops a novel ML smoothing method for incomplete data in state-space models.

problem Estimating states in stochastic systems with incomplete information.
method Introduces score function and conditional observed information matrices for incomplete data, and uses them to derive the ML smoother.
result The ML smoother provides more accurate state estimates with lower standard errors compared to the standard ML state estimator.

Recently, a framework for application-oriented optimal experiment design has been introduced. In this context, the distance of the estimated system from the true one is measured in terms of a particular end-performance metric. This treatment leads to superior unknown system estimates to classical experiment designs bas…

2015-07-26abs ↗pdf ↗

An intrinsic problem of classifiers based on machine learning (ML) methods is that their learning time grows as the size and complexity of the training dataset increases. For this reason, it is important to have efficient computational methods and algorithms that can be applied on large datasets, such that it is still …

2013-04-12abs ↗pdf ↗

Study on theoretical limits of 0\ell_0 sparse-regression algorithms using Fl RDT.

problem Understanding the performance limits of 0\ell_0 norm based optimization algorithms in compressed sensing and sparse regression.
method Utilized Fully lifted random duality theory (Fl RDT) to analyze the maximum-likelihood (ML) decoding performance.
result Uncovered phase-transition (PT) and descending 0\ell_0 (d0\ell_0) curves that separate successful and unsuccessful algorithm performance.