The importance of accurate recommender systems has been widely recognized by academia and industry. However, the recommendation quality is still rather low. Recently, a linear sparse and low-rank representation of the user-item matrix has been applied to produce Top-N recommendations. This approach uses the nuclear nor…
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,695 papers · 148 categories
Trend · papers per month
48 results for “Top-N recommendation”
Top-N recommender systems have been investigated widely both in industry and academia. However, the recommendation quality is far from satisfactory. In this paper, we propose a simple yet promising algorithm. We fill the user-item matrix based on a low-rank assumption and simultaneously keep the original information. T…
Hyperbolic geometry autoencoder outperforms Euclidean in top-N recommendation tasks.
problem Top-N recommendation performance using hyperbolic geometry.
method Simple autoencoder based on hyperbolic geometry with a single hidden layer.
result Outperforms Euclidean models and state-of-the-art methods.
We propose Top-N-Rank, a novel family of list-wise Learning-to-Rank models for reliably recommending the N top-ranked items. The proposed models optimize a variant of the widely used discounted cumulative gain (DCG) objective function which differs from DCG in two important aspects: (i) It limits the evaluation of DCG …
Recommending appropriate items to users is crucial in many e-commerce platforms that contain implicit data as users' browsing, purchasing and streaming history. One common approach consists in selecting the N most relevant items to each user, for a given N, which is called top-N recommendation. To do so, recommender sy…
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.
The purpose if this master's thesis is to study and develop a new algorithmic framework for Collaborative Filtering to produce recommendations in the top-N recommendation problem. Thus, we propose Lanczos Latent Factor Recommender (LLFR); a novel "big data friendly" collaborative filtering algorithm for top-N recommend…
Knowledge distillation (KD) is a well-known method to reduce inference latency by compressing a cumbersome teacher model to a small student model. Despite the success of KD in the classification task, applying KD to recommender models is challenging due to the sparsity of positive feedback, the ambiguity of missing fee…
How to Put Users in Control of their Data in Federated Top-N Recommendation with Learning to Rankcs.LG
FPL allows users to control their data in federated top-N recommendation.
problem Data privacy in recommendation services.
method Federated Learning with learning to rank optimization.
result Users can control the amount of sensitive data shared with a central server.
Fifty Shades of Ratings: How to Benefit from a Negative Feedback in Top-N Recommendations Taskscs.LG
Conventional collaborative filtering techniques treat a top-n recommendations problem as a task of generating a list of the most relevant items. This formulation, however, disregards an opposite - avoiding recommendations with completely irrelevant items. Due to that bias, standard algorithms, as well as commonly used …
Recommending new items to existing users has remained a challenging problem due to absence of user's past preferences for these items. The user personalized non-collaborative methods based on item features can be used to address this item cold-start problem. These methods rely on similarities between the target item an…
Collaborative filtering (CF) is a popular technique in today's recommender systems, and matrix approximation-based CF methods have achieved great success in both rating prediction and top-N recommendation tasks. However, real-world user-item rating matrices are typically sparse, incomplete and noisy, which introduce ch…
This work explores non-negative low-rank matrix factorization based on regularized Poisson models (PF or "Poisson factorization" for short) for recommender systems with implicit-feedback data. The properties of Poisson likelihood allow a shortcut for very fast computations over zero-valued inputs, and oftentimes result…
Normalized nonnegative models assign probability distributions to users and random variables to items; see [Stark, 2015]. Rating an item is regarded as sampling the random variable assigned to the item with respect to the distribution assigned to the user who rates the item. Models of that kind are highly expressive. F…
Most accurate recommender systems are black-box models, hiding the reasoning behind their recommendations. Yet explanations have been shown to increase the user's trust in the system in addition to providing other benefits such as scrutability, meaning the ability to verify the validity of recommendations. This gap bet…
Making recommendations in the presence of sparsity is known to present one of the most challenging problems faced by collaborative filtering methods. In this work we tackle this problem by exploiting the innately hierarchical structure of the item space following an approach inspired by the theory of Decomposability. W…
Recommender systems often rely on models which are trained to maximize accuracy in predicting user preferences. When the systems are deployed, these models determine the availability of content and information to different users. The gap between these objectives gives rise to a potential for unintended consequences, co…
Unweighted matrix factorization can match or outperform weighted methods in recommender systems.
problem Improving recommendation performance with matrix factorization on implicit feedback data.
method Systematic study of various weighting schemes and matrix factorization algorithms.
result Training with unweighted data can perform comparably to, and sometimes outperform, training with weighted data.
Extends homotopical theory to locally compact groups, refining their compactness properties.
problem Developing homotopical invariants for locally compact groups.
method Extending classical theory of homotopical -sets to locally compact Hausdorff groups, defining sets of characters.
result Recovering and generalizing classical results on characters and compactness properties of groups.
News recommender systems are aimed to personalize users experiences and help them to discover relevant articles from a large and dynamic search space. Therefore, news domain is a challenging scenario for recommendations, due to its sparse user profiling, fast growing number of items, accelerated item's value decay, and…
Recently, matrix factorization-based recommendation methods have been criticized for the problem raised by the triangle inequality violation. Although several metric learning-based approaches have been proposed to overcome this issue, existing approaches typically project each user to a single point in the metric space…
Reservoir subspace injection improves online ICA by preserving injected features.
problem Discarding injected features in top- whitening can degrade performance.
method Formalized reservoir subspace injection (RSI) and developed diagnostics (IER, SSO, ρ_x) to identify and mitigate the failure mode.
result RSI controller preserves passthrough retention, improving performance by up to 2.2 dB.
We study parameter estimation in Nonlinear Factor Analysis (NFA) where the generative model is parameterized by a deep neural network. Recent work has focused on learning such models using inference (or recognition) networks; we identify a crucial problem when modeling large, sparse, high-dimensional datasets -- underf…
Collaborative filtering is widely used in modern recommender systems. Recent research shows that variational autoencoders (VAEs) yield state-of-the-art performance by integrating flexible representations from deep neural networks into latent variable models, mitigating limitations of traditional linear factor models. V…
A new method for generating sets and graphs without requiring exchangeability.
problem Generating exchangeable distributions for sets and graphs is challenging.
method Top-n creation, a differentiable generation mechanism that selects relevant points from a latent vector.
result Top-n method outperforms i.i.d. generation in various tasks.
The smoothing theory is revised to generalize to different disc embedding spaces.
problem Generalizing the smoothing theory to various disc embedding spaces.
method Revising the Morlet-Burghelea-Lashof-Kirby-Siebenmann theorem to apply to different versions of disc smooth embedding spaces.
result The delooping of disc embedding spaces is shown to be compatible with the Hatcher and Budney actions.
A new portfolio model DEWSP improves Sharpe ratio by 0.24% to 5.15%.
problem High sensitivity of optimized portfolios to estimation errors.
method Deep learning algorithms predict returns for top-N ranked assets, then equally weight them.
result DEWSPs provide an improvement rate of 0.24% to 5.15% in terms of monthly Sharpe ratio compared to HEWSPs.
In this paper, we examined the zero-shot activity recognition task with the usage of videos. We introduce an auto-encoder based model to construct a multimodal joint embedding space between the visual and textual manifolds. On the visual side, we used activity videos and a state-of-the-art 3D convolutional action recog…
KANEL: Kolmogorov-Arnold Network Ensemble Learning Enables Early Hit Enrichment in High-Throughput Virtual Screeningphysics.chem-ph
KANEL combines models for early hit enrichment in virtual screening.
problem Assessing model accuracy in chemical bioactivity predictions.
method Ensemble workflow using Kolmogorov-Arnold Networks (KANs) and other models.
result Improves early hit enrichment metrics like PPV@N.
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.
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.
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.
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…
The paper aims to define a benchmark for deep learning recommendation models.
problem Insufficient benchmarking for deep learning recommendation models.
method Synthesizes modeling strategies, defines desirable characteristics, and summarizes advice from the MLPerf Recommendation Advisory Board.
result Defines an industry-relevant benchmark for deep learning recommendation models.
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.
Interactive recommender systems that enable the interactions between users and the recommender system have attracted increasing research attentions. Previous methods mainly focus on optimizing recommendation accuracy. However, they usually ignore the diversity of the recommendation results, thus usually results in unsa…
Survey on using knowledge graphs for better recommender systems.
problem Data sparsity and cold start issues in recommender systems.
method Utilizes knowledge graphs to improve recommendation accuracy and provide explanations.
result Advantages of knowledge graph-based recommender systems.
Job recommendation has traditionally been treated as a filter-based match or as a recommendation based on the features of jobs and candidates as discrete entities. In this paper, we introduce a methodology where we leverage the progression of job selection by candidates using machine learning. Additionally, our recomme…
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…
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.
Survey of IoT recommendation systems and their limitations.
problem Traditional recommender systems fail to handle IoT data.
method Comprehensive review of IoT recommender systems and techniques.
result Proposes a reference framework for future research.
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…
ComiRec framework predicts user interests for personalized recommendations.
problem Predicting user interests from sequential behavior data.
method ComiRec framework captures multiple user interests and balances recommendation accuracy and diversity.
result ComiRec achieves significant improvements over state-of-the-art models in sequential recommendation.
In this paper, we investigate the common scenario where every candidate item for recommendation is characterized by a maximum capacity, i.e., number of seats in a Point-of-Interest (POI) or size of an item's inventory. Despite the prevalence of the task of recommending items under capacity constraints in a variety of s…
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…
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.
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…
Traditional collaborative filtering (CF) based recommender systems tend to perform poorly when the user-item interactions/ratings are highly scarce. To address this, we propose a learning framework that improves collaborative filtering with a synthetic feedback loop (CF-SFL) to simulate the user feedback. The proposed …