Olshevsky, Alex
Boston University
7 papers on CoChatORCID 0000-0002-5852-9789
Most cited papers
- Verified
Distributed Optimization Over Time-Varying Directed Graphs
Nedic, A., & Olshevsky, A. (2015) · IEEE Transactions on Automatic Control
Distributed Control Multi-Agent SystemsOptimization and Variational Analysis
Cited by 1,187
- Verified
Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
Nedić, A., Olshevsky, A., & Shi, W. (2017) · SIAM Journal on Optimization
Distributed Control Multi-Agent SystemsOptimization and Variational Analysis
Cited by 1,069
- Verified
Federated learning of predictive models from federated Electronic Health Records
Brisimi, T. S., Chen, R., Mela, T., Olshevsky, A., Paschalidis, I. C., & Shi, W. (2018) · International Journal of Medical Informatics
Privacy-Preserving Technologies in DataDistributed Control Multi-Agent Systems
Cited by 997
- Verified
On Distributed Averaging Algorithms and Quantization Effects
Nedic, A., Olshevsky, A., Ozdaglar, A., & Tsitsiklis, J. N. (2009) · IEEE Transactions on Automatic Control
Distributed Control Multi-Agent SystemsStability and Control of Uncertain Systems
Cited by 557
- Verified
Geometrically convergent distributed optimization with uncoordinated step-sizes
Nedic, A., Olshevsky, A., Shi, W., & Uribe, C. A. (2017) · 2017 American Control Conference (ACC)
Distributed Control Multi-Agent SystemsStochastic Gradient Optimization Techniques
Cited by 145
- Verified
Distributed optimization over time-varying directed graphs
Nedic, A., & Olshevsky, A. (2013) · 52nd IEEE Conference on Decision and Control
Distributed Control Multi-Agent SystemsOptimization and Variational Analysis
Cited by 72
- Verified
Stochastic Gradient-Push for Strongly Convex Functions on Time-Varying Directed Graphs
Nedic, A., & Olshevsky, A. (2014) · arXiv
Distributed Control Multi-Agent SystemsStochastic Gradient Optimization Techniques
Cited by 38
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free