← Search

Johannes O. Royset

3 accepted papers

2026

Enhancing Learning with Noisy Labels via Rockafellian Relaxation

ICLR 2026poster

Labeling errors in datasets are common, arising in a variety of contexts, such as human labeling and weak labeling. Although neural networks (NNs) can tolerate modest amounts of these errors, their performance degrades substantially once the label error rate exceeds a certain threshold. We propose t…

Cited by 0SourceScholar
2026

Membership Privacy Risks of Sharpness Aware Minimization

ICLR 2026poster

Optimization algorithms that seek flatter minima, such as Sharpness-Aware Minimization (SAM), are credited with improved generalization and robustness to noise. We ask whether such gains impact membership privacy. Surprisingly, we find that SAM is more prone to Membership Inference Attacks (MIA) tha…

Cited by 0SourceScholar
2025

Non-Asymptotic and Non-Lipschitzian Bounds on Optimal Values in Stochastic Optimization Under Heavy Tails

ICML 2025poster

This paper focuses on non-asymptotic confidence bounds (CB) for the optimal values of stochastic optimization (SO) problems. Existing approaches often rely on two conditions that may be restrictive: The need for a global Lipschitz constant and the assumption of light-tailed distributions. Beyond eit…

Cited by 0SourcePDFScholar