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

3774110147 · Jun 202019922001200920172026
48 results for user biases

Theoretical model for iterative user discovery in recommender systems.

problem Iterative feedback loops in recommender systems and their biases.
method Theoretical framework to model system evolution and convergence properties.
result Theoretical bounds and convergence properties on user discovery and blind spots.

Study shows how online personalization can lead to unfair models due to biased user responses.

problem Fairness issues in online personalization systems due to biased user responses.
method Formulated a regularization-based approach to mitigate biases in machine learning models.
result Demonstrated that online personalization can cause models to learn unfair behavior from biased user responses.

The possible impact of algorithmic recommendation on the autonomy and free choice of Internet users is being increasingly discussed, especially in terms of the rendering of information and the structuring of interactions. This paper aims at reviewing and framing this issue along a double dichotomy. The first one addres…

2019-07-19abs ↗pdf ↗

Recommender systems are used in variety of domains affecting people's lives. This has raised concerns about possible biases and discrimination that such systems might exacerbate. There are two primary kinds of biases inherent in recommender systems: observation bias and bias stemming from imbalanced data. Observation b…

2018-09-13abs ↗pdf ↗

Adobe research tackles strategic recommendations using reinforcement learning.

problem Optimizing user interactions for long-term objectives in various use-cases.
method Reinforcement learning applied to modeling user behavior and decision-making.
result Practical solutions implemented for various use-cases, addressing fundamental challenges.

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.

Industrial recommender systems deal with extremely large action spaces -- many millions of items to recommend. Moreover, they need to serve billions of users, who are unique at any point in time, making a complex user state space. Luckily, huge quantities of logged implicit feedback (e.g., user clicks, dwell time) are …

2018-12-06abs ↗pdf ↗

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.

CausalRM models rewards from user feedback, overcoming noise and bias.

problem Aligning language models with user preferences from noisy, biased feedback.
method Causal-theoretic reward modeling framework addressing noise and bias in observational feedback.
result CausalRM learns accurate reward signals from noisy and biased observational feedback.

We quantify content availability and user discovery opportunities in recommender systems.

problem Determining the maximum probability of recommending content to users.
method Stochastic reachability to compute upper bounds on recommendation likelihood.
result Reachability metrics can detect biases and diagnose user discovery limitations.

The paper tackles biases in session-based recommender systems by modeling user interest as a stochastic process.

problem Data uncertainty, popularity bias, and exposure bias in session-based recommender systems.
method The paper proposes treating user interest as a stochastic process in the latent space, debiasing item embeddings, modeling dense user interest, and introducing fake targets to simulate extended exposure.
result The proposed approach mitigates challenges in session-based recommender systems, as shown by computational experiments on various datasets.

System learns to combine multiple model components for personalized text generation.

problem Adapting and biasing language models for personal preferences.
method Combines model-defined components, learns activation and probability combination from unlabeled text.
result Directly generates text with personalized components from unlabeled data.

The paper identifies and analyzes subjective class issues in user-generated data.

problem Subjective labels in user-generated data can lead to biased and manipulated results.
method Defined subjective and objective classes, proposed a framework for detecting subjective labels.
result Data mining practitioners can detect and avoid subjective class issues early in their projects.

Debias recommender systems by accounting for hidden confounders using network information.

problem Debiased recommender systems to reduce bias caused by hidden confounders.
method Leverage network information to disentangle user conformity and item popularity, modeling exposure and ratings while controlling hidden confounders.
result The proposed method effectively debiases recommender systems, improving recommendation accuracy.

KFAtt improves CTR prediction by modeling user behavior with Kalman filtering attention.

problem Improving CTR prediction in personalized e-commerce search engines.
method KFAtt combines Kalman filtering with attention mechanisms to model user behavior.
result KFAtt outperforms existing methods in CTR prediction, achieving better performance in both offline and online settings.

Previous work on recommender systems mainly focus on fitting the ratings provided by users. However, the response patterns, i.e., some items are rated while others not, are generally ignored. We argue that failing to observe such response patterns can lead to biased parameter estimation and sub-optimal model performanc…

2012-10-16abs ↗pdf ↗

The study aims to prevent unfair content presentation in recommender systems.

problem Over- and under-presentation of content leads to biased user preference estimates.
method Two models are considered: one that ignores systematic and limited exposure, and another that conditions on limited exposure.
result Ignoring systematic presentations overestimates promoted options and underestimates censored alternatives.

A new dataset tracks user interactions and click responses in online marketplaces.

problem Lack of exposure data in recommender systems datasets.
method Proposes a novel dataset including slates and click responses, allowing more accurate likelihood models.
result Models using exposure data show more natural likelihood, reducing bias towards previously exposed items.

FedAVOT improves federated learning by aligning user distributions.

problem Partial client participation leads to biased and unstable updates in federated learning.
method Formulates aggregation as masked optimal transport to align availability and importance distributions.
result Achieves a standard O(1/√T) rate, independent of the number of participating users per round.

Algorithm improves recommendation subset selection in the presence of biases.

problem Maximizing submodular functions for recommendation in the presence of social biases.
method Algorithm for submodular maximization with fairness constraints.
result Algorithm provably outputs subsets with near-optimal utility and proportional representation.

Active learning suffers from biased non-response, which this paper addresses.

problem Active learning's effectiveness is compromised by biased non-response in real-world contexts.
method Proposes a cost-based correction to the sampling strategy, UCB-EU, to mitigate the impact of biased non-response.
result UCB-EU successfully reduces the harm from labelling non-response in many settings.

Improved text generation with constraints using discrete auto-regressive biasing.

problem Balancing fluency and constraint satisfaction in LLM outputs.
method Discrete Auto-regressive Biasing, leveraging gradients in discrete text space.
result Significantly improved constraint satisfaction with comparable fluency.

We propose a scalable Bayesian preference learning method for jointly predicting the preferences of individuals as well as the consensus of a crowd from pairwise labels. Peoples' opinions often differ greatly, making it difficult to predict their preferences from small amounts of personal data. Individual biases also m…

2019-12-04abs ↗pdf ↗

OMIC improves matrix completion with orthonormal side information and nuclear-norm regularization.

problem Matrix completion with improved interpretability and adaptability.
method OMIC combines orthonormal side information and nuclear-norm regularization, optimized by a converging algorithm.
result OMIC outperforms state-of-the-art methods in synthetic and real-world datasets.

We study fairness in collaborative-filtering recommender systems, which are sensitive to discrimination that exists in historical data. Biased data can lead collaborative-filtering methods to make unfair predictions for users from minority groups. We identify the insufficiency of existing fairness metrics and propose f…

2017-05-24abs ↗pdf ↗

Paper tackles ride-sharing user experience enhancement with weakly supervised learning.

problem Compound weakly supervised learning problem in ride-sharing comment data.
method CWSL method with instance reweighting, robust criteria, and alternating optimization.
result Effectiveness validated on Didi ride-sharing comment data.

Extends Demographic Parity for fairer wage predictions with expert knowledge.

problem Inadequate fairness metrics limit user domain knowledge and ignore intersectional fairness.
method Develops a parametric method to incorporate expert knowledge in fair predictions.
result Offers a robust solution for real-life applications with limited data and spending constraints.

The conventional solution to the recommendation problem greedily ranks individual document candidates by prediction scores. However, this method fails to optimize the slate as a whole, and hence, often struggles to capture biases caused by the page layout and document interdepedencies. The slate recommendation problem …

2018-03-05abs ↗pdf ↗

This paper tackles selection bias in recommender systems by considering the neighborhood effect.

problem Selection bias in recommender systems due to filtering and user selection.
method Formalizes neighborhood effect as interference problem, introduces treatment representation, and proposes ideal loss.
result Proposed methods achieve unbiased learning when both selection bias and neighborhood effect are present.

EMFs combine deep learning and probabilistic models for better density estimation.

problem Combining domain-specific knowledge with general-purpose deep learning.
method Alternating transformations with structured layers that embed domain-specific inductive biases.
result EMFs induce desirable properties like multimodality and hierarchical coupling.

This note explores probabilistic sampling weighted by uncertainty in active learning. This method has been previously used and authors have tangentially remarked on its efficacy. The scheme has several benefits: (1) it is computationally cheap, (2) it can be implemented in a single-pass streaming fashion which is a ben…

2019-09-11abs ↗pdf ↗