Geometric median in nearly linear time
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
In this paper we provide faster algorithms for solving the geometric median problem: given n points in d compute a point that minimizes the sum of Euclidean distances to the points. This is one of the oldest non-trivial problems in computational geometry yet despite a long history of research the previous fastest running times for computing a (1+є)-approximate geometric median were O(d· n4/3є−8/3) by Chin et. al, Õ(dexpє−4logє−1) by Badoiu et. al, O(nd+poly(d,є−1)) by Feldman and Langberg, and the polynomial running time of O((nd)O(1)log1/є) by Parrilo and Sturmfels and Xue and Ye.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Breakdown Points of Affine Equivariant Estimators of Multivariate Location and Covariance Matrices
Lopuhaa, H. P., & Rousseeuw, P. J. (1991) · The Annals of Statistics · doi:10.1214/aos/1176347978 · Cited by 446
The multivariate L 1 -median and associated data depth
Vardi, Y., & Zhang, C.-H. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.97.4.1423 · Cited by 430 · cited 1×
“There have been many proposed modifications to Weiszfeld’s algorithm [8, 25, 23, 3, 27, 16] that in general give non-asymptotic runtime guarantees.”
MethodThe algebraic degree of geometric optimization problems
Bajaj, C. (1988) · Discrete & Computational Geometry · doi:10.1007/bf02187906 · Cited by 200
Cited by
(2017) · neural information processing systems · Cited by 1,413
Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Acceleration
He, Y., Liu, P., Wang, Z., Hu, Z., & Yang, Y. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00447 · Cited by 1,217
Robust Aggregation for Federated Learning
Pillutla, K., Kakade, S. M., & Harchaoui, Z. (2022) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2022.3153135 · Cited by 801
Distributed Statistical Machine Learning in Adversarial Settings: Byzantine Gradient Descent
Chen, Y., Su, L., & Xu, J. (2017) · Proceedings of the ACM on Measurement and Analysis of Computing Systems · doi:10.1145/3154503 · Cited by 390
“The parameter server computes the geometric median of means of gradients, which takes O(md + kd log(3)(N)), as the geometric median can be computed in O(kd log(3)(N)) [9].”
MethodDistributed Statistical Machine Learning in Adversarial Settings: Byzantine Gradient Descent
Chen, Y., Su, L., & Xu, J. (2018) · Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems · doi:10.1145/3219617.3219655 · Cited by 228
Metadata
- Authors
- Cohen, M. B., Lee, Y. T., Miller, G., Pachocki, J., & Sidford, A.
- Venue
- Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
- Publisher
- ACM
- Published
- 2016-06-19
- Pages
- 9-21
- OpenAlex
- W2410099853
- Cited by
- 107
- References
- 3
- FWCI
- 15.24
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Geometric median in nearly linear time. https://app.cochat.ai/papers/10.1145/2897518.2897647
- The paper
- Cohen, M. B., Lee, Y. T., Miller, G., Pachocki, J., & Sidford, A. (2016). Geometric median in nearly linear time. Proceedings of the forty-eighth annual ACM symposium on Theory of Computing. https://doi.org/10.1145/2897518.2897647
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.