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

Trend · papers per month

200400600800 · Jun 202019922001200920172026
48 results for User Studies

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}).

In Federated Learning, we aim to train models across multiple computing units (users), while users can only communicate with a common central server, without exchanging their data samples. This mechanism exploits the computational power of all users and allows users to obtain a richer model as their models are trained …

2020-02-19abs ↗pdf ↗

Paper fine-tunes LLMs using user edits, unifying preference, supervision, and reward feedback.

problem Adapting LLMs to user preferences and feedback types.
method Derives bounds for learning algorithms from user edits, proposes an ensembling procedure.
result Ensembling procedure outperforms individual feedback methods and robustly adapts to different user-edit distributions.

As more and more people shift their movie watching online, competition between movie viewing websites are getting more and more intense. Therefore, it has become incredibly important to accurately predict a given user's watching list to maximize the chances of keeping the user on the platform. Recent studies have sugge…

2019-09-02abs ↗pdf ↗

Studies on massive open online courses (MOOCs) users discuss the existence of typical profiles and their impact on the learning process of the students. However defining the typical behaviors as well as classifying the users accordingly is a difficult task. In this paper we suggest two methods to model MOOC users behav…

2019-07-10abs ↗pdf ↗

A new method for precise user targeting in advertising using hyperbolic manifold learning.

problem Improving user satisfaction in targeted advertising by overcoming skepticism and spam perception.
method Proposes a Multi-Manifold Learning framework to learn hierarchical user and ad representations in the hyperbolic space.
result Demonstrates improved performance in user targeting and prediction accuracy on both public datasets and a large-scale commercial system.

User strategization undermines algorithmic trustworthiness.

problem User strategic behavior corrupts algorithmic data and trust.
method Modeling user-platform interactions as a game, analyzing strategic behavior's short-term benefits and long-term harms.
result User strategization can initially benefit platforms but ultimately harms their ability to make accurate decisions.

Paper studies user-level differential privacy in federated linear contextual bandits.

problem Federated learning with user-level differential privacy constraints.
method Unified federated bandits framework, CDP and LDP definitions, ROBIN algorithm.
result Near-optimal learning under user-level CDP with privacy budget and number of clients.

User contributions in the form of posts, comments, and votes are essential to the success of online communities. However, allowing user participation also invites undesirable behavior such as trolling. In this paper, we characterize antisocial behavior in three large online discussion communities by analyzing users who…

2015-04-02abs ↗pdf ↗

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.

Study resource allocation strategies in sequential decisions with unknown rewards.

problem Sequential resource allocation with unknown rewards.
method Design combinatorial multi-armed bandit algorithms for discrete or continuous budgets.
result Prove algorithms achieve logarithmic cumulative regret under semi-bandit feedback.

New framework uses user feedback in CB problems for better decision-making.

problem Improving decision-making in contextual bandit problems with user-triggered feedback.
method Developed a new framework to leverage user-triggered feedback in CB problems, robust to feedback bias.
result Improved regret guarantees for CB algorithms using user feedback.

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.

Study on adversarial attacks on user identification systems using motion sensors.

problem Adversarial attacks on deep learning models for user identification based on motion sensors.
method Study of adversarial example generation methods and their impact on user identification systems.
result Deep neural networks trained for user identification based on motion sensors are vulnerable to adversarial attacks, leading to high misclassification rates.

Current recommender systems exploit user and item similarities by collaborative filtering. Some advanced methods also consider the temporal evolution of item ratings as a global background process. However, all prior methods disregard the individual evolution of a user's experience level and how this is expressed in th…

2017-05-06abs ↗pdf ↗

We construct the Google matrices of bitcoin transactions for all year quarters during the period of January 11, 2009 till April 10, 2013. During the last quarters the network size contains about 6 million users (nodes) with about 150 million transactions. From PageRank and CheiRank probabilities, analogous to trade imp…

2019-06-04abs ↗pdf ↗

AIPS improves ranking policy evaluation by adapting to diverse user behavior.

problem Inaccurate Off-Policy Evaluation of ranking policies due to high variance under diverse user behavior.
method Developed Adaptive IPS (AIPS) that adapts to different user behaviors and minimizes MSE.
result AIPS achieves minimum variance among unbiased estimators and provides significant empirical accuracy improvement.

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.

Study shows competition feedback can make ML predictors biased towards specific user groups.

problem How competition affects machine learning predictors and user prediction quality.
method Flexible model of competing ML predictors, empirical and mathematical analysis.
result Competition causes predictors to specialize for specific sub-populations at the cost of general performance.

This study measures liquidity risks in Aave, a blockchain lending protocol.

problem Liquidity risks in lending protocols, especially in Aave.
method Measurements of liquidity risks using Aave as a case study, focusing on available liquidity and market concentration.
result Liquidity risks in Aave are volatile and affect the protocol negatively, especially for repeat borrowers.

Autonomous robots often encounter challenging situations where their control policies fail and an expert human operator must briefly intervene, e.g., through teleoperation. In settings where multiple robots act in separate environments, a single human operator can manage a fleet of robots by identifying and teleoperati…

2019-09-22abs ↗pdf ↗

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.

When an AI system interacts with multiple users, it frequently needs to make allocation decisions. For instance, a virtual agent decides whom to pay attention to in a group setting, or a factory robot selects a worker to deliver a part. Demonstrating fairness in decision making is essential for such systems to be broad…

2019-12-13abs ↗pdf ↗

Enhanced recommender system using ensemble learning and graph embedding.

problem Challenges in selecting relevant data for users from large datasets.
method Group classification, ensemble learning, fuzzy rules, decision tree, graph embedding.
result High efficiency of the presented method on MovieLens datasets.