activity
20162024
most citedOn the Complexity of Deterministic Nonsmooth and Nonconvex Optimization

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

collaborators

5 papers

cs.LG2024

Transfer Learning Beyond Bounded Density Ratios

Alkis Kalavasis, Ilias Zadik, Manolis Zampetakis

We study the fundamental problem of transfer learning where a learning algorithm collects data from some source distribution but needs to perform well with respect to a differe…

cs.DS2023

Sorting from Crowdsourced Comparisons using Expert Verifications

Ellen Vitercik, Manolis Zampetakis, David Zhang

We introduce a novel noisy sorting model motivated by the Just Noticeable Difference (JND) model from experimental psychology. The goal of our model is to capture the low quality o…

math.OC20223 cited

On the Complexity of Deterministic Nonsmooth and Nonconvex Optimization

Michael I. Jordan, Tianyi Lin, Manolis Zampetakis

In this paper, we present several new results on minimizing a nonsmooth and nonconvex function under a Lipschitz condition. Recent work shows that while the classical notion of Cla…

stat.ME20222 cited

Efficient Truncated Linear Regression with Unknown Noise Variance

Constantinos Daskalakis, Patroklos Stefanou, Rui Yao +1

Truncated linear regression is a classical challenge in Statistics, wherein a label, , and its corresponding feature vector, , are only…

cs.DS2016

Faster Sublinear Algorithms using Conditional Sampling

Themistoklis Gouleakis, Christos Tzamos, Manolis Zampetakis

A conditional sampling oracle for a probability distribution D returns samples from the conditional distribution of D restricted to a specified subset of the domain. A recent line…