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

24477194 · Jun 202019922001200920172026
48 results for user fatigue

A new model considers fatigue in online content recommendation systems.

problem Fatigue in users due to overexposure and boredom from similar recommendations.
method Proposed a fatigue-aware Dependent Click Model (DCM) and two learning algorithms.
result Developed algorithms with regret bounds for learning content relevance and fatigue effects.

In this paper we consider an online recommendation setting, where a platform recommends a sequence of items to its users at every time period. The users respond by selecting one of the items recommended or abandon the platform due to fatigue from seeing less useful items. Assuming a parametric stochastic model of user …

2019-01-23abs ↗pdf ↗

This study proposes an exercise fatigue detection model based on real-time clinical data which includes time domain analysis, frequency domain analysis, detrended fluctuation analysis, approximate entropy, and sample entropy. Furthermore, this study proposed a feature extraction method which is combined with an analyti…

2018-03-07abs ↗pdf ↗

Self-supervised learning improves RUL prediction with limited data in fatigue damage prognosis.

problem Limited labelled data for RUL prediction in fatigue damage prognosis.
method Pre-training deep learning models on unlabelled sensor data using self-supervised learning.
result Self-supervised pre-trained models significantly outperform non-pre-trained models in RUL prediction with scarce labelled data.

In online display advertising, selecting the most effective ad creative (ad image) for each impression is a crucial task for DSPs (Demand-Side Platforms) to fulfill their goals (click-through rate, number of conversions, revenue, and brand improvement). As widely recognized in the marketing literature, the effect of ad…

2019-08-21abs ↗pdf ↗

This research develops efficient surrogate models for predicting crack growth in metal structures.

problem Accurately predicting crack growth in metal structures under uncertainty.
method Employing Gaussian Process (GP) regression models for latent variable modeling to create probabilistic surrogate models.
result Surrogate models successfully encode material and load-related uncertainties in stochastic crack growth processes.

This paper improves Gaussian process predictions by integrating prior knowledge.

problem Gaussian processes lack predictive power when prior information is ignored.
method Derive mean and covariance functions from previous data using weighted sums of basis functions.
result Integrating prior knowledge significantly increases look-ahead time and accuracy.

Improved aircraft structure prediction using derivative-enhanced sparse Cholesky GP method.

problem Accurate real-time prediction of aircraft structure performance.
method Combining derivative data with a modified dynamic sparse Cholesky linear system solver.
result Improved prediction accuracy of aircraft structure performance.

The goal of this thesis is to investigate the potential of predictive modelling for football injuries. This work was conducted in close collaboration with Tottenham Hotspurs FC (THFC), the PGA European tour and the participation of Wolverhampton Wanderers (WW). Three investigations were conducted: 1. Predicting the rec…

2016-09-20abs ↗pdf ↗

Method screens similar capsule endoscopic images, reducing doctor workload and improving accuracy.

problem Time-consuming and high error rate in manual inspection of large numbers of similar capsule endoscopic images.
method Structural similarity analysis of visually salient areas and hierarchical clustering.
result 76% reduction in similar images, 100% lesion recall, 18-minute average play time.

Proposes a new MOBO framework for better estimation of uncertain parameters in expensive black-box functions.

problem Estimating the unknown utopia in multi-objective optimization problems with expensive black-box functions.
method Nested weighted Tchebycheff Multi-objective Bayesian Optimization (WTB-MOBO) with ensemble model selection.
result Improves MOBO performance by selecting the best model from an ensemble of predictive models.

Model trains passing events on a bridge using multilevel Gaussian process.

problem Represent aggregate train-passing events from a bridge monitoring system.
method Formulate a combined model with low-rank approximation hierarchical Gaussian process, incorporating domain expertise as constraints.
result Allow for simulation of previously unobserved train types.

In many instances, information on engineering systems can be obtained through measurements, monitoring or direct observations of system performances and can be used to update the system reliability estimate. In structural reliability analysis, such information is expressed either by inequalities (e.g. for the observati…

2012-03-24abs ↗pdf ↗

The paper develops a reinforcement learning model to estimate ad impact considering delayed and cumulative effects.

problem Accurately estimating ad impact considering delayed and long-term effects, cumulative impacts, and customer heterogeneity.
method Modeling ad bidding as a Contextual Markov Decision Process (CMDP) with delayed Poisson rewards, proposing a two-stage maximum likelihood estimator and reinforcement learning algorithm.
result Achieves a near-optimal regret bound of O~(dH2T)\tilde{O}{(dH^2\sqrt{T})}, validating the approach through simulation experiments.

GUIDE-VAE generates user-guided data with improved realism and performance.

problem Generating data points for multi-user datasets while considering user information.
method Conditional generative model that integrates user embeddings and a pattern dictionary-based covariance composition.
result GUIDE-VAE outperforms conventional VAEs in multi-user settings, especially under data imbalance.

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.

CnGAN generates synthetic user preferences for non-overlapped users in cross-network recommender systems.

problem Cross-network recommender solutions ignore non-overlapped users, limiting their applicability.
method Multi-task learning, encoder-GAN architecture, user-based pairwise loss function.
result Generated user preferences improve recommendations for non-overlapped users, achieving superior performance.

New method detects and measures malicious users in recommendation algorithms.

problem Identifying and quantifying malicious user activity in recommendation systems.
method Probabilistic programming for a disentangled model of malicious and regular user behavior.
result Simulation-based measure for quantifying malicious user effects.

Traditional collaborative filtering (CF) based recommender systems tend to perform poorly when the user-item interactions/ratings are highly scarce. To address this, we propose a learning framework that improves collaborative filtering with a synthetic feedback loop (CF-SFL) to simulate the user feedback. The proposed …

2019-10-21abs ↗pdf ↗

A multi-user multi-armed bandit (MAB) framework is used to develop algorithms for uncoordinated spectrum access. The number of users is assumed to be unknown to each user. A stochastic setting is first considered, where the rewards on a channel are the same for each user. In contrast to prior work, it is assumed that t…

2018-07-02abs ↗pdf ↗

The paper tackles robust policy learning in multitask contextual bandits with adversarial users.

problem Learning optimal policies in multitask contextual bandits with a small fraction of adversarial users.
method Developed efficient robust mean estimators for both uni-variate and high-dimensional random variables.
result Lower bound of ildeΩ(min(S,A)α2/ε2) ildeΩ(\min(S,A) \cdot α^2 / ε^2) per-user interactions to learn an εε-optimal policy for good users.

Improved neural model for social recommendation by integrating social and interest networks.

problem Data sparsity and lack of higher-order relationships in social recommendation.
method DiffNet++ models neural influence diffusion and interest diffusion in a unified framework using a multi-level attention network.
result Extensive experiments on real-world datasets show the effectiveness of DiffNet++.

In recommender systems, the user-item interaction data is usually sparse and not sufficient for learning comprehensive user/item representations for recommendation. To address this problem, we propose a novel dual-bridging recommendation model (DBRec). DBRec performs latent user/item group discovery simultaneously with…

2019-09-27abs ↗pdf ↗

Study personalizes user experience to maximize rewards with patience budget.

problem Maximizing rewards for a platform while respecting user patience.
method Proposes bandit algorithms for sequential choice with feedback models.
result Upper and lower bounds on regret of order O(N2/3)O(N^{2/3}) and Ω(N2/3)Ω(N^{2/3}).

Estimates population mean from user-level data with privacy, accounting for heterogeneity.

problem Heterogeneous user data with varying numbers of data points and distributions.
method Simple model of heterogeneous user data, differential privacy mechanism for estimation.
result Asymptotic optimality of the proposed estimator and general lower bounds on error.

The evolution of social media users' behavior over time complicates user-level comparison tasks such as verification, classification, clustering, and ranking. As a result, naïve approaches may fail to generalize to new users or even to future observations of previously known users. In this paper, we propose a novel pro…

2019-10-11abs ↗pdf ↗

Model user preferences for conversational LLMs using weak rewards.

problem Lack of persistent user models in conversational LLMs leading to repeated user restatements.
method Vector-Adapted Retrieval Scoring (VARS) framework that updates user vectors online from weak scalar rewards.
result Full VARS agent achieves strongest overall performance, matches strong Reflection baseline in task success, and reduces user effort.

Bayesian optimization agent learns user preferences from pairwise comparisons.

problem Learning user preferences from unknown and infinite choices.
method Sequential Bayesian optimization with pairwise comparisons.
result Optimal agent strategy minimizes remaining system uncertainty.

MRIF models dynamic user interests at multiple temporal-ranges.

problem Capturing dynamic and multi-resolution user interests in recommendation.
method Multi-resolution Interest Fusion (MRIF) model that considers both temporal-ranges and drifts in user interests.
result MRIF outperforms state-of-the-art recommendation methods consistently.

Rating platforms enable large-scale collection of user opinion about items (products, other users, etc.). However, many untrustworthy users give fraudulent ratings for excessive monetary gains. In the paper, we present FairJudge, a system to identify such fraudulent users. We propose three metrics: (i) the fairness of …

2017-03-30abs ↗pdf ↗

Estimates users' preference for a site over others using engagement data.

problem Lack of data on users' interactions with other sites makes it hard to estimate preferences for a focal site.
method Uses Hierarchical Bayes Method with two estimation techniques: Markov Chain Monte Carlo and Stochastic Gradient with Langevin Dynamics.
result Good support found for the approach to computing personalized share of engagement.