803 citations · 2.6k across the 256 of their papers we have counts for
16 papers · 2 filters
Timely Communication in Federated Learning
Baturalp Buyukates, Sennur Ulukus
We consider a federated learning framework in which a parameter server (PS) trains a global model by using clients without actually storing the client data centrally at a cloud…
Timely Group Updating
Melih Bastopcu, Sennur Ulukus
We consider two closely related problems: anomaly detection in sensor networks and testing for infections in human populations. In both problems, we have nodes (sensors, humans…
Gradient Coding with Dynamic Clustering for Straggler Mitigation
Baturalp Buyukates, Emre Ozfatura, Sennur Ulukus +1
In distributed synchronous gradient descent (GD) the main performance bottleneck for the per-iteration completion time is the slowest \textit{straggling} workers. To speed up GD it…
Multi-Party Private Set Intersection: An Information-Theoretic Approach
Zhusheng Wang, Karim Banawan, Sennur Ulukus
We investigate the problem of multi-party private set intersection (MP-PSI). In MP-PSI, there are parties, each storing a data set over replicated and non…
Age of Information: An Introduction and Survey
Roy D. Yates, Yin Sun, D. Richard Brown +3
We summarize recent contributions in the broad area of age of information (AoI). In particular, we describe the current state of the art in the design and optimization of low-laten…
Coded Distributed Computing with Partial Recovery
Emre Ozfatura, Sennur Ulukus, Deniz Gunduz
Coded computation techniques provide robustness against straggling workers in distributed computing. However, most of the existing schemes require exact provisioning of the straggl…
Age-Based Coded Computation for Bias Reduction in Distributed Learning
Emre Ozfatura, Baturalp Buyukates, Deniz Gunduz +1
Coded computation can be used to speed up distributed learning in the presence of straggling workers. Partial recovery of the gradient vector can further reduce the computation tim…
Maximizing Information Freshness in Caching Systems with Limited Cache Storage Capacity
Melih Bastopcu, Sennur Ulukus
We consider a cache updating system with a source, a cache with limited storage capacity and a user. There are files. The source keeps the freshest versions of the files which…
Selective Encoding Policies for Maximizing Information Freshness
Melih Bastopcu, Baturalp Buyukates, Sennur Ulukus
An information source generates independent and identically distributed status update messages from an observed random phenomenon which takes distinct values based on a given p…
Straggler-aware Distributed Learning: Communication Computation Latency Trade-off
Emre Ozfatura, Sennur Ulukus, Deniz Gunduz
When gradient descent (GD) is scaled to many parallel workers for large scale machine learning problems, its per-iteration computation time is limited by the straggling workers. St…
Information Freshness in Cache Updating Systems
Melih Bastopcu, Sennur Ulukus
We consider a cache updating system with a source, a cache and a user. There are files. The source keeps the freshest version of the files which are updated with known rates $λ…
Semantic Private Information Retrieval
Sajani Vithana, Karim Banawan, Sennur Ulukus
We investigate the problem of semantic private information retrieval (semantic PIR). In semantic PIR, a user retrieves a message out of independent messages stored in repli…
Age of Information with Gilbert-Elliot Servers and Samplers
Baturalp Buyukates, Sennur Ulukus
We study age of information in a status updating system that consists of a single sampler, i.e., source node, that sends time-sensitive status updates to a single monitor node thro…
Partial Updates: Losing Information for Freshness
Melih Bastopcu, Sennur Ulukus
We consider an information updating system where a source produces updates as requested by a transmitter. The transmitter further processes these updates in order to generate $part…
Optimal Selective Encoding for Timely Updates
Melih Bastopcu, Baturalp Buyukates, Sennur Ulukus
We consider a system in which an information source generates independent and identically distributed status update packets from an observed phenomenon that takes possible valu…
Who Should Google Scholar Update More Often?
Melih Bastopcu, Sennur Ulukus
We consider a resource-constrained updater, such as Google Scholar, which wishes to update the citation records of a group of researchers, who have different mean citation rates (a…