Federated learning framework extended for personalizing global models.
problem Evaluate personalization strategies for global models on-device.
method Extend federated learning framework, develop tools for analysis and evaluation.
result Personalization yields significant benefits for a large user population.
Framework for discovering treatment benefits in user segments.
problem Discovering differential impacts of treatments across user subgroups.
method Combines causal inference and machine learning for user segment discovery.
result Unified approach for treatment benefit discovery and assignment.
RIVCoin stabilizes cryptocurrency portfolios through a DAO and redistributes income.
problem Stabilizing cryptocurrency value and aligning incentives for all users.
method Decentralized DAO, diversified reserves, and income redistribution.
result Aligns incentives for wealthier users to stabilize smaller users' risk.
Look-ahead reasoning helps predict strategic user behavior on learning platforms.
problem Optimization criteria on learning platforms do not reflect users' priorities.
method Formalized level-k thinking and contrasted collective and selfish behavior.
result Coordination benefits users but does not offer higher-level reasoning advantages in the long run.
MTFL improves UA and speeds convergence in personalised DNNs on edge devices.
problem Non-IID user data harms FL convergence and global UA is not always the goal.
method Introduces non-federated BN layers into federated DNNs for personalised training.
result MTFL reduces UA rounds by up to 5x and convergence time by up to 3x.
The paper proposes a method to learn user representations invariant to social media behavior changes.
problem Difficulty in comparing users over time due to evolving behavior.
method Learning a mapping from user activity to a vector space capturing invariant features.
result The learned mapping enables efficient comparisons of users not seen at training time.
A new framework promotes trustworthy user-generated datasets by ensuring no user benefits from misreporting.
problem Incentivizing data misreporting in user-generated datasets.
method Proposes Licchavi, a global and personalized learning framework with provable strategyproofness guarantees.
result Proves that no user can gain much by replying to Licchavi's queries with deviated answers.
We consider the problem of personalization of online services from the viewpoint of ad targeting, where we seek to find the best ad categories to be shown to each user, resulting in improved user experience and increased advertisers' revenue. We propose to address this problem as a task of ranking the ad categories dep…
Fairness in AI decisions for users with varying performance.
problem Ensuring fairness in AI decisions for users with different performance levels.
method Contextual Multi-Armed Bandit algorithm with fairness constraints.
result Accounting for user contexts improves fairness in AI decisions.
Users increasingly rely on social media feeds for consuming daily information. The items in a feed, such as news, questions, songs, etc., usually result from the complex interplay of a user's social contacts, her interests and her actions on the platform. The relationship of the user's own behavior and the received fee…
New algorithm balances user reward and statistical inference by mixing TS with UR based on difference size.
problem Combining statistical inference with user reward in adaptive experiments.
method TS-PostDiff algorithm that uses UR when differences are small and TS when large.
result TS-PostDiff reduces false positives and increases statistical power for small differences, while maximizing reward for large ones.
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…
Model user preferences for conversational LLMs using weak rewards.
problem Lack of persistent user models in conversational LLMs leading to repeated user restatements.
method Vector-Adapted Retrieval Scoring (VARS) framework that updates user vectors online from weak scalar rewards.
result Full VARS agent achieves strongest overall performance, matches strong Reflection baseline in task success, and reduces user effort.
Online review communities are dynamic as users join and leave, adopt new vocabulary, and adapt to evolving trends. Recent work has shown that recommender systems benefit from explicit consideration of user experience. However, prior work assumes a fixed number of discrete experience levels, whereas in reality users gai…
Improved multi-user VoiceFilter-Lite model for speech recognition.
problem Limited performance of multi-user VoiceFilter-Lite models.
method Dual learning rate schedule and FiLM for feature conditioning.
result Closed the performance gap between multi-user and single-user VoiceFilter-Lite models.
Proposes a framework for extracting consistent physiological features across users.
problem Variability of biosignals across different users and tasks.
method Adversarial feature extractor for disentangled universal representations.
result Up to 8.8% improvement in average accuracy of classification.
Modeling social network activity through user and topic interaction.
problem Understanding complex dynamics of opinion formation in social networks.
method Mixture of Interacting Cascades (MIC) model of marked multidimensional Hawkes processes.
result MIC achieves superior performance in modeling information cascade spread.
Paper uses LightGBM for mobile user credit assessment.
problem Improving credit evaluation methods for communication operators.
method Data preprocessing, feature engineering, multiple machine learning models integration.
result Established a suitable fusion model for operator user credit evaluation.
We consider the fully decentralized machine learning scenario where many users with personal datasets collaborate to learn models through local peer-to-peer exchanges, without a central coordinator. We propose to train personalized models that leverage a collaboration graph describing the relationships between user per…
New algorithm for federated learning without a central server.
problem Federated learning in unidirectional trust social networks.
method Central Server Free Federated Learning (OPS) method.
result Users can benefit from communication with trusted users in federated learning.
Information systems experience an ever-growing volume of unstructured data, particularly in the form of textual materials. This represents a rich source of information from which one can create value for people, organizations and businesses. For instance, recommender systems can benefit from automatically understanding…
An important metric of users' satisfaction and engagement within on-line streaming services is the user session length, i.e. the amount of time they spend on a service continuously without interruption. Being able to predict this value directly benefits the recommendation and ad pacing contexts in music and video strea…
Protects user privacy in models using optional personal data.
problem Ensuring fairness for users who opt-out of data sharing.
method Formalizes protection requirements, introduces Protected User Consent (PUC), devises data augmentation strategy.
result PUC-compliant models can improve performance without disadvantaging opt-out users.
Deep learning identifies smartphone users from motion sensor data.
problem Smartphone user identification using motion sensor signals.
method Transformed motion signals into images, trained CNN for classification, used SVM for few-shot identification.
result CNN achieved 89.75% multi-class user classification and 96.72% few-shot user identification accuracy.
Personalized federated learning adapts models to each user's data.
problem Training models across users without data exchange leads to a common model, not personalized.
method Develops a personalized federated learning approach using Model-Agnostic Meta-Learning (MAML).
result Personalized models can be adapted by a few gradient descent steps on local data.
TPG-DNN predicts user intent using GRU loss and multi-task learning.
problem Improving user experience and shopping efficiency in e-commerce.
method Adaptive GRU loss function with multi-task learning.
result TPG-DNN outperforms existing CTR models on Taobao datasets.
Optimizes user marketing campaigns to balance cost and effectiveness.
problem Lack of methods to optimize marketing campaigns considering cost and effectiveness.
method Proposes a treatment effect optimization algorithm using deep learning to balance cost and effectiveness.
result Demonstrates superior performance in cost-efficiency and real-world business value.
Response time improves alignment with diverse human preferences.
problem Standard aggregation of feedback ignores heterogeneity and anonymity.
method Augmenting feedback with response time data and modeling decisions with DDM.
result Estimator of heterogeneous preferences converges to true average preference.
This note explores probabilistic sampling weighted by uncertainty in active learning. This method has been previously used and authors have tangentially remarked on its efficacy. The scheme has several benefits: (1) it is computationally cheap, (2) it can be implemented in a single-pass streaming fashion which is a ben…
CHAMELEON uses RNNs to recommend news sequences better than other methods.
problem Improving news recommendation accuracy and catalog coverage.
method Hybrid meta-architecture CHAMELEON with RNNs for sequence modeling and side information.
result Significantly higher recommendation accuracy and catalog coverage.
We study an online multi-task learning setting, in which instances of related tasks arrive sequentially, and are handled by task-specific online learners. We consider an algorithmic framework to model the relationship of these tasks via a set of convex constraints. To exploit this relationship, we design a novel algori…
Suppose that we wish to estimate a user's preference vector w from paired comparisons of the form "does user w prefer item p or item q?," where both the user and items are embedded in a low-dimensional Euclidean space with distances that reflect user and item similarities. Such observations arise in numerous se…
Paper trains models to resist string transformations.
problem Vulnerability of NLP models to adversarial string transformations.
method Combines search and abstraction techniques for robust training.
result Trained models resist combinations of user-defined transformations.
This paper optimizes clustering interpretability by balancing value and user-defined features.
problem Generating interpretable clusters in graph data.
method Proposes a β-interpretable clustering algorithm that ensures at least β fraction of nodes share the same feature value.
result Empirical demonstration of the benefits of the proposed approaches in generating interpretable clusters.
Traditional activity recognition systems work on the basis of training, taking a fixed set of sensors into account. In this article, we focus on the question how pattern recognition can leverage new information sources without any, or with minimal user input. Thus, we present an approach for opportunistic activity reco…
New algorithm speeds up user preference learning in conversational contexts.
problem Limited performance of existing conversational contextual bandit approaches.
method Proposes ConLinUCB framework and two algorithms, ConLinUCB-BS and ConLinUCB-MCR, with explorative key-term selection.
result Proves tighter regret bounds and achieves significant computational efficiency improvements.
Human behavior expression and experience are inherently multi-modal, and characterized by vast individual and contextual heterogeneity. To achieve meaningful human-computer and human-robot interactions, multi-modal models of the users states (e.g., engagement) are therefore needed. Most of the existing works that try t…
End-to-end dialogue model learns from joint embeddings and user intent.
problem Challenges in reasoning and incorporating state-full knowledge in goal-oriented dialogues.
method Proposes an RNN-based end-to-end encoder-decoder architecture trained with joint embeddings and multi-task learning.
result Improves task-oriented dialogue system performance as shown by BLEU score evaluation.
Stablecoins promise to bridge fiat currencies with the world of cryptocurrencies. They provide a way for users to take advantage of the benefits of digital currencies, such as ability to transfer assets over the internet, provide assurance on minting schedules and scarcity, and enable new asset classes, while also part…
Decentralized Online Learning (online learning in decentralized networks) attracts more and more attention, since it is believed that Decentralized Online Learning can help the data providers cooperatively better solve their online problems without sharing their private data to a third party or other providers. Typical…
Adversarial transfer learning improves stress assessment across users.
problem Transfer learning challenges in physiological biosignals.
method Disentangled nuisance-robust representations using adversarial networks.
result Adversarial framework enhances cross-subjects stress assessment.
LIMEADE improves AI advice for opaque models, enhancing accuracy and user satisfaction.
problem Lack of advice methods for opaque AI models.
method Develops a general framework to translate advice into model updates.
result Improves accuracy and user satisfaction compared to baselines.
Paper examines vulnerabilities in data-driven pricing schemes.
problem Vulnerability of clustering-oriented pricing schemes to malicious user behavior.
method Defined a notion of disguising to identify strategic behaviors of malicious users, characterized sensitivity zones to evaluate malicious user percentages, conducted cost benefit analysis.
result Concluded with a vulnerability analysis of data-driven pricing schemes.
Mixed likelihood GPs improve model performance in human-in-the-loop experiments.
problem Lack of auxiliary information in traditional GPs for human responses.
method Propose mixed likelihood variational GPs to leverage auxiliary information.
result Modeling performance improvements across diverse applications.
OMIC improves matrix completion with orthonormal side information and nuclear-norm regularization.
problem Matrix completion with improved interpretability and adaptability.
method OMIC combines orthonormal side information and nuclear-norm regularization, optimized by a converging algorithm.
result OMIC outperforms state-of-the-art methods in synthetic and real-world datasets.
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…
Uplift modeling is an emerging machine learning approach for estimating the treatment effect at an individual or subgroup level. It can be used for optimizing the performance of interventions such as marketing campaigns and product designs. Uplift modeling can be used to estimate which users are likely to benefit from …
DeepCMC compresses CSI for massive MIMO systems, reducing overhead and improving performance.
problem High CSI overhead in massive MIMO systems limits spectral efficiency.
method Deep learning-based fully convolutional neural network with residual layers and entropy coding.
result DeepCMC outperforms state-of-the-art schemes in CSI reconstruction quality for the same compression rate.