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.
Caratheodory's axiom limits arbitrage in resource-limited systems.
problem Non-arbitrage constraints in resource-limited financial systems.
method Preserving Caratheodory's axiom in resource-limited systems.
result Exponential family is the necessary geometric structure for both thermodynamics and finance.
A new algorithm for resource-aware multi-armed bandits minimizes regret.
problem Optimizing resource usage in a multi-armed bandit problem with censored observations.
method UCB-inspired online learning algorithm with theoretical regret analysis.
result The proposed algorithm outperforms standard multi-armed bandit algorithms in simulations.
Survey of knowledge distillation for resource-limited devices.
problem Deploying large deep learning models on resource-limited devices.
method Knowledge distillation using a smaller model trained with information from a larger model.
result A new metric (distillation metric) for comparing different knowledge distillation algorithms.
OpTorch optimizes deep learning for resource-limited environments.
problem Resource constraints in deep learning training.
method Optimized deep learning pipelines in training time and memory.
result Achieved similar accuracy to existing libraries with reduced memory usage.
Paper proposes a new binary quantization method for faster DNN inference.
problem Accelerating deep neural network inference on resource-limited devices.
method Quantized Compressed Sensing (QCS) for binary quantization.
result The proposed method preserves benefits of standard methods while reducing quantization error.
Unified framework for accelerating DNNs on resource-limited platforms.
problem Accelerating DNN execution on resource-limited platforms.
method Block-based pruning framework with reweighted regularization.
result First universal framework for both CNNs and RNNs with real-time acceleration and no accuracy compromise.
The paper examines efficient algorithms for linear regression over resource-limited networks.
problem Efficient communication in distributed learning over resource-limited networks.
method Developed algorithms for communication-efficient learning of linear regression tasks.
result The algorithms enable a tradeoff between communication and learning with theoretical performance guarantees.
We develop model free PAC performance guarantees for multiple concurrent MDPs, extending recent works where a single learner interacts with multiple non-interacting agents in a noise free environment. Our framework allows noisy and resource limited communication between agents, and develops novel PAC guarantees in this…
A new RNN architecture reduces model size and improves performance.
problem Overparameterization and resource limitations in RNNs.
method Jointly encodes weight matrices using tensor-train factorization.
result Reduces model size by several orders of magnitude without sacrificing performance.
Modeling alignment as resource-limited cognitive processes, researchers derive performance bounds.
problem Systematic deviations in feedback-based alignment of large language models.
method Modeling alignment as a two-stage cascade UoHoY given S, with cognitive and total capacities. result Capacity-coupled Alignment Performance Interval derived from Fano and PAC-Bayes bounds.
This paper investigates compression techniques for deep neural networks to reduce their size without sacrificing performance.
problem Compression of large deep neural networks for resource-limited platforms.
method Weight pruning, quantization, and lossless weight matrix representations based on source coding.
result Achieved up to 165 times compression rate while maintaining or improving model performance.
Convolutional Neural Network (CNN) based Deep Learning (DL) has achieved great progress in many real-life applications. Meanwhile, due to the complex model structures against strict latency and memory restriction, the implementation of CNN models on the resource-limited platforms is becoming more challenging. This work…
Unified framework for constrained online decision-making.
problem Sequential decisions under stage-wise feasibility constraints.
method Upper counterfactual confidence bounds and generalized eluder dimension.
result Principled foundation for constrained sequential decision-making.
The aim of this work is to address the question of whether we can in principle design rational decision-making agents or artificial intelligences embedded in computable physics such that their decisions are optimal in reasonable mathematical senses. Recent developments in rare event probability estimation, recursive ba…
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.
A new method prunes neural networks faster and more efficiently.
problem Reducing training time and memory usage for neural networks.
method Set-based Task-Adaptive Meta Pruning (STAMP) that meta-learns a pruning mask.
result Significantly improved compression rates and faster training speed.
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…
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.
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 …
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.
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.
The goal of recommendation is to show users items that they will like. Though usually framed as a prediction, the spirit of recommendation is to answer an interventional question---for each user and movie, what would the rating be if we "forced" the user to watch the movie? To this end, we develop a causal approach to …
Many businesses are using recommender systems for marketing outreach. Recommendation algorithms can be either based on content or driven by collaborative filtering. We study different ways to incorporate content information directly into the matrix factorization approach of collaborative filtering. These content-booste…
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.
Paper optimizes recommendation systems for long-term business metrics.
problem Short-term reward optimization ignores long-term business metrics.
method Introduced a framework for modeling long-term rewards in RecoGym.
result Proposed a simple extension leading to state-of-the-art results.
Proposes using frequent sequences to improve sequential recommendation models.
problem Combining user history and recent actions for personalized recommendations.
method Uses frequent sequences to identify relevant parts of user history, embedding items based on preferences and dynamics in a unified metric model.
result Outperforms state-of-the-art methods, especially on sparse datasets.
CLEAR learns causal graphs from attention in recommender systems to explain user behavior.
problem Understanding why specific recommendations are made in recommender systems.
method CLEAR learns session-specific causal graphs from attention in pre-trained neural recommenders, addressing latent confounders.
result CLEAR provides counterfactual explanations that are shorter and more effective than naive methods.
The majority of recommender systems are designed to recommend items (such as movies and products) to users. We focus on the problem of recommending buyers to sellers which comes with new challenges: (1) constraints on the number of recommendations buyers are part of before they become overwhelmed, (2) constraints on th…
Paper proposes unbiased learning for recommendation causal effects.
problem Estimating the causal effect of recommendation when the ground truth is unobservable.
method Inverse propensity scoring technique to construct unbiased estimators, followed by empirical risk minimization with propensity capping.
result The proposed method outperforms other biased learning methods in various settings.
Negative user preference is an important context that is not sufficiently utilized by many existing recommender systems. This context is especially useful in scenarios where the cost of negative items is high for the users. In this work, we describe a new recommender algorithm that explicitly models negative user prefe…
Improves recommender systems using mathematical principles.
problem Accuracy and speed of recommender systems.
method Explains and analyzes mathematical principles and algorithms.
result Describes the strengths and weaknesses of mathematical distance methods.