{'fraction_non_alphanumeric': 0.015608740894901144, 'fraction_numerical': 0.001040582726326743, 'mean_word_length': 5.774647887323944, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Improved Convergence Rates for Distributed Resource Allocation

In this paper, we develop a class of decentralized algorithms for solving a convex resource allocation optimization problem over a connected network. By observing a connection between the resource allocation and the consensus optimization, we propose a novel class of algorithms for solving the resource allocation problem with improved convergence guarantees. Specifically, we introduce an algorithm for solving the resource allocation problem with an o(1/k) convergence rate when the agents' objective functions are generally convex and per agent local constraints are allowed; we then introduce a gradient-based algorithm for the case when per agent local constraints are absent and show that such scheme achieves geometric convergence with an improved scalability. We also provide a projection-gradient-based algorithm which can handle smooth objective and simple constraints more efficiently.