Contaminated Multi-task Learning with Heterogeneity: Fundamental Limits and Optimal Algorithms

Marco Avella Medina; Mengchu Li; Ye Tian

REVIEW 2 major objections 6 minor 300 references

Contaminated Multi-task Learning with Heterogeneity: Fundamental Limits and Optimal Algorithms

T0 review · 2 major / 6 minor · reviewed 2026-07-12 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Filtering multi-task gradients beats regularization: contamination error drops from ε√(d/n) to near the minimax rate ε/√n while still personalizing under heterogeneity.

desk verdict Solid theory paper: clean negative results on the ε√d/n barrier plus a filtering method that matches minimax rates for both global and local parameters under joint contamination and heterogeneity. read the letter →

arxiv 2607.02681 v1 pith:CNQIKXGM submitted 2026-07-02 stat.ML cs.LGmath.STstat.MEstat.TH

Ye Tian , Mengchu Li , Marco Avella Medina This is my paper

classification stat.MLcs.LGmath.STstat.MEstat.TH MSC 62F3562H1268T05

keywords multi-tasklearningfederatedrobustnessdatacontaminationheterogeneityminimaxoptimalityfilteringgradientdescent

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

When many related learning tasks share information, a few corrupted tasks and ordinary differences among clean tasks can ruin standard multi-task methods. This paper shows that popular regularization schemes and score-based outlier detectors all pay an extra √d factor in the contamination term, producing error of order ε√(d/n) even when the information-theoretic limit is only ε/√n. The authors prove matching minimax lower bounds for a general heterogeneous empirical-risk problem, then give a filtering-based robust multi-task gradient method that attains those rates (up to logs) over a broad sample-size regime. The same procedure returns both a global estimator and clean-task personalized estimators. Simulations and a smartphone activity data set confirm that the method stays accurate under contamination while adapting to task differences.

What carries the argument

Joint robust gradient estimation (JRGE) via iterative filtering of task-level gradients, fed by a simple robust covariance estimator built from single-task empirical covariances, then plugged into multi-task gradient descent with soft-thresholded local updates.

What would settle it

In the Gaussian mean model with large d, fix ε and n so that ε√(d/n) is several times larger than ε/√n; if the filtering estimator's worst-case error still tracks ε√(d/n) rather than the claimed near-minimax rate, the barrier-removal claim fails.

Watch

Extended reading notes

Core claim

In contaminated multi-task ERM with ε-fraction adversarial tasks and heterogeneous clean tasks, regularization families and score-based detectors are fundamentally limited by a dimension-dependent contamination barrier of order ε√(d/n). A filtering-based robust multi-task gradient descent that jointly aggregates gradients and estimates their covariance removes that barrier, matching the minimax rates ε/√n + √(ε)h + √(d/(nK)) for the global parameter and the corresponding personalized rates for clean local parameters, up to logarithmic factors, under local strong convexity, smoothness and sub-Gaussian gradients.

Load-bearing premise

Each task risk must be strongly convex and smooth inside a fixed-radius ball around its own minimizer, and sample gradients must obey a high-probability Lipschitz condition so that the filtering steps stay controlled throughout the trajectory.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

The punchline is that this paper actually closes a concrete gap. In the Gaussian mean model it proves that a wide family of regularizers and score-based outlier detectors all pay an extra √d in the contamination term; then it gives matching minimax lower and upper bounds for a general ERM multi-task problem and a filtering algorithm that removes that factor while still personalizing.

What is new is the systematic negative package (Theorems 1–4), not just one regularizer, plus the joint lower bounds for θ* and the clean local θ(k)* that correctly pick up the √ε h interaction. The algorithm is standard filtering plus a simple single-task covariance estimator and soft-thresholded local gradients; the analysis shows the residual covariance term vanishes in a broad regime (roughly n ≳ d or ε^{2}(1∨√(n/d)) ≲ n/K). That is the right comparison to the lower bound, and the paper is honest about the residual term outside that regime.

The math looks carefully done. Assumptions are local strong convexity/smoothness and sub-Gaussian gradients, plus a high-probability Lipschitz condition for uniform control of the iterates—standard for non-asymptotic GD and not hidden. Simulations and the HAR experiment are sensible and beat a long list of Byzantine and MTL baselines. No code is a real but ordinary reproducibility soft spot; free parameters (ε, thresholds, stepsizes) are the usual ones for this literature.

This is for people who work on robust multi-task, federated, or Byzantine estimation and care about rates. It is not a conceptual revolution, but it is a clean, useful advance with matching theory. I would send it to peer review without hesitation and would cite the negative results and the rate statements myself.

Referee Report

2 major / 6 minor

Summary. The paper studies multi-task ERM under adversarial contamination of an ε-fraction of K tasks (each of size n) together with heterogeneity among clean tasks. It first proves that several standard paradigms—adaptive/robust center regularization, global matrix penalties, decomposition (dirty) models, and score-based outlier-task detection—incur a worst-case contamination error of order ε√(d/n) in the Gaussian mean model, which is suboptimal relative to the lower bound ε/√n (Theorems 1–4). It then establishes minimax lower bounds for both the global average-risk minimizer θ* and the clean local minimizers θ^(k)* in a general heterogeneous ERM setting, capturing the interaction √(ε)h + h^(k) (Theorem 5 / 12). A filtering-based robust multi-task gradient descent method (Algorithms 1–3), using joint robust gradient estimation and a simple single-task covariance filter, is shown to attain high-probability upper bounds matching these lower bounds up to logs in a broad regime (roughly n ≳ d or ε²(1 ∨ √(n/d)) ≲ n/K), under local strong convexity, smoothness, and sub-Gaussian gradients (Corollary 1). Simulations and a HAR real-data study support robustness and personalization relative to many benchmarks.

Significance. If the matching rates hold as stated, the work cleanly separates a dimension-dependent contamination barrier that affects a wide family of regularization and score-based methods from a filtering approach that removes the extra √d factor while retaining personalization under heterogeneity. The lower bounds improve on prior work by making the √(ε)h interaction explicit and by treating both global and local parameters. The algorithmic construction (JRGE + single-task covariance filtering + soft-thresholded local gradients) is computationally practical and is supported by extensive comparisons. The appendix proofs use standard tools (stability certificates, covering arguments, Taylor expansions for regularizers) and the optimality regime is stated explicitly (Remark 5, Figure 1). These are genuine contributions to robust multi-task / federated learning under simultaneous contamination and heterogeneity.

major comments (2)

Algorithms 2 and 3 take the contamination fraction ε as a known input (and λ_Σ, λ are tuned with knowledge of ε-scale quantities). The theoretical rates and the filtering certificate (Lemma 8, Proposition 4) depend on this. The manuscript should either (i) state clearly that ε is assumed known, as is common in strong-contamination analyses, or (ii) add a short discussion/robustness check on misspecification of ε (e.g., over-estimating ε by a constant factor). Without this, the practical claim that the method is ready for use when ε is unknown is slightly stronger than the theory supports.
Corollary 1 / Remark 5: the upper bound still carries the residual contamination term (ε/√n)[(d/n)^{1/4} + (d/n)^{1/2}]. The abstract and introduction emphasize that the method “removes the extra √d contamination dependence” of regularization methods. That is correct relative to ε√(d/n), but when n is only moderately larger than d the residual is not fully dimension-free. A one-sentence clarification in the abstract or Remark 5 that full minimax optimality (matching ε/√n) holds in the stated regime, and that outside it a milder dimension factor remains, would prevent over-reading of the claim.

minor comments (6)

Assumption 6 (high-probability Lipschitz of sample gradients with L' ≲ (nKd)^{C}) is used for uniform control of filtering iterates. A brief remark that this is a high-probability strengthening of population smoothness (Assumption 2), and that it holds for the mean and GLM examples under the stated sub-Gaussian conditions (Lemmas 1–2), would help readers who skip the appendix.
Section 2.1.1 / Assumption 1: the list of regularizer conditions is long. A short pointer that Lasso, Ridge, Bridge, SCAD, MC+, and hard-thresholding all satisfy it (with verification deferred to Appendix A.6) is already present; ensuring the main-text statement of Theorem 1 explicitly says “for any regularizer satisfying Assumption 1” would make the negative result easier to cite.
Tables 1–3 and Appendix C: bold/italic marking of best and second/third is helpful. Adding a one-line note that Single-task is omitted from global-error columns because it does not produce a pooled estimator would avoid confusion.
Notation: the same symbol L is used for the smoothness constant (Assumption 2) and for the proximal radius of the regularizer (Assumption 1). Different letters would reduce cognitive load when both sections are read together.
Figure 1 caption: “shaded region corresponds to the regime where the upper bound in Corollary 1 is minimax optimal up to logarithmic factors” is clear; a brief axis label or legend for the two boundaries (n ∼ d and n ∼ Kε²) would make the figure self-contained.
Related work: the discussion of untrusted-batch / batch-contamination models (QV18, CLM20, ABLY26) is useful. A sentence contrasting task-level contamination with within-batch contamination would further situate the contribution.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: rates derived from stated assumptions and independent minimax constructions; self-citations are background only.

full rationale

The paper's central claims (negative results Theorems 1-4 establishing the ε√(d/n) barrier for regularization/score-based methods; minimax lower bounds Theorem 5/12 via packing/Le Cam; matching upper bounds Corollary 1 via filtering Algorithms 2-3 under Assumptions 2/4/6) are derived from first-order optimality, concentration, stability certificates, and gradient-descent contraction, not by redefining the target quantities in terms of themselves or by fitting parameters that force the claimed rates. Lower bounds are constructed independently of the upper-bound algorithm. Self-citations (e.g., to DW22, TWXF22) supply motivation and comparison baselines but are not load-bearing for the new rates or the filtering analysis; the proofs in the appendix are self-contained under the listed assumptions. No fitted-input-as-prediction, uniqueness-imported-from-authors, or ansatz-smuggled-via-citation patterns appear. Residual log factors and the local-ball restriction are acknowledged rather than hidden. Score 1 only for the presence of ordinary self-citations that do not close any definitional loop.

Assumptions & free parameters 4 free parameters · 6 assumptions · 2 invented entities

The central optimality claim rests on a standard strong-contamination multi-task ERM model plus local convexity/smoothness and sub-Gaussian gradients. Free parameters are algorithmic (thresholds, stepsizes, assumed ε). No new physical entities; the main inventions are algorithmic constructions (JRGE filtering with multi-task covariance estimation and soft-thresholded personalization).

free parameters (4)

contamination fraction ε (assumed known for Algorithm 2/3)
Filtering and safe-set construction take ε as input; misspecification is not analyzed as part of the main rates.
filtering threshold λ_Σ and soft-threshold λ
Chosen theoretically as functions of (n,K,d,ε,δ,H) and tuned by cross-validation in experiments; rates depend on these being large enough.
step sizes η, η^(k) and iteration count T
Must place iterates in the local strong-convexity ball and drive initialization error below statistical terms; experiments fix η=0.05 and large T.
heterogeneity radii h, h^(k) and local radius R0
Enter both lower and upper bounds; treated as problem parameters rather than estimated quantities in the main theory.

assumptions (6)

domain assumption Local L-smoothness and 1/L-strong convexity of each task risk on a ball of radius R0 (Assumption 2).
Used for linear convergence of multi-task gradient descent (Theorem 6).
domain assumption Task gradient heterogeneity bounds (9)–(10) with parameters h and h^(k) (Assumption 3).
Defines the parameter spaces for minimax lower bounds and appears in upper bounds as √ε h and h^(k).
domain assumption Sub-Gaussian sample gradients with uniform ψ2 bound (Assumption 4).
Drives concentration and stability of task gradients for filtering.
domain assumption High-probability Lipschitz continuity of sample gradients in θ (Assumption 6).
Needed for uniform-in-θ control of JRGE across GD iterates via covering.
domain assumption Strong contamination model: adversary may replace all samples of an ε-fraction of tasks arbitrarily, possibly depending on clean data.
Section 1.1 setup; standard in modern robust statistics but stronger than Huber contamination.
standard math Standard concentration and covering arguments for sub-Gaussian vectors and empirical processes.
Used throughout appendices for stability, covariance estimation, and lower bounds.

invented entities (2)

Joint robust gradient estimation (JRGE) with multi-task single-task covariance filtering (Algorithms 2–3)
purpose: Aggregate contaminated task gradients near-optimally without paying √d, using a simple robust covariance built from pairwise-close single-task covariances.
Methodological construction adapted from filtering literature; independent_evidence is algorithmic performance under stated assumptions, not a new physical object.
Soft-thresholded personalized local gradient g^(k) around the robust global gradient
purpose: Achieve personalization under heterogeneity while retaining robustness.
Algorithmic device in Algorithm 1; rates depend on threshold λ.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Contaminated Multi-task Learning with Heterogeneity: Fundamental Limits and Optimal Algorithms." pith.science (2026). https://pith.science/paper/CNQIKXGM

@misc{pith2026260702681,
  author       = {Pith},
  title        = {Pith review of: Contaminated Multi-task Learning with Heterogeneity: Fundamental Limits and Optimal Algorithms},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/CNQIKXGM}},
  note         = {Machine review of arXiv:2607.02681}
}

abstract

Integrating information across related tasks can improve estimation and prediction in transfer, multi-task, and federated learning, but contamination and heterogeneity make robust borrowing challenging. We study a contaminated multi-task empirical risk minimization (ERM) framework in which an $\epsilon$ fraction of $K$ tasks, each with sample size $n$, may be arbitrarily contaminated while the remaining tasks are heterogeneous. Our goal is to estimate both the global minimizer of the average risk and the clean task-specific minimizers, thereby combining robustness and personalization. In the Gaussian mean model, we show that several common paradigms, including adaptive and robust regularization around a shared center, global matrix regularization, decomposition-based regularization, and score-based outlier-task detection, all suffer from a worst-case contamination error of order $\epsilon\sqrt{d/n}$, which is suboptimal compared to the lower bound $\epsilon/\sqrt{n}$. This identifies a dimension-dependent barrier for these approaches. We then establish minimax lower bounds for a general heterogeneous ERM setting and propose a computationally efficient filtering-based robust multi-task gradient descent method. Under local strong convexity, smoothness, and sub-Gaussian gradient assumptions, the proposed method attains high-probability upper bounds matching the minimax rates up to logarithmic factors over a broad regime. In particular, it removes the extra $\sqrt{d}$ contamination dependence of many regularization-based methods and score-based outlier detection, while achieving personalization to local tasks under strong heterogeneity. Simulations and a real-data analysis demonstrate strong robustness and personalization relative to a broad range of benchmark methods.

Figures

Figures reproduced from arXiv: 2607.02681 by the authors.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

300 extracted references · 3 canonical work pages

[1]

1996 , publisher=

Weak Convergence and Empirical Processes: With Applications to Statistics , author=. 1996 , publisher=

1996
[2]

IEEE Transactions on Signal Processing , volume=

Robust wavelet denoising , author=. IEEE Transactions on Signal Processing , volume=. 2001 , publisher=

2001
[3]

Information and Inference: A Journal of the IMA , volume=

Estimating location parameters in sample-heterogeneous distributions , author=. Information and Inference: A Journal of the IMA , volume=. 2022 , publisher=

2022
[4]

arXiv preprint arXiv:2508.19640 , year=

Optimal Cox regression under federated differential privacy: coefficients and cumulative hazards , author=. arXiv preprint arXiv:2508.19640 , year=

arXiv
[5]

The Annals of Statistics , volume=

On robustness and local differential privacy , author=. The Annals of Statistics , volume=. 2023 , publisher=

2023
[6]

International Conference on Algorithmic Learning Theory , pages=

Robust estimation of discrete distributions under local differential privacy , author=. International Conference on Algorithmic Learning Theory , pages=. 2023 , organization=

2023
[7]

Advances in Neural Information Processing Systems , volume=

Robust and differentially private mean estimation , author=. Advances in Neural Information Processing Systems , volume=
[8]

9th Innovations in Theoretical Computer Science Conference (ITCS 2018) , series =

Learning Discrete Distributions from Untrusted Batches , author =. 9th Innovations in Theoretical Computer Science Conference (ITCS 2018) , series =. 2018 , editor =. doi:10.4230/LIPIcs.ITCS.2018.47 , url =

work page doi:10.4230/lipics.itcs.2018.47 2018

Show all 300 references

[9]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing , pages =

Efficiently Learning Structured Distributions from Untrusted Batches , author =. Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing , pages =. 2020 , publisher =

2020
[10]

Proceedings of the 37th International Conference on Machine Learning , series =

Optimal Robust Learning of Discrete Distributions from Batches , author =. Proceedings of the 37th International Conference on Machine Learning , series =. 2020 , publisher =

2020
[11]

Advances in Neural Information Processing Systems , volume =

A General Method for Robust Learning from Batches , author =. Advances in Neural Information Processing Systems , volume =
[12]

Proceedings of the 38th International Conference on Machine Learning , series =

Robust Density Estimation from Batches: The Best Things in Life are (Nearly) Free , author =. Proceedings of the 38th International Conference on Machine Learning , series =. 2021 , publisher =

2021
[13]

Advances in Neural Information Processing Systems , volume =

Linear Regression using Heterogeneous Data Batches , author =. Advances in Neural Information Processing Systems , volume =. 2024 , url =

2024
[14]

The Thirty Seventh Annual Conference on Learning Theory , series =

Robust Distribution Learning with Local and Global Adversarial Corruptions , author =. The Thirty Seventh Annual Conference on Learning Theory , series =. 2024 , publisher =

2024
[15]

Journal of the Royal Statistical Society Series B: Statistical Methodology , pages=

Minimax and adaptive transfer learning for nonparametric classification under distributed differential privacy constraints , author=. Journal of the Royal Statistical Society Series B: Statistical Methodology , pages=. 2025 , publisher=

2025
[16]

Annual Review of Statistics and Its Application , volume=

A theoretical review of modern robust statistics , author=. Annual Review of Statistics and Its Application , volume=. 2025 , publisher=

2025
[17]

A festschrift for Erich L

The notion of breakdown point , author=. A festschrift for Erich L. Lehmann , volume=. 1983 , publisher=

1983
[18]

The Annals of Statistics , volume=

Robust Machine Learning By Median-of-Means , author=. The Annals of Statistics , volume=. 2020 , publisher=

2020
[19]

The screening and ranking algorithm to detect

Niu, Yue S and Zhang, Heping , year = 2012, journal =. The screening and ranking algorithm to detect

2012
[20]

A review on minimax rates in change point detection and localisation , author =
[21]

Biometrika , publisher =

Continuous inspection schemes , author =. Biometrika , publisher =
[22]

arXiv preprint arXiv:1311.2669 , year=

Distance-based and continuum Fano inequalities with applications to statistical estimation , author=. arXiv preprint arXiv:1311.2669 , year=

arXiv
[23]

, author=

An optimal randomized algorithm for maximum Tukey depth. , author=. SODA , volume=
[24]

30th USENIX Security Symposium (USENIX Security 21) , pages=

Extracting training data from large language models , author=. 30th USENIX Security Symposium (USENIX Security 21) , pages=
[25]

Advances in Neural Information Processing Systems 36 , year =

Youssef Allouah and Rachid Guerraoui and Nirupam Gupta and Rafael Pinot and Geovani Rizk , title =. Advances in Neural Information Processing Systems 36 , year =
[26]

2019 , publisher=

Robust statistics: theory and methods (with R) , author=. 2019 , publisher=

2019
[27]

arXiv preprint arXiv:2605.17126 , year=

Multi-task Linear Regression without Eigenvalue Lower Bounds: Adaptivity, Robustness and Safety , author=. arXiv preprint arXiv:2605.17126 , year=

arXiv
[28]

arXiv preprint arXiv:2508.12048 , year=

Robust Data Fusion via Subsampling , author=. arXiv preprint arXiv:2508.12048 , year=

arXiv
[29]

arXiv preprint arXiv:2602.20698 , year =

Maryam Aliakbarpour and Vladimir Braverman and Yuhan Liu and Junze Yin , title =. arXiv preprint arXiv:2602.20698 , year =. doi:10.48550/arXiv.2602.20698 , eprint =

doi
[30]

Statistics and its Interface , volume=

Penalized unsupervised learning with outliers , author=. Statistics and its Interface , volume=
[31]

Journal of the Royal Statistical Society Series B: Statistical Methodology , pages=

Byzantine-tolerant distributed learning of finite mixture models , author=. Journal of the Royal Statistical Society Series B: Statistical Methodology , pages=. 2026 , publisher=

2026
[32]

1980 , publisher=

Identification of outliers , author=. 1980 , publisher=

1980
[33]

Advances in Neural Information Processing Systems 37 , pages =

Youssef Allouah and Abdellah El Mrini and Rachid Guerraoui and Nirupam Gupta and Rafael Pinot , title =. Advances in Neural Information Processing Systems 37 , pages =. 2024 , doi =

2024
[34]

The Thirty Eighth Annual Conference on Learning Theory , pages=

Optimal Robust Estimation under Local and Global Corruptions: Stronger Adversary and Smaller Error , author=. The Thirty Eighth Annual Conference on Learning Theory , pages=. 2025 , organization=

2025
[35]

Proceedings of the 2016 ACM SIGSAC conference on computer and communications security , pages=

Deep learning with differential privacy , author=. Proceedings of the 2016 ACM SIGSAC conference on computer and communications security , pages=

2016
[36]

2017 , journal =

Minimax estimation of linear and quadratic functionals on sparsity classes , author=. 2017 , journal =

2017
[37]

2017 IEEE Symposium on Security and Privacy (SP) , pages=

Is interaction necessary for distributed private learning? , author=. 2017 IEEE Symposium on Security and Privacy (SP) , pages=. 2017 , organization=

2017
[38]

arXiv preprint arXiv:2010.06562 , year=

Unified lower bounds for interactive high-dimensional estimation under information constraints , author=. arXiv preprint arXiv:2010.06562 , year=

2010 arXiv
[39]

Optimal change point detection and localization in sparse dynamic networks , author =
[40]

Statistical analysis and forecasting of economic structural change , publisher =

Nonparametric tests for shift and change in regression at an unknown time point , author =. Statistical analysis and forecasting of economic structural change , publisher =
[41]

arXiv preprint arXiv:1711.03908 , year=

Finite sample differentially private confidence intervals , author=. arXiv preprint arXiv:1711.03908 , year=

arXiv
[42]

Lecture Notes for ECE598YW (UIUC) , volume=

Lecture notes on information-theoretic methods for high-dimensional statistics , author=. Lecture Notes for ECE598YW (UIUC) , volume=
[43]

1607.02533 , archiveprefix =

Adversarial examples in the physical world , author =. 1607.02533 , archiveprefix =

arXiv
[44]

Physical adversarial examples for object detectors , author =
[45]

Adversarial examples for evaluating reading comprehension systems , author =
[46]

On physical adversarial patches for object detection , author =
[47]

Robust statistics: the approach based on influence functions , author =
[48]

The Annals of Statistics , publisher =

Optimal change point detection and localization in sparse dynamic networks , author =. The Annals of Statistics , publisher =
[49]

Multiscale

Futschik, Andreas and Hotz, Thomas and Munk, Axel and Sieling, Hannes , year = 2014, journal =. Multiscale

2014
[50]

The Annals of Statistics , publisher =

Break detection in the covariance structure of multivariate time series models , author =. The Annals of Statistics , publisher =
[51]

A linear time method for the detection of point and collective anomalies , author =
[52]

Economic Structural Change , publisher =

Recursive M-tests for the change-point problem , author =. Economic Structural Change , publisher =
[53]

Journal of the Royal Statistical Society: Series B (Statistical Methodology) , publisher =

High dimensional change point estimation via sparse projection , author =. Journal of the Royal Statistical Society: Series B (Statistical Methodology) , publisher =
[54]

Fast approximation of

Do, Minh N , year = 2003, journal =. Fast approximation of

2003
[55]

Elements of information theory , author =
[56]

The total variation distance between high-dimensional Gaussians , author =
[57]

Discrete Applied Mathematics , publisher =

A result of Vapnik with applications , author =. Discrete Applied Mathematics , publisher =
[58]

Statistics & Probability Letters , publisher =

Tight lower bound on the probability of a binomial exceeding its expectation , author =. Statistics & Probability Letters , publisher =
[59]

International Conference on Artificial Intelligence and Statistics , pages =

A robust univariate mean estimator is all you need , author =. International Conference on Artificial Intelligence and Statistics , pages =
[60]

Summer School on Machine Learning , pages =

Introduction to statistical learning theory , author =. Summer School on Machine Learning , pages =
[61]

The Annals of Statistics , publisher =

Wild binary segmentation for multiple change-point detection , author =. The Annals of Statistics , publisher =
[62]

Statistica Sinica , publisher =

Multiple change-point detection via a screening and ranking algorithm , author =. Statistica Sinica , publisher =
[63]

A robust bootstrap change point test for high-dimensional location parameter , author =
[64]

Journal of the American Statistical Association , publisher =

Optimal detection of changepoints with a linear computational cost , author =. Journal of the American Statistical Association , publisher =
[65]

Assouad,

Yu, Bin , year = 1997, booktitle =. Assouad,

1997
[66]

Doubly Robust Bayesian Inference for Non-Stationary Streaming Data with -Divergences , author =
[67]

High-dimensional probability: An introduction with applications in data science , author =
[68]

A unified approach to robust mean estimation , author =
[69]

An evaluation of change point detection algorithms , author =
[70]

Breakthroughs in statistics , publisher =

Robust estimation of a location parameter , author =. Breakthroughs in statistics , publisher =
[71]

Robust estimates of location , author =
[72]

Journal of the Royal Statistical Society: Series B (Statistical Methodology) , publisher =

Robust estimation in the normal mixture model based on robust clustering , author =. Journal of the Royal Statistical Society: Series B (Statistical Methodology) , publisher =
[73]

Lecture notes on Robustness in Machine Learning , author =
[74]

The Annals of Statistics , volume=

All-in-one robust estimator of the Gaussian mean , author=. The Annals of Statistics , volume=. 2022 , publisher=

2022
[75]

Optimal nonparametric multivariate change point detection and localization , author =
[76]

International Conference on Artificial Intelligence and Statistics , pages=

High dimensional robust sparse regression , author=. International Conference on Artificial Intelligence and Statistics , pages=. 2020 , organization=

2020
[77]

Department of Statistics, Princeton University , year=

T6: Order Statistics, in mimeographed notes for Statistics 411 , author=. Department of Statistics, Princeton University , year=
[78]

Conference on Learning Theory , pages=

Computationally efficient robust sparse estimation in high dimensions , author=. Conference on Learning Theory , pages=. 2017 , organization=

2017
[79]

Proceedings of the International Congress of Mathematicians, Vancouver, 1975 , volume=

Mathematics and the picturing of data , author=. Proceedings of the International Congress of Mathematicians, Vancouver, 1975 , volume=

1975
[80]

A general decision theory for

Chen, Mengjie and Gao, Chao and Ren, Zhao , year = 2016, journal =. A general decision theory for

2016
[81]

International Conference on Machine Learning , pages =

Being robust (in high dimensions) can be practical , author =. International Conference on Machine Learning , pages =
[82]

Robust regression with covariate filtering: Heavy tails and adversarial contamination , author =
[83]

Online Robust and Adaptive Learning from Data Streams , author =
[84]

Journal of the American Statistical Association , publisher =

A nonparametric approach for multiple change point analysis of multivariate data , author =. Journal of the American Statistical Association , publisher =
[85]

Circular binary segmentation for the analysis of array-based

Olshen, Adam B and Venkatraman, ES and Lucito, Robert and Wigler, Michael , year = 2004, journal =. Circular binary segmentation for the analysis of array-based

2004
[86]

Journal of applied meteorology and climatology , volume = 46, number = 6, pages =

A review and comparison of changepoint detection techniques for climate data , author =. Journal of applied meteorology and climatology , volume = 46, number = 6, pages =
[87]

Journal of Climate , volume = 26, number = 14, pages =

Changepoint detection in climate time series with long-term trends , author =. Journal of Climate , volume = 26, number = 14, pages =
[88]

Stat , publisher =

Change-point analysis in financial networks , author =. Stat , publisher =
[89]

Real-time financial surveillance via quickest change-point detection methods , author =
[90]

The Journal of Finance , publisher =

The equity premium and structural breaks , author =. The Journal of Finance , publisher =
[91]

Optimal Change-Point Detection and Localization , author =
[92]

Robustness and Complex Data Structures , publisher =

Robust change point analysis , author =. Robustness and Complex Data Structures , publisher =
[93]

Robust and Heavy-Tailed Mean Estimation Made Simple, via Regret Minimization , author =
[94]

Outlier robust mean estimation with subgaussian rates via stability , author =
[95]

Annals of Statistics , publisher =

Sub-Gaussian estimators of the mean of a random vector , author =. Annals of Statistics , publisher =
[96]

2018 , howpublished =

, author =. 2018 , howpublished =

2018
[97]

A private and computationally-efficient estimator for unbounded

Kamath, Gautam and Mouzakis, Argyris and Singhal, Vikrant and Steinke, Thomas and Ullman, Jonathan , year = 2021, journal =. A private and computationally-efficient estimator for unbounded

2021
[98]

Propose, Test, Release: Differentially private estimation with high probability , author =
[99]

IEEE Transactions on Information Theory , volume = 68, number = 1, pages =

Interactive Inference Under Information Constraints , author =. IEEE Transactions on Information Theory , volume = 68, number = 1, pages =
[100]

Annales de l'ISUP , volume = 63, pages =

Classification under local differential privacy , author =. Annales de l'ISUP , volume = 63, pages =
[101]

Electronic Journal of Statistics , publisher =

Strongly universally consistent nonparametric regression and classification with privatised data , author =. Electronic Journal of Statistics , publisher =
[102]

Estimating location parameters in entangled single-sample distributions , author =
[103]

2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) , pages =

Agnostic estimation of mean and covariance , author =. 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) , pages =

2016
[104]

The 22nd International Conference on Artificial Intelligence and Statistics , pages =

Locally Private Mean Estimation: Z -test and Tight Confidence Intervals , author =. The 22nd International Conference on Artificial Intelligence and Statistics , pages =
[105]

The Annals of Statistics , publisher =

Robust multivariate mean estimation: the optimality of trimmed mean , author =. The Annals of Statistics , publisher =
[106]

The Effect of Privacy Regulation on the Data Industry: Empirical Evidence from

Aridor, Guy and Che, Yeon-Koo and Salz, Tobias , year = 2021, journal =. The Effect of Privacy Regulation on the Data Industry: Empirical Evidence from

2021
[107]

Privacy loss in

Tang, Jun and Korolova, Aleksandra and Bai, Xiaolong and Wang, Xueqiang and Wang, Xiaofeng , year = 2017, journal =. Privacy loss in

2017
[108]

The deployment of artificial intelligence tools in the health sector: privacy concerns and regulatory answers within the GDPR , author =. Eur. J. Legal Stud. , publisher =
[109]

Collecting telemetry data privately , author =
[110]

Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security , pages =

Rappor: Randomized aggregatable privacy-preserving ordinal response , author =. Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security , pages =

2014
[111]

Geometrizing rates of convergence,

Donoho, David L and Liu, Richard C , year = 1991, journal =. Geometrizing rates of convergence,

1991
[112]

Advances in Neural Information Processing Systems , volume = 32, pages =

Private hypothesis selection , author =. Advances in Neural Information Processing Systems , volume = 32, pages =
[113]

Rates of convergence of minimum distance estimators and

Yatracos, Yannis G , year = 1985, journal =. Rates of convergence of minimum distance estimators and

1985
[114]

IEEE Control Systems Letters , publisher =

Consistency of Distributionally Robust Risk-and Chance-Constrained Optimization Under Wasserstein Ambiguity Sets , author =. IEEE Control Systems Letters , publisher =
[115]

SIAM Journal on Computing , publisher =

Robust estimators in high-dimensions without the computational intractability , author =. SIAM Journal on Computing , publisher =
[116]

Zeitschrift f

Robust confidence limits , author =. Zeitschrift f
[117]

Journal of the Royal Statistical Society: Series B (Statistical Methodology) , publisher =

Robust estimation via robust gradient estimation , author =. Journal of the Royal Statistical Society: Series B (Statistical Methodology) , publisher =
[118]

Robust Statistics , author =
[119]

Annales de l'IHP Probabilit

Challenging the empirical mean and empirical variance: a deviation study , author =. Annales de l'IHP Probabilit
[120]

Robust and private

Dimitrakakis, Christos and Nelson, Blaine and Mitrokotsa, Aikaterini and Rubinstein, Benjamin IP , year = 2014, journal =. Robust and private

2014
[121]

International Conference on Artificial Intelligence and Statistics , pages =

Robust and Private Learning of Halfspaces , author =. International Conference on Artificial Intelligence and Statistics , pages =
[122]

Tight and Robust Private Mean Estimation with Few Users , author =
[123]

Private Robust Estimation by Stabilizing Convex Relaxations , author =
[124]

Advances in Neural Information Processing Systems , volume=

Locally private online change point detection , author=. Advances in Neural Information Processing Systems , volume=
[125]

Joseph Lam-Weil and Béatrice Laurent and Jean-Michel Loubes , year = 2022, journal =

2022
[126]

Advances in Neural Information Processing Systems , volume = 27, pages =

Extremal mechanisms for local differential privacy , author =. Advances in Neural Information Processing Systems , volume = 27, pages =
[127]

Journal of the American Statistical Association , publisher =

Randomized response: A survey technique for eliminating evasive answer bias , author =. Journal of the American Statistical Association , publisher =
[128]

Journal of the American Statistical Association , publisher =

A statistical framework for differential privacy , author =. Journal of the American Statistical Association , publisher =
[129]

The Annals of Statistics , publisher =

The cost of privacy: Optimal rates of convergence for parameter estimation with differential privacy , author =. The Annals of Statistics , publisher =
[130]

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , pages =

The structure of optimal private tests for simple hypotheses , author =. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , pages =
[131]

Theory of Cryptography Conference , pages =

Calibrating noise to sensitivity in private data analysis , author =. Theory of Cryptography Conference , pages =
[132]

CHANCE , publisher =

The Role of Robust Statistics in Private Data Analysis , author =. CHANCE , publisher =
[133]

Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing , pages =

Differential privacy and robust statistics , author =. Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing , pages =
[134]

Conference on Learning Theory , pages =

Locally private hypothesis selection , author =. Conference on Learning Theory , pages =
[135]

Ten Lectures on Wavelets , author =
[136]

International Conference on Machine Learning , pages=

Sever: A robust meta-algorithm for stochastic optimization , author=. International Conference on Machine Learning , pages=. 2019 , organization=

2019
[137]

i: Upper bounds

Asymptotically minimax adaptive estimation. i: Upper bounds. optimally adaptive estimates , author=. Theory of Probability & Its Applications , volume=. 1992 , publisher=

1992
[138]

Conference on Learning Theory , pages=

Robust estimation for random graphs , author=. Conference on Learning Theory , pages=. 2022 , organization=

2022
[139]

arXiv preprint arXiv:2206.03441 , year=

Robust Sparse Mean Estimation via Sum of Squares , author=. arXiv preprint arXiv:2206.03441 , year=

arXiv
[140]

The Annals of Statistics , publisher =

Geometrizing rates of convergence under local differential privacy constraints , author =. The Annals of Statistics , publisher =
[141]

Combinatorial Methods in Density Estimation , author =
[142]

Mathematical Foundations of Infinite-Dimensional Statistical Models , author =
[143]

Local privacy, data processing inequalities, and statistical minimax rates , author =
[144]

The Annals of Statistics , publisher =

Robust covariance and scatter matrix estimation under Huber’s contamination model , author =. The Annals of Statistics , publisher =
[145]

High-Dimensional Statistics: A Non-asymptotic Viewpoint , author =
[146]

2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) , pages =

The role of interactivity in local differential privacy , author =. 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) , pages =

2019
[147]

Advances in Neural Information Processing Systems , volume = 33, pages =

Locally private non-asymptotic testing of discrete distributions is faster using interactive mechanisms , author =. Advances in Neural Information Processing Systems , volume = 33, pages =
[148]

Annals of Statistics , publisher =

Information-theoretic determination of minimax rates of convergence , author =. Annals of Statistics , publisher =
[149]

Journal of the American Statistical Association , publisher =

Minimax optimal procedures for locally private estimation , author =. Journal of the American Statistical Association , publisher =
[150]

Introduction to Nonparametric Estimation , author =
[151]

Electronic Journal of Statistics , publisher =

Density estimation with contamination: minimax rates and theory of adaptation , author =. Electronic Journal of Statistics , publisher =
[152]

Electronic Journal of Statistics , publisher =

On density estimation at a fixed point under local differential privacy , author =. Electronic Journal of Statistics , publisher =
[153]

Robust density estimation under

Uppal, Ananya and Singh, Shashank and P. Robust density estimation under. Advances in Neural Information Processing Systems , volume=
[154]

Nonparametric density estimation & convergence rates for

Uppal, Ananya and Singh, Shashank and P. Nonparametric density estimation & convergence rates for
[155]

Wavelets and Operators , publisher =

Wavelets and spaces of functions and distributions , author =. Wavelets and Operators , publisher =. doi:10.1017/CBO9780511623820.009 , place =

doi
[156]

The Annals of Statistics , publisher =

Density estimation by wavelet thresholding , author =. The Annals of Statistics , publisher =
[157]

Local differential privacy: Elbow effect in optimal density estimation and adaptation over

Butucea, Cristina and Dubois, Amandine and Kroll, Martin and Saumard, Adrien , year = 2020, journal =. Local differential privacy: Elbow effect in optimal density estimation and adaptation over

2020
[158]

Concentration Inequalities: A Nonasymptotic Theory of Independence , author =
[159]

Wavelets, Approximation, and Statistical Applications , author =
[160]

IEEE Transactions on Information Theory , publisher =

Optimal nonparametric multivariate change point detection and localization , author =. IEEE Transactions on Information Theory , publisher =
[161]

Bipartite graphs and their applications , author =
[162]

Proceedings of the National Academy of Sciences , publisher =

Information dynamics shape the sexual networks of Internet-mediated prostitution , author =. Proceedings of the National Academy of Sciences , publisher =
[163]

IEEE Transactions on Information Theory , publisher =

Inference under information constraints I: Lower bounds from chi-square contraction , author =. IEEE Transactions on Information Theory , publisher =
[164]

Bayesian time series models , publisher =

Analysis of changepoint models , author =. Bayesian time series models , publisher =
[165]

disorder

Detecting “disorder” in multidimensional random processes , author =. Doklady akademii nauk , volume = 259, pages =
[166]

The Journal of Machine Learning Research , publisher =

Statistical inference on random dot product graphs: a survey , author =. The Journal of Machine Learning Research , publisher =
[167]

IEEE Journal on Selected Areas in Communications , publisher =

A statistical framework for detecting electricity theft activities in smart grid distribution networks , author =. IEEE Journal on Selected Areas in Communications , publisher =
[168]

IEEE Journal on Selected Areas in Information Theory , publisher =

Sequential (quickest) change detection: Classical results and new directions , author =. IEEE Journal on Selected Areas in Information Theory , publisher =
[169]

Social Network Analysis and Mining , publisher =

Dynamic community detection in evolving networks using locality modularity optimization , author =. Social Network Analysis and Mining , publisher =
[170]

International Conference on Ad-Hoc Networks and Wireless , pages =

Time-varying graphs and dynamic networks , author =. International Conference on Ad-Hoc Networks and Wireless , pages =
[171]

Protection against reconstruction and its applications in private federated learning , author =
[172]

Dubois, Amandine , year = 2021, school =. Probl

2021
[173]

, author =

The algorithmic foundations of differential privacy. , author =. Found. Trends Theor. Comput. Sci. , volume = 9, number =
[174]

Theoretical Computer Science , publisher =

Differentially private high dimensional sparse covariance matrix estimation , author =. Theoretical Computer Science , publisher =
[175]

Conference on Learning Theory , pages =

Lower bounds for locally private estimation via communication complexity , author =. Conference on Learning Theory , pages =
[176]

International Journal of Clinical and Health Psychology , publisher =

Network change point detection in resting-state functional connectivity dynamics of mild cognitive impairment patients , author =. International Journal of Clinical and Health Psychology , publisher =
[177]

Climate dynamics , publisher =

Analysis of spatial and temporal extreme monsoonal rainfall over South Asia using complex networks , author =. Climate dynamics , publisher =
[178]

2009 sixth international conference on fuzzy systems and knowledge discovery , volume = 5, pages =

Personal recommendation based on weighted bipartite networks , author =. 2009 sixth international conference on fuzzy systems and knowledge discovery , volume = 5, pages =

2009
[179]

International Journal on Artificial Intelligence Tools , publisher =

Personal recommendation via heterogeneous diffusion on bipartite network , author =. International Journal on Artificial Intelligence Tools , publisher =
[180]

Global Crime , publisher =

Evolution of a drug trafficking network: Mapping changes in network structure and function across time , author =. Global Crime , publisher =
[181]

Journal of the Royal Statistical Society: Series C (Applied Statistics) , publisher =

Estimating whole-brain dynamics by using spectral clustering , author =. Journal of the Royal Statistical Society: Series C (Applied Statistics) , publisher =
[182]

Edge differentially private estimation in the beta -model via jittering and method of moments , author =
[183]

Locally Differentially Private Sparse Vector Aggregation , author =
[184]

Proceedings of the forty-eighth annual ACM symposium on Theory of Computing , pages =

Communication lower bounds for statistical estimation problems via a distributed data processing inequality , author =. Proceedings of the forty-eighth annual ACM symposium on Theory of Computing , pages =
[185]

Applied and Computational Harmonic Analysis , publisher =

How well can we estimate a sparse vector? , author =. Applied and Computational Harmonic Analysis , publisher =
[186]

arXiv preprint arXiv:2305.18987 , year=

Robust mean change point testing in high-dimensional data with heavy tails , author=. arXiv preprint arXiv:2305.18987 , year=
[187]

arXiv preprint arXiv:2011.14881 , year=

Phase transitions for support recovery under local differential privacy , author=. arXiv preprint arXiv:2011.14881 , year=

2011 arXiv
[188]

Interactive versus non-interactive locally differentially private estimation: Two elbows for the quadratic functional , author =
[189]

Locally differentially private estimation of nonlinear functionals of discrete distributions , author =
[190]

International Conference on Machine Learning , pages =

Differentially Private Community Detection for Stochastic Block Models , author =. International Conference on Machine Learning , pages =
[191]

The Annals of Statistics , publisher =

Minimax rates in sparse, high-dimensional change point detection , author =. The Annals of Statistics , publisher =
[192]

Conference on Learning Theory , pages=

Differential privacy and robust statistics in high dimensions , author=. Conference on Learning Theory , pages=. 2022 , organization=

2022
[193]

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) , pages=

Mechanism design via differential privacy , author=. 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) , pages=. 2007 , organization=

2007
[194]

Change point localization in dependent dynamic nonparametric random dot product graphs , journal =

Oscar Hernan Madrid. Change point localization in dependent dynamic nonparametric random dot product graphs , journal =
[195]

arXiv preprint arXiv:2212.05015 , year=

Robustness Implies Privacy in Statistical Estimation , author=. arXiv preprint arXiv:2212.05015 , year=

arXiv
[196]

Science , volume=

Inferring change points in the spread of COVID-19 reveals the effectiveness of interventions , author=. Science , volume=. 2020 , publisher=

2020
[197]

Electronic Journal of Statistics , volume=

Optimal multiple change-point detection for high-dimensional data , author=. Electronic Journal of Statistics , volume=. 2023 , publisher=

2023
[198]

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security , pages =

Generating synthetic decentralized social graphs with local differential privacy , author =. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security , pages =

2017
[199]

ACM Transactions on Database Systems (TODS) , publisher =

Private analysis of graph structure , author =. ACM Transactions on Database Systems (TODS) , publisher =
[200]

Theory of Cryptography Conference , pages =

Analyzing graphs with node differential privacy , author =. Theory of Cryptography Conference , pages =
[201]

IEEE Transactions on Information Forensics and Security , publisher =

AsgLDP: collecting and generating decentralized attributed graphs with local differential privacy , author =. IEEE Transactions on Information Forensics and Security , publisher =
[202]

Differentially private change-point detection , author =
[203]

arXiv preprint arXiv:2211.16333 , year=

Outlier-Robust Sparse Mean Estimation for Heavy-Tailed Distributions , author=. arXiv preprint arXiv:2211.16333 , year=

arXiv
[204]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms , pages =

Amplification by shuffling: From local to central differential privacy via anonymity , author =. Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms , pages =
[205]

Local differential privacy for evolving data , author =
[206]

Journal of the American Statistical Association , publisher =

Changepoint detection in the presence of outliers , author =. Journal of the American Statistical Association , publisher =
[207]

Towards Private Learning on Decentralized Graphs with Local Differential Privacy , author =
[208]

Differentially-private control-flow node coverage for software usage analysis , author =
[209]

Electronic Journal of Statistics , publisher =

Univariate mean change point detection: Penalization, cusum and optimality , author =. Electronic Journal of Statistics , publisher =
[210]

30th USENIX Security Symposium (USENIX Security 21) , pages =

Locally differentially private analysis of graph statistics , author =. 30th USENIX Security Symposium (USENIX Security 21) , pages =
[211]

High-dimensional, multiscale online changepoint detection , author =
[212]

Proceedings of the 2016 International Conference on Management of Data , pages =

Publishing graph degree distribution with node differential privacy , author =. Proceedings of the 2016 International Conference on Management of Data , pages =

2016
[213]

Advances in Neural Information Processing Systems , volume=

Learning with user-level privacy , author=. Advances in Neural Information Processing Systems , volume=
[214]

Sexually transmitted infections , publisher =

Risk network structure in the early epidemic phase of HIV transmission in Colorado Springs , author =. Sexually transmitted infections , publisher =
[215]

Publicationes Mathematicate , volume = 6, pages =

On random graph , author =. Publicationes Mathematicate , volume = 6, pages =
[216]

Advances in Neural Information Processing Systems , volume=

Network change point localisation under local differential privacy , author=. Advances in Neural Information Processing Systems , volume=
[217]

arXiv preprint arXiv:1706.06991 , year=

Adaptive Huber regression: Nonasymptotic optimality and phase transition , author=. arXiv preprint arXiv:1706.06991 , year=

arXiv
[218]

Physical review E , publisher =

Stochastic blockmodels and community structure in networks , author =. Physical review E , publisher =
[219]

Social networks , publisher =

Stochastic blockmodels: First steps , author =. Social networks , publisher =
[220]

Proceedings of the national academy of sciences , publisher =

Structure and tie strengths in mobile communication networks , author =. Proceedings of the national academy of sciences , publisher =
[221]

Advances in Neural Information Processing Systems , volume=

Adversarially robust change point detection , author=. Advances in Neural Information Processing Systems , volume=
[222]

The Annals of Statistics , publisher =

Inference using noisy degrees: Differentially private -model and synthetic graphs , author =. The Annals of Statistics , publisher =
[223]

ACM Transactions on Algorithms (TALG) , publisher =

Heavy hitters and the structure of local privacy , author =. ACM Transactions on Algorithms (TALG) , publisher =
[224]

Tight lower bounds for locally differentially private selection , author =
[225]

Proceedings of the forty-seventh annual ACM symposium on Theory of computing , pages =

Local, private, efficient protocols for succinct histograms , author =. Proceedings of the forty-seventh annual ACM symposium on Theory of computing , pages =
[226]

Nonparametric goodness-of-fit testing under Gaussian models , author =
[227]

The right complexity measure in locally private estimation: It is not the fisher information , author =
[228]

Robust estimation algorithms don't need to know the corruption level , author =
[229]

SIAM Journal on optimization , publisher =

Robust stochastic approximation approach to stochastic programming , author =. SIAM Journal on optimization , publisher =
[230]

Conference on Learning Theory , pages =

The Role of Interactivity in Structured Estimation , author =. Conference on Learning Theory , pages =
[231]

Robust Estimation of Discrete Distributions under Local Differential Privacy , author =
[232]

International Conference on Machine Learning , pages =

Robust Testing and Estimation under Manipulation Attacks , author =. International Conference on Machine Learning , pages =
[233]

arXiv preprint arXiv:2002.06633 , year=

Seeded binary segmentation: A general methodology for fast and optimal change point detection , author=. arXiv preprint arXiv:2002.06633 , year=

2002 arXiv
[234]

2021 IEEE Symposium on Security and Privacy (SP) , pages =

Manipulation attacks in local differential privacy , author =. 2021 IEEE Symposium on Security and Privacy (SP) , pages =

2021
[235]

Van Erven, Tim and Harremos, Peter , year = 2014, journal =. R

2014
[236]

Mironov, Ilya , year = 2017, booktitle =. R

2017
[237]

Communication-constrained hypothesis testing: Optimality, robustness, and reverse data processing inequalities , author =
[238]

International Conference on Artificial Intelligence and Statistics , pages =

Robust hypothesis testing and distribution estimation in Hellinger distance , author =. International Conference on Artificial Intelligence and Statistics , pages =
[239]

The Annals of Statistics , volume=

Robust sub-Gaussian estimation of a mean vector in nearly linear time , author=. The Annals of Statistics , volume=. 2022 , publisher=

2022
[240]

Proceedings of the thirtieth annual ACM-SIAM symposium on discrete algorithms , pages=

High-dimensional robust mean estimation in nearly-linear time , author=. Proceedings of the thirtieth annual ACM-SIAM symposium on discrete algorithms , pages=. 2019 , organization=

2019
[241]

Physica A: Statistical Mechanics and its Applications , volume=

Modelling financial volatility in the presence of abrupt changes , author=. Physica A: Statistical Mechanics and its Applications , volume=. 2013 , publisher=

2013
[242]

The Annals of Applied Statistics , volume=

Change-point model on nonhomogeneous Poisson processes with application in copy number profiling by next-generation DNA sequencing , author=. The Annals of Applied Statistics , volume=. 2012 , publisher=

2012
[243]

Journal of Applied Statistics , volume=

A Bayesian approach for locating change points in a compound Poisson process with application to detecting DNA copy number variations , author=. Journal of Applied Statistics , volume=. 2014 , publisher=

2014
[244]

arXiv preprint arXiv:1911.05911 , year=

Recent advances in algorithmic high-dimensional robust statistics , author=. arXiv preprint arXiv:1911.05911 , year=

1911 arXiv
[245]

Journal of the American Statistical Association , volume=

The statistical research group, 1942--1945 , author=. Journal of the American Statistical Association , volume=. 1980 , publisher=

1942
[246]

The Annals of Statistics , volume=

Adaptive and robust multi-task learning , author=. The Annals of Statistics , volume=. 2023 , publisher=

2023
[247]

Proceedings of the 28th ACM SIGKDD conference on knowledge discovery and data mining , pages=

Fldetector: Defending federated learning against model poisoning attacks via detecting malicious clients , author=. Proceedings of the 28th ACM SIGKDD conference on knowledge discovery and data mining , pages=
[248]

Proceedings of the ACM on Measurement and Analysis of Computing Systems , volume=

Securing distributed gradient descent in high dimensional statistical learning , author=. Proceedings of the ACM on Measurement and Analysis of Computing Systems , volume=. 2019 , publisher=

2019
[249]

Journal of Machine Learning Research , volume=

Minimax estimation for personalized federated learning: an alternative between FedAvg and local training? , author=. Journal of Machine Learning Research , volume=
[250]

Advances in Neural Information Processing Systems , volume=

Collaborative learning in the jungle (decentralized, byzantine, heterogeneous, asynchronous and nonconvex learning) , author=. Advances in Neural Information Processing Systems , volume=
[251]

International Conference on Learning Representations , year=

Byzantine-Robust Learning on Heterogeneous Datasets via Bucketing , author=. International Conference on Learning Representations , year=
[252]

International Conference on Machine Learning , pages=

Learning from History for Byzantine Robust Optimization , author=. International Conference on Machine Learning , pages=. 2021 , organization=

2021
[253]

Probability in high dimension , author=
[254]

arXiv preprint arXiv:2407.18384 , year=

Mathematical theory of deep learning , author=. arXiv preprint arXiv:2407.18384 , year=
[255]

Conference on Learning Theory , pages=

Faster algorithms for high-dimensional robust covariance estimation , author=. Conference on Learning Theory , pages=. 2019 , organization=

2019
[256]

Advances in Neural Information Processing Systems , volume=

Machine learning with adversaries: Byzantine tolerant gradient descent , author=. Advances in Neural Information Processing Systems , volume=
[257]

International Conference on Machine Learning , pages=

The Hidden Vulnerability of Distributed Learning in Byzantium , author=. International Conference on Machine Learning , pages=. 2018 , organization=

2018
[258]

IEEE Transactions on Information Theory , volume=

Simultaneous Support Recovery in High Dimensions: Benefits and Perils of Block _1/ _ -Regularization , author=. IEEE Transactions on Information Theory , volume=. 2011 , publisher=

2011
[259]

International Conference on Artificial Intelligence and Statistics , pages=

Exclusive lasso for multi-task feature selection , author=. International Conference on Artificial Intelligence and Statistics , pages=. 2010 , organization=

2010
[260]

Proceedings of the 26th annual International Conference on Machine Learning , pages=

Blockwise coordinate descent procedures for the multi-task lasso, with applications to neural semantic basis discovery , author=. Proceedings of the 26th annual International Conference on Machine Learning , pages=
[261]

Advances in Neural Information Processing Systems , volume=

Multi-task feature learning , author=. Advances in Neural Information Processing Systems , volume=
[262]

Arizona State University , volume=

Malsar: Multi-task learning via structural regularization , author=. Arizona State University , volume=
[263]

International Conference on Machine Learning , pages=

Sparse+ group-sparse dirty models: Statistical guarantees without unreasonable conditions and a case for non-convexity , author=. International Conference on Machine Learning , pages=. 2017 , organization=

2017
[264]

Advances in Neural Information Processing Systems , volume=

Dirty statistical models , author=. Advances in Neural Information Processing Systems , volume=
[265]

ACM Transactions on Knowledge Discovery from Data (TKDD) , volume=

Learning incoherent sparse and low-rank patterns from multiple tasks , author=. ACM Transactions on Knowledge Discovery from Data (TKDD) , volume=. 2012 , publisher=

2012
[266]

Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining , pages=

Integrating low-rank and group-sparse structures for robust multi-task learning , author=. Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining , pages=
[267]

Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining , pages=

Robust multi-task feature learning , author=. Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining , pages=
[268]

Proceedings of the ACM on Measurement and Analysis of Computing Systems , volume=

Distributed statistical machine learning in adversarial settings: Byzantine gradient descent , author=. Proceedings of the ACM on Measurement and Analysis of Computing Systems , volume=. 2017 , publisher=

2017
[269]

International Conference on Machine Learning , pages=

Byzantine-robust distributed learning: Towards optimal statistical rates , author=. International Conference on Machine Learning , pages=. 2018 , organization=

2018
[270]

Proceedings of Machine Learning Research , volume=

Towards the Theory of Unsupervised Federated Learning: Non-asymptotic Analysis of Federated EM Algorithms , author=. Proceedings of Machine Learning Research , volume=. 2024 , publisher=

2024
[271]

Annals of statistics , pages=

Adaptive estimation of a quadratic functional by model selection , author=. Annals of statistics , pages=. 2000 , publisher=

2000
[272]

arXiv preprint arXiv:2403.11343 , year=

Federated Transfer Learning with Differential Privacy , author=. arXiv preprint arXiv:2403.11343 , year=

arXiv
[273]

Advances in Neural Information Processing Systems , volume=

Personalized federated learning with moreau envelopes , author=. Advances in Neural Information Processing Systems , volume=
[274]

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining , pages=

Regularized multi--task learning , author=. Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining , pages=
[275]

Electronic Journal of Statistics , volume=

Concentration study of M-estimators using the influence function , author=. Electronic Journal of Statistics , volume=. 2022 , publisher=

2022
[276]

2023 , publisher=

Algorithmic high-dimensional robust statistics , author=. 2023 , publisher=

2023
[277]

Foundations and trends

Proximal algorithms , author=. Foundations and trends. 2014 , publisher=

2014
[278]

Statistical Science , volume=

Proximal Algorithms in Statistics and Machine Learning , author=. Statistical Science , volume=
[279]

Probability Theory and Related Fields , volume=

High dimensional robust m-estimation: Asymptotic variance via approximate message passing , author=. Probability Theory and Related Fields , volume=. 2016 , publisher=

2016
[280]

Journal of the American Statistical Association , volume=

Outlier detection using nonconvex penalized regression , author=. Journal of the American Statistical Association , volume=. 2011 , publisher=

2011
[281]

The Journal of Machine Learning Research , volume=

Multi-task regression using minimal penalties , author=. The Journal of Machine Learning Research , volume=. 2012 , publisher=

2012
[282]

IEEE Transactions on Information Theory , volume=

A dirty model for multiple sparse regression , author=. IEEE Transactions on Information Theory , volume=. 2013 , publisher=

2013
[283]

Algorithmic Learning Theory: 27th International Conference, ALT 2016, Bari, Italy, October 19-21, 2016, Proceedings 27 , pages=

A vector-contraction inequality for rademacher complexities , author=. Algorithmic Learning Theory: 27th International Conference, ALT 2016, Bari, Italy, October 19-21, 2016, Proceedings 27 , pages=. 2016 , organization=

2016
[284]

Advances in Neural Information Processing Systems , volume=

Concentration inequalities under sub-Gaussian and sub-exponential conditions , author=. Advances in Neural Information Processing Systems , volume=
[285]

IEEE Communications Surveys & Tutorials , volume=

Federated learning for internet of things: A comprehensive survey , author=. IEEE Communications Surveys & Tutorials , volume=. 2021 , publisher=

2021
[286]

ACM Transactions on Intelligent Systems and Technology (TIST) , volume=

Federated learning for healthcare: Systematic review and architecture proposal , author=. ACM Transactions on Intelligent Systems and Technology (TIST) , volume=. 2022 , publisher=

2022
[287]

arXiv preprint arXiv:1811.03604 , year=

Federated learning for mobile keyboard prediction , author=. arXiv preprint arXiv:1811.03604 , year=

arXiv
[288]

2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) , pages=

Statistical query lower bounds for robust estimation of high-dimensional gaussians and gaussian mixtures , author=. 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) , pages=. 2017 , organization=

2017
[289]

Journal of the European Mathematical Society , year=

Covariance estimation: Optimal dimension-free guarantees for adversarial corruption and heavy tails , author=. Journal of the European Mathematical Society , year=
[290]

arXiv preprint arXiv:2203.02880 , year=

Robust estimation of covariance matrices: Adversarial contamination and beyond , author=. arXiv preprint arXiv:2203.02880 , year=

arXiv
[291]

Statistical Science , volume=

User-friendly covariance estimation for heavy-tailed distributions , author=. Statistical Science , volume=. 2019 , publisher=

2019
[292]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing , pages=

Algorithms for heavy-tailed statistics: Regression, covariance estimation, and beyond , author=. Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing , pages=
[293]

Mathematical Statistics and Learning , year=

Statistically optimal robust mean and covariance estimation for anisotropic Gaussians , author=. Mathematical Statistics and Learning , year=
[294]

arXiv preprint arXiv:1610.02527 , year=

Federated optimization: Distributed machine learning for on-device intelligence , author=. arXiv preprint arXiv:1610.02527 , year=

arXiv
[295]

International Conference on Machine Learning , pages=

Robust learning from untrusted sources , author=. International Conference on Machine Learning , pages=. 2019 , organization=

2019
[296]

The Annals of Statistics , volume=

All-in-one robust estimator of the gaussian mean , author=. The Annals of Statistics , volume=. 2022 , publisher=

2022
[297]

Advances in Neural Information Processing Systems , volume=

Robust mean estimation without moments for symmetric distributions , author=. Advances in Neural Information Processing Systems , volume=
[298]

Conference on learning theory , pages=

How hard is robust mean estimation? , author=. Conference on learning theory , pages=. 2019 , organization=

2019
[299]

Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages=

Robustness implies privacy in statistical estimation , author=. Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages=
[300]

arXiv preprint arXiv:2303.17765 , year=

Learning from Similar Linear Representations: Adaptivity, Minimaxity, and Robustness , author=. arXiv preprint arXiv:2303.17765 , year=

arXiv

Pith tools

Reviewed July 12, 2026 · model on record in the stance chip above.

[1] [1]

1996 , publisher=

Weak Convergence and Empirical Processes: With Applications to Statistics , author=. 1996 , publisher=

1996

[2] [2]

IEEE Transactions on Signal Processing , volume=

Robust wavelet denoising , author=. IEEE Transactions on Signal Processing , volume=. 2001 , publisher=

2001

[3] [3]

Information and Inference: A Journal of the IMA , volume=

Estimating location parameters in sample-heterogeneous distributions , author=. Information and Inference: A Journal of the IMA , volume=. 2022 , publisher=

2022

[4] [4]

arXiv preprint arXiv:2508.19640 , year=

Optimal Cox regression under federated differential privacy: coefficients and cumulative hazards , author=. arXiv preprint arXiv:2508.19640 , year=

arXiv

[5] [5]

The Annals of Statistics , volume=

On robustness and local differential privacy , author=. The Annals of Statistics , volume=. 2023 , publisher=

2023

[6] [6]

International Conference on Algorithmic Learning Theory , pages=

Robust estimation of discrete distributions under local differential privacy , author=. International Conference on Algorithmic Learning Theory , pages=. 2023 , organization=

2023

[7] [7]

Advances in Neural Information Processing Systems , volume=

Robust and differentially private mean estimation , author=. Advances in Neural Information Processing Systems , volume=

[8] [8]

9th Innovations in Theoretical Computer Science Conference (ITCS 2018) , series =

Learning Discrete Distributions from Untrusted Batches , author =. 9th Innovations in Theoretical Computer Science Conference (ITCS 2018) , series =. 2018 , editor =. doi:10.4230/LIPIcs.ITCS.2018.47 , url =

work page doi:10.4230/lipics.itcs.2018.47 2018