{"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/6","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":6,"pages_in_order":6,"rows_per_page":100,"rows":[501,536],"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/5","next":null,"papers":[{"url":null,"slug":"distributed-multi-task-relationship-learning","title":"Distributed Multi-Task Relationship Learning","date":"2016-12-13","arxiv_id":"1612.04022","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-primal-dual-method-for-conic-constrained","title":"A primal-dual method for conic constrained distributed optimization problems","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"without-replacement-sampling-for-stochastic-1","title":"Without-Replacement Sampling for Stochastic Gradient Methods","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-optimization-distributed-machine","title":"Federated Optimization: Distributed Machine Learning for On-Device Intelligence","date":"2016-10-08","arxiv_id":"1610.02527","repositories_listed":0,"syntology":null},{"url":null,"slug":"geometrically-convergent-distributed","title":"Geometrically Convergent Distributed Optimization with Uncoordinated Step-Sizes","date":"2016-09-19","arxiv_id":"1609.05877","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-online-optimization-in-dynamic","title":"Distributed Online Optimization in Dynamic Environments Using Mirror Descent","date":"2016-09-09","arxiv_id":"1609.02845","repositories_listed":0,"syntology":null},{"url":null,"slug":"aide-fast-and-communication-efficient","title":"AIDE: Fast and Communication Efficient Distributed Optimization","date":"2016-08-24","arxiv_id":"1608.06879","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-optimization-of-convex-sum-of-non","title":"Distributed Optimization of Convex Sum of Non-Convex Functions","date":"2016-08-18","arxiv_id":"1608.05401","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-optimization-for-client-server","title":"Distributed Optimization for Client-Server Architecture with Negative Gradient Weights","date":"2016-08-12","arxiv_id":"1608.03866","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-asynchronous-dual-free-stochastic","title":"Distributed Asynchronous Dual Free Stochastic Dual Coordinate Ascent","date":"2016-05-29","arxiv_id":"1605.09066","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-inexact-damped-newton-method-data","title":"Distributed Inexact Damped Newton Method: Data Partitioning and Load-Balancing","date":"2016-03-16","arxiv_id":"1603.05191","repositories_listed":0,"syntology":null},{"url":null,"slug":"without-replacement-sampling-for-stochastic","title":"Without-Replacement Sampling for Stochastic Gradient Methods: Convergence Results and Application to Distributed Optimization","date":"2016-03-02","arxiv_id":"1603.00570","repositories_listed":0,"syntology":null},{"url":null,"slug":"mixed-robustaverage-submodular-partitioning-1","title":"Mixed Robust/Average Submodular Partitioning: Fast Algorithms, Guarantees, and Applications","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-optimizationdistributed","title":"Federated Optimization:Distributed Optimization Beyond the Datacenter","date":"2015-11-11","arxiv_id":"1511.03575","repositories_listed":0,"syntology":null},{"url":null,"slug":"mixed-robustaverage-submodular-partitioning","title":"Mixed Robust/Average Submodular Partitioning: Fast Algorithms, Guarantees, and Applications to Parallel Machine Learning and Multi-Label Image Segmentation","date":"2015-10-29","arxiv_id":"1510.08865","repositories_listed":0,"syntology":null},{"url":null,"slug":"partitioning-data-on-features-or-samples-in","title":"Partitioning Data on Features or Samples in Communication-Efficient Distributed Optimization?","date":"2015-10-22","arxiv_id":"1510.06688","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantics-representations-and-grammars-for","title":"Semantics, Representations and Grammars for Deep Learning","date":"2015-09-29","arxiv_id":"1509.08627","repositories_listed":0,"syntology":null},{"url":null,"slug":"asynchronous-distributed-admm-for-large-scale-1","title":"Asynchronous Distributed ADMM for Large-Scale Optimization- Part I: Algorithm and Convergence Analysis","date":"2015-09-09","arxiv_id":"1509.02597","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-stochastic-variance-reduced","title":"Distributed Stochastic Variance Reduced Gradient Methods and A Lower Bound for Communication Complexity","date":"2015-07-27","arxiv_id":"1507.07595","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-admm-algorithm-for-distributed","title":"Fast ADMM Algorithm for Distributed Optimization with Adaptive Penalty","date":"2015-06-30","arxiv_id":"1506.08928","repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-loco-distributing-statistical-estimation","title":"DUAL-LOCO: Distributing Statistical Estimation Using Random Projections","date":"2015-06-08","arxiv_id":"1506.02554","repositories_listed":0,"syntology":null},{"url":null,"slug":"elm-based-distributed-cooperative-learning","title":"ELM-Based Distributed Cooperative Learning Over Networks","date":"2015-04-04","arxiv_id":"1504.00981","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hierarchical-approach-for-joint-multi-view","title":"A Hierarchical Approach for Joint Multi-view Object Pose Estimation and Categorization","date":"2015-03-04","arxiv_id":"1503.01393","repositories_listed":0,"syntology":null},{"url":null,"slug":"communication-efficient-distributed","title":"Communication-Efficient Distributed Optimization of Self-Concordant Empirical Loss","date":"2015-01-01","arxiv_id":"1501.00263","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-distributed-optimization-on-dynamic","title":"Online Distributed Optimization on Dynamic Networks","date":"2014-12-22","arxiv_id":"1412.7215","repositories_listed":0,"syntology":null},{"url":null,"slug":"communication-efficient-distributed-dual","title":"Communication-Efficient Distributed Dual Coordinate Ascent","date":"2014-09-04","arxiv_id":"1409.1458","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-performance-kernel-machines-with","title":"High-performance Kernel Machines with Implicit Distributed Optimization and Randomization","date":"2014-09-03","arxiv_id":"1409.0940","repositories_listed":0,"syntology":null},{"url":null,"slug":"roml-a-robust-feature-correspondence-approach","title":"ROML: A Robust Feature Correspondence Approach for Matching Objects in A Set of Images","date":"2014-03-31","arxiv_id":"1403.7877","repositories_listed":0,"syntology":null},{"url":null,"slug":"asynchronous-forward-bounding-for-distributed","title":"Asynchronous Forward Bounding for Distributed COPs","date":"2014-01-15","arxiv_id":"1401.3442","repositories_listed":0,"syntology":null},{"url":null,"slug":"asynchronous-adaptation-and-learning-over","title":"Asynchronous Adaptation and Learning over Networks --- Part I: Modeling and Stability Analysis","date":"2013-12-19","arxiv_id":"1312.5434","repositories_listed":0,"syntology":null},{"url":null,"slug":"asynchronous-adaptation-and-learning-over-1","title":"Asynchronous Adaptation and Learning over Networks - Part II: Performance Analysis","date":"2013-12-19","arxiv_id":"1312.5438","repositories_listed":0,"syntology":null},{"url":null,"slug":"trading-computation-for-communication","title":"Trading Computation for Communication: Distributed Stochastic Dual Coordinate Ascent","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"communicationcomputation-tradeoffs-in","title":"Communication/Computation Tradeoffs in Consensus-Based Distributed Optimization","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"diffusion-adaptation-over-networks","title":"Diffusion Adaptation over Networks","date":"2012-05-18","arxiv_id":"1205.4220","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-delayed-stochastic-optimization","title":"Distributed Delayed Stochastic Optimization","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-averaging-for-distributed-optimization","title":"Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling","date":"2010-05-12","arxiv_id":"1005.2012","repositories_listed":0,"syntology":null}],"record_sha256":"400b6e4a09f9e23a63c227d9d8d07889a66c43e972e98db42721811744306841","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}