Alexander Olshevsky

IEEE Signal Process. Mag., 2020

Robust Asynchronous Stochastic Gradient-Push: Asymptotically Optimal and Network-Independent Performance for Strongly Convex Functions.

[BibT_eX]

[DOI]

Artin Spiridonoff

J. Mach. Learn. Res., 2020

Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workers.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2020

On a Relaxation of Time-Varying Actuator Placement.

[BibT_eX]

[DOI]

IEEE Control. Syst. Lett., 2020

Local SGD With a Communication Overhead Depending Only on the Number of Workers.

[BibT_eX]

[DOI]

Artin Spiridonoff

CoRR, 2020

Adversarial Crowdsourcing Through Robust Rank-One Matrix Completion.

[BibT_eX]

[DOI]

Qianqian Ma

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Minimax Rate for Learning From Pairwise Comparisons in the BTL Model.

[BibT_eX]

[DOI]

Venkatesh Saligrama

Proceedings of the 37th International Conference on Machine Learning, 2020

Minimax Rank-$1$ Matrix Factorization.

[BibT_eX]

[DOI]

Venkatesh Saligrama

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019

Minimal Reachability is Hard To Approximate.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2019

Scaling Laws for Consensus Protocols Subject to Noise.

[BibT_eX]

[DOI]

François-Xavier Standaert

IEEE Trans. Autom. Control., 2019

Leakage Certification Revisited: Bounding Model Errors in Side-Channel Security Evaluations.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

On the Inapproximability of the Discrete Witsenhausen Problem.

[BibT_eX]

[DOI]

IEEE Control. Syst. Lett., 2019

Asymptotic Network Independence in Distributed Optimization for Machine Learning.

[BibT_eX]

[DOI]

Shi Pu

CoRR, 2019

A Non-Asymptotic Analysis of Network Independence for Distributed Stochastic Gradient Descent.

[BibT_eX]

[DOI]

Shi Pu

CoRR, 2019

Graph Resistance and Learning from Pairwise Comparisons.

[BibT_eX]

[DOI]

Venkatesh Saligrama

Proceedings of the 36th International Conference on Machine Learning, 2019

2018

On (Non)Supermodularity of Average Control Energy.

[BibT_eX]

[DOI]

IEEE Trans. Control. Netw. Syst., 2018

Network Topology and Communication-Computation Tradeoffs in Decentralized Optimization.

[BibT_eX]

[DOI]

Michael G. Rabbat

Proc. IEEE, 2018

Federated learning of predictive models from federated Electronic Health Records.

[BibT_eX]

[DOI]

Int. J. Medical Informatics, 2018

Graph-Theoretic Analysis of Belief System Dynamics under Logic Constraints.

[BibT_eX]

[DOI]

César A. Uribe

CoRR, 2018

Improved Convergence Rates for Distributed Resource Allocation.

[BibT_eX]

[DOI]

Proceedings of the 57th IEEE Conference on Decision and Control, 2018

Fully Asynchronous Push-Sum With Growing Intercommunication Intervals.

[BibT_eX]

[DOI]

Artin Spiridonoff

Proceedings of the 2018 Annual American Control Conference, 2018

Limitations and Tradeoffs in Minimum Input Selection Problems.

[BibT_eX]

[DOI]

Milad Siami

Proceedings of the 2018 Annual American Control Conference, 2018

QoS Multimedia Multicast Routing.

[BibT_eX]

Ion I. Mandoiu

Alexander Zelikovsky

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

Fast Convergence Rates for Distributed Non-Bayesian Learning.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2017

Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs.

[BibT_eX]

[DOI]

SIAM J. Optim., 2017

Linear Time Average Consensus and Distributed Optimization on Fixed Graphs.

[BibT_eX]

[DOI]

SIAM J. Control. Optim., 2017

Distributed resource allocation on dynamic networks in quadratic time.

[BibT_eX]

[DOI]

Thinh T. Doan

Syst. Control. Lett., 2017

Distributed Learning for Cooperative Inference.

[BibT_eX]

[DOI]

César A. Uribe

CoRR, 2017

Crowdsourcing with Sparsely Interacting Workers.

[BibT_eX]

[DOI]

CoRR, 2017

Geometrically convergent distributed optimization with uncoordinated step-sizes.

[BibT_eX]

[DOI]

Proceedings of the 2017 American Control Conference, 2017

2016

Stochastic Gradient-Push for Strongly Convex Functions on Time-Varying Directed Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2016

Convergence Time of Quantized Metropolis Consensus Over Time-Varying Networks.

[BibT_eX]

[DOI]

Tamer Basar

Seyed Rasoul Etesami

IEEE Trans. Autom. Control., 2016

On Symmetric Continuum Opinion Dynamics.

[BibT_eX]

[DOI]

SIAM J. Control. Optim., 2016

Eigenvalue clustering, control energy, and logarithmic capacity.

[BibT_eX]

[DOI]

Syst. Control. Lett., 2016

Linearly convergent decentralized consensus optimization over directed networks.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE Global Conference on Signal and Information Processing, 2016

Fast algorithms for distributed optimization and hypothesis testing: A tutorial.

[BibT_eX]

[DOI]

Proceedings of the 55th IEEE Conference on Decision and Control, 2016

A geometrically convergent method for distributed optimization over time-varying graphs.

[BibT_eX]

[DOI]

Angelia Nedich

Proceedings of the 55th IEEE Conference on Decision and Control, 2016

A tutorial on distributed (non-Bayesian) learning: Problem, algorithms and results.

[BibT_eX]

[DOI]

Proceedings of the 55th IEEE Conference on Decision and Control, 2016

Distributed learning with infinitely many hypotheses.

[BibT_eX]

[DOI]

Proceedings of the 55th IEEE Conference on Decision and Control, 2016

On performance of consensus protocols subject to noise: Role of hitting times and network structure.

[BibT_eX]

[DOI]

Proceedings of the 55th IEEE Conference on Decision and Control, 2016

Network independent rates in distributed learning.

[BibT_eX]

[DOI]

Proceedings of the 2016 American Control Conference, 2016

Distributed Gaussian learning over time-varying directed graphs.

[BibT_eX]

[DOI]

Proceedings of the 50th Asilomar Conference on Signals, Systems and Computers, 2016

2015

Distributed Optimization Over Time-Varying Directed Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2015

Nonuniform Line Coverage From Noisy Scalar Measurements.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2015

Cooperative Learning in Multiagent Systems from Intermittent Measurements.

[BibT_eX]

[DOI]

Naomi Ehrich Leonard

SIAM J. Control. Optim., 2015

Fast Convergence of Quantized Consensus Using Metropolis Chains Over Static and Dynamic Networks.

[BibT_eX]

[DOI]

Tamer Basar

Seyed Rasoul Etesami

CoRR, 2015

On primitivity of sets of matrices.

[BibT_eX]

[DOI]

Vincent D. Blondel

Raphaël M. Jungers

Autom., 2015

Minimum input selection for structural controllability.

[BibT_eX]

[DOI]

Proceedings of the American Control Conference, 2015

Nonasymptotic convergence rates for cooperative learning over time-varying directed graphs.

[BibT_eX]

[DOI]

Proceedings of the American Control Conference, 2015

2014

Minimal Controllability Problems.

[BibT_eX]

[DOI]

IEEE Trans. Control. Netw. Syst., 2014

Consensus with Ternary Messages.

[BibT_eX]

[DOI]

SIAM J. Control. Optim., 2014

How to Decide Consensus? A Combinatorial Necessary and Sufficient Condition and a Proof that Consensus is Decidable but NP-Hard.

[BibT_eX]

[DOI]

Vincent D. Blondel

SIAM J. Control. Optim., 2014

Average Consensus in Nearly Linear Time on Fixed Graphs and Implications for Decentralized Optimization and Multi-Agent Control.

[BibT_eX]

[DOI]

CoRR, 2014

Graph diameter, eigenvalues, and minimum-time consensus.

[BibT_eX]

[DOI]

Raphaël M. Jungers

Guillaume Vankeerberghen

Autom., 2014

Fast convergence of quantized consensus using Metropolis chains.

[BibT_eX]

[DOI]

Tamer Basar

Seyed Rasoul Etesami

Proceedings of the 53rd IEEE Conference on Decision and Control, 2014

2013

Degree Fluctuations and the Convergence Time of Consensus Algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2013

Nonuniform Coverage Control on the Line.

[BibT_eX]

[DOI]

Naomi Ehrich Leonard

IEEE Trans. Autom. Control., 2013

NP-hardness of deciding convexity of quartic polynomials and related problems.

[BibT_eX]

[DOI]

Math. Program., 2013

The Minimal Controllability Problem

[BibT_eX]

[DOI]

CoRR, 2013

Distributed optimization of strongly convex functions on directed time-varying graphs.

[BibT_eX]

[DOI]

Proceedings of the IEEE Global Conference on Signal and Information Processing, 2013

Combinatorial bounds and scaling laws for noise amplification in networks.

[BibT_eX]

[DOI]

Proceedings of the 12th European Control Conference, 2013

Cooperative learning in multi-agent systems from intermittent measurements.

[BibT_eX]

[DOI]

Naomi Ehrich Leonard

Proceedings of the 52nd IEEE Conference on Decision and Control, 2013

Symmetric continuum opinion dynamics: Convergence, but sometimes only in distribution.

[BibT_eX]

[DOI]

Proceedings of the 52nd IEEE Conference on Decision and Control, 2013

2012

Diameter, Optimal Consensus, and Graph Eigenvalues

[BibT_eX]

[DOI]

Raphaël M. Jungers

Guillaume Vankeerberghen

CoRR, 2012

On the cost of deciding consensus.

[BibT_eX]

[DOI]

Vincent D. Blondel

Proceedings of the 51th IEEE Conference on Decision and Control, 2012

2011

A Lower Bound for Distributed Averaging Algorithms on the Line Graph.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2011

Distributed Anonymous Discrete Function Computation.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2011

Convergence Speed in Distributed Consensus and Averaging.

[BibT_eX]

[DOI]

SIAM Rev., 2011

2010

Efficient information aggregation strategies for distributed control and signal processing.

[BibT_eX]

[DOI]

PhD thesis, 2010

Matrix p-Norms Are NP-Hard to Approximate If p!=q1, 2, INFINITY.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2010

2009

On Distributed Averaging Algorithms and Quantization Effects.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2009

On the NP-Hardness of Checking Matrix Polytope Stability and Continuous-Time Switching Stability.

[BibT_eX]

[DOI]

Leonid Gurvits

IEEE Trans. Autom. Control., 2009

Matrix P-norms are NP-hard to approximate if p \neq 1,2,\infty

[BibT_eX]

[DOI]

CoRR, 2009

Distributed anonymous function computation in information fusion and multiagent systems.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008

On the Nonexistence of Quadratic Lyapunov Functions for Consensus Algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2008

Distributed subgradient methods and quantization effects.

[BibT_eX]

[DOI]

Proceedings of the 47th IEEE Conference on Decision and Control, 2008

2007

QoS Multimedia Multicast Routing.

[BibT_eX]

[DOI]

Ion I. Mandoiu

Alexander Zelikovsky

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

2006

Convergence Rates in Distributed Consensus and Averaging.

[BibT_eX]

[DOI]