activity
20212026
most citedPotential Function-based Framework for Making the Gradients Small in Convex and Min-Max Optimization

7 citations · 7 across the 15 of their papers we have counts for

collaborators
Showing cs.LGShow all

11 papers · 1 filter

cs.LG2026

Efficiently Learning Drifting Halfspaces with Massart Noise

Mingchen Ma, Guyang Cao, Jelena Diakonikolas +1

We study the problem of learning a drifting concept in the presence of Massart noise. In this framework, an online learner has access to a history of independent samples whose labe…

cs.LG2026

Robust Learning of a Group DRO Neuron

Guyang Cao, Shuyao Li, Sushrut Karmalkar +1

We study the problem of learning a single neuron under standard squared loss in the presence of arbitrary label noise and group-level distributional shifts, for a broad family of c…

cs.LG2025

Robustly Learning Monotone Single-Index Models

Puqian Wang, Nikos Zarifis, Ilias Diakonikolas +1

We consider the basic problem of learning Single-Index Models with respect to the square loss under the Gaussian distribution in the presence of adversarial label noise. Our main c…

cs.LG2025

Distributionally Robust Optimization with Adversarial Data Contamination

Shuyao Li, Ilias Diakonikolas, Jelena Diakonikolas

Distributionally Robust Optimization (DRO) provides a framework for decision-making under distributional uncertainty, yet its effectiveness can be compromised by outliers in the tr…

cs.LG2025

Robustly Learning Monotone Generalized Linear Models via Data Augmentation

Nikos Zarifis, Puqian Wang, Ilias Diakonikolas +1

We study the task of learning Generalized Linear models (GLMs) in the agnostic model under the Gaussian distribution. We give the first polynomial-time algorithm that achieves a co…

cs.LG2024

Learning a Single Neuron Robustly to Distributional Shifts and Adversarial Label Noise

Shuyao Li, Sushrut Karmalkar, Ilias Diakonikolas +1

We study the problem of learning a single neuron with respect to the -loss in the presence of adversarial distribution shifts, where the labels can be arbitrary, and the goa…

cs.LG2024

Sample and Computationally Efficient Robust Learning of Gaussian Single-Index Models

Puqian Wang, Nikos Zarifis, Ilias Diakonikolas +1

A single-index model (SIM) is a function of the form , where is a known link function and …

cs.LG2024

Robustly Learning Single-Index Models via Alignment Sharpness

Nikos Zarifis, Puqian Wang, Ilias Diakonikolas +1

We study the problem of learning Single-Index Models under the loss in the agnostic model. We give an efficient learning algorithm, achieving a constant factor approximatio…

cs.LG2023

Near-Optimal Bounds for Learning Gaussian Halfspaces with Random Classification Noise

Ilias Diakonikolas, Jelena Diakonikolas, Daniel M. Kane +2

We study the problem of learning general (i.e., not necessarily homogeneous) halfspaces with Random Classification Noise under the Gaussian distribution. We establish nearly-matchi…

cs.LG2023

Information-Computation Tradeoffs for Learning Margin Halfspaces with Random Classification Noise

Ilias Diakonikolas, Jelena Diakonikolas, Daniel M. Kane +2

We study the problem of PAC learning -margin halfspaces with Random Classification Noise. We establish an information-computation tradeoff suggesting an inherent gap between the…

cs.LG2023

Robustly Learning a Single Neuron via Sharpness

Puqian Wang, Nikos Zarifis, Ilias Diakonikolas +1

We study the problem of learning a single neuron with respect to the -loss in the presence of adversarial label noise. We give an efficient algorithm that, for a broad famil…