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

326597129 · Jun 202019922001200920172026
48 results for user emotional preference

Paper proposes TPathMine model for more accurate user attribute prediction.

problem Predicting user attributes from click data in heterogeneous networks.
method HetPathMine model with meta-path weights optimized for user emotional preferences.
result TPathMine model achieves higher accuracy in user attribute prediction.

Study shows LLM-advisors match human performance in eliciting preferences but struggle with conflicting needs and trust.

problem How do LLM-advisors perform in complex financial domains where domain expertise is crucial?
method Lab-based user study with 64 participants, focusing on three challenges: preference elicitation, personalized guidance, and relationship building.
result LLM-advisors can match human performance in preference elicitation but struggle with conflicting needs and trust issues.

Voice-enabled interactions provide more human-like experiences in many popular IoT systems. Cloud-based speech analysis services extract useful information from voice input using speech recognition techniques. The voice signal is a rich resource that discloses several possible states of a speaker, such as emotional sta…

2019-08-09abs ↗pdf ↗

The study predicts how discussions in mental disorder Reddit communities affect users' emotional states.

problem Improving mental health conditions through social support analysis.
method Text embedding techniques and RNNs for predicting emotional tone shifts.
result Users' emotional states can improve due to social support, as evidenced by positive comments following negative posts.

Paper proposes a framework to protect user anonymity in emotion recognition.

problem Preserving user anonymity in face-based emotion recognition systems.
method Adversarial learning framework using CNN architecture.
result The proposed approach minimizes identity-specific information and maximizes emotion-dependent information.

This article provides the first survey of computational models of emotion in reinforcement learning (RL) agents. The survey focuses on agent/robot emotions, and mostly ignores human user emotions. Emotions are recognized as functional in decision-making by influencing motivation and action selection. Therefore, computa…

2017-05-15abs ↗pdf ↗

We propose a novel approach to multimodal sentiment analysis using deep neural networks combining visual analysis and natural language processing. Our goal is different than the standard sentiment analysis goal of predicting whether a sentence expresses positive or negative sentiment; instead, we aim to infer the laten…

2018-05-25abs ↗pdf ↗

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.

The growing ubiquity of Social Media data offers an attractive perspective for improving the quality of machine learning-based models in several fields, ranging from Computer Vision to Natural Language Processing. In this paper we focus on Facebook posts paired with reactions of multiple users, and we investigate their…

2019-09-24abs ↗pdf ↗

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 study shows personalized content recommendations can lead to polarization of user preferences.

problem Personalized content recommendations can alter user preferences, leading to polarization.
method Used a model of preference dynamics to explore how personalized content affects user preferences.
result Standard reward maximization algorithms achieve only constant regret in personalized recommendation environments.

New method adapts to user preferences dynamically, improving recommendation models.

problem Current recommendation models lack dynamic adaptation to changing user preferences.
method Preference Discerning with LLM-Enhanced Generative Retrieval
result Mender achieves state-of-the-art performance in adapting to evolving user preferences.

Robot motions in the presence of humans should not only be feasible and safe, but also conform to human preferences. This, however, requires user feedback on the robot's behavior. In this work, we propose a novel approach to leverage the user's brain signals as a feedback modality in order to decode the judgment of rob…

2019-09-03abs ↗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.

Bardo Composer generates tabletop RPG music based on player speech.

problem Creating immersive background music for tabletop RPGs.
method Speech recognition, emotion classification, and music generation using a novel beam search algorithm.
result Generated music pieces can be accurately identified by human subjects as conveying the intended emotion.

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.

DPA aligns LLMs with multi-objective rewards for diverse user preferences.

problem Fine-grained control over LLMs for diverse user needs.
method Integrates multi-objective reward modeling and directional preference control.
result DPA offers better performance trade-offs and intuitive user control over LLM generation.

This paper fine-tunes BERT for stock market sentiment analysis and improves trading performance.

problem Improving trading performance in non-strongly efficient markets.
method Fine-tuning BERT on annotated data, combining with Alpha191 model for regression and prediction.
result Emotional factors significantly improve trading performance, increasing return rates by 73.8% compared to baseline.

System detects financial forecasts in tweets, achieving high precision.

problem Detecting financial forecasts in social media messages.
method Natural Language Processing and Machine Learning techniques for real-time analysis.
result Achieves over 90% precision for financial forecasts.

FSPO optimizes synthetic preferences for LLM personalization.

problem Personalizing large language models for diverse users.
method FSPO reframes reward modeling as a meta-learning problem, using few labeled preferences and synthetic data.
result FSPO achieves high winrates in personalized responses, both synthetic and real.

Fashion preference is a fuzzy concept that depends on customer taste, prevailing norms in fashion product/style, henceforth used interchangeably, and a customer's perception of utility or fashionability, yet fashion e-retail relies on algorithmically generated search and recommendation systems that process structured d…

2018-06-30abs ↗pdf ↗

This research improves EEG-based MI-BCI systems to be more resilient to emotional arousal.

problem Lack of robustness in EEG-based MI-BCI systems due to emotional arousal.
method Subjects were exposed to VR environments to induce high and low arousal states. Machine learning models were trained on proxy subjects instead of arousal states. MI models were trained for each subject.
result MI-BCI systems are made more resilient to emotional perturbations.

We tackle the problem of constructive preference elicitation, that is the problem of learning user preferences over very large decision problems, involving a combinatorial space of possible outcomes. In this setting, the suggested configuration is synthesized on-the-fly by solving a constrained optimization problem, wh…

2017-11-22abs ↗pdf ↗

In this paper, we investigate the impact of diverse user preference on learning under the stochastic multi-armed bandit (MAB) framework. We aim to show that when the user preferences are sufficiently diverse and each arm can be optimal for certain users, the O(log T) regret incurred by exploring the sub-optimal arms un…

2019-01-23abs ↗pdf ↗

Proposes auditing for envy-freeness in recommender systems to assess individual preferences.

problem Auditing fairness in recommender systems for individual preferences.
method Formulates a pure exploration problem in multi-armed bandits, proposing a sample-efficient algorithm with theoretical guarantees.
result Algorithm ensures fairness without deteriorating user experience on real-world datasets.

Paper proposes a two-stage ranking for personalized TV recommendations.

problem Improving TV recommendation accuracy and efficiency.
method First, identifies potential candidates using user viewing patterns. Then, ranks them based on user preferences and program textual information.
result The proposed model outperforms in recommendation accuracy and efficiency.

Given an incomplete ratings data over a set of users and items, the preference completion problem aims to estimate a personalized total preference order over a subset of the items. In practical settings, a ranked list of top-kk items from the estimated preference order is recommended to the end user in the decreasing …

2019-03-17abs ↗pdf ↗

PGRec improves recommendation by modeling user-item preferences as a graph and embedding it for better predictions.

problem Sparse user-item data in recommender systems.
method PGRec models user-item preferences as a PrefGraph, then uses deep learning and factorization to embed and predict user preferences.
result PGRec outperforms state-of-the-art methods by up to 3.2% in NDCG@10.

A new method improves recommendation accuracy by learning from multiple networks and time-dependent user preferences.

problem Incomplete user profiles and dynamic user preferences degrade recommender quality.
method A cross-network time-aware recommender that learns from multiple source networks and develops current user models.
result The proposed solution achieves superior performance in accuracy, novelty, and diversity.

Network-based models predict user preferences for items like movies and research articles.

problem Filtering and delivering personalized advice for users with many available products.
method Network models based on group memberships, using Monte Carlo sampling and Expectation-Maximization methods.
result Network models outperform leading approaches for recommendation.

Most of the existing recommender systems use the ratings provided by users on individual items. An additional source of preference information is to use the ratings that users provide on sets of items. The advantages of using preferences on sets are two-fold. First, a rating provided on a set conveys some preference in…

2019-04-22abs ↗pdf ↗

New MAB model incentivizes user arm-pulling with self-reinforcing preferences.

problem Balancing exploration and exploitation in recommender systems with incentivized user preferences.
method Proposes a new MAB model with random arm selection and two policies: At-Least-nn Explore-Then-Commit and UCB-List.
result Achieves O(logT)O(log T) expected regret and O(logT)O(log T) expected payment over a time horizon TT.