Alex Olshevsky

From MaRDI portal
Person:325056

Available identifiers

zbMath Open olshevsky.alexMaRDI QIDQ325056

List of research outcomes





PublicationDate of PublicationType
Robust asynchronous stochastic gradient-push: asymptotically optimal and network-independent performance for strongly convex functions2020-10-05Paper
Gradient descent for sparse rank-one matrix completion for crowd-sourced aggregation of sparsely interacting workers2020-10-05Paper
Leakage certification revisited: bounding model errors in side-channel security evaluations2020-05-20Paper
Scaling Laws for Consensus Protocols Subject to Noise2019-07-18Paper
On (Non)Supermodularity of Average Control Energy2019-03-29Paper
Fast Convergence Rates for Distributed Non-Bayesian Learning2018-06-27Paper
Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs2018-01-10Paper
Linear time average consensus and distributed optimization on fixed graphs2018-01-04Paper
Minimal Controllability Problems2017-09-21Paper
Nonuniform coverage control on the line2017-09-08Paper
Degree Fluctuations and the Convergence Time of Consensus Algorithms2017-09-08Paper
Distributed Anonymous Discrete Function Computation2017-08-25Paper
A Lower Bound for Distributed Averaging Algorithms on the Line Graph2017-08-25Paper
On the Nonexistence of Quadratic Lyapunov Functions for Consensus Algorithms2017-08-08Paper
On Distributed Averaging Algorithms and Quantization Effects2017-08-08Paper
Distributed Optimization Over Time-Varying Directed Graphs2017-05-16Paper
Nonuniform Line Coverage From Noisy Scalar Measurements2017-05-16Paper
Stochastic Gradient-Push for Strongly Convex Functions on Time-Varying Directed Graphs2017-05-03Paper
Convergence Time of Quantized Metropolis Consensus Over Time-Varying Networks2017-05-03Paper
Distributed resource allocation on dynamic networks in quadratic time2017-01-23Paper
On primitivity of sets of matrices2015-12-22Paper
How to decide consensus? A combinatorial necessary and sufficient condition and a proof that consensus is decidable but NP-hard2015-02-09Paper
Consensus with ternary messages2014-07-30Paper
NP-hardness of deciding convexity of quartic polynomials and related problems2013-03-18Paper
Convergence speed in distributed consensus and averaging2012-01-09Paper
Matrix \(p\)-norms are NP-hard to approximate if \(p\neq1,2,\infty\)2011-03-02Paper
Convergence speed in distributed consensus and averaging2010-03-15Paper
Kharitonov's theorem and Bézoutians2005-04-21Paper

Research outcomes over time

This page was built for person: Alex Olshevsky