Manuel Fernández

most citedTight Kernel Query Complexity of Kernel Ridge Regression and Kernel

k

-means Clustering

2 citations · 3 across the 3 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2019

Graph Spanners in the Message-Passing Model

Manuel Fernandez, David P. Woodruff, Taisuke Yasuda

Graph spanners are sparse subgraphs which approximately preserve all pairwise shortest-path distances in an input graph. The notion of approximation can be additive, multiplicative…

cs.DS2019

The Query Complexity of Mastermind with $ℓ_{p}$ Distances

Manuel Fernandez, David P. Woodruff, Taisuke Yasuda

Consider a variant of the Mastermind game in which queries are $ℓ_{p}$ distances, rather than the usual Hamming distance. That is, a codemaker chooses a hidden vector $\mathbf{y}\…

cs.DS2019★ 2 cited

Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel $k$ -means Clustering

Manuel Fernandez, David P. Woodruff, Taisuke Yasuda

We present tight lower bounds on the number of kernel evaluations required to approximately solve kernel ridge regression (KRR) and kernel $k$ -means clustering (KKMC) on $n$ input…

Graph Spanners in the Message-Passing Model

The Query Complexity of Mastermind with ℓp​ Distances

Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel k-means Clustering

The Query Complexity of Mastermind with $ℓ_{p}$ Distances

Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel $k$ -means Clustering