{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/distributed-optimization/papers/4","list_of":"/task/distributed-optimization","task":"Distributed Optimization","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":4,"pages_in_order":6,"rows_per_page":100,"rows":[301,400],"of":536,"counts":{"archive_papers_tagged":536,"with_a_code_link":86,"where_syntology_ran_a_sample":14,"not_listed_spam_title":0,"listed":536,"listed_where_code_ran":14,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":13,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":13,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/distributed-optimization","prev":"/task/distributed-optimization/papers/3","next":"/task/distributed-optimization/papers/5","papers":[{"url":null,"slug":"end-to-end-quality-of-service-assurance-with","title":"End-to-End Quality-of-Service Assurance with Autonomous Systems: 5G/6G Case Study","date":"2022-01-31","arxiv_id":"2201.13300","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-gradient-based-optimization-in","title":"Distributed gradient-based optimization in the presence of dependent aperiodic communication","date":"2022-01-27","arxiv_id":"2201.11343","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-learning-of-generalized-linear","title":"Distributed Learning of Generalized Linear Causal Networks","date":"2022-01-23","arxiv_id":"2201.09194","repositories_listed":0,"syntology":null},{"url":null,"slug":"privacy-aware-distributed-day-ahead-dispatch","title":"Coordinated Day-ahead Dispatch of Multiple Power Distribution Grids hosting Stochastic Resources: An ADMM-based Framework","date":"2022-01-10","arxiv_id":"2201.03465","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-random-reshuffling-over-networks","title":"Distributed Random Reshuffling over Networks","date":"2021-12-31","arxiv_id":"2112.15287","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-rates-of-two-time-scale-gradient","title":"Convergence Rates of Two-Time-Scale Gradient Descent-Ascent Dynamics for Solving Nonconvex Min-Max Problems","date":"2021-12-17","arxiv_id":"2112.09579","repositories_listed":0,"syntology":null},{"url":null,"slug":"communication-efficient-distributed-sgd-with-1","title":"Communication-Efficient Distributed SGD with Compressed Sensing","date":"2021-12-15","arxiv_id":"2112.07836","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-graph-learning-with-smooth-data","title":"Distributed Graph Learning with Smooth Data Priors","date":"2021-12-11","arxiv_id":"2112.05887","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-learning-over-wireless-networks","title":"Collaborative Learning over Wireless Networks: An Introductory Overview","date":"2021-12-07","arxiv_id":"2112.05559","repositories_listed":0,"syntology":null},{"url":null,"slug":"variance-reduction-in-deep-learning-more","title":"Variance Reduction in Deep Learning: More Momentum is All You Need","date":"2021-11-23","arxiv_id":"2111.11828","repositories_listed":0,"syntology":null},{"url":null,"slug":"flix-a-simple-and-communication-efficient","title":"FLIX: A Simple and Communication-Efficient Alternative to Local Methods in Federated Learning","date":"2021-11-22","arxiv_id":"2111.11556","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-semi-distributed-interior-point-algorithm","title":"A Semi-Distributed Interior Point Algorithm for Optimal Coordination of Automated Vehicles at Intersections","date":"2021-11-19","arxiv_id":"2111.10125","repositories_listed":0,"syntology":null},{"url":null,"slug":"finite-time-consensus-learning-for","title":"Finite-Time Consensus Learning for Decentralized Optimization with Nonlinear Gossiping","date":"2021-11-04","arxiv_id":"2111.02949","repositories_listed":0,"syntology":null},{"url":null,"slug":"basis-matters-better-communication-efficient","title":"Basis Matters: Better Communication-Efficient Second Order Methods for Federated Learning","date":"2021-11-02","arxiv_id":"2111.01847","repositories_listed":0,"syntology":null},{"url":null,"slug":"decentralized-feature-distributed","title":"Decentralized Feature-Distributed Optimization for Generalized Linear Models","date":"2021-10-28","arxiv_id":"2110.15283","repositories_listed":0,"syntology":null},{"url":null,"slug":"cell-zooming-with-masked-data-for-off-grid","title":"Cell Zooming with Masked Data for Off-Grid Small Cell Networks: Distributed Optimization Approach","date":"2021-10-26","arxiv_id":"2110.13349","repositories_listed":0,"syntology":null},{"url":null,"slug":"parallel-feedforward-compensation-for-output","title":"Parallel Feedforward Compensation for Output Synchronization: Fully Distributed Control and Indefinite Laplacian","date":"2021-10-25","arxiv_id":"2110.12787","repositories_listed":0,"syntology":null},{"url":null,"slug":"acceleration-in-distributed-optimization","title":"Acceleration in Distributed Optimization under Similarity","date":"2021-10-24","arxiv_id":"2110.12347","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-reinforcement-learning-approach-to-2","title":"A Reinforcement Learning Approach to Parameter Selection for Distributed Optimal Power Flow","date":"2021-10-22","arxiv_id":"2110.11991","repositories_listed":0,"syntology":null},{"url":null,"slug":"utilizing-redundancy-in-cost-functions-for","title":"Utilizing Redundancy in Cost Functions for Resilience in Distributed Optimization and Learning","date":"2021-10-21","arxiv_id":"2110.10858","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-optimization-of-graph","title":"Distributed Optimization of Graph Convolutional Network using Subgraph Variance","date":"2021-10-06","arxiv_id":"2110.02987","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-privacy-preserving-electric","title":"Distributed Privacy-Preserving Electric Vehicle Charging Control Based on Secret Sharing","date":"2021-10-05","arxiv_id":"2110.02280","repositories_listed":0,"syntology":null},{"url":null,"slug":"kkt-conditions-first-order-and-second-order","title":"KKT Conditions, First-Order and Second-Order Optimization, and Distributed Optimization: Tutorial and Survey","date":"2021-10-05","arxiv_id":"2110.01858","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-online-optimization-with","title":"Distributed Online Optimization with Byzantine Adversarial Agents","date":"2021-09-25","arxiv_id":"2109.12340","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-communication-efficient-adaptive","title":"Toward Communication Efficient Adaptive Gradient Method","date":"2021-09-10","arxiv_id":"2109.05109","repositories_listed":0,"syntology":null},{"url":null,"slug":"asynchronous-iterations-in-optimization-new","title":"Asynchronous Iterations in Optimization: New Sequence Results and Sharper Algorithmic Guarantees","date":"2021-09-09","arxiv_id":"2109.04522","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-convergence-of-decentralized-adaptive","title":"On the Convergence of Decentralized Adaptive Gradient Methods","date":"2021-09-07","arxiv_id":"2109.03194","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-minimax-complexity-of-distributed","title":"The Minimax Complexity of Distributed Optimization","date":"2021-09-01","arxiv_id":"2109.00534","repositories_listed":0,"syntology":null},{"url":null,"slug":"fl-misr-fast-large-scale-multi-image-super","title":"FL-MISR: Fast Large-Scale Multi-Image Super-Resolution for Computed Tomography Based on Multi-GPU Acceleration","date":"2021-08-09","arxiv_id":"2108.04315","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-system-identification-for-linear","title":"Distributed System Identification for Linear Stochastic Systems with Binary Sensors","date":"2021-08-03","arxiv_id":"2108.01488","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-sgd-optimizes-overparameterized-neural","title":"Local SGD Optimizes Overparameterized Neural Networks in Polynomial Time","date":"2021-07-22","arxiv_id":"2107.10868","repositories_listed":0,"syntology":null},{"url":null,"slug":"canita-faster-rates-for-distributed-convex","title":"CANITA: Faster Rates for Distributed Convex Optimization with Communication Compression","date":"2021-07-20","arxiv_id":"2107.09461","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-differential-private-method-for-distributed","title":"A Differential Private Method for Distributed Optimization in Directed Networks via State Decomposition","date":"2021-07-09","arxiv_id":"2107.04370","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-distributed-optimization-with-randomly","title":"Robust Distributed Optimization With Randomly Corrupted Gradients","date":"2021-06-28","arxiv_id":"2106.14956","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-variational-quantum-algorithms","title":"Accelerating variational quantum algorithms with multiple quantum processors","date":"2021-06-24","arxiv_id":"2106.12819","repositories_listed":0,"syntology":null},{"url":null,"slug":"asynchronous-stochastic-optimization-robust","title":"Asynchronous Stochastic Optimization Robust to Arbitrary Delays","date":"2021-06-22","arxiv_id":"2106.11879","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-autonomy-in-management-of-wireless","title":"Learning Autonomy in Management of Wireless Random Networks","date":"2021-06-15","arxiv_id":"2106.07984","repositories_listed":0,"syntology":null},{"url":null,"slug":"decentralized-personalized-federated-min-max","title":"Decentralized Personalized Federated Learning for Min-Max Problems","date":"2021-06-14","arxiv_id":"2106.07289","repositories_listed":0,"syntology":null},{"url":null,"slug":"smoothness-aware-quantization-techniques","title":"Theoretically Better and Numerically Faster Distributed Optimization with Smoothness-Aware Quantization Techniques","date":"2021-06-07","arxiv_id":"2106.03524","repositories_listed":0,"syntology":null},{"url":null,"slug":"auction-based-and-distributed-optimization","title":"Auction-based and Distributed Optimization Approaches for Scheduling Observations in Satellite Constellations with Exclusive Orbit Portions","date":"2021-06-04","arxiv_id":"2106.03548","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-the-performance-of-distributed","title":"Assessing the Impacts of Nonideal Communications on Distributed Optimal Power Flow Algorithms","date":"2021-05-31","arxiv_id":"2106.00135","repositories_listed":0,"syntology":null},{"url":null,"slug":"plug-and-play-optimization-for-pixel-super","title":"Pixel super-resolved lensless on-chip sensor with scattering multiplexing","date":"2021-05-31","arxiv_id":"2105.14746","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimization-in-open-networks-via-dual","title":"Optimization in Open Networks via Dual Averaging","date":"2021-05-27","arxiv_id":"2105.13348","repositories_listed":0,"syntology":null},{"url":null,"slug":"localnewton-reducing-communication-bottleneck","title":"LocalNewton: Reducing Communication Bottleneck for Distributed Learning","date":"2021-05-16","arxiv_id":"2105.07320","repositories_listed":0,"syntology":null},{"url":null,"slug":"innovation-compression-for-communication","title":"Innovation Compression for Communication-efficient Distributed Optimization with Linear Convergence","date":"2021-05-14","arxiv_id":"2105.06697","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-the-transient-times-for-distributed","title":"Improving the Transient Times for Distributed Stochastic Gradient Methods","date":"2021-05-11","arxiv_id":"2105.04851","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-energy-trading-management-for","title":"Distributed Energy Trading Management for Renewable Prosumers with HVAC and Energy Storage","date":"2021-05-01","arxiv_id":"2105.00175","repositories_listed":0,"syntology":null},{"url":null,"slug":"mean-field-marl-based-bandwidth-negotiation","title":"Mean Field MARL Based Bandwidth Negotiation Method for Massive Devices Spectrum Sharing","date":"2021-04-30","arxiv_id":"2104.15085","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-experiment-design-and-control-for","title":"Distributed Experiment Design and Control for Multi-agent Systems with Gaussian Processes","date":"2021-03-25","arxiv_id":"2103.14156","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-newton-like-algorithms-and","title":"Distributed Newton-like Algorithms and Learning for Optimized Power Dispatch","date":"2021-03-24","arxiv_id":"2103.13493","repositories_listed":0,"syntology":null},{"url":null,"slug":"gradient-tracking-over-directed-graphs-for","title":"Gradient-Tracking over Directed Graphs for solving Leaderless Multi-Cluster Games","date":"2021-02-18","arxiv_id":"2102.09406","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-second-order-methods-with-fast","title":"Distributed Second Order Methods with Fast Rates and Compressed Communication","date":"2021-02-14","arxiv_id":"2102.07158","repositories_listed":0,"syntology":null},{"url":null,"slug":"smoothness-matrices-beat-smoothness-constants","title":"Smoothness Matrices Beat Smoothness Constants: Better Communication Compression Techniques for Distributed Optimization","date":"2021-02-14","arxiv_id":"2102.07245","repositories_listed":0,"syntology":null},{"url":null,"slug":"straggler-resilient-distributed-machine","title":"Straggler-Resilient Distributed Machine Learning with Dynamic Backup Workers","date":"2021-02-11","arxiv_id":"2102.06280","repositories_listed":0,"syntology":null},{"url":null,"slug":"bias-variance-reduced-local-sgd-for-less","title":"Bias-Variance Reduced Local SGD for Less Heterogeneous Federated Learning","date":"2021-02-05","arxiv_id":"2102.03198","repositories_listed":0,"syntology":null},{"url":null,"slug":"concentration-of-non-isotropic-random-tensors","title":"Concentration of Non-Isotropic Random Tensors with Applications to Learning and Empirical Risk Minimization","date":"2021-02-04","arxiv_id":"2102.04259","repositories_listed":0,"syntology":null},{"url":null,"slug":"delayed-projection-techniques-for-linearly","title":"Delayed Projection Techniques for Linearly Constrained Problems: Convergence Rates, Acceleration, and Applications","date":"2021-01-05","arxiv_id":"2101.01505","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergent-adaptive-gradient-methods-in","title":"Convergent Adaptive Gradient Methods in Decentralized Optimization","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cost-efficient-svrg-with-arbitrary-sampling","title":"Cost-efficient SVRG with Arbitrary Sampling","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"design-of-heterogeneous-multi-agent-system","title":"Design of heterogeneous multi-agent system for distributed computation","date":"2021-01-01","arxiv_id":"2101.00161","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-user-scheduling-for-6g-a-fairness","title":"Fairness-Oriented User Scheduling for Bursty Downlink Transmission Using Multi-Agent Reinforcement Learning","date":"2020-12-30","arxiv_id":"2012.15081","repositories_listed":0,"syntology":null},{"url":null,"slug":"byzantine-resilient-non-convex-stochastic-1","title":"Byzantine-Resilient Non-Convex Stochastic Gradient Descent","date":"2020-12-28","arxiv_id":"2012.14368","repositories_listed":0,"syntology":null},{"url":null,"slug":"linear-convergence-of-distributed-mirror","title":"Linear Convergence of Distributed Mirror Descent with Integral Feedback for Strongly Convex Problems","date":"2020-11-24","arxiv_id":"2011.12233","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-sketches-with-small-inversion-bias","title":"Sparse sketches with small inversion bias","date":"2020-11-21","arxiv_id":"2011.10695","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-stochastic-consensus-optimization","title":"Distributed Stochastic Consensus Optimization with Momentum for Nonconvex Nonsmooth Problems","date":"2020-11-10","arxiv_id":"2011.05082","repositories_listed":0,"syntology":null},{"url":null,"slug":"widely-distributed-radar-imaging-based-on","title":"Widely-distributed Radar Imaging Based on Consensus ADMM","date":"2020-11-04","arxiv_id":"2011.02319","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-sgd-for-saddle-point-problems","title":"Distributed Saddle-Point Problems: Lower Bounds, Near-Optimal and Robust Algorithms","date":"2020-10-25","arxiv_id":"2010.13112","repositories_listed":0,"syntology":null},{"url":null,"slug":"client-selection-in-federated-learning-1","title":"Client Selection in Federated Learning: Convergence Analysis and Power-of-Choice Selection Strategies","date":"2020-10-03","arxiv_id":"2010.01243","repositories_listed":0,"syntology":null},{"url":null,"slug":"byzantine-robust-learning-on-heterogeneous-2","title":"Byzantine-Robust Learning on Heterogeneous Datasets via Resampling","date":"2020-09-28","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"asynchronous-distributed-optimization-with","title":"Asynchronous Distributed Optimization with Stochastic Delays","date":"2020-09-22","arxiv_id":"2009.10717","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-mirror-descent-with-integral","title":"Distributed Mirror Descent with Integral Feedback: Asymptotic Convergence Analysis of Continuous-time Dynamics","date":"2020-09-14","arxiv_id":"2009.06747","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-on-job-shop-scheduling","title":"Graph neural networks-based Scheduler for Production planning problems using Reinforcement Learning","date":"2020-09-08","arxiv_id":"2009.03836","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-communication-compression-for-distributed","title":"On Communication Compression for Distributed Optimization on Heterogeneous Data","date":"2020-09-04","arxiv_id":"2009.02388","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-online-optimization-via-gradient","title":"GTAdam: Gradient Tracking with Adaptive Momentum for Distributed Online Optimization","date":"2020-09-03","arxiv_id":"2009.01745","repositories_listed":0,"syntology":null},{"url":null,"slug":"projected-push-sum-gradient-descent-ascent","title":"Projected Push-Sum Gradient Descent-Ascent for Convex Optimizationwith Application to Economic Dispatch Problems","date":"2020-08-11","arxiv_id":"2004.02854","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-personalized-gradient-tracking","title":"Distributed Personalized Gradient Tracking with Convex Parametric Models","date":"2020-08-10","arxiv_id":"2008.04363","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-graph-convolutional-networks","title":"Distributed Training of Graph Convolutional Networks","date":"2020-07-13","arxiv_id":"2007.06281","repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-learning-s-blessing-fedavg-has","title":"A Unified Linear Speedup Analysis of Federated Averaging and Nesterov FedAvg","date":"2020-07-11","arxiv_id":"2007.05690","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-model-predictive-control-with","title":"Distributed Model Predictive Control with Reconfigurable Terminal Ingredients for Reference Tracking","date":"2020-07-01","arxiv_id":"2007.00427","repositories_listed":0,"syntology":null},{"url":null,"slug":"linear-convergent-decentralized-optimization","title":"Linear Convergent Decentralized Optimization with Compression","date":"2020-07-01","arxiv_id":"2007.00232","repositories_listed":0,"syntology":null},{"url":null,"slug":"advances-in-asynchronous-parallel-and","title":"Advances in Asynchronous Parallel and Distributed Optimization","date":"2020-06-24","arxiv_id":"2006.13838","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-collision-free-motion","title":"Distributed Collision-Free Motion Coordination on a Sphere: A Conic Control Barrier Function Approach","date":"2020-06-23","arxiv_id":"2003.13363","repositories_listed":0,"syntology":null},{"url":null,"slug":"deed-a-general-quantization-scheme-for","title":"DEED: A General Quantization Scheme for Communication Efficiency in Bits","date":"2020-06-19","arxiv_id":"2006.11401","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximate-gradient-coding-with-optimal","title":"Approximate Gradient Coding with Optimal Decoding","date":"2020-06-17","arxiv_id":"2006.09638","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-newton-can-communicate-less-and","title":"Distributed Newton Can Communicate Less and Resist Byzantine Workers","date":"2020-06-15","arxiv_id":"2006.08737","repositories_listed":0,"syntology":null},{"url":null,"slug":"anytime-minibatch-exploiting-stragglers-in-1","title":"Anytime MiniBatch: Exploiting Stragglers in Online Distributed Optimization","date":"2020-06-10","arxiv_id":"2006.05752","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-optimization-for-massive","title":"Distributed Optimization for Massive Connectivity","date":"2020-06-10","arxiv_id":"2006.05637","repositories_listed":0,"syntology":null},{"url":null,"slug":"aladin-a-an-open-source-matlab-toolbox-for","title":"ALADIN-$α$ -- An open-source MATLAB toolbox for distributed non-convex optimization","date":"2020-06-02","arxiv_id":"2006.01866","repositories_listed":0,"syntology":null},{"url":null,"slug":"recurrent-averaging-inequalities-in-multi","title":"Recurrent Averaging Inequalities in Multi-Agent Control and Social Dynamics Modeling","date":"2020-05-13","arxiv_id":"1910.14465","repositories_listed":0,"syntology":null},{"url":null,"slug":"fedsplit-an-algorithmic-framework-for-fast","title":"FedSplit: An algorithmic framework for fast federated optimization","date":"2020-05-11","arxiv_id":"2005.05238","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-resource-allocation-algorithms","title":"Distributed Resource Allocation Algorithms for Multi-Operator Cognitive Communication Systems","date":"2020-05-06","arxiv_id":"2005.04001","repositories_listed":0,"syntology":null},{"url":null,"slug":"supervised-mpc-control-of-large-scale","title":"Supervised MPC control of large-scale electricity networks via clustering methods","date":"2020-04-29","arxiv_id":"2004.14117","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochalm-a-stochastic-alternate-linearization","title":"StochaLM: a Stochastic alternate Linearization Method for distributed optimization","date":"2020-04-23","arxiv_id":"2004.11432","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertain-multi-agent-systems-with","title":"Uncertain Multi-Agent Systems with Distributed Constrained Optimization Missions and Event-Triggered Communications: Application to Resource Allocation","date":"2020-04-03","arxiv_id":"2004.01685","repositories_listed":0,"syntology":null},{"url":null,"slug":"dc-distadmm-admm-algorithm-for-contrained","title":"DC-DistADMM: ADMM Algorithm for Constrained Distributed Optimization over Directed Graphs","date":"2020-03-30","arxiv_id":"2003.13742","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-and-time-varying-primal-dual","title":"Distributed and time-varying primal-dual dynamics via contraction analysis","date":"2020-03-27","arxiv_id":"2003.12665","repositories_listed":0,"syntology":null},{"url":null,"slug":"iterative-pre-conditioning-to-expedite-the","title":"Iterative Pre-Conditioning to Expedite the Gradient-Descent Method","date":"2020-03-13","arxiv_id":"2003.07180","repositories_listed":0,"syntology":null},{"url":null,"slug":"communication-efficient-variance-reduced","title":"Communication-efficient Variance-reduced Stochastic Gradient Descent","date":"2020-03-10","arxiv_id":"2003.04686","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-reinforcement-learning-for-qos","title":"Deep Reinforcement Learning for QoS-Constrained Resource Allocation in Multiservice Networks","date":"2020-03-03","arxiv_id":"2003.02643","repositories_listed":0,"syntology":null},{"url":null,"slug":"decentralized-gradient-methods-does-topology","title":"Decentralized gradient methods: does topology matter?","date":"2020-02-28","arxiv_id":"2002.12688","repositories_listed":0,"syntology":null}],"record_sha256":"4eeed9786947434c4e2322e28de60eadd2dc74d3fb15e60a28e4e446438ef132","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}