6 citations · 11 across the 13 of their papers we have counts for
10 papers · 1 filter
Iterative Sketching for Secure Coded Regression
Neophytos Charalambides, Hessam Mahdavifar, Mert Pilanci +1
Linear regression is a fundamental and primitive problem in supervised machine learning, with applications ranging from epidemiology to finance. In this work, we propose methods fo…
Gradient Coding with Iterative Block Leverage Score Sampling
Neophytos Charalambides, Mert Pilanci, Alfred Hero
We generalize the leverage score sampling sketch for -subspace embeddings, to accommodate sampling subsets of the transformed data, so that the sketching approach is approp…
Securely Aggregated Coded Matrix Inversion
Neophytos Charalambides, Mert Pilanci, Alfred Hero
Coded computing is a method for mitigating straggling workers in a centralized computing network, by using erasure-coding techniques. Federated learning is a decentralized model fo…
Secure Linear MDS Coded Matrix Inversion
Neophytos Charalambides, Mert Pilanci, Alfred Hero
A cumbersome operation in many scientific fields, is inverting large full-rank matrices. In this paper, we propose a coded computing approach for recovering matrix inverse approxim…
Orthonormal Sketches for Secure Coded Regression
Neophytos Charalambides, Hessam Mahdavifar, Mert Pilanci +1
In this work, we propose a method for speeding up linear regression distributively, while ensuring security. We leverage randomized sketching techniques, and improve straggler resi…
Generalized Fractional Repetition Codes for Binary Coded Computations
Neophytos Charalambides, Hessam Mahdavifar, Alfred O. Hero
This paper addresses the gradient coding and coded matrix multiplication problems in distributed optimization and coded computing. We present a numerically stable binary coding met…
Approximate Weighted Coded Matrix Multiplication
Neophytos Charalambides, Mert Pilanci, Alfred Hero
One of the most common, but at the same time expensive operations in linear algebra, is multiplying two matrices and . With the rapid development of machine learning and inc…
Beyond the Guruswami-Sudan (and Parvaresh-Vardy) Radii: Folded Reed-Solomon, Multiplicity and Derivative Codes
Neophytos Charalambides
The classical family of Reed-Solomon codes consist of evaluations of polynomials over the finite field of degree less than , at distinct field elements. These…
Weighted Gradient Coding with Leverage Score Sampling
Neophytos Charalambides, Mert Pilanci, Alfred O. Hero
A major hurdle in machine learning is scalability to massive datasets. Approaches to overcome this hurdle include compression of the data matrix and distributing the computations.…
Numerically Stable Binary Gradient Coding
Neophytos Charalambides, Hessam Mahdavifar, Alfred O. Hero
A major hurdle in machine learning is scalability to massive datasets. One approach to overcoming this is to distribute the computational tasks among several workers. \textit{Gradi…