New algorithm for online collaborative filtering using linear bandits and alternating least squares.
problem Online collaborative filtering with item recommendations over time.
method Combines linear bandits and alternating least squares for matrix factorization.
result Superior performance in cumulative regret and average cumulative NDCG over state-of-the-art algorithms.
New collaborative algorithm improves personalized mean estimation in online settings.
problem Online estimation of means from multiple, possibly overlapping distributions.
method Novel collaborative strategy for active querying and mean estimation.
result Algorithm improves mean estimates through communication among agents.
A new method for online personalized learning reduces gradient variance by dynamically selecting peers.
problem Online personalized decentralized learning with statistically heterogeneous clients.
method Gradient-based collaboration criterion allowing clients to dynamically select peers with similar gradients.
result The method acts as a variance reduction method, achieving optimal performance in certain conditions.
Study on collaborative vs. non-collaborative online and bandit convex optimization.
problem Minimizing average regret in distributed online and bandit convex optimization.
method Analyzes the impact of collaboration in adaptive and zeroth-order feedback settings.
result Collaboration is beneficial in high-dimensional federated online optimization with limited feedback.
OL4EL optimizes edge learning on resource-constrained servers.
problem Resource constraints on edge servers hinder effective distributed machine learning.
method Online Learning for EL (OL4EL) framework using budget-limited multi-armed bandit model.
result OL4EL significantly improves learning performance while conserving resources.
Distributed Collaborative Hashing improves recommendation efficiency in big data.
problem Efficiency in offline model training and online recommendation for collaborative filtering.
method Distributed Learning Framework + Hashing Technique.
result DCH model achieves comparable recommendation accuracy with fast convergence and real-time efficiency.
Hybrid VAE improves movie recommendation accuracy.
problem Improving personalized recommendations in online marketplaces.
method Combining movie embeddings from a sibling VAE network with user ratings for movie recommendation.
result Empirical evidence shows VAE network benefits from incorporating movie embeddings.
R package connects to OpenML for machine learning tasks and data sharing.
problem Efficiency and reproducibility in machine learning research.
method R package interface with OpenML platform.
result Enables easy data and task sharing, reproducibility, and collaboration.
New method learns decisions from collective preferences without individual covariates.
problem Making decisions online without individual covariates.
method Collaborative filtering, matrix completion bandit, ε-greedy policy, online gradient descent, inverse propensity weighting.
result Method outperforms benchmarks and reveals new discoveries.
Collaborative filtering (CF) allows the preferences of multiple users to be pooled to make recommendations regarding unseen products. We consider in this paper the problem of online and interactive CF: given the current ratings associated with a user, what queries (new ratings) would most improve the quality of the rec…
This work advances collaborative decision making by combining human and AI strengths in uncertainty quantification.
problem Current AI lacks robust decision-making capabilities under uncertainty, especially in high-stakes contexts.
method Introduces Human AI Collaborative Uncertainty Quantification (HACUQ) framework, formalizing AI-human collaboration and developing calibration algorithms.
result Optimal collaborative prediction sets follow a two-threshold structure, and online adaptation algorithms can adapt to evolving human behavior.
Study on online CF with occasional positive ratings, finds p_f impacts sample complexity.
problem Online CF with limited positive feedback.
method Probabilistic user model, online user-based CF algorithm analysis.
result Sample complexity reduced by 1/p_f for initial exploration.
Most traditional online learning algorithms are based on variants of mirror descent or follow-the-leader. In this paper, we present an online algorithm based on a completely different approach, tailored for transductive settings, which combines "random playout" and randomized rounding of loss subgradients. As an applic…
Algorithm helps first agent learn to collaborate with adaptive second agent in MDPs.
problem Designing a learning algorithm for the first agent to collaborate with an adaptive second agent in MDPs.
method Novel online learning algorithms for the first agent with a specific regret bound.
result Sub-linear regret of the first agent implies near-optimality of the joint return for smooth MDPs.
Despite the prevalence of collaborative filtering in recommendation systems, there has been little theoretical development on why and how well it works, especially in the "online" setting, where items are recommended to users over time. We address this theoretical gap by introducing a model for online recommendation sy…
Data science teams collaborate extensively, using various tools and stakeholders.
problem Lack of understanding in how data science workers collaborate in practice.
method Conducted an online survey with 183 data science workers.
result Data science teams are highly collaborative and use multiple tools and stakeholders.
Meta clustering categorizes learners for collaborative learning.
problem Filtering out unqualified collaborators in collaborative learning.
method Select-Exchange-Cluster (SEC) method to classify learners by their supervised functions.
result SEC can cluster learners into accurate collaboration sets and enhance single-learner performance.
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…
Paper develops a Bayesian HMF model for accurate dyadic data prediction.
problem Predicting unobserved dyadic data in various research areas.
method Integrates discrete and continuous modeling into a unified Heterogeneous Matrix Factorization model using Variational Bayesian method and online learning.
result The model outperforms state-of-the-art methods on large-scale collaborative filtering datasets.
Recommendation systems have been integrated into the majority of large online systems to filter and rank information according to user profiles. It thus influences the way users interact with the system and, as a consequence, bias the evaluation of the performance of a recommendation algorithm computed using historical…
Two efficient algorithms improve online item recommendation for large user-item matrices.
problem Low rank matrix completion in an online setting with noisy rewards.
method Phased algorithms extsc{PhasedClusterElim} and extsc{DeterminantElim} for item recommendation.
result Near-optimal per-user regret guarantees for item recommendation.
TSPRA integrates topics, sentiment, and user preference for better online review prediction and analysis.
problem Improving online review prediction and sentiment analysis accuracy.
method HDP-based model combining topics, sentiment, and user preference.
result Outperforms state-of-the-art model FLAME in rating prediction and sentiment analysis.
A new algorithm reduces communication costs for collaborative decision-making across clients.
problem Collaborative decision-making with sparse rewards and heterogeneous contexts.
method Federated Lasso algorithm for sparse linear contextual bandits.
result Achieves near-optimal regret with logarithmic communication costs.
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.
JPS improves joint policies for multi-agent collaboration in imperfect information games.
problem Learning good joint policies for multi-agent collaboration with imperfect information.
method Decomposes global changes to localized policy changes, iteratively improving joint policies without re-evaluating the entire game.
result JPS improves solutions provided by unilateral approaches and outperforms algorithms designed for collaborative policy learning.
Deep learning model improves personalized product recommendations.
problem Large-scale personalized recommendation systems with implicit feedback.
method Combines neural attention mechanisms and representation learning for efficient, high-coverage models.
result Significant performance improvements over alternative methods in offline and online settings.
Predicts whether online discussions will be productive or not.
problem Identifying wasteful discussions in group settings.
method Analyze conversational dynamics and linguistic cues.
result Linguistic cues and conversational patterns predict discussion productivity.
HybridSVD combines user and item info for efficient, flexible recommendations.
problem Lack of effective methods for incorporating both user and item side information in collaborative filtering.
method Hybrid algorithm using PureSVD with generalized singular value decomposition and cold start solution.
result Superior performance compared to similar hybrid models on various datasets.
SetRank tackles collaborative ranking from implicit feedback using setwise Bayesian approach.
problem Challenges in pairwise and listwise approaches for implicit feedback.
method SetRank is a novel setwise Bayesian approach that accommodates implicit feedback characteristics.
result SetRank outperforms state-of-the-art baselines on real-world datasets.
Study analyzes online abuse against women journalists and politicians on Twitter.
problem Online abuse against women journalists and politicians on Twitter.
method Crowdsourced analysis of a curated dataset of labeled tweets, accounting for variability in abuse perception.
result Technical backbone for raising awareness and improving social media standards.
While a user's preference is directly reflected in the interactive choice process between her and the recommender, this wealth of information was not fully exploited for learning recommender models. In particular, existing collaborative filtering (CF) approaches take into account only the binary events of user actions …
Collaborative learning in social networks improves multi-armed bandit performance.
problem Improving multi-armed bandit performance in a social network setting.
method Analyzed various policies and developed a simple learning algorithm based on dominating sets.
result Natural extensions of single-agent policies perform poorly in a network setting.
A new platform helps detect and manage pressure ulcers.
problem Detecting and managing pressure ulcers efficiently.
method Convolutional neural networks and transfer learning.
result Automated skin damage and pressure ulcer assessment tool.
Algorithm maximizes user rewards under per-item budget constraints.
problem Maximizing cumulative rewards in collaborative bandits with budget constraints.
method Collaborative algorithm B-LATTICE that clusters users and collaborates across groups.
result Achieves sub-linear regret bounds matching minimax bounds.
USTAR combines multiple social media modalities to model user-guided activities.
problem Lack of comprehensive spatiotemporal activity models using all social media modalities.
method Online learning method embedding locations, time, text, and users into a single space, incorporating NGTSM and GTSM records, and using collaborative filtering.
result USTAR significantly improves region and keyword retrieval compared to state-of-the-art methods.
The paper presents a machine learning approach to multidimensional item response theory.
problem Modeling and predicting student performance from assessment data.
method Inspired by collaborative filtering, the paper defines a general class of models using penalized joint maximum likelihood (JML) for estimation and cross-validation for model selection.
result The high-dimensional model fit to large and sparse data does not lend itself well to traditional factor interpretation.
Applying traditional collaborative filtering to digital publishing is challenging because user data is very sparse due to the high volume of documents relative to the number of users. Content based approaches, on the other hand, is attractive because textual content is often very informative. In this paper we describe …
DistGP models multi-robot mapping with distributed Gaussian process learning.
problem Collaborative mapping by multiple robots with limited local data.
method Sparse Gaussian process with factorisation and distributed training via GBP.
result DistGP achieves superior accuracy and robustness compared to DiNNO.
FedLCB-Q learns optimal policies from federated offline data with linear speedup.
problem Learning optimal policies from offline data with federated learning.
method Federated offline RL algorithm tailored for Q-learning, using local Q-function updates and central aggregation.
result Achieves linear speedup in sample complexity with collaboration among agents.
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.
Rating prediction is an important application, and a popular research topic in collaborative filtering. However, both the validity of learning algorithms, and the validity of standard testing procedures rest on the assumption that missing ratings are missing at random (MAR). In this paper we present the results of a us…
New approach for multitask learning over networks sharing a common latent feature.
problem Learning multiple tasks simultaneously in a distributed network.
method Assumes shared latent feature representation; develops distributed online algorithms.
result Unified framework for analyzing mean-square-error performance.
Study improves privacy-preserving online prediction from experts with speed-ups.
problem Privacy-preserving online prediction from experts with speed-ups.
method Differentially private federated online prediction algorithms.
result Achieves m-fold regret speed-up with low-loss expert in federated setting. Deep learning from manga posters improves anime and manga recommendations.
problem Predicting user preferences for cold-start anime and manga recommendations.
method BALSE model using Illustration2Vec to extract tag information from posters.
result BALSE model significantly improves recommendation quality, especially for less-known mangas.
New algorithms secure IoT edge computing from jamming attacks.
problem Secure mobile edge computing in IoT under jamming attacks.
method Online learning tools for developing SAVE-S and SAVE-A algorithms.
result Achieves sublinear regret without extra resources.
A new algorithm improves stochastic linear bandit performance using residual bootstrap.
problem Improving performance in stochastic linear bandit problems.
method Residual bootstrap exploration to estimate mean reward and pull the arm with the highest estimate.
result Proposed algorithm exttt{LinReBoot} achieves high-probability sub-linear regret under mild conditions.
New algorithms reduce communication costs in collaborative learning.
problem Reducing communication costs in collaborative learning.
method Distributed boosting and adaptation to classification noise.
result Communication-efficient algorithms for collaborative PAC learning robust to noise.
Survey shows firms still underutilize collaboration in procurement relationships.
problem Limited collaboration between purchasing firms and suppliers despite benefits.
method Survey of procurement professionals, structural equation modeling.
result Firms are not fully utilizing collaborative relationships.