FedRule uses graph neural networks to recommend rules for smart homes without centralizing data.
problem Manual rule setup for smart devices is inefficient and privacy-compromising.
method FedRule constructs user-specific graphs for rule recommendation, using federated learning to protect privacy.
result FedRule achieves comparable performance to centralized methods and outperforms others.
Federated multi-view matrix factorization learns from multiple data sources without centralizing user data.
problem Cold-start federated recommendations and multi-view data structure.
method Federated learning framework extended to multi-view matrix factorization.
result Federated multi-view matrix factorization outperforms simpler methods in cold-start federated recommendations.
Paper develops a robust federated recommendation system against poisoning attacks.
problem Low-cost poisoning attacks degrade federated recommendation systems' performance.
method Develops a robust learning strategy using gradients to filter out Byzantine clients.
result Empirically validated robust learning strategy on four datasets.
This paper analyzes privacy threats in federated matrix factorization.
problem Privacy threats in federated matrix factorization models.
method Categorizes federated matrix factorization into three types and analyzes privacy threats.
result This is the first study of privacy threats in federated matrix factorization.
Fed-FEARE model extracts rules from multiple agencies' data securely.
problem Data privacy and secure rule extraction across multiple agencies.
method Federated F-score based ensemble tree model.
result Model performance measures significantly improved with federated learning.
FPL allows users to control their data in federated top-N recommendation.
problem Data privacy in recommendation services.
method Federated Learning with learning to rank optimization.
result Users can control the amount of sensitive data shared with a central server.
Federated approach protects privacy while learning user patterns.
problem Protecting sensitive data in recommendation systems.
method Differentially private prototypes for global and local models.
result Local adaptation improves recommendation accuracy and relevance.
Paper addresses federated contextual bandits with encryption.
problem Building contextual bandits with vertically distributed data.
method Design of O3M encryption scheme for LinUCB and LinTS.
result Proposed protocols achieve good performance and privacy.
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 increasing interest in user privacy is leading to new privacy preserving machine learning paradigms. In the Federated Learning paradigm, a master machine learning model is distributed to user clients, the clients use their locally stored data and model for both inference and calculating model updates. The model upd…
FLARKO uses LLMs, KGs, and KTO to generate profitable, behaviorally aligned financial recommendations.
problem Financial recommendation systems often fail to account for behavioral and regulatory factors.
method FLARKO integrates LLMs, KGs, and KTO to generate profitable and behaviorally aligned recommendations.
result FLARKO consistently outperforms state-of-the-art recommendation baselines on behavioral alignment and joint profitability.
Explainability and effectiveness are two key aspects for building recommender systems. Prior efforts mostly focus on incorporating side information to achieve better recommendation performance. However, these methods have some weaknesses: (1) prediction of neural network-based embedding methods are hard to explain and …
FedConPE improves conversational recommender systems efficiency and privacy.
problem Efficiently eliciting user preferences in interactive systems with heterogeneous clients.
method Phase elimination-based federated conversational bandit algorithm with adaptive key term construction.
result Minimizes uncertainty across all dimensions in feature space and offers improved efficiency and privacy.
Study on incentivizing truthfulness in federated learning with heterogeneous data.
problem Manipulated updates in federated learning due to data heterogeneity.
method Formulated a game-theoretic approach to prevent clients from misreporting their gradient updates.
result Developed a payment rule that provably disincentivizes sending modified updates in federated learning.
PriRec preserves privacy in POI recommendation by keeping data and models on users' devices.
problem Privacy concerns in centralized POI recommendation models.
method Local differential privacy for sensitive data, secure decentralized gradient descent for linear models, secure aggregation for feature interactions.
result PriRec achieves comparable or better recommendation accuracy than FM while protecting user privacy.
New study tackles free-rider attacks in federated learning models.
problem Free-rider attacks compromise federated learning models by non-contributing to data updates.
method Theoretical and experimental analysis of iterative federated learning schemes, including FedAvg and FedProx.
result Formal guarantees for free-rider attacks to converge to aggregated models of fair participants.
Analyzes gaming in federated learning systems and provides design principles.
problem Gaming and cooperation in federated learning systems under partial observability.
method Developed an analytical framework to separate welfare-improving behavior from metric gaming.
result Derived threshold conditions for deterring harmful gaming and preserving cooperation.
Federated learning approach for binary matrix factorization.
problem Efficiently factorizing binary data distributed across stakeholders while maintaining privacy.
method Proximal optimization for federated learning of relaxed binary matrix factorization.
result Federated algorithm outperforms state-of-the-art methods in quality and efficacy.
Federated learning enables training collaborative machine learning models at scale with many participants whilst preserving the privacy of their datasets. Standard federated learning techniques are vulnerable to Byzantine failures, biased local datasets, and poisoning attacks. In this paper we introduce Adaptive Federa…
The paper uses machine learning to find causal rules from business process logs.
problem Discovering causal relationships in business process logs.
method Action rule mining followed by causal machine learning (uplift trees).
result Identifies treatments with high causal effect on outcomes.
New methods improve Byzantine robustness in distributed learning.
problem Existing robust aggregation rules fail in realistic scenarios.
method Introducing new robust iterative clipping procedure and worker momentum.
result First provably robust method for standard stochastic optimization.
Federated survival analysis outperforms local and centralized training, with RSF offering the best balance of discrimination, calibration, and robustness.
problem Survival analysis models require large, diverse cohorts but are limited by privacy regulations and lack of centralized data.
method Federated learning (FL) is used to train shared models without exchanging raw data.
result FL consistently outperforms local training and approaches, and occasionally exceeds centralized performance.
FedDuA adapts global learning rate for federated learning.
problem Slow convergence in federated learning due to dataset and parameter space heterogeneity.
method FedDuA uses mirror descent to adaptively select global learning rate based on inter-client and coordinate-wise heterogeneity.
result FedDuA achieves minimax optimal convergence for convex objectives and outperforms baselines in various settings.
The problem of detecting terms that can be interesting to the advertiser is considered. If a company has already bought some advertising terms which describe certain services, it is reasonable to find out the terms bought by competing companies. A part of them can be recommended as future advertising terms to the compa…
Paper proposes incentives for federated learning to ensure truthful contributions.
problem Ensuring truthful contributions from decentralized users in federated learning.
method Introduces a scoring rule based framework to incentivize truthful reporting of local hypotheses at a Bayesian Nash Equilibrium.
result Proposed solution verified using MNIST and CIFAR-10 datasets, showing decreasing scores for low-quality hypotheses.
Paper proposes FMAB framework for federated learning with two models: approximate and exact.
problem Uncertainty in client sampling and suboptimality gap in federated multi-armed bandits.
method Developed a general FMAB framework and two specific models (approximate and exact), proposing Fed2-UCB for the approximate model.
result Achieved O(log(T)) regret in the approximate model and order-optimal regret in the exact model.
Federated learning was proposed with an intriguing vision of achieving collaborative machine learning among numerous clients without uploading their private data to a cloud server. However, the conventional framework requires each client to leverage the full model for learning, which can be prohibitively inefficient fo…
Unified analysis of FL with arbitrary client participation.
problem Challenges of intermittent client availability and efficiency in FL.
method Introduces a generalized FedAvg and novel analysis capturing client participation.
result Unified convergence upper bounds for various participation patterns.
A new method for decision tree selection in recommendation systems.
problem Feature-based selection of a single tree from an ensemble for dynamic interpretation.
method A multi-armed contextual bandit recommendation framework that trains a system on top of Random Forests to identify the most relevant tree.
result The dynamic method outperforms an independent CART tree and is comparable to Random Forest in predictive performance.
A new energy-efficient pruning method for federated learning.
problem Energy inefficiency in gradient sparsification for federated learning.
method Formalized energy-constrained projection problem and proposed Cost-Weighted Magnitude Pruning (CWMP).
result CWMP optimally balances performance and energy efficiency in federated learning.
We tackle the problem of building explainable recommendation systems that are based on a per-user decision tree, with decision rules that are based on single attribute values. We build the trees by applying learned regression functions to obtain the decision rules as well as the values at the leaf nodes. The regression…
Fuses ITRs for primary and secondary outcomes to minimize harm.
problem Learn an ITR maximizing primary outcome while minimizing harm to secondary outcomes.
method Introduces fusion penalty to encourage similar recommendations for different outcomes. Two algorithms estimate the ITR using surrogate loss functions.
result Agreement rate between primary and secondary optimal ITRs converges faster than ignoring secondary outcomes.
Homeowners around the world elevate houses to manage flood risks. Deciding how high to elevate a house poses a nontrivial decision problem. The U.S. Federal Emergency Management Agency (FEMA) recommends elevating existing houses to the Base Flood Elevation (the elevation of the 100-yr flood) plus a freeboard. This reco…
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.
FSL-BDP models time-to-default without centralizing data, improving privacy mechanisms in federated settings.
problem Traditional credit risk models ignore default timing and violate data-protection rules.
method Federated Survival Learning with Bayesian Differential Privacy (FSL-BDP).
result FSL-BDP improves privacy mechanisms in federated settings, outperforming classical DP in most clients.
We quantify content availability and user discovery opportunities in recommender systems.
problem Determining the maximum probability of recommending content to users.
method Stochastic reachability to compute upper bounds on recommendation likelihood.
result Reachability metrics can detect biases and diagnose user discovery limitations.
Symmetric CNNs improve sequential recommendation and protein structure prediction.
problem Improving prediction accuracy in sequential recommendation and protein structure inference.
method Developed a CNN architecture that preserves symmetry in convolutional layers, using parameterized convolutional kernels.
result Symmetric structured CNNs achieve better performance with fewer parameters.
User and item features of side information are crucial for accurate recommendation. However, the large number of feature dimensions, e.g., usually larger than 10^7, results in expensive storage and computational cost. This prohibits fast recommendation especially on mobile applications where the computational resource …
SOAR generates rules for both positive and negative classes in binary classification.
problem Lack of interpretability in machine learning models for binary classification.
method Extends or-of-and classification technique to both positive and negative classes.
result Competitive classification performance with simulated-annealing optimization.
SupRB learns rules for continuous decision problems from examples.
problem Learning from continuous choices and explaining decisions to operators.
method SupRB is a supervised rule-based learning system for multi-dimensional continuous problems.
result SupRB provides human-understandable rules for optimal choices and quality predictions.
RL algorithms with medical integration improve personalized treatment recommendations.
problem Developing effective personalized treatment strategies for chronic diseases.
method Integrating medical knowledge into RL algorithms for DTR.
result Enhanced treatment recommendations with increased confidence.
It is crucial to provide compatible treatment schemes for a disease according to various symptoms at different stages. However, most classification methods might be ineffective in accurately classifying a disease that holds the characteristics of multiple treatment stages, various symptoms, and multi-pathogenesis. More…
This study assesses the impact of non-IID data in federated learning, revealing significant performance drops.
problem The impact of non-IID data on federated learning model performance.
method Empirical analysis using Hellinger Distance to measure distribution differences, benchmarking four strategies for handling non-IID data.
result Significant performance drops occur at specific HD thresholds, especially for extreme non-IIDness.
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…
Neural Logic Reasoning integrates deep learning and symbolic logic for better prediction tasks.
problem Lack of cognitive reasoning in deep neural networks limits their ability to solve complex prediction tasks.
method Proposes Logic-Integrated Neural Network (LINN) that learns logical operations and conducts propositional logical reasoning.
result LINN significantly outperforms state-of-the-art recommendation models in Top-K recommendation.
A method to robustly federate learning with non-i.i.d. data and Byzantine workers.
problem Byzantine workers sending malicious messages in federated learning with non-i.i.d. data.
method Resampling strategy to reduce inner and outer variation, stochastic average gradient, robust geometric median aggregation.
result The method reaches a neighborhood of the optimal solution at a linear convergence rate and learning error depends on the number of Byzantine workers.
In distributed reinforcement learning, it is common to exchange the experience memory of each agent and thereby collectively train their local models. The experience memory, however, contains all the preceding state observations and their corresponding policies of the host agent, which may violate the privacy of the ag…
Spiking Neural Networks (SNNs) offer a promising alternative to conventional Artificial Neural Networks (ANNs) for the implementation of on-device low-power online learning and inference. On-device training is, however, constrained by the limited amount of data available at each device. In this paper, we propose to mit…