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

Trend · papers per month

10213141 · Jun 202019922001200920172026
48 results for long-term satisfaction

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.

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.

In this paper, we study reinforcement learning (RL) algorithms to solve real-world decision problems with the objective of maximizing the long-term reward as well as satisfying cumulative constraints. We propose a novel first-order policy optimization method, Interior-point Policy Optimization (IPO), which augments the…

2019-10-21abs ↗pdf ↗

Study on electronic banking satisfaction in Nigeria.

problem Limited research on factors enhancing end users' satisfaction in electronic banking.
method Empirical analysis of factors influencing electronic banking user satisfaction.
result Factors influencing electronic banking user satisfaction and their relationship with satisfaction.

Hybrid approach combines user feedback and machine learning for predicting user satisfaction.

problem Measuring user satisfaction in large-scale conversational agent systems.
method Fusion of explicit user feedback and predictions from two machine-learned models trained on different data types.
result Hybrid approach significantly improves user satisfaction predictions.

Study shows non-systematic bias in customer satisfaction surveys limits data value.

problem Non-systematic bias in customer satisfaction surveys limits data value.
method Used real customer satisfaction survey data of a large retail bank to show the irreducible error and suggest thoughtful survey design methods.
result A thoughtful survey design can reduce non-systematic error in customer satisfaction surveys.

Enhanced neural network framework improves constraint satisfaction with topological conditioning.

problem Maintaining semantic coherence while satisfying physical and logical constraints in neuro-symbolic reasoning.
method Integrates topological conditioning with gradient stabilization mechanisms using Forman-Ricci curvature, Deep Delta Learning, and Covariance Matrix Adaptation Evolution Strategy.
result Achieves mean energy reduction to 1.15 compared to baseline values of 11.68, with 95 percent success rate.

A new online learning problem, CAB, tackles matching platforms to maximize user satisfaction.

problem Maximizing matches in a matching platform can lead to dissatisfaction and churn.
method Developed CAB, an online learning problem that maximizes arm satisfaction, and analyzed algorithms like UCB and Thompson sampling.
result CAB-UCB achieves higher cumulative satisfaction than baselines in experiments.

Researchers study how teachers' advising relationships influence their perceptions of satisfaction and students, not policy influence.

problem Understanding the relationship between teachers' advising relationships and their perceptions of satisfaction and students.
method Proposed a novel joint model of network and item responses (JNIRM) with correlated latent variables.
result Teachers' advising relationships contribute more to satisfaction and students than to influence over educational policies.

Paper presents a reinforcement learning framework for personalized music playlist generation.

problem Misalignment between offline model objectives and online user satisfaction metrics in conventional playlist recommendation methods.
method Simulation-based reinforcement learning approach using a Deep Q-Network (DQN) modified to address large state and action spaces.
result The modified DQN (AH-DQN) policy leads to better user-satisfaction metrics compared to baseline methods during online A/B tests.

GACEM optimizes complex multi-modal problems using neural networks.

problem Black-box optimization and constraint satisfaction in multi-modal environments.
method Modified Cross-Entropy Method with masked auto-regressive neural network.
result GACEM outperforms traditional CEM in diverse solutions, mode discovery, and sample efficiency.

This paper proposes a method to safely adjust exploration in RL to satisfy constraints.

problem Unsafe exploration in reinforcement learning violates constraints on controlled object states.
method Automatic adjustment of exploration inputs and variance-covariance matrix for safety.
result The method guarantees satisfaction of joint chance constraints with specified probability.

The paper shows regularization can't always find all optimal solutions in constrained ML.

problem Finding the right balance between model accuracy and constraint satisfaction.
method Formal demonstration of the limitations of regularization-based approaches in non-convex cases.
result There are optimal solutions for constrained problems that do not correspond to any multiplier value.

Improves generative models by optimizing rewards and sample editing.

problem Efficiently generating high-reward samples with structural constraints.
method Introduces MDM-VGB, a discrete diffusion sampler that augments unmasking generation with reward-guided remasking.
result MDM-VGB achieves quadratic complexity and robustness to noise, outperforming heuristics like best-of-NN.

TIP-Search optimizes market prediction accuracy and timeliness under uncertain load.

problem Real-time market prediction requires accurate predictions before a deadline.
method Filters feasible models, dispatches workers, trades accuracy for deadline risk.
result Optimized pool achieves 0.991 timely accuracy and 0.994 raw accuracy.

In the last few years the systematic adoption of deep learning to visual generation has produced impressive results that, amongst others, definitely benefit from the massive exploration of convolutional architectures. In this paper, we propose a general approach to visual generation that combines learning capabilities …

2018-07-16abs ↗pdf ↗

Scalable model checking for stochastic systems using Gaussian Processes and Bayesian Neural Networks.

problem Efficiently verifying properties of stochastic systems with high-dimensional parameter spaces.
method Stochastic Variational Smoothed Model Checking (SV-smMC) using Gaussian Processes and Bayesian Neural Networks.
result SV-smMC scales to larger datasets and enables application to high-dimensional parameter spaces.

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.

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.

This paper uses Bayesian models to analyze CTA returns across short and long-term trends.

problem The relative merits and interactions of short- and long-term trend systems in CTA replication remain controversial.
method Dynamic decomposition of CTA returns into short-term trend, long-term trend, and market beta factors using a Bayesian graphical model.
result The blend of horizons shapes the strategy's risk-adjusted performance.