activity
20142025
most citedFederated Learning Under Intermittent Client Availability and Time-Varying Communication Constraints

62 citations · 170 across the 44 of their papers we have counts for

collaborators
Showing 2019Show all

7 papers · 1 filter

cs.LG2019

Evolutionary Clustering via Message Passing

Natalia M. Arzeno, Haris Vikalo

We are often interested in clustering objects that evolve over time and identifying solutions to the clustering problem for every time step. Evolutionary clustering provides insigh…

cs.LG2019★ 5 cited

A Study of the Learnability of Relational Properties: Model Counting Meets Machine Learning (MCML)

Muhammad Usman, Wenxi Wang, Kaiyuan Wang +3

This paper introduces the MCML approach for empirically studying the learnability of relational properties that can be expressed in the well-known software design language Alloy. A…

cs.SI2019

ComHapDet: A Spatial Community Detection Algorithm for Haplotype Assembly

Abishek Sankararaman, Haris Vikalo, François Baccelli

Background: Haplotypes, the ordered lists of single nucleotide variations that distinguish chromosomal sequences from their homologous pairs, may reveal an individual's susceptibil…

q-bio.GN2019

A Graph Auto-Encoder for Haplotype Assembly and Viral Quasispecies Reconstruction

Ziqi Ke, Haris Vikalo

Reconstructing components of a genomic mixture from data obtained by means of DNA sequencing is a challenging problem encountered in a variety of applications including single indi…

cs.LG2019

Identifying Sparse Low-Dimensional Structures in Markov Chains: A Nonnegative Matrix Factorization Approach

Mahsa Ghasemi, Abolfazl Hashemi, Haris Vikalo +1

We consider the problem of learning low-dimensional representations for large-scale Markov chains. We formulate the task of representation learning as that of mapping the state spa…

cs.DM2019

Performance-Complexity Tradeoffs in Greedy Weak Submodular Maximization with Random Sampling

Abolfazl Hashemi, Haris Vikalo, Gustavo de Veciana

Many problems in signal processing and machine learning can be formalized as weak submodular optimization tasks. For such problems, a simple greedy algorithm (\textsc{Greedy}) is g…