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

14.9%29.7%44.6%59.5% · Jun 202019922001200920172026
48 results for long-term learning

This paper balances short-term and long-term rewards in policy learning.

problem Balancing short-term and long-term rewards in policy learning.
method Formalizes a new framework to balance rewards, identifies rewards under mild assumptions, deduces efficiency bounds, and develops a policy learning approach.
result The proposed method improves the estimator of long-term reward and reduces regret.

PBO methods improve RNN performance in learning long-term dependencies.

problem Training RNNs to learn long-term dependencies is challenging.
method Population-based global optimisation (PBO) techniques, including evolution strategies and particle swarm optimisation.
result PBO methods lead to performance improvements in RNNs for volatility forecasting.

The paper targets optimal interventions for long-term outcomes using imputed data and policy learning.

problem Maximizing long-term outcomes observed only in the future.
method Imputing missing long-term outcomes and using a doubly-robust approach for policy evaluation and optimization.
result The approach outperforms simple short-term proxies and achieves significant revenue impact over three years.

This paper builds a model to predict the long-term future in reinforcement learning.

problem Catastrophic failures due to flawed long-term predictions in reinforcement learning models.
method The authors develop a latent-variable autoregressive model using variational inference to incorporate future information.
result The model achieves higher rewards faster than baselines on various tasks and environments.

Paper proposes a model-free algorithm for CMDPs with long-term constraints, achieving optimal regret bounds.

problem Optimizing systems with long-term constraints where transition probabilities are unknown.
method Combines concepts from constrained optimization and Q-learning to propose an algorithm.
result Achieves optimal regret bounds for reward and constraint violation.

PoDiRe learns long-term rewards in multi-task recommendations.

problem Long-term rewards in multiple recommendation tasks.
method Policy Distilled Reinforcement Learning (PoDiRe) combining deep reinforcement learning and knowledge distillation.
result PoDiRe outperforms state-of-the-art methods in real-world data.

FiLM improves deep learning for long-term time series forecasting.

problem Preserving historical information without overfitting noise.
method Applies Legendre Polynomials and Fourier projections, adds low-rank approximation.
result Significantly improves multivariate and univariate forecasting accuracy.

New algorithm optimizes long-term user satisfaction in recommendation systems.

problem Optimizing long-term user satisfaction in recommendation systems with delayed rewards.
method Developed a predictive model of delayed rewards and a bandit algorithm that balances exploration and exploitation.
result Our approach results in substantially better performance compared to short-term or delayed optimization.

This paper proposes a framework to predict long-term trends and short-term fluctuations in multivariate time series.

problem Existing prediction methods often ignore the distinction between long-term trends and short-term fluctuations.
method The paper introduces a MTS forecasting framework that uses both original time series and its first difference to capture long-term trends and short-term fluctuations.
result The proposed method improves forecasting performance by using more supervision information.

This work tackles slate-based recommender systems using RL, optimizing long-term user engagement.

problem Optimizing long-term user engagement in slate-based recommender systems.
method Developed SLATEQ, a decomposition of RL methods for slate-based recommendations, and outlined a practical methodology.
result SLATEQ decomposes long-term value of a slate into component item-wise long-term values under mild assumptions.

FPG uses fractional calculus for efficient reinforcement learning with long-term memory.

problem High variance and inefficient sampling in standard policy gradient methods for long-term temporal modeling.
method Fractional Policy Gradients (FPG) incorporating Caputo fractional derivatives for power-law temporal correlations.
result Achieves asymptotic variance reduction of order O(t^(-alpha)) and sample efficiency gains.

Industrial-scale podcast recommender system optimizes long-term listening journeys.

problem Optimizing long-term listening experiences in podcast recommendation systems.
method Reinforcement learning approach to optimize user listening journeys over months.
result Significantly improved long-term performance in A/B tests compared to short-term metrics.

New algorithm optimizes for long-term user satisfaction in delayed reward settings.

problem Optimizing for long-term user satisfaction in delayed reward settings.
method Developed a predictive model of delayed rewards and a bandit algorithm that combines rewards and surrogate outcomes.
result Our algorithm significantly outperforms methods that optimize for short-term proxies or rely solely on delayed rewards.

Combines CNN and Transformer for financial time series forecasting.

problem Forecasting financial time series, especially stock prices, is challenging due to short-term and long-term dependencies.
method Uses CNN for short-term dependencies and Transformer for long-term dependencies.
result Demonstrated superior performance in forecasting stock price changes compared to traditional methods.

LEMN improves memory networks for learning from streaming data.

problem Efficiently processing large data streams in memory-augmented neural networks.
method LEMN uses a RNN-based retention agent to learn and replace less important memory entries based on their importance and historical context.
result LEMN achieves significant improvements over existing methods in learning from streaming data.

New algorithm optimizes online network resource allocation with long-term constraints.

problem Optimal resource reservation in communication networks with job transfers and budget limits.
method Randomized exponentially weighted method for long-term constraints.
result Upper bound for regret and cumulative constraint violations established.

MPPN network improves long-term time series forecasting accuracy.

problem Inaccurate long-term time series forecasting due to noise and lack of interpretability.
method MPPN network constructs context-aware multi-resolution semantic units and employs multi-periodic pattern mining and channel adaptive module.
result MPPN significantly outperforms state-of-the-art methods on nine real-world benchmarks.

Estimates long-term effects from short-term experiments and observational data with unobserved confounders.

problem Estimating long-term causal effects from short-term experiments and long-term observational data with unobserved confounding.
method Combining regression residuals with short-term experimental outcomes to create an instrumental variable for estimating long-term causal effects.
result The estimator is unbiased and its variance is analytically studied.

Paper proposes a graph neural network for accurate long-term ILI prediction.

problem Limited long-term prediction performance and spatio-temporal dependency in existing models.
method Cross-location attention based graph neural network (Cola-GNN) for time series embeddings and location aware attentions.
result Proposed method shows strong predictive performance and interpretable results for long-term epidemic predictions.

New algorithms provide long-term memory guarantees for online learning.

problem Achieving long-term memory in online learning for experts and bandits.
method Reduction to typical switching regret, developing various algorithms with specific regret bounds.
result Developed algorithms with a new regret bound of O(T(SlnT+nlnK))\mathcal{O}(\sqrt{T(S\ln T + n \ln K)}).

Estimates long-term effects of new treatments using historical and short-term data.

problem Estimating long-term effects of novel treatments with limited historical data.
method Surrogate indices, dynamic treatment effect estimation, and double machine learning combined in a unified pipeline.
result Consistent and asymptotically normal estimates of long-term effects under Markovian assumption.

ANPyC combats forgetting by pruning and consolidating neural parameters.

problem Catastrophic forgetting in neural networks, especially with long-term tasks.
method Adversarial Neural Pruning and Synaptic Consolidation (ANPyC) to balance task-relevant and irrelevant parameters.
result ANPyC prevents forgetting while enabling efficient learning of multiple tasks.

The paper tackles calibrating long-term behaviors with multiple styles using programmatic style-consistency.

problem Generating long-term sequential behaviors with multiple styles simultaneously.
method Leverage programmatic labeling functions to specify controllable styles and derive style-consistency as a learning objective.
result Learned policies can be calibrated for up to 1024 distinct style combinations.

ZiMM model predicts long-term blurry relapses from non-clinical claims data.

problem Predicting long-term blurry relapses after medical acts.
method Introduces ZiMM (Zero-inflated Mixture of Multinomial distributions) and a deep-learning architecture (ZiMM Encoder-Decoder) to learn from sparse, irregular patterns in claims data.
result ZiMM ED improves predictions over various baselines, including non-deep learning and deep-learning approaches.

HRL improves open-domain dialog models by optimizing long-term conversational goals.

problem Challenges in open-domain dialog generation, including repetitive outputs, difficulty tracking conversational goals, and inappropriate text.
method Proposes VHRL, a hierarchical reinforcement learning approach using policy gradients to tune utterance-level embeddings of a variational sequence model.
result Significant improvements in human evaluation and automatic metrics over state-of-the-art dialog models.

Paper introduces a simpler gated RNN structure to better capture long-term dependencies.

problem Difficulty in learning long-term dependencies in RNNs.
method Proposes a grouped distributor unit (GDU) with partitioned hidden states and adaptive update rates.
result GDU outperforms LSTM and GRU on various tasks, including pathological and natural data.

We describe a new class of learning models called memory networks. Memory networks reason with inference components combined with a long-term memory component; they learn how to use these jointly. The long-term memory can be read and written to, with the goal of using it for prediction. We investigate these models in t…

2014-10-15abs ↗pdf ↗

Framework for deferring decisions to experts in sequential medical settings.

problem Myopic and non-adaptive decision-making by ML models in sequential medical contexts.
method Sequential Learning-to-Defer (SLTD) framework using model-based reinforcement learning.
result Adaptive deferral policy improves trade-off between long-term outcomes and deferral frequency.

Model combines long-term and short-term memory using conceptors.

problem Transfer between long-term and short-term memory.
method Recurrent neural network with gated reservoir for short-term memory and conceptors for long-term memory.
result Standard operations on conceptors allow combining long-term memories and describing their effect on short-term memory.

TimeBridge addresses non-stationarity in long-term time series forecasting.

problem Non-stationarity in multivariate time series leads to spurious regressions and obscures long-term relationships.
method TimeBridge segments series into patches, applying Integrated Attention for short-term non-stationarity and Cointegrated Attention for long-term cointegration.
result TimeBridge achieves state-of-the-art performance in both short-term and long-term forecasting.

A novel online GP model captures long-term memory in sequential data.

problem Capturing long-term memory in sequential data online.
method Integrates HiPPO framework into interdomain GP, leveraging time-varying orthogonal projections as inducing variables.
result OHSVGP outperforms existing online GP methods in predictive performance, long-term memory preservation, and computational efficiency.

Study investigates deep learning for scalable long-term traffic predictions in large transport networks.

problem Scalable long-term traffic predictions in large transport networks.
method Investigated deep learning models for link-based predictions, including clustering and graph convolutional approaches.
result Deep learning models can be useful for long-term large-scale traffic prediction, but simpler predictors are satisfactory for short-term forecasting.

Framework improves resilience in operations through joint long-term and short-term decision-making.

problem Resilient operations in global markets require adaptive decision rules.
method Developed a two-timescale hierarchical reinforcement learning framework.
result Framework increases mean profit by 9.2% under joint demand-supply shocks and 11.8% under prolonged shocks.

ESNs with transfer learning predict long-term chaotic patterns in spatiotemporal dynamical systems.

problem Predicting long-term statistical patterns of spatiotemporally chaotic dynamical systems.
method Echo state networks (ESNs) with transfer learning.
result ESNs with transfer learning accurately predict long-term statistical properties of spatiotemporally chaotic PDEs.