A new DBN model predicts inventory levels in retail, accounting for lost items.
problem Stock freezing due to lost, stolen, or broken items.
method Dynamic Bayesian Network (DBN) with EM algorithm to estimate sales and loss distributions.
result The DBN model accurately predicts inventory levels, improving upon traditional methods.
Dataset inference defends against model stealing by identifying stolen training data.
problem Model stealing through machine learning models trained on proprietary data.
method Combines statistical testing with decision boundary estimation to identify stolen training data.
result Model owners can claim with high confidence that their model was stolen, even with limited stolen data.
Paper shows attackers can steal model weights with just noise inputs.
problem Model weight theft with minimal inputs.
method Used i.i.d. Bernoulli noise inputs to achieve high accuracy.
result Achieved high accuracy (96% for MNIST, 82% for KMNIST) with minimal inputs.
New method steals deep neural network knowledge using unlabeled data.
problem Stealing knowledge from protected deep neural networks.
method Generating composite images to mimic mentor neural networks.
result Student network successfully mimics mentor network and steals knowledge.
Framework learns item representations from text data for complementary and similar items.
problem Generating accurate complementary item recommendations from textual data.
method Quadruplet network learning framework for latent space representation of items.
result Items are placed closer together in latent space for similar and complementary items compared to non-complementary items.
WCF uses Wasserstein distance to recommend cold-start items based on content similarity.
problem Recommendation performance drops for new items with little interaction history.
method Applies Wasserstein distance to map interaction history to contents, inferring user preferences.
result WCF outperforms state-of-the-art methods in cold-start recommendation.
Bayesian method improves adaptive testing item selection, ensuring full item exposure.
problem Adaptive testing selects items to estimate ability, but must also ensure diverse item exposure.
method Formulated as Bayesian model averaging, deriving optimal item sampling probabilities.
result Stochastic method achieves full item bank exposure without sacrificing accuracy.
FBSM improves item recommendation for cold-start users by modeling feature interactions.
problem Cold-start item recommendation for new users.
method Factorized bilinear similarity model learning interactions among item features.
result Improves TOP-n recommendation performance compared to traditional methods.
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.
DBRec discovers latent groups to improve recommendation.
problem Sparse user-item interaction data in recommender systems.
method Simultaneously discovers latent user/item groups and interacts them with users/items for bridging preferences.
result DBRec outperforms state-of-the-art models on real datasets.
Paper tackles item cold-start problem using active learning and attributes.
problem Cold-start issue in recommender systems for new items.
method Proposes a novel recommendation scheme combining active learning and item attributes.
result Experimental results show superior performance compared to traditional methods.
Optimal recommendation system using user and item clustering.
problem Maximizing recommendation accuracy with limited feedback.
method Latent variable model with user and item clustering, exploiting i.i.d. structure.
result Near-optimal algorithm that combines item and user structures.
NNMs improve item recommendation by providing interpretable user and item representations.
problem Creating recommender systems that are both accurate and understandable.
method Normalized nonnegative models (NNMs) for item recommendation.
result NNM-based recommender systems provide high predictive power, computational tractability, and expressive user and item representations.
Active learning improves ordering of items with contextual attributes.
problem Learning accurate item orderings from pairwise comparisons, especially when exhaustive comparisons are impractical.
method Proposes an active learning strategy that samples items to minimize expected ordering error, accounting for uncertainty in comparisons.
result Superior sample efficiency and generalization compared to non-contextual ranking approaches and active preference learning baselines.
The study measures similarity in introductory programming items, offering a method and evaluation.
problem Measuring similarity in a diverse pool of programming items for personalized learning.
method General approach to measuring similarity, specific measures for introductory programming, three levels of abstraction evaluation.
result Evaluation of similarity measures using diverse programming environments.
Next basket recommendation improved with context-aware item representations.
problem Predicting users' next purchases based on historical transactions.
method Pre-trained context-aware item representations using transformers.
result IERT outperforms state-of-the-art methods in next basket prediction.
This paper optimizes the number of comparisons needed to find the best k items from pairwise comparisons.
problem Finding the best k items from pairwise comparisons with limited comparisons.
method Developed algorithms for finding probably approximately correct and exact best k items under stochastic conditions.
result Upper and lower bounds on the number of comparisons for finding the best k items, with matching upper bounds for PAC best k items.
Two methods improve 10-K item segmentation using large language models.
problem Challenges in extracting specific items from 10-K reports due to variations in document formats and item presentation.
method Two advanced item segmentation methods: GPT4ItemSeg and BERT4ItemSeg.
result BERT4ItemSeg achieves a macro-F1 of 0.9825, surpassing other methods.
A new algorithm estimates item parameters in item response theory models.
problem Estimating item parameters in item response theory models.
method Computation of the stationary distribution of a Markov chain defined on an item-item graph.
result Our algorithm is consistent and enjoys favorable optimality properties.
Paper introduces consumed item packs for better recommendation.
problem Personalizing web content using implicit feedback.
method Introduces consumed item packs (CIP) to link users/items based on consumption behavior.
result CIP-U, CIP-I, DEEPCIP, and FISM provide competitive recommendation quality.
Much of the data being created on the web contains interactions between users and items. Stochastic blockmodels, and other methods for community detection and clustering of bipartite graphs, can infer latent user communities and latent item clusters from this interaction data. These methods, however, typically ignore t…
Algorithm clusters items by sequentially selecting features, minimizing observations.
problem Clustering items based on bandit feedback with many features.
method Sequential Halving algorithm for feature selection.
result Accurate recovery of item partition with minimal observations.
System segments Form 10-K documents into Item sections for financial analysis.
problem Segmenting Form 10-K documents into Item sections for efficient financial analysis.
method Developed an automatic Form 10-K Itemization system using NLP techniques.
result System achieves a retrieval rate of 93% for segmenting Item sections.
New algorithm for online recommendation of top items from large lists.
problem Online recommendation of top items from a large set of candidates.
method Cascading bandits, linear generalization, learning attraction probabilities from features.
result Regret bound for one algorithm, superior performance on recommendation problems.
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.
Eigenvalue analogy explains item-based recommender system accuracy.
problem Lack of theoretical explanation for item-based recommender system success.
method Formalized as an eigenvalue problem, estimating ratings as true ratings multiplied by user-specific eigenvalues.
result Eigenvalue magnitude correlates with user's recommendation accuracy and can measure confidence.
Algorithm identifies best item from subsets with random utility model feedback.
problem PAC learning the best item from subsets with random utility model feedback.
method Pairwise relative counts and hierarchical elimination for learning algorithm.
result Near-optimal PAC sample complexity guarantee for identifying ε-optimal item.
Adaptive cascade submodular maximization tackles sequential selection under uncertainty.
problem Maximizing expected utility from a set of items with unknown states and continuation probabilities.
method Proposed adaptive cascade submodular functions and a 0.12 approximation algorithm.
result Identified a class of functions (adaptive cascade submodular) that many practical applications satisfy.
In this paper, we consider decentralized sequential decision making in distributed online recommender systems, where items are recommended to users based on their search query as well as their specific background including history of bought items, gender and age, all of which comprise the context information of the use…
NNLMs optimize poorly for word probabilities due to embedding space structure.
problem NNLMs assign suboptimal probabilities to some words.
method Analyzed the inductive bias of NNLMs and the structure of word embeddings.
result Words on the convex hull have bounded probability, affecting others.
Etsy uses novel embeddings to improve user recommendations based on item interactions.
problem Improving personalized recommendations for users based on diverse item interactions.
method Learning interaction-based item embeddings to encode co-occurrence patterns of item and interaction types.
result Taking interaction type into account improves user shopping behavior modeling accuracy.
Collaborative filtering is used to recommend items to a user without requiring a knowledge of the item itself and tends to outperform other techniques. However, collaborative filtering suffers from the cold-start problem, which occurs when an item has not yet been rated or a user has not rated any items. Incorporating …
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.
New algorithms for fair item allocation with limited copies.
problem Fair division of numerous items with few copies.
method Modeling as a contextual bandit problem with sub-linear regret guarantees.
result Proposed algorithms achieve sub-linear regret in fair item allocation.
We consider the problem of learning soft assignments of N items to K categories given two sources of information: an item-category similarity matrix, which encourages items to be assigned to categories they are similar to (and to not be assigned to categories they are dissimilar to), and an item-item similarity mat…
New methods improve recommendation accuracy for users and items with few ratings.
problem Skewed distribution and low ratings affect recommendation accuracy.
method Four matrix completion-based approaches: FARP, TMF, TMF + Dropout, IFWMF.
result Improved prediction accuracy for users and items with few ratings.
New algorithm reduces regret in fatigue-aware online recommendation.
problem Fatigue leads to user abandonment in online recommendation systems.
method Thompson Sampling for combinatorial bandits with fatigue model.
result Polynomial regret bound in number of items, outperforming naive approaches.
New estimators improve Rasch model item parameter estimation for sparse data.
problem Estimating item parameters in sparse Rasch model data.
method Random pairing maximum likelihood estimator (RP-MLE) and its bootstrapped variant (MRP-MLE).
result RP-MLE and MRP-MLE are minimax optimal and provide precise item parameter estimates.
Study ranking in generalized linear bandits with position and item dependencies.
problem Complex reward function due to position and item dependencies in recommendation systems.
method Model position and item dependencies, design UCB and Thompson Sampling algorithms.
result Generalizes existing studies in position dependencies and graph theory.
Generative methods for creating new items for user groups.
problem Creating new items for groups of users with varying preferences.
method Formalized joint problem, used VAE latent space for item generation and user group prediction.
result Generated items similar to highly desirable unobserved items.
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.
Gradient optimization improves preference elicitation for large item spaces.
problem Computational infeasibility of EVOI for large item spaces in recommender systems.
method Continuous formulation of EVOI as a differentiable network, optimized using gradient methods.
result Gradient-based EVOI optimization achieves state-of-the-art performance and scalability.
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.
This report clarifies the distribution of unique items in bootstrap samples.
problem Understanding the role of duplicate items in bootstrap samples.
method Analyzes the distribution of unique items in bootstrap samples and derives a heuristic for normal approximation.
result Derives a heuristic for when a normal approximation is permissible for the distribution of unique items in bootstrap samples.
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%.
There is much empirical evidence that item-item collaborative filtering works well in practice. Motivated to understand this, we provide a framework to design and analyze various recommendation algorithms. The setup amounts to online binary matrix completion, where at each time a random user requests a recommendation a…
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.
Seq2Slate models for ranking by predicting appealing item slates.
problem Ranking items in a slate to present a user appealing set of items.
method Sequence-to-sequence model that predicts the next best item to place on the slate.
result The model captures complex dependencies between items and learns from weak supervision.