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

3517021,0521,403 · Jun 202019922001200920172026
48 results for Mamba models

SOR-Mamba improves Mamba for robust time series forecasting by minimizing channel order bias.

problem Robust time series forecasting with Mamba's sequential order bias.
method SOR-Mamba incorporates regularization to minimize channel order discrepancy and introduces CCM for channel correlation preservation.
result SOR-Mamba enhances robustness to channel order and improves forecasting accuracy.

Mamba efficiently learns low-dimensional targets in-context via feature extraction.

problem Learning low-dimensional targets in context for computational efficiency.
method Test-time feature learning of a single-index model using Mamba's pretrained linear-time sequence model.
result Mamba achieves efficient in-context learning of low-dimensional targets via feature extraction.

SAMBA predicts stock returns efficiently using Mamba and graph neural networks.

problem Accurate stock price predictions for financial returns.
method SAMBA integrates Mamba architecture with graph neural networks to achieve near-linear computational complexity.
result SAMBA significantly outperforms state-of-the-art models in prediction accuracy.

State-space models improve dynamical system predictions efficiently and accurately.

problem Challenges in predicting dynamical systems, including long-time integration and long-range dependencies.
method State-space models implemented in Mamba, addressing limitations of existing architectures.
result Mamba outperforms other models in interpolation and challenging extrapolation tasks.

Study compares LSTM, Transformer, and Mamba for bladder cancer recurrence analysis.

problem Complex time-dependent data in bladder cancer recurrence analysis.
method Evaluation of LSTM, Transformer, and Mamba models using Cox proportional hazards model.
result LSTM-Cox model outperforms Transformer-Cox and Mamba-Cox models in prediction accuracy.

A new method predicts non-Markovian closure terms for complex systems.

problem Predicting the effect of unresolved variables on resolved dynamics in high-dimensional systems.
method Mamba-Assisted Closure (MAC) framework: sequence model trained to predict closure from resolved trajectory, coupled with reduced-order equations.
result Substantially outperforms existing methods in predictive accuracy and long-time stability.

KalMamba improves RL efficiency with probabilistic SSMs.

problem Efficiency in learning and inference for probabilistic SSMs in RL.
method Combines Mamba's scalability with Kalman filtering for efficient probabilistic SSMs.
result KalMamba outperforms state-of-the-art SSMs in RL, especially on longer sequences.

Mamba outperforms Reformer in minute-level stock prediction using LLM sentiment scores.

problem Improving minute-level stock market prediction accuracy in volatile markets.
method Combining sentiment scores from top LLMs with stock price data, training Mamba and Reformer models.
result Mamba achieved lower error rates across all tested LLMs, especially with LLaMA 3.3--70B.

Framework predicts Navier-Stokes solutions on 2D domains using graph neural networks.

problem Predicting stationary Navier-Stokes solutions in non-parametrized 2D geometries.
method Graph-based multi-fidelity learning framework combining reduced-order models, Transformers, and Mamba architectures.
result Mamba architecture reduces computational cost while maintaining performance.

MAMBA learns policies competitive with multiple conflicting oracles.

problem Learning policies from multiple conflicting oracles in reinforcement learning.
method MAMBA uses a gradient estimator in the style of GAE to optimize policies, leveraging demonstrations from multiple weak oracles.
result MAMBA outperforms the state-of-the-art in learning policies competitive with multiple conflicting oracles.

Swift Hydra uses RL and generative AI to improve anomaly detection.

problem Generalization to unseen anomalies in critical systems.
method Generative AI and reinforcement learning (RL) for synthesizing diverse anomaly samples.
result Swift Hydra outperforms state-of-the-art models on ADBench benchmark.

Transformer-based multi-scale model outperforms traditional methods in solving PDEs on irregular domains.

problem Solving partial differential equations on irregular domains using deep learning.
method Introduces Multi-Scale Attention Transformer (\msat{}) for solving PDEs.
result Achieves state-of-the-art generalization on complex geometry problems with significant speedup.

FCOC framework improves financial volatility forecasting.

problem Tackles dual challenges of feature fidelity and model responsiveness in financial volatility forecasting.
method Synergizes fractal feature extraction and dynamic chaotic oscillation processing.
result Demonstrates profound and generalizable impact on S\&P 500 and DJI datasets.

A new framework for efficient sequence maps using Bayesian filtering and covariance.

problem Designing efficient recurrent sequence maps from explicit memory assumptions.
method Design-model framework, exact Bayesian filtering, query-dependent readout, linear-Gaussian instantiation.
result Improved robustness and retrieval performance across various benchmarks.

This study improves state estimation for nonlinear systems using conditional normalizing flows.

problem Performance degradation of traditional filtering algorithms in nonlinear systems with non-Gaussian uncertainty.
method Uses conditional normalizing flows with MLP, transformer, or state-space models for state and parameter estimation.
result Optimal-transport-inspired kinetic loss mitigates overparameterization in flows.

Introduces alternators for modeling sequences, outperforming baselines.

problem Modeling complex sequential data with stability and efficiency.
method Two neural networks (OTN and FTN) alternate between outputting samples in observation and feature spaces, learned via cross-entropy criterion.
result Alternators outperform strong baselines in various domains (Lorenz equations, Neuroscience, Climate Science).

CogScale benchmarks AI architectures for sequential processing.

problem Evaluating AI architectures' ability to process sequential information efficiently.
method 14 scalable synthetic tasks designed to isolate cognitive and memory abilities at different scales.
result Attention mechanisms and modern state-space models consistently maintain high performance as task difficulty scales.

New model preserves symmetry in multivariate time series, improving performance.

problem Implicit ordering in MTS models violates inherent exchangeability.
method Permutation-equivariant 2D state space model with canonical architecture.
result Eliminates sequential dependency chains and simplifies stability analysis.

Proposes a new neural network architecture inspired by biology to improve learning and information flow.

problem Improving artificial neural networks to match biological neuron properties like multidirectional propagation and probabilistic modeling.
method Extends KAN approach with joint distribution neurons that can propagate values and distributions, including variance and higher-order moments.
result Proposed architecture can predict and propagate distributions, including expected values and variances.

pLSTM tackles long-range language modeling and computer vision tasks with parallelizable linear source transition mark networks.

problem Challenges of existing recurrent architectures in handling sequences and multi-dimensional data.
method Introduces pLSTM, a parallelizable linear source transition mark network for linear graphs and DAGs, addressing vanishing/exploding activation/gradient issues.
result pLSTM outperforms Transformers in long-range tasks like arrow-pointing extrapolation and image size extrapolation.

The α\alpha-Alternator adapts to varying noise levels in sequences, improving robustness and performance.

problem Current models assume uniform noise levels, limiting performance on noisy temporal data.
method Introduces α\alpha-Alternator using Vendi Score to dynamically adjust noise sensitivity.
result Outperforms Alternators and state-of-the-art models in trajectory prediction, imputation, and forecasting.

The paper introduces BCART models for aggregate claim amount, improving frequency-severity and joint modeling.

problem Modeling aggregate claim amount with frequency-severity and joint dependencies.
method Developed three types of BCART models: frequency-severity, sequential, and joint models. Used various distributions for claim severity data.
result Weibull distribution outperforms gamma and lognormal for right-skewed, heavy-tailed claim severity data.

The paper uses model-based trees to create interpretable surrogate models for complex machine learning models.

problem Interpreting complex machine learning models.
method Using model-based trees to partition feature space and create interpretable models.
result Model-based trees generate optimal surrogate models that balance interpretability and performance.

The study examines how model predictions hold up under model extensions.

problem Model predictions may not be robust under model extensions, limiting their applicability.
method The study uses causal ordering to assess robustness of qualitative model predictions and characterizes model extensions that preserve predictions.
result Conditions and techniques are provided to assess robustness of model predictions under model extensions.

Revises Bayesian model averaging for foundation models.

problem Ensemble pre-trained and lightly-finetuned foundation models for improved classification performance.
method Introduces trainable linear classifiers and computationally cheaper model averaging scheme (OMA).
result Ensembled models can better predict on various datasets.

Paper introduces symmetric divergence link models for probability distributions.

problem Symmetric divergence measures for probability distributions.
method Two general classes of link models: one for survival functions and another for cumulative probability distribution functions.
result Advantages of symmetric divergence measures over asymmetric measures for model averaging and feature assessment.

Researchers review challenges in interpreting additive models, especially neural additive models.

problem Challenges in interpreting additive models, particularly neural additive models.
method Review of generalized additive models and discussion of nonidentifiability.
result Challenges in claiming interpretability or suitability for safety-critical applications of additive models.

Sigma models linked to Gross-Neveu models via quiver varieties.

problem Understanding the relationship between sigma models and Gross-Neveu models.
method Exploring the mathematical correspondence between sigma models and Gross-Neveu models, including their geometric and trigonometric/elliptic deformations.
result Sigma models are mathematically equivalent to Gross-Neveu models under certain conditions.

Simple models are preferred over complex models, but over-simplistic models could lead to erroneous interpretations. The classical approach is to start with a simple model, whose shortcomings are assessed in residual-based model diagnostics. Eventually, one increases the complexity of this initial overly simple model a…

2017-06-26abs ↗pdf ↗