Item recommendation is the task of predicting a personalized ranking on a set of items (e.g. websites, movies, products). In this paper, we investigate the most common scenario with implicit feedback (e.g. clicks, purchases). There are many methods for item recommendation from implicit feedback like matrix factorizatio…
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,878 papers · 148 categories
Trend · papers per month
48 results for “Bayesian Personalized Ranking”
Item recommendation is a personalized ranking task. To this end, many recommender systems optimize models with pairwise ranking objectives, such as the Bayesian Personalized Ranking (BPR). Using matrix Factorization (MF) --- the most widely used model in recommendation --- as a demonstration, we show that optimizing it…
Network embedding methodologies, which learn a distributed vector representation for each vertex in a network, have attracted considerable interest in recent years. Existing works have demonstrated that vertex representation learned through an embedding method provides superior performance in many real-world applicatio…
A study compares local music recommendation algorithms, finding neighborhood-based methods perform best.
problem Cold-start problem for local artists with little user preference data.
method Comparison of three recommender system algorithms (IIN, ALS, BPR) on local music recommendation task.
result Neighborhood-based approach (IIN) performs best for local music recommendation.
Unified product embeddings improve cross-task performance in e-commerce.
problem Training product embeddings in isolation limits cross-task performance.
method Combining text, clickstream, and image data using denoising auto-encoders, BPR, and Siamese neural networks.
result Unified product embeddings uniformly outperform isolated embeddings across three e-commerce tasks.
Ranking Differential Privacystat.ML
This paper protects rankings from differential privacy breaches.
problem Leakage of personal information in rankings.
method Develops ε-ranking differential privacy and a multistage ranking algorithm.
result Establishes the connection between Mallows model and ε-ranking differential privacy.
A new method models user-specific parameters as a low-rank plus sparse component for efficient personalization.
problem Efficient personalization of machine learning models for individual users.
method Meta-learning approach that models network weights as a sum of low-rank and sparse components.
result The proposed method, AMHT-LRS, achieves nearly optimal sample complexity for estimating the low-rank and sparse components.
Federated Learning with Uncertainty and Personalization via Efficient Second-order Optimizationcs.LG
Efficient Bayesian FL method improves predictive accuracy and uncertainty estimates.
problem Federated Learning with model and predictive uncertainty and personalization.
method Second-order optimization approach for Bayesian FL.
result Improved predictive accuracies and uncertainty estimates.
Personalized Transformer improves temporal collaborative ranking performance.
problem Temporal collaborative ranking in recommendation systems.
method Personalized Transformer model using attention mechanisms.
result Personalized Transformer outperforms SASRec by almost 5% in NDCG@10.
Search queries are appropriate when users have explicit intent, but they perform poorly when the intent is difficult to express or if the user is simply looking to be inspired. Visual browsing systems allow e-commerce platforms to address these scenarios while offering the user an engaging shopping experience. Here we …
A rising topic in computational journalism is how to enhance the diversity in news served to subscribers to foster exploration behavior in news reading. Despite the success of preference learning in personalized news recommendation, their over-exploitation causes filter bubble that isolates readers from opposing viewpo…
Deep neural network predicts product returns before purchase.
problem High costs of handling returned fashion products.
method Bayesian Personalized Ranking (BPR) embeddings and skip-gram model for user and product features.
result Reduced overall returns through real-time return probability prediction.
In designing personalized ranking algorithms, it is desirable to encourage a high precision at the top of the ranked list. Existing methods either seek a smooth convex surrogate for a non-smooth ranking metric or directly modify updating procedures to encourage top accuracy. In this work we point out that these methods…
Identifies interpretable generative model for multivariate data.
problem Black-box architectures of deep generative models are often unidentified and difficult to interpret.
method Introduces Deep Discrete Encoder (DDE) Copula, a hierarchical binary latent variable model inside a copula framework.
result Establishes conditions for identification of DDE copula parameters and proves posterior consistency.
New ranking algorithms improve online content delivery by learning from click data.
problem Bias in ranking systems due to production system biases.
method Proposed novel extensions of LinUCB and Linear Thompson Sampling algorithms to handle position-based click model.
result Validated the proposed algorithms through offline and online experiments.
Object tracking is an ubiquitous problem that appears in many applications such as remote sensing, audio processing, computer vision, human-machine interfaces, human-robot interaction, etc. Although thoroughly investigated in computer vision, tracking a time-varying number of persons remains a challenging open problem.…
Group personalization improves FL performance in heterogeneous client data.
problem Mitigating client drift in federated learning with heterogeneous data.
method Fine-tuning a global FL model over homogeneous groups of clients, then personalizing each group's model.
result The proposed method achieves superior personalization performance compared to other FL approaches.
Paper proposes a novel MTL framework for personalized modeling of diverse individuals.
problem Personalized modeling of heterogeneous subpopulations with high-dimensional data.
method Low-rank tensor decomposition for multi-task learning.
result Superior performance compared to benchmarks in diverse subpopulation scenarios.
Bayesian Supervised Causal Clustering identifies patient subgroups for personalized decision-making.
problem Finding patient subgroups with similar characteristics for personalized decision-making.
method Bayesian Supervised Causal Clustering (BSCC) that identifies homogenous subgroups based on treatment effects.
result BSCC identifies subgroups with similar covariate profiles and treatment effects.
Bayesian REX learns Atari games from demonstrations efficiently.
problem Bayesian reward learning for complex control problems is computationally intractable.
method Bayesian Reward Extrapolation (Bayesian REX) pre-trains a low-dimensional feature encoding and uses preferences to perform fast Bayesian inference.
result Bayesian REX learns Atari games from demonstrations in 5 minutes, competitive with state-of-the-art methods.
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.
Bayesian model eliminates feedback loops in personalization systems.
problem Feedback loops in user choice systems based on limited exposure.
method Bayesian choice model based on Luce axioms, fair and efficient.
result Low regret in learning to present, accurate preference estimates with minimal interactions.
Genome-wide association studies have proven to be essential for understanding the genetic basis of disease. However, many complex traits---personality traits, facial features, disease subtyping---are inherently high-dimensional, impeding simple approaches to association mapping. We developed a nonparametric Bayesian re…
New test identifies specific biological parameters for personalized CVD detection.
problem Ineffectual pathology tests fail to consider platelet activation and inter-individual variability.
method Stochastic platelet deposition model and approximate Bayesian computation with discriminative summary statistics.
result Inferred parameters help identify specific biological parameters for personalized CVD detection.
Proposes HBayes for hierarchical Bayesian recommendation learning.
problem Hierarchical structures in recommender systems.
method Hierarchical Bayesian learning framework with variational inference.
result Outperforms state-of-the-art models in precision, recall, and NDCG.
Proposes efficient data acquisition for personalized treatment effects from observational data.
problem Efficiently acquiring outcomes for personalized treatment effects in observational studies.
method Introduces causal, Bayesian acquisition functions to select points with overlapping support.
result Demonstrates improved sample efficiency and accuracy in learning personalized treatment effects.
iSplit LBI predicts individualized partial rankings from ties, outperforming state-of-the-art methods.
problem Predicting partial rankings from pairwise comparisons with ties, considering individual preferences.
method Variable splitting-based algorithm (iSplit LBI) that generates a sequence of estimations with a regularization path, decomposing parameters into abnormal signals, personalized signals, and random noise.
result iSplit LBI significantly outperforms state-of-the-art alternatives in predicting individualized partial rankings.
Multi-label network classification is a well-known task that is being used in a wide variety of web-based and non-web-based domains. It can be formalized as a multi-relational learning task for predicting nodes labels based on their relations within the network. In sparse networks, this prediction task can be very chal…
Bayesian neural networks benefit from fully marginalizing over all modes to improve generalization.
problem Bayesian neural networks suffer from multimodal posterior distributions that can lead to suboptimal generalization.
method Use appropriate Bayesian sampling tools to fully marginalize over all posterior modes.
result Training with full marginalization improves the ability of the network to reason between multiple candidate solutions.
Bayesian optimization generates personalized face stimuli for cognitive neuroscience.
problem Lack of personalized face stimuli in cognitive neuroscience studies.
method Combines GANs with Bayesian optimization to identify individual response patterns to faces.
result Algorithm efficiently generates optimal faces maximizing individual subject's response.
The paper proposes a policy learning framework for interpretable personalization.
problem Effective personalization of goods and services to improve revenues and maintain competitive edge.
method Policy learning with linear decision boundaries using causal inference and Bayesian optimization.
result The learned policy improves net sales revenue by 88.2% and provides insights into important features.
FLowDUP trains personalized models with unlabeled clients in low dimensions.
problem Training personalized models on clients with only unlabeled data.
method FLowDUP uses a forward pass with unlabeled data and a transductive PAC-Bayesian bound to generate personalized models in a low-dimensional subspace.
result FLowDUP enables efficient communication and computation with personalized models generated from unlabeled data.
Develops algorithms for personalized ranking in recommender and energy systems.
problem Designing algorithms for personalized ranking in dynamic systems.
method Proposes SAROS for recommender systems and a fault detection algorithm for power systems.
result SAROS outperforms traditional methods in both recommender and energy systems.
BFTS uses Bayesian Additive Regression Trees for improved personalized mobile health interventions.
problem Adapting to complex, non-linear user behaviors in personalized mobile health interventions.
method Bayesian Forest Thompson Sampling (BFTS) integrates Bayesian Additive Regression Trees (BART) into the exploration loop of contextual bandits.
result BFTS achieves state-of-the-art regret on tabular benchmarks and improves engagement rates by over 30% in a behavioral intervention study.
The Black-Litterman model combines investors' personal views with historical data and gives optimal portfolio weights. In this paper we will introduce the original Black-Litterman model (section 1), we will modify the model such that it fits in a Bayesian framework by considering the investors' personal views to be a d…
This paper addresses the problem of emotion recognition from physiological signals. Features are extracted and ranked based on their effect on classification accuracy. Different classifiers are compared. The inter-subject variability and the personalization effect are thoroughly investigated, through trial-based and su…
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.
Scalable model for slate recommendation learns reward probabilities.
problem Scalable personalized slate recommendation in large action spaces.
method Probabilistic Rank and Reward (PRR) model combining reward, interaction, and rank.
result PRR outperforms existing methods and is scalable to large action spaces.
IA-BMA adapts model weights to inputs for better predictions.
problem Predicting with multiple models in heterogeneous settings.
method Input adaptive Bayesian Model Averaging (IA-BMA) with an input adaptive prior and amortized variational inference.
result IA-BMA consistently delivers more accurate and better-calibrated predictions.
Bayesian model identifies skill difficulties and student subgroups in engineering education.
problem Identifying and supporting diverse student needs in entry-level university engineering modules.
method Hierarchical Bayesian modeling of student response data.
result Clear patterns of skill mastery and distinct student subgroups identified.
Differentially private graph learning via bounded sensitivity PPR.
problem Protecting user data in graph learning algorithms.
method Proposes a sensitivity-bounded personalized PageRank (PPR) algorithm.
result Achieves similar accuracy to non-private algorithms with large degrees.
Proposes using dimensionality reduction with personalized page rank to improve GCNs' performance in node classification.
problem GCNs' limitation in considering only a few propagation steps away nodes, leading to hub node bias.
method Utilizes dimensionality reduction techniques conjugate with personalized page rank to fully account for graph topology.
result Significantly outperforms existing methods in node classification tasks on real-world networks.
We consider a problem of ranking and selection via simulation in the context of personalized decision making, where the best alternative is not universal but varies as a function of some observable covariates. The goal of ranking and selection with covariates (R&S-C) is to use simulation samples to obtain a selection p…
Novel method embeds generative model into Bayesian optimization for HD cardiac model parameter estimation.
problem High-dimensional optimization of patient-specific cardiac model parameters with limited data.
method Embeds a generative variational auto-encoder into the objective function of Bayesian optimization.
result Improves accuracy of parameter estimation with more than 10x gain in efficiency.
Advances in collaborative filtering and ranking methods.
problem Improving recommendation systems efficiency and accuracy.
method Graph information encoding, pairwise and listwise approaches, regularization techniques, personalization.
result New methods significantly improve recommendation system performance.
Deep Bayesian Bandits improve personalized ads by balancing exploration and exploitation.
problem Recommender systems favor items already engaged by users, causing new campaigns to remain unexplored.
method Formulated as a contextual bandit, implemented exploration techniques using posterior distribution and bootstrapped models.
result Demonstrated a positive gain in exploration model in offline simulation and online AB setting.
Bayesian model improves image completion accuracy by automatically learning low rank structure.
problem Improving image completion accuracy with limited data and avoiding overfitting.
method Developed a Bayesian low rank tensor ring model with multiplicative interaction and Student-T distribution for sparse core factors.
result The proposed method outperforms state-of-the-art image completion techniques, especially in recovery accuracy.
This paper improves fairness in recommendation systems by learning individual preferences across multiple dimensions.
problem Fairness in recommender systems, especially in areas with social impact.
method Opportunistic multi-aspect re-ranking approach that learns individual preferences and enhances provider fairness.
result Achieves a better trade-off between accuracy and fairness across multiple fairness dimensions.