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

4590134179 · Jun 202019922001200920182026
48 results for Sequential Enhancement

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.

WaveCRN improves E2E speech enhancement with efficient CNN and SRU.

problem Efficiently modeling speech locality and sequential properties for E2E speech enhancement.
method WaveCRN uses a CNN for speech locality and SRU for temporal sequential modeling, with RFM for noise suppression.
result WaveCRN outperforms state-of-the-art approaches with reduced complexity and inference time.

Framework predicts melt pool geometry with AI, improving manufacturing quality.

problem Achieving consistent product quality in Metal Additive Manufacturing.
method Surprise-guided sequential learning framework integrating CTGAN for limited data.
result Enhanced predictive accuracy for melt pool dimensions.

Improved speech separation and enhancement using neural beamforming.

problem Challenging speech separation and enhancement in reverberant environments.
method Sequential neural beamforming combining spectral and spatial separation methods.
result Average improvement of 2.75 dB in scale-invariant signal-to-noise ratio and 14.2% absolute reduction in speech recognition metric.

The paper addresses estimating long-term treatment effects with monotone missing data.

problem Estimating long-term treatment effects with missing data, especially monotone missing.
method The paper introduces the sequential missingness assumption for identification and proposes three novel estimation methods: inverse probability weighting, sequential regression imputation, and SeqMSM. It also introduces a balancing-enhanced approach, BalanceNet, to improve estimation accuracy.
result The proposed methods, including BalanceNet, effectively estimate long-term treatment effects with monotone missing data.

Proposes a method to integrate learner models robustly against misspecifications.

problem Misspecifications in learner models and parameter sharing patterns degrade prediction accuracy.
method Sequentially incorporates additional learners based on user-specified parameter sharing patterns.
result Data-adaptively selects the most suitable way of parameter sharing to enhance predictive performance.

Develops methods for finding counterfactual explanations in sequential decision making.

problem Finding counterfactual explanations for sequential decision making processes.
method Formal characterization of sequential actions and states using Markov decision processes and Gumbel-Max structural causal model. Introduces a polynomial time algorithm based on dynamic programming.
result Algorithm finds optimal counterfactual explanations for sequential decision making.

CoT improves transformer sample efficiency by reducing input token dependencies and attention sparsity.

problem Transformer sample inefficiency in simple tasks.
method Demonstrated through parity-learning setup, showing CoT reduces required samples from exponential to polynomial.
result Transformer learns function within polynomial samples with CoT, requiring exponential samples without CoT.

Persistent sampling improves SMC efficiency by retaining and reusing particles.

problem High computational costs and particle impoverishment in SMC.
method Persistent sampling (PS) retains and reuses particles from all prior iterations, using multiple importance sampling and resampling from a mixture of historical distributions.
result PS achieves more accurate posterior approximations and lower variance in marginal likelihood estimates without additional likelihood evaluations.

This research proposes a CL model for RNNs to handle sequential data without forgetting.

problem Learning in dynamic environments without forgetting previous knowledge for sequential data.
method A Recurrent Neural Network (RNN) model with Elastic Weight Consolidation (EWC) for CL.
result The proposed model outperforms EWC and RNNs on CL benchmarks for sequential data.

System detects financial misinformation and generates clear explanations.

problem Identifying and explaining fraudulent financial content.
method Combined large language models, pre-processing, and sequential learning.
result Achieved F1-score of 0.8283 for classification and ROUGE-1 of 0.7253 for explanations.

Paper develops a framework for learning interpretable representations of sequential decision behavior.

problem Obtaining a transparent description of existing behavior.
method Inverse decision modeling framework, formalizing both forward and inverse problems.
result Learning interpretable representations of behavior, including suboptimal actions, biased beliefs, and imperfect knowledge.

STanHop predicts multivariate time series with memory-enhanced capabilities.

problem Predicting multivariate time series with memory-enhanced capabilities.
method Sparse Tandem Hopfield Network (STanHop) with two external memory modules.
result STanHop outperforms dense Hopfield models in memory retrieval error.

We address challenges in collaborative black-box optimization through three frameworks.

problem Challenges in distributed experimentation, heterogeneity, and privacy in black-box optimization.
method Three unifying frameworks: global, local, and predictive.
result Shift from descriptive/predictive to prescriptive federated learning in black-box optimization.

This paper explores how interactive protocols enhance local differential privacy.

problem The power of interactive protocols in local differential privacy.
method Classification of locally private protocols by compositionality and transformation of fully interactive protocols into sequentially interactive ones.
result Fully interactive protocols can solve problems that sequentially interactive protocols cannot without a significant increase in sample complexity.

Proposes a method to accelerate safe sequential learning using offline data.

problem Limited exploration due to disconnected safe regions and slow task learning.
method Safe transfer sequential learning using Gaussian processes and offline data.
result Enhances global exploration across multiple disjoint safe regions with lower data consumption.

A new method uses CPD to efficiently model feature interactions in non-sequential data.

problem Efficiently modeling feature interactions in non-sequential data with high computational and memory costs.
method Implicitly represent model parameters as a tensor, factorize into a compact Tensor Train (TT) format, and use Canonical Polyadic (CP) Decomposition for invariance to feature ordering.
result The proposed CP-based predictor outperforms other TN-based predictors on sparse data and matches neural network performance on dense non-sequential tasks.

The paper proposes a fair reinforcement learning framework to prevent healthcare disparities.

problem Unfair reinforcement learning policies in healthcare can lead to socioeconomically-disadvantaged subgroups being underprivileged.
method The paper introduces a counterfactual fairness framework and a sequential data preprocessing algorithm to achieve fair sequential decision making.
result The proposed approach greatly enhances fair access to counseling in a digital health dataset designed to reduce opioid misuse.

Enhances SMC² with Hessian info for more efficient posterior approximation.

problem Improving accuracy and efficiency in Bayesian inference.
method Integrates second-order information (Hessian) into SMC²'s proposal distribution.
result Second-order proposals lead to more accurate posterior approximations and better step-size selection.

New method improves ABI for sequential data, reducing forgetting and improving accuracy.

problem Performance degradation of ABI under model misspecification and distribution shifts.
method Decouples simulation-based pre-training from unsupervised SC fine-tuning, using memory buffer and elastic weight consolidation.
result Significant mitigation of forgetting and improved posterior estimates compared to standard simulation-based training.

A novel CAB-XDE framework predicts speculative stock prices with high accuracy.

problem Forecasting speculative stock prices in volatile markets.
method Customized attention BiLSTM with XGBoost, integrating attention mechanism and weight determination theory-error reciprocal method.
result Empirically validated with MAPE of 0.0037, MAE of 84.40, and RMSE of 106.14.

Enhances multi-project scheduling with multiple priority rules.

problem Resource allocation in multi-project scheduling with limited time and resources.
method Simulation-based approach using composite priority rules.
result Increased probability of finding schedules with shortest duration.

Survey categorizes methods for learning state representations in reinforcement learning.

problem Addressing challenges in complex observation spaces for sequential decision making.
method Categorizes six main classes of methods for learning state representations.
result Enhances understanding of state representation learning in reinforcement learning.

Improved SVAE models enhance sequential data prediction.

problem Challenges in implementing and using structured variational autoencoders.
method Modern machine learning tools, hardware acceleration, parallelization, automatic differentiation, exploiting structure in the prior.
result SVAEs outperform general alternatives in accuracy and efficiency.

DeepICMGP surrogate models multiple outputs efficiently.

problem Challenges in modeling dependencies between multiple outputs using traditional multi-output GPs.
method Introduces hierarchical coregionalization structures across layers in DGPs.
result Demonstrates competitive performance and active learning strategies.

We present a novel view that unifies two frameworks that aim to solve sequential prediction problems: learning to search (L2S) and recurrent neural networks (RNN). We point out equivalences between elements of the two frameworks. By complementing what is missing from one framework comparing to the other, we introduce a…

2016-07-18abs ↗pdf ↗

HCFContext predicts mobile context using collaborative filtering and homomorphic encryption.

problem Accurate mobile context determination for enterprise policies.
method Proposes HPContext and HCFContext models using sequential history and collaborative filtering, with privacy-preserving homomorphic encryption.
result HCFContext enhances context prediction by leveraging related users' observations.

The paper proposes a method to test features selected by SeqFS-DA with controlled FPR.

problem Ensuring reliability of feature selection after domain adaptation in high-dimensional regression.
method Proposes a novel method to test features selected by SeqFS-DA with controlled FPR.
result The proposed method controls FPR below a significance level αα (e.g., 0.05) and enhances statistical power.

Enhanced Momentum Transformer outperforms traditional trading strategies.

problem Improving trading performance in equities with evolving market conditions.
method Building a Momentum Transformer using an attention mechanism combined with LSTM, capturing long-term dependencies and transaction costs.
result Average returns of 4.14% and Sharpe ratio of 1.12, similar to original results but with higher volatility.