Paper-Conference

Efficient Distributed Learning with Sparsity

We propose a novel, efficient approach for distributed sparse learning with observations randomly partitioned across machines. In each round of the proposed method, worker machines …

avatar
Jialei Wang
•

Sketching Meets Random Projection in the Dual: A Provable Recovery Algorithm for Big and High-dimensional Data

Sketching techniques scale up machine learning algorithms by reducing the sample size or dimensionality of massive data sets, without sacrificing their statistical properties. In …

avatar
Jialei Wang
•

Distributed Multi-Task Learning

We consider the problem of distributed multi-task learning, where each machine learns a separate, but related, task. Specifically, each machine learns a linear predictor in …

avatar
Jialei Wang
•

Markov Network Estimation From Multi-attribute Data

avatar
Mladen Kolar
•