Harnessing smoothness to accelerate distributed optimization
The DOI matches its Crossref record; 36 of the 37 references it cites were found in a registry or an index.
Abstract
There has been a growing effort in studying the distributed optimization problem over a network. The objective is to optimize a global function formed by a sum of local functions, using only local computation and communication. Literature has developed consensus-based distributed (sub)gradient descent (DGD) methods and has shown that they have the same convergence rate O(log t/√t) as the centralized (sub)gradient methods (CGD) when the function is convex but possibly nonsmooth. However, when the function is convex and smooth, under the framework of DGD, it is unclear how to harness the smoothness to obtain a faster convergence rate comparable to CGD's convergence rate. In this paper, we propose a distributed algorithm that, despite using the same amount of communication per iteration as DGD, can effectively harnesses the function smoothness and converge to the optimum with a rate of O(1/t). If the objective function is further strongly convex, our algorithm has a linear convergence rate. Both rates match the convergence rate of CGD. The key step in our algorithm is a novel gradient estimation scheme that uses history information to achieve fast and accurate estimation of the average gradient. To motivate the necessity of history information, we also show that it is impossible for a class of distributed algorithms like DGD to achieve a linear convergence rate without using history information even if the objective function is strongly convex and smooth.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“However, none of the papers mentioned in this paragraph provide a theoretical analysis for strongly convex optimization problems over time-varying graphs , which is the goal of this paper.”
From Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs (2017) · cites this paper as [52]
In the citing paper
“Finally, we note that reference [52], appearing simultaneously with this work, also proposed a method for distributed optimization based on gradient differences.”
From Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs (2017) · cites this paper as [52]
Citations
Cites
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Consensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522 · cited 1×
“2The selection of the consensus weights is an intensely studied problem, see [23], [24].”
BackgroundErdős, P., & Rényi, A. (2022) · Publicationes Mathematicae Debrecen · doi:10.5486/pmd.1959.6.3-4.12 · Cited by 5,337
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Distributed Subgradient Methods for Multi-Agent Optimization
Nedic, A., & Ozdaglar, A. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2009515 · Cited by 3,719 · cited 4×
“, [6], [8]–[13], [16]– [18], [20], [21], that combine a consensus algorithm and a first order optimization algorithm.”
BackgroundMethodInfluentialMatrix Analysis and Applied Linear Algebra
Meyer, C. (2000) · doi:10.1137/1.9780898719512 · Cited by 3,565
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
Matrix analysis and applied linear algebra
(2001) · Choice Reviews Online · doi:10.5860/choice.38-5065 · Cited by 3,300
Parlar, M. (2000) · Interactive Operations Research with Maple · doi:10.1007/978-1-4612-1356-7_5 · Cited by 1,741
EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
Shi, W., Ling, Q., Wu, G., & Yin, W. (2015) · SIAM Journal on Optimization · doi:10.1137/14096668x · Cited by 1,261
Research works printed but not linked: 1
- 2012, Logistic Regression
Cited by
Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
Nedić, A., Olshevsky, A., & Shi, W. (2017) · SIAM Journal on Optimization · doi:10.1137/16m1084316 · Cited by 1,069
“Finally, we note that reference [52], appearing simultaneously with this work, also proposed a method for distributed optimization based on gradient differences.”
MethodHarnessing Smoothness to Accelerate Distributed Optimization
Qu, G., & Li, N. (2018) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2017.2698261 · Cited by 565
Self-citationNetwork Topology and Communication-Computation Tradeoffs in Decentralized Optimization
Nedic, A., Olshevsky, A., & Rabbat, M. G. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2817461 · Cited by 534
Li, Z., Shi, W., & Yan, M. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2926022 · Cited by 244
A Linear Algorithm for Optimization Over Directed Graphs With Geometric Convergence
Xin, R., & Khan, U. A. (2018) · IEEE Control Systems Letters · doi:10.1109/lcsys.2018.2834316 · Cited by 243
Linear Convergence in Optimization Over Directed Graphs With Row-Stochastic Matrices
Xi, C., Mai, V. S., Xin, R., Abed, E. H., & Khan, U. A. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2797164 · Cited by 215
Convergence of Asynchronous Distributed Gradient Methods Over Stochastic Networks
Xu, J., Zhu, S., Soh, Y. C., & Xie, L. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2730481 · Cited by 214
Distributed nonconvex constrained optimization over time-varying digraphs
Scutari, G., & Sun, Y. (2019) · Mathematical Programming · doi:10.1007/s10107-018-01357-w · Cited by 210
Exact Diffusion for Distributed Optimization and Learning—Part I: Algorithm Development
Yuan, K., Ying, B., Zhao, X., & Sayed, A. H. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2875898 · Cited by 200
Communication-efficient algorithms for decentralized and stochastic optimization
Lan, G., Lee, S., & Zhou, Y. (2020) · Mathematical Programming · doi:10.1007/s10107-018-1355-4 · Cited by 187
On Nonconvex Decentralized Gradient Descent
Zeng, J., & Yin, W. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2818081 · Cited by 184
ADD-OPT: Accelerated Distributed Directed Optimization
Xi, C., Xin, R., & Khan, U. A. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2737582 · Cited by 181
Optimal Distributed Feedback Voltage Control Under Limited Reactive Power
Qu, G., & Li, N. (2019) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2019.2931685 · Cited by 160
Self-citationAn Improved Convergence Analysis for Decentralized Online Stochastic Non-Convex Optimization
Xin, R., Khan, U. A., & Kar, S. (2021) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2021.3062553 · Cited by 147
Geometrically convergent distributed optimization with uncoordinated step-sizes
Nedic, A., Olshevsky, A., Shi, W., & Uribe, C. A. (2017) · 2017 American Control Conference (ACC) · doi:10.23919/acc.2017.7963560 · Cited by 145
Decentralized Frank–Wolfe Algorithm for Convex and Nonconvex Problems
Wai, H.-T., Lafond, J., Scaglione, A., & Moulines, É. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2685559 · Cited by 144
Convergence rate analysis of distributed optimization with projected subgradient algorithm
Liu, S., Qiu, Z., & Xie, L. (2017) · Automatica · doi:10.1016/j.automatica.2017.06.011 · Cited by 122
Distributed Optimization for Smart Cyber-Physical Networks
Notarstefano, G., Notarnicola, I., & Camisa, A. (2019) · Foundations and Trends® in Systems and Control · doi:10.1561/2600000020 · Cited by 122
Parallel and Distributed Successive Convex Approximation Methods for Big-Data Optimization
Scutari, G., & Sun, Y. (2018) · Lecture notes in mathematics · doi:10.1007/978-3-319-97142-1_3 · Cited by 121
A Push-Pull Gradient Method for Distributed Optimization in Networks
Pu, S., Shi, W., Xu, J., & Nedic, A. (2018) · 2018 IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619047 · Cited by 94
Solving a system of linear equations: From centralized to distributed algorithms
Wang, P., Mou, S., Lian, J. J., & Ren, W. (2019) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2019.04.008 · Cited by 95
Decentralized Accelerated Gradient Methods With Increasing Penalty Parameters
Li, H., Fang, C., Yin, W., & Lin, Z. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.3018317 · Cited by 88
Distributed nonconvex multiagent optimization over time-varying networks
Sun, Y., Scutari, G., & Palomar, D. (2016) · 2016 50th Asilomar Conference on Signals, Systems and Computers · doi:10.1109/acssc.2016.7869154 · Cited by 86
Distributed Discrete-Time Optimization in Multiagent Networks Using Only Sign of Relative State
Zhang, J., You, K., & Başar, T. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2884998 · Cited by 86
Distributed Nesterov Gradient Methods Over Arbitrary Graphs
Xin, R., Jakovetić, D., & Khan, U. A. (2019) · IEEE Signal Processing Letters · doi:10.1109/lsp.2019.2925537 · Cited by 86
A Linearly Convergent Algorithm for Decentralized Optimization: Sending Less Bits for Free!Preprint
Kovalev, D. A., Koloskova, A., Jaggi, M., Richtárik, P., & Stich, S. U. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.01697 · Cited by 75
A Robust Gradient Tracking Method for Distributed Optimization over Directed Networks
Pu, S. (2020) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc42340.2020.9303917 · Cited by 60
Recent Theoretical Advances in Decentralized Distributed Convex Optimization
Gorbunov, E., Rogozin, A., Beznosikov, A. N., Dvinskikh, D., & Gasnikov, A. V. (2022) · Springer optimization and its applications · doi:10.1007/978-3-031-00832-0_8 · Cited by 48
Decentralized Optimization Over the Stiefel Manifold by an Approximate Augmented Lagrangian Function
Wang, L., & Liu, X. (2022) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2022.3182883 · Cited by 46
Distributed Optimization with Dynamic Event-Triggered Mechanisms
Du, W. J., Yi, X., George, J., Johansson, K. H., & Yang, T. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619311 · Cited by 44
Wang, P., Ren, W., & Duan, Z. (2018) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2018.2797805 · Cited by 39
Maros, M., & Jaldén, J. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619626 · Cited by 34
Luan, M., Wen, G., Liu, H., Huang, T., Chen, G., & Yu, W. (2023) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2023.3270185 · Cited by 28
Accelerated Distributed Nesterov Gradient Descent for smooth and strongly convex functions
Qu, G., & Li, N. (2016) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2016.7852231 · Cited by 28
Self-citationDistributed Finite-Time Optimization
Yao, L., Yuan, Y., Sundaram, S., & Yang, T. (2018) · International Conference on Control and Automation · doi:10.1109/icca.2018.8444343 · Cited by 27
Zhang, X., Fang, M., Liu, Z., Yang, H., Liu, J., & Zhu, Z. (2022) · ACM International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing (MobiHoc) · doi:10.1145/3492866.3549723 · Cited by 26
Distributed Big-Data Optimization via Blockwise Gradient Tracking
Notarnicola, I., Sun, Y., Scutari, G., & Notarstefano, G. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.3008713 · Cited by 26
Accelerated Distributed Dual Averaging Over Evolving Networks of Growing Connectivity
Liu, S., Chen, P., & Hero, A. O. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2793878 · Cited by 21
Partition-based multi-agent optimization in the presence of lossy and asynchronous communication
Todescato, M., Bof, N., Cavraro, G., Carli, R., & Schenato, L. (2019) · Automatica · doi:10.1016/j.automatica.2019.108648 · Cited by 20
Accelerated distributed Nesterov Gradient Descent for convex and smooth functions
Qu, G., & Li, N. (2017) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2017.8263979 · Cited by 19
Self-citationDistributed Online Private Learning of Convex Nondecomposable Objectives
Cheng, H., Liao, X., & Li, H. (2023) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2023.3329832 · Cited by 18
Distributed big-data optimization via block-iterative convexification and averaging
Notarnicola, I., Sun, Y., Scutari, G., & Notarstefano, G. (2017) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2017.8263982 · Cited by 18
Implicit Tracking-Based Distributed Constraint-Coupled Optimization
Li, J., & Su, H. (2022) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2022.3203486 · Cited by 17
Projected Push-Pull for Distributed Constrained Optimization Over Time-Varying Directed Graphs
Akgün, O. E., Dayı, A. K., Gil, S., & Nedić, A. (2024) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc60939.2024.10644202 · Cited by 15
On the Convergence of Distributed Subgradient Methods under Quantization
Doan, T. T., Maguluri, S. T., & Romberg, J. (2018) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2018.8636036 · Cited by 14
Lin, Y., Li, W., Zhang, B., & Du, J. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3492329 · Cited by 13
Event-Triggered Consensus-Based Optimization Algorithm for Smooth and Strongly Convex Cost Functions
Hayashi, N., Sugiura, T., Kajiyama, Y., & Takai, S. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8618863 · Cited by 12
Wang, L., & Liu, X. (2023) · Journal of Industrial and Management Optimization · doi:10.3934/jimo.2023018 · Cited by 11
Convergence Rate of Distributed Subgradient Methods under Communication Delays
Doan, T. T., Beck, C. L., & Srikant, R. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431382 · Cited by 11
Xu, P., Wang, Y., Chen, X., & Tian, Z. (2023) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2023.3310499 · Cited by 10
Accelerated Dual Averaging Methods for Decentralized Constrained Optimization
Liu, C., Shi, Y., Li, H., & Du, W. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3173062 · Cited by 9
On the Linear Convergence of Two Decentralized Algorithms
Li, Y., & Yan, M. (2021) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-021-01833-y · Cited by 9
An accelerated algorithm for distributed optimization with Barzilai-Borwein step sizes
Zhang, X., Liu, S., & Zhao, N. (2022) · Signal Processing · doi:10.1016/j.sigpro.2022.108748 · Cited by 7
Fast Distributed Optimization over Directed Graphs under Malicious Attacks using TrustPreprint
Dayı, A. K., Akgün, O. E., Gil, S., Yemini, M., & Nedić, A. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2407.06541 · Cited by 7
Kajiyama, Y., Hayashi, N., & Takai, S. (2017) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2017.8264346 · Cited by 6
Aggregating Stochastic Gradients in Distributed Optimization
Doan, T. T. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431394 · Cited by 5
A Convergence-preserving Data Integrity Attack on Distributed Optimization Using Local Information
Ding, T., Xu, Q., Zhu, S., & Guan, X. (2020) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc42340.2020.9304245 · Cited by 5
Distributed Event-Triggered Stochastic Gradient-Tracking for Nonconvex Optimization
ISHIKAWA, D., Hayashi, N., & Takai, S. (2024) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.2023map0002 · Cited by 4
Distributed Trust-Region Method With First Order Models
Armacki, A., Jakovetić, D., Krejić, N., & Jerinkić, N. K. (2019) · IEEE EUROCON - International Conference on Computer as a Tool (EUROCON) · doi:10.1109/eurocon.2019.8861739 · Cited by 4
Akgün, O. E., Dayı, A. K., Gil, S., & Nedić, A. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2310.06223 · Cited by 4
Decentralized stochastic sharpness-aware minimization algorithm
Chen, S., Deng, X., Xu, D., Sun, T., & Li, D. (2024) · Neural Networks · doi:10.1016/j.neunet.2024.106325 · Cited by 3
Improved Convergence Rates of P-EXTRA for Non-smooth Distributed optimization
Wu, X., & Lu, J. (2019) · International Conference on Control and Automation · doi:10.1109/icca.2019.8899909 · Cited by 3
2018 Index IEEE Transactions on Control of Network Systems Vol. 5
(2018) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2019.2896050 · Cited by 3
Malaspina, G., Jakovetić, D., & Krejić, N. (2023) · Optimization Letters · doi:10.1007/s11590-023-02011-x · Cited by 2
Learning and Optimization in Wireless Sensor Networks
Qureshi, M. I., Rikos, A. I., Charalambous, T., & Khan, U. A. (2025) · Wiley eBooks · doi:10.1002/9781394249879.ch2 · Cited by 2
An Approximately-Zero-Gradient-Sum Algorithm for Consensus Optimization
Wei, H., Qu, Z., Wu, X., Wang, H., & Lu, J. (2018) · International Conference on Control, Automation, Robotics and Vision (ICARCV) · doi:10.1109/icarcv.2018.8581380 · Cited by 2
A Flexible Distributed Optimization Framework for Service of Concurrent Tasks in Processing Networks
Shi, Z., & Eryılmaz, A. (2019) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2019.8737632 · Cited by 2
On the Convergence of NEAR-DGD for Nonconvex Optimization with Second Order Guarantees
Iakovidou, C., & Wei, E. (2021) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc45484.2021.9683777 · Cited by 2
Decentralized Gradient Descent: Bottleneck Regimes and Budget ComplexityPreprint
Michelusi, N. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2607.12172 · Cited by 2
Decentralized Sum-of-Nonconvex Optimization
Liu, Z., & Low, B. K. H. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i13.29318 · Cited by 1
A variance‐reduced distributed stochastic momentum algorithm over directed networks
Gong, X., Gao, J., & Liu, X. (2025) · Asian Journal of Control · doi:10.1002/asjc.3775 · Cited by 1
Distributed Online Randomized Gradient-Free Optimization With Compressed Communication
Zhu, L., Shi, X., Xu, X., Cao, J., & Chen, X. (2026) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2026.3710570 · Cited by 1
Optimization over directed graphs: Linear convergence rate
Xi, C., & Khan, U. A. (2017) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2017.7952958
Methods for Decentralized Signal Processing With Big Data
Wai, H.-T., Scaglione, A., & Moulines, É. (2018) · Elsevier eBooks · doi:10.1016/b978-0-12-813677-5.00015-8
SUBGRADIENT PROJECTION OVER DIRECTED GRAPHS USING SURPLUS CONSENSUS
Xin, R., Xi, C., & Khan, U. A. (2018) · IEEE Data Science Workshop (DSW) · doi:10.1109/dsw.2018.8439884
Spectral-like gradient method for distributed optimization
Jakovetić, D., Krejić, N., & Jerinkić, N. K. (2019) · IEEE EUROCON - International Conference on Computer as a Tool (EUROCON) · doi:10.1109/eurocon.2019.8861761
Distributed multi-agent consensus under constraints
Qiu, Z. (2017) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/72344
Consensus and Diffusion for First-Order Distributed Optimization Over Multi-Hop Network
Wu, M., Liao, H., Tan, L., Jin, G., Zhong, L., Xiao, Y., & Wang, Z. (2023) · IEEE Access · doi:10.1109/access.2023.3297112
Extrapolated Gradient for Accelerating Online Distributed Stochastic Optimization
Lin, Y., & Li, W. (2025) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc65474.2025.11091074
A New Paradigm for Decentralized Nonconvex Optimization with Improved Convergence
Phuong, T. T., & Phong, L. T. (2025) · Lecture notes on data engineering and communications technologies · doi:10.1007/978-3-031-96099-4_29
Trust-Based Algorithms for Resilient Multi-Agent Systems
Akgün, O. E. (2025) · Digital Access to Scholarship at Harvard (DASH) (Harvard University)
Metadata
- Authors
- Qu, G., & Li, N.
- Affiliations
- Harvard University (US)
- ORCID
- Venue
- 2016 IEEE 55th Conference on Decision and Control (CDC)
- Publisher
- IEEE
- Published
- 2016-12
- Pages
- 159-166
- ISSN
- 0191-2216 (ISSN-L)
- OpenAlex
- W2400034325
- Cited by
- 72
- References
- 37
- Citations by year
- 2025: 4 · 2024: 5 · 2023: 4 · 2022: 7 · 2021: 3 · 2020: 5 · 2019: 10 · 2018: 22 · 2017: 9 · 2016: 3
- FWCI
- 12.53
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- IEEE Conference on Decision and Control (CDC) (publishedVersion)
- Topics
- Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
- Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
- Keywords
- distributed optimization, smoothness, linear convergence, strongly convex functions, gradient estimation, history information, convergence rate, nonsmooth optimization, communication complexity
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
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.