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

Trend · papers per month

131262392523 · Jun 202019922001200920172026
48 results for group recommender systems

DeepFair improves fairness in recommender systems without sacrificing accuracy.

problem Lack of bias management in recommender systems leads to unfair recommendations for minority groups.
method Deep Learning based Collaborative Filtering algorithm that balances fairness and accuracy.
result It is possible to make fair recommendations without losing significant accuracy.

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.

Matrix completion has a long-time history of usage as the core technique of recommender systems. In particular, 1-bit matrix completion, which considers the prediction as a ``Recommended'' or ``Not Recommended'' question, has proved its significance and validity in the field. However, while customers and products aggre…

2019-04-07abs ↗pdf ↗

Develops a method to estimate uncertainty for group-level recommendations in matrix completion.

problem Uncertainty estimation for group-level recommendations in matrix completion.
method Structured conformal inference method combining any matrix completion algorithm.
result Stronger group-level guarantees through structured calibration.

KHGRec tackles noisy and incomplete KG-enhanced recommendations by modeling complex interactions.

problem Challenges in integrating KGs for accurate recommendations, especially in complex higher-order interactions and heterogeneous modalities.
method KHGRec uses a collaborative knowledge heterogeneous hypergraph (CKHG) to model group-wise interdependencies, employing two hypergraph encoders and attention mechanisms.
result KHGRec achieves an average 5.18% relative improvement over state-of-the-art baselines on four real-world datasets.

DeepUnHide uses deep learning to reveal hidden demographic features in recommender systems.

problem Extracting hidden demographic features from recommender systems factors.
method Gradient-based localization in deep learning for feature extraction.
result DeepUnHide outperforms state-of-the-art feature selection methods.

Proposes a new model for explainable recommendation systems.

problem Developing predictive models that provide explanations for item recommendations.
method Generalized Additive Models with Manifest and Latent Interactions (GAMMLI).
result Advantages in both predictive performance and explainability.

Social activities play an important role in people's daily life since they interact. For recommendations based on social activities, it is vital to have not only the activity information but also individuals' social relations. Thanks to the geo-social networks and widespread use of location-aware mobile devices, massiv…

2019-11-06abs ↗pdf ↗

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 ↗

A new recommender system uses slates and Thompson Sampling to improve diversity and click rates.

problem Recommending relevant content to users in a dynamic environment.
method Variational Bayesian Recurrent Neural Net, Thompson Sampling, hierarchical prior, in-slate Thompson Sampling.
result Improved click rates and diversity in recommended slates.

CAFL breaks feedback loops in recommender systems using causal inference.

problem Feedback loops in recommender systems compromise recommendation quality and homogenize user behavior.
method Causal Adjustment for Feedback Loops (CAFL) algorithm that breaks feedback loops using causal inference.
result CAFL improves recommendation quality compared to prior correction methods.

With the overwhelming online products available in recent years, there is an increasing need to filter and deliver relevant personalized advice for users. Recommender systems solve this problem by modeling and predicting individual preferences for a great variety of items such as movies, books or research articles. In …

2020-02-10abs ↗pdf ↗

Deviation-based learning improves recommender systems by abstaining from recommending choices users might follow.

problem Recommender systems learn from user choices but can stall if users blindly follow recommendations.
method The recommender learns user knowledge by observing choices, abstaining from recommending a choice when multiple alternatives produce similar payoffs.
result Learning rate and social welfare improve when the recommender abstains from recommending certain choices.

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.

Machine learning models learn what we teach them to learn. Machine learning is at the heart of recommender systems. If a machine learning model is trained on biased data, the resulting recommender system may reflect the biases in its recommendations. Biases arise at different stages in a recommender system, from existi…

2019-05-10abs ↗pdf ↗

Develops a real-time exercise recommendation system using deep learning.

problem Improving accuracy in exercise recommendation systems without user feedback.
method Deep recurrent neural network with attention mechanisms, real-time expert feedback.
result Improved accuracy in exercise recommendation system after real-time active learning.

Recommender system is an important component of many web services to help users locate items that match their interests. Several studies showed that recommender systems are vulnerable to poisoning attacks, in which an attacker injects fake data to a given system such that the system makes recommendations as the attacke…

2018-09-11abs ↗pdf ↗

SharedMF uses secret sharing to protect privacy in distributed recommendation systems.

problem Privacy issues in multi-source data for recommendation systems.
method Federated learning and secret sharing technology.
result SharedMF achieves faster execution speed and better data adaptability compared to homomorphic encryption methods.

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 ↗

Proposes a deep hybrid model for better recommendation systems.

problem Limited studies on hybrid recommender systems and the need for more advanced approaches.
method Integrates deep learning with ID embeddings and auxiliary features for improved recommendation.
result Improves recommendation results over deep learning models using ID embeddings.

Deep learning improves conversational recommender systems.

problem Creating effective goal-oriented dialogue systems through natural language interactions.
method Apply deep learning techniques to conversational recommender systems.
result Deep learning models enhance user preference learning in CRS.

Interprets feature interactions in ad-click prediction models.

problem Improving interpretability of black-box recommender systems.
method Interprets feature interactions from a source model and encodes them in a target model.
result Interpretations significantly outperform existing recommender models.

Confounding biases recommender systems, even when data seems fully observed.

problem Unmeasured features influencing both treatment and outcome in recommender systems.
method Illustrations and simulation studies showing how common practices introduce confounding.
result Standard recommender system practices can introduce confounding, reducing 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.

Recommender systems take inputs from user history, use an internal ranking algorithm to generate results and possibly optimize this ranking based on feedback. However, often the recommender system is unaware of the actual intent of the user and simply provides recommendations dynamically without properly understanding …

2017-11-28abs ↗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.

We present a large scale hyperbolic recommender system. We discuss why hyperbolic geometry is a more suitable underlying geometry for many recommendation systems and cover the fundamental milestones and insights that we have gained from its development. In doing so, we demonstrate the viability of hyperbolic geometry f…

2019-02-22abs ↗pdf ↗

Nowadays, collaborative filtering recommender systems have been widely deployed in many commercial companies to make profit. Neighbourhood-based collaborative filtering is common and effective. To date, despite its effectiveness, there has been little effort to explore their robustness and the impact of data poisoning …

2019-12-01abs ↗pdf ↗

Recommender systems play a crucial role in mitigating the problem of information overload by suggesting users' personalized items or services. The vast majority of traditional recommender systems consider the recommendation procedure as a static process and make recommendations following a fixed strategy. In this paper…

2017-12-30abs ↗pdf ↗

Auto-Surprise automates recommender system selection and optimization.

problem Finding the best algorithm and hyperparameters for recommender systems.
method Extends Surprise library with TPE optimization for algorithm selection and hyperparameter tuning.
result Significantly faster in finding optimal hyperparameters compared to grid search.

In this paper, we propose a unified framework and an algorithm for the problem of group recommendation where a fixed number of items or alternatives can be recommended to a group of users. The problem of group recommendation arises naturally in many real world contexts, and is closely related to the budgeted social cho…

2017-12-25abs ↗pdf ↗

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.

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.