Data collection and quality challenges in deep learning: A data-centric ai perspective

SE Whang, Y Roh, H Song, JG Lee - The VLDB Journal, 2023 - Springer
Data-centric AI is at the center of a fundamental shift in software engineering where machine
learning becomes the new software, powered by big data and computing infrastructure …

Robust aggregation for federated learning

K Pillutla, SM Kakade… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
We present a novel approach to federated learning that endows its aggregation process with
greater robustness to potential poisoning of local data or model parameters of participating …

A faster interior point method for semidefinite programming

H Jiang, T Kathuria, YT Lee… - 2020 IEEE 61st …, 2020 - ieeexplore.ieee.org
Semidefinite programs (SDPs) are a fundamental class of optimization problems with
important recent applications in approximation algorithms, quantum complexity, robust …

Byzantine-robust federated learning with optimal statistical rates

B Zhu, L Wang, Q Pang, S Wang… - International …, 2023 - proceedings.mlr.press
We propose Byzantine-robust federated learning protocols with nearly optimal statistical
rates based on recent progress in high dimensional robust statistics. In contrast to prior work …

Robust and differentially private mean estimation

X Liu, W Kong, S Kakade, S Oh - Advances in neural …, 2021 - proceedings.neurips.cc
In statistical learning and analysis from shared data, which is increasingly widely adopted in
platforms such as federated learning and meta-learning, there are two major concerns …

Quantum entropy scoring for fast robust mean estimation and improved outlier detection

Y Dong, S Hopkins, J Li - Advances in Neural Information …, 2019 - proceedings.neurips.cc
We study two problems in high-dimensional robust statistics:\emph {robust mean estimation}
and\emph {outlier detection}. In robust mean estimation the goal is to estimate the mean …

Robust sub-Gaussian estimation of a mean vector in nearly linear time

J Depersin, G Lecué - The Annals of Statistics, 2022 - projecteuclid.org
We construct an algorithm for estimating the mean of a heavy-tailed random variable when
given an adversarial corrupted sample of N independent observations. The only assumption …

Solving sdp faster: A robust ipm framework and efficient implementation

B Huang, S Jiang, Z Song, R Tao… - 2022 IEEE 63rd Annual …, 2022 - ieeexplore.ieee.org
This paper introduces a new robust interior point method analysis for semidefinite
programming (SDP). This new robust analysis can be combined with either logarithmic …

Robust and heavy-tailed mean estimation made simple, via regret minimization

S Hopkins, J Li, F Zhang - Advances in Neural Information …, 2020 - proceedings.neurips.cc
We study the problem of estimating the mean of a distribution in high dimensions when
either the samples are adversarially corrupted or the distribution is heavy-tailed. Recent …

List-decodable linear regression

S Karmalkar, A Klivans… - Advances in neural …, 2019 - proceedings.neurips.cc
List-decodable Linear Regression Page 1 List-decodeable Linear Regression Sushrut
Karmalkar University of Texas at Austin sushrutk@cs.utexas.edu Adam R. Klivans University of …