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.

169,181 papers · 148 categories

Trend · papers per month

10203040 · Jun 202019922001200920182026
48 results for user-item preferences

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.

New model improves recommendation systems by analyzing user-item interactions.

problem Improving recommendation systems for better user-item interactions.
method Sliced Anti-symmetric Decomposition (SAD) model using tensor decomposition.
result SAD produces the most consistent personalized preferences compared to SOTA models.

Unified neural framework for multi-relational recommender systems.

problem Accurately capturing users' fine-grained preferences from diverse feedback types.
method Multi-Relational Memory Network (MRMN) framework that models fine-grained user-item relations and discriminates between feedback types.
result The proposed MRMN model outperforms state-of-the-art algorithms in various recommender scenarios.

Hybrid Deep Embedding for aspect-level explanations in recommendations.

problem Challenges in personalization, dynamic explanations, and aspect-level granularity in recommendation systems.
method Proposes Hybrid Deep Embedding (HDE) to learn dynamic embeddings for user and item preferences, and aspect-level quality vectors.
result Demonstrates improved recommending performance and dynamic aspect-level explanations.

Proposes a tree-based method to efficiently predict user interests in large recommender systems.

problem Efficiently predicting user-item preferences in large recommender systems with high calculation costs.
method Predicts user interests from coarse to fine using a tree structure, which can incorporate deep neural networks.
result Significantly outperforms traditional methods in both training and prediction.

Proposes MCCF to distinguish latent purchasing motivations in user-item interactions.

problem Difficulty in capturing fine-grained user preferences due to complex latent motivations.
method Introduces MCCF with decomposer and combiner modules to identify and recombine latent components.
result Significant performance gains and necessity of considering multiple components demonstrated.

The paper explores using set-level ratings for better user-item preference prediction in recommender systems.

problem Capturing user preferences on individual items using set-level ratings.
method Developed collaborative filtering-based methods to model user behaviors in set-level ratings.
result Collaborative filtering-based models can recover and predict user preferences on individual items using set-level ratings.

Model-based collaborative filtering analyzes user-item interactions to infer latent factors that represent user preferences and item characteristics in order to predict future interactions. Most collaborative filtering algorithms assume that these latent factors are static, although it has been shown that user preferen…

2016-08-17abs ↗pdf ↗

Improved item recommendations for repeat interactions using sequence analysis.

problem Limited effectiveness of traditional recommender systems in handling repeated user-item interactions.
method Designed a recommender system that considers sequences of item interactions for each user.
result Empirically shown to give highly accurate predictions and increase sales by 5%.

Data poisoning attacks can manipulate recommender systems to recommend target items.

problem Attacks on recommender systems to influence top-N item recommendations.
method Formulated as an optimization problem, solved using influence function to select influential users.
result Effective data poisoning attacks that outperform existing methods.

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++.

Proposes a new loss function to avoid treating missing information as positive or negative feedback.

problem Handling missing information in implicit feedback datasets for recommender systems.
method Introduces the Missing Information Loss (MIL) function and applies it to Matrix Factorization and Denoising Autoencoder.
result MIL achieves competitive performance in ranking-aware metrics and reduces the recommendation of popular items.

The paper develops a method to estimate consumer preferences from observed rankings.

problem Estimating consumer preferences from partial ranking information.
method Interpreting observed rankings as pairwise comparisons, modeling latent utility, and correcting for selection bias.
result The method improves recommendation performance, especially for previously unconsumed products.

Develops a two-level monotonic multistage recommender system for better user-specific prediction.

problem Leveraging user-item-stage dependencies in a monotonic chain of events for enhanced prediction accuracy.
method A multistage recommender system with a two-level monotonic property, using a large-margin classifier based on a nonnegative additive latent factor model.
result The proposed method outperforms existing methods in simulations and an article sharing dataset.

Proposes a new framework for resource-limited recommendation.

problem Resource constraints affect user choices in recommendation tasks.
method Interest-behavior multiplicative network with MRRNNs and resource-limited branch.
result Framework effectively predicts user interactions considering resource limitations.

Collaborative filtering (CF) aims to predict users' ratings on items according to historical user-item preference data. In many real-world applications, preference data are usually sparse, which would make models overfit and fail to give accurate predictions. Recently, several research works show that by transferring k…

2012-10-26abs ↗pdf ↗

TransCF improves recommendation by modeling user-item relationships with translation vectors.

problem Triangle inequality violation in matrix factorization-based recommendation methods.
method TransCF uses translation vectors to model latent user-item relationships in implicit feedback.
result TransCF outperforms state-of-the-art methods by up to 17% in hit ratio.

Memory-Augmented Meta-Optimization improves cold-start recommendation.

problem Cold-start problem in recommender systems for new users or items.
method Memory-Augmented Meta-Optimization approach with personalized and task-specific memories.
result Significant improvement in cold-start recommendation performance on multiple datasets.

SAIN integrates user-item feedback with content attributes for better recommendation.

problem Cold start problems in recommendation models due to sparse user-item interactions.
method SAIN uses a self-attention mechanism to capture feature interactions and an information integration layer to combine feedback and content information.
result SAIN outperforms state-of-the-art models by 2.13% on public datasets.

Deep Retrieval learns a retrievable structure for efficient large-scale recommendations.

problem Efficiently retrieving top relevant candidates in large-scale recommendation systems.
method Deep Retrieval learns a retrievable structure directly from user-item interaction data, encoding candidates into a discrete latent space and optimizing a model to maximize accuracy.
result Deep Retrieval achieves almost the same accuracy as brute-force baseline and significantly outperforms ANN baselines in a live production system.

The paper analyzes and optimizes recommendation systems using user-user and item-item collaborative filtering.

problem Optimizing recommendation systems to minimize disliked recommendations.
method Proposes algorithms inspired by user-user and item-item collaborative filtering, proving performance guarantees in terms of expected regret.
result Information-theoretic lower bounds on regret match upper bounds up to logarithmic factors in two model parameter regimes.

This paper improves recommender systems by handling dynamic user preferences and item popularity.

problem Dynamic user preferences and changing item popularity in recommender systems.
method Developed a Thompson sampling-based policy for a high-dimensional linear bandit problem, reducing feature vector dimensionality and using exponentially increasing weights.
result Proved a regret bound that scales with the reduced dimension, demonstrating effectiveness in trade-off between computational complexity and regret performance.

Unified deep framework for personalized recommendations with uncertainty.

problem Uncertainty in user preferences in recommendation systems.
method Gaussian embeddings, Monte-Carlo sampling, convolutional neural networks.
result Superior performance in recommendation accuracy compared to state-of-the-art models.

Matrix factorization simplifies user-item co-occurrence analysis.

problem Understanding the meaning of low-dimensional matrices in matrix factorization.
method Showed matrix factorization equals calculating eigenvectors of co-occurrence matrices, using RMT insights.
result Low-dimension matrices represent a reduced noise user and item co-occurrence space.

A new linear GCN model improves recommendation performance for large graphs.

problem Training difficulties and over-smoothing in GCN-based CF models.
method Proposes a linear residual graph convolutional network (LRGCCF) to address training difficulties and over-smoothing issues.
result The proposed model yields better efficiency and effectiveness on real datasets.

GEMRank embeds users and items using co-occurrence relations for better collaborative filtering.

problem Lack of textual data for entity embedding in recommender systems.
method Uses profile co-occurrence for entity relations and factorization for embedding. Feeds embeddings into a neural network for predictions.
result Significantly outperforms baseline algorithms in various data sets.

We present our solution to the job recommendation task for RecSys Challenge 2016. The main contribution of our work is to combine temporal learning with sequence modeling to capture complex user-item activity patterns to improve job recommendations. First, we propose a time-based ranking model applied to historical obs…

2016-08-11abs ↗pdf ↗

XploVAE improves recommendation by balancing known and novel items.

problem Balancing known and novel items for better recommendations.
method Constructs user-specific subgraphs for exploitation and exploration, learns personalized item embeddings.
result Demonstrates effectiveness on various real-world datasets.

Proposes a multilayer nonlinear semi-nonnegative matrix factorization for better recommendation.

problem Inaccurate user-item interaction modeling with classical matrix factorization.
method Multilayer nonlinear Semi-NMF approach for latent user and item representations.
result Proposed method achieves better generalization in prediction and comparable representation in clustering.

JODIE learns dynamic user-item embeddings from interactions, outperforming existing methods.

problem Modeling dynamic user-item interactions for accurate future predictions.
method JODIE uses coupled recurrent models with update, projection, and prediction components, and a novel t-Batch algorithm.
result JODIE outperforms state-of-the-art methods by up to 22.4% on future interaction and state change prediction tasks.

Collaborative filtering analyzes user preferences for items (e.g., books, movies, restaurants, academic papers) by exploiting the similarity patterns across users. In implicit feedback settings, all the items, including the ones that a user did not consume, are taken into consideration. But this assumption does not acc…

2015-10-23abs ↗pdf ↗

Proposes a robust framework for recommendation with implicit feedback considering cost-sensitive learning.

problem Recommendation with implicit feedback often assumes a strict low-rank structure and ignores class imbalance.
method Decomposes U-I matrix into low-rank and sparse components, incorporating cost-sensitive learning.
result Cost-sensitive error is upper bounded by O(αmn)O(\fracα{\sqrt{mn}}), demonstrating improved performance.

Poisson factorization is a probabilistic model of users and items for recommendation systems, where the so-called implicit consumer data is modeled by a factorized Poisson distribution. There are many variants of Poisson factorization methods who show state-of-the-art performance on real-world recommendation tasks. How…

2017-03-04abs ↗pdf ↗

Matrix completion models are among the most common formulations of recommender systems. Recent works have showed a boost of performance of these techniques when introducing the pairwise relationships between users/items in the form of graphs, and imposing smoothness priors on these graphs. However, such techniques do n…

2017-04-22abs ↗pdf ↗

A new algorithm MBMF improves recommendation accuracy and speed for sparse datasets.

problem Sparse and fluctuating predictions in recommender systems.
method MBMF uses magnitude constraints and Spherical coordinates to optimize faster than existing methods.
result MBMF outperforms existing algorithms in accuracy and speed on synthetic and real datasets.

The paper proposes a new method for product recommendation that considers revenue contributions and user similarity.

problem High dimensionality and sparsity in user-item data, especially in terms of revenue contributions.
method The approach encodes revenue contributions in the user-item matrix and computes customer similarity using suitable distance measures.
result The method segments users based on revenue-based similarity and supports recommendations aligned with profitability objectives.

We develop a Bayesian Poisson matrix factorization model for forming recommendations from sparse user behavior data. These data are large user/item matrices where each user has provided feedback on only a small subset of items, either explicitly (e.g., through star ratings) or implicitly (e.g., through views or purchas…

2013-11-07abs ↗pdf ↗