Search Results for author:
Found 33 papers, 12 papers with code
Fair Concurrent Training of Multiple Models in Federated Learning
We show how our fairness-based learning and incentive mechanisms impact training convergence and finally evaluate our algorithm with multiple sets of learning tasks on real world datasets.
TREACLE: Thrifty Reasoning via Context-Aware LLM and Prompt Selection
Recent successes in natural language processing have led to the proliferation of large language models (LLMs) by multiple providers.
Empowering Federated Learning with Implicit Gossiping: Mitigating Connection Unreliability Amidst Unknown and Arbitrary Dynamics
It consists of a parameter server and a possibly large collection of clients (e. g., in cross-device federated learning) that may operate in congested and changing environments.
CoRAST: Towards Foundation Model-Powered Correlated Data Analysis in Resource-Constrained CPS and IoT
Foundation models (FMs) emerge as a promising solution to harness distributed and diverse environmental data by leveraging prior knowledge to understand the complicated temporal and spatial correlations within heterogeneous datasets.
An LLM-Based Digital Twin for Optimizing Human-in-the Loop Systems
In this paper, we present a case study that employs LLM agents to mimic the behaviors and thermal preferences of various population groups (e. g. young families, the elderly) in a shopping mall.
DYNAMITE: Dynamic Interplay of Mini-Batch Size and Aggregation Frequency for Federated Learning with Static and Streaming Dataset
Federated Learning (FL) is a distributed learning paradigm that can coordinate heterogeneous edge devices to perform model training without sharing private data.
Adversarial Robustness Unhardening via Backdoor Attacks in Federated Learning
Our research, initially spurred by test-time evasion attacks, investigates the intersection of adversarial training and backdoor attacks within federated learning, introducing Adversarial Robustness Unhardening (ARU).
Intelligent Communication Planning for Constrained Environmental IoT Sensing with Reinforcement Learning
Internet of Things (IoT) technologies have enabled numerous data-driven mobile applications and have the potential to significantly improve environmental monitoring and hazard warnings through the deployment of a network of IoT sensors.
Intelligent Communication
Multi-agent Reinforcement Learning
+1
RGMComm: Return Gap Minimization via Discrete Communications in Multi-Agent Reinforcement Learning
This result enables us to recast multi-agent communication into a novel online clustering problem over the local observations at each agent, with messages as cluster labels and the upper bound on the return gap as clustering loss.
FedMLSecurity: A Benchmark for Attacks and Defenses in Federated Learning and Federated LLMs
This paper introduces FedSecurity, an end-to-end benchmark designed to simulate adversarial attacks and corresponding defense mechanisms in Federated Learning (FL).
Towards Bias Correction of FedAvg over Nonuniform and Time-Varying Communications
Specifically, in each round $t$, the link between the PS and client $i$ is active with probability $p_i^t$, which is $\textit{unknown}$ to both the PS and the clients.
GiPH: Generalizable Placement Learning for Adaptive Heterogeneous Computing
Careful placement of a computational application within a target device cluster is critical for achieving low application completion time.
FedML-HE: An Efficient Homomorphic-Encryption-Based Privacy-Preserving Federated Learning System
Federated Learning trains machine learning models on distributed devices by aggregating local model updates instead of local data.
FedRule: Federated Rule Recommendation System with Graph Neural Networks
Much of the value that IoT (Internet-of-Things) devices bring to ``smart'' homes lies in their ability to automatically trigger other devices' actions: for example, a smart camera triggering a smart lock to unlock a door.
FIRE: A Failure-Adaptive Reinforcement Learning Framework for Edge Computing Migrations
In edge computing, users' service profiles are migrated due to user mobility.
Characterizing Internal Evasion Attacks in Federated Learning
However, combining adversarial training with personalized federated learning frameworks increases relative internal attack robustness by 60% compared to federated adversarial training and performs well under limited system resources.
Hierarchical Conversational Preference Elicitation with Bandit Feedback
To achieve this, the recommender system conducts conversations with users, asking their preferences for different items or item categories.
Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms
Under this new condition, we propose a BCUCB-T algorithm with variance-aware confidence intervals and conduct regret analysis which reduces the $O(K)$ factor to $O(\log K)$ or $O(\log^2 K)$ in the regret bound, significantly improving the regret bounds for the above applications.
Faithful Explanations for Deep Graph Models
Second, our analytical and empirical results demonstrate that feature attribution methods cannot capture the nonlinear effect of edge features, while existing subgraph explanation methods are not faithful.
FedGCN: Convergence-Communication Tradeoffs in Federated Training of Graph Convolutional Networks
Methods for training models on graphs distributed across multiple clients have recently grown in popularity, due to the size of these graphs as well as regulations on keeping data where it is generated.
FedSoft: Soft Clustered Federated Learning with Proximal Local Updating
Traditionally, clustered federated learning groups clients with the same data distribution into a cluster, so that every client is uniquely associated with one data distribution and helps train a model for this distribution.
GCN-SE: Attention as Explainability for Node Classification in Dynamic Graphs
These works, however, do not fully address the challenge of flexibly assigning different importance to snapshots of the graph at different times, which depending on the graph dynamics may have more or less predictive power on the labels.
Combinatorial Multi-armed Bandits for Resource Allocation
In doing so, the decision maker should learn the value of the resources allocated for each user from feedback on each user's received reward.
Interpretable Clustering on Dynamic Graphs with Recurrent Graph Neural Networks
We characterize the optimal decay rate for each cluster and propose a clustering method that achieves almost exact recovery of the true clusters.
Can we Generalize and Distribute Private Representation Learning?
We study the problem of learning representations that are private yet informative, i. e., provide information about intended "ally" targets while hiding sensitive "adversary" attributes.
Reconstructing Actions To Explain Deep Reinforcement Learning
Feature attribution has been a foundational building block for explaining the input feature importance in supervised learning with Deep Neural Network (DNNs), but face new challenges when applied to deep Reinforcement Learning (RL). We propose a new approach to explaining deep RL actions by defining a class of \emph{action reconstruction} functions that mimic the behavior of a network in deep RL.
Online Competitive Influence Maximization
In this paper, we introduce a new Online Competitive Influence Maximization (OCIM) problem, where two competing items (e. g., products, news stories) propagate in the same network and influence probabilities on edges are unknown.
Towards Flexible Device Participation in Federated Learning
Traditional federated learning algorithms impose strict requirements on the participation rates of devices, which limit the potential reach of federated learning.
Network-Aware Optimization of Distributed Learning for Fog Computing
Unlike traditional federated learning frameworks, our method enables devices to offload their data processing tasks to each other, with these decisions determined through a convex data transfer optimization problem that trades off costs associated with devices processing, offloading, and discarding data points.
Distributed, Parallel, and Cluster Computing
Machine Learning on Volatile Instances
Due to the massive size of the neural network models and training datasets used in machine learning today, it is imperative to distribute stochastic gradient descent (SGD) by splitting up tasks such as gradient evaluation across multiple worker nodes.
Observe Before Play: Multi-armed Bandit with Pre-observations
We consider the stochastic multi-armed bandit (MAB) problem in a setting where a player can pay to pre-observe arm rewards before playing an arm in each round.
MOVI: A Model-Free Approach to Dynamic Fleet Management
Since DQNs scale poorly with a large number of possible dispatches, we streamline our DQN training and suppose that each individual vehicle independently learns its own optimal policy, ensuring scalability at the cost of less coordination between vehicles.
On the Real-time Vehicle Placement Problem
Motivated by ride-sharing platforms' efforts to reduce their riders' wait times for a vehicle, this paper introduces a novel problem of placing vehicles to fulfill real-time pickup requests in a spatially and temporally changing environment.
