S-D-RSM: Stochastic Distributed Regularized Splitting Method for Large-Scale Convex Optimization Problems
Maoran Wang, Xingju Cai, Yongxin Chen
https://arxiv.org/abs/2511.10133 https://arxiv.org/pdf/2511.10133 https://arxiv.org/html/2511.10133
arXiv:2511.10133v1 Announce Type: new
Abstract: This paper investigates the problems large-scale distributed composite convex optimization, with motivations from a broad range of applications, including multi-agent systems, federated learning, smart grids, wireless sensor networks, compressed sensing, and so on. Stochastic gradient descent (SGD) and its variants are commonly employed to solve such problems. However, existing algorithms often rely on vanishing step sizes, strong convexity assumptions, or entail substantial computational overhead to ensure convergence or obtain favorable complexity. To bridge the gap between theory and practice, we integrate consensus optimization and operator splitting techniques (see Problem Reformulation) to develop a novel stochastic splitting algorithm, termed the \emph{stochastic distributed regularized splitting method} (S-D-RSM). In practice, S-D-RSM performs parallel updates of proximal mappings and gradient information for only a randomly selected subset of agents at each iteration. By introducing regularization terms, it effectively mitigates consensus discrepancies among distributed nodes. In contrast to conventional stochastic methods, our theoretical analysis establishes that S-D-RSM achieves global convergence without requiring diminishing step sizes or strong convexity assumptions. Furthermore, it achieves an iteration complexity of $\mathcal{O}(1/\epsilon)$ with respect to both the objective function value and the consensus error. Numerical experiments show that S-D-RSM achieves up to 2--3$\times$ speedup compared to state-of-the-art baselines, while maintaining comparable or better accuracy. These results not only validate the algorithm's theoretical guarantees but also demonstrate its effectiveness in practical tasks such as compressed sensing and empirical risk minimization.
toXiv_bot_toot
Latent Class Logit Kernel Framework for Surrogate Safety: Identifying Behavioural Thresholds through Conflict Indicator Profiles
Rulla Al-Haideri, Changhe Liu, Karim Ismail, Bilal Farooq, Chi Zhang
https://arxiv.org/abs/2510.12012
Multi-objective Bayesian optimization for blocking in extreme value analysis and its application in additive manufacturing
Shehzaib Irfan, Nabeel Ahmad, Alexander Vinel, Daniel F. Silva, Shuai Shao, Nima Shamsaei, Jia Liu
https://arxiv.org/abs/2510.11960
Anarcho-syndicalism is the belief that workers, as the fundamental producers of social value, must seize control of the means of production through direct action and autonomous organization. It rejects both capitalist private ownership and state-controlled systems, arguing instead for a decentralized federation of worker-managed industries. From my perspective, anarcho-syndicalism is not merely an economic strategy but a revolutionary theory of social transformation, one that places the work…
Quantized Dirac Fields in torsionful gravity: cosmological implications and links with the dark universe
Antonio Capolupo, Sante Carloni, Luca Fabbri, Simone Monda, Aniello Quaranta, Stefano Vignolo
https://arxiv.org/abs/2510.06874
Invariant Price of Anarchy: a Metric for Welfarist Traffic Control
Ilia Shilov, Mingjia He, Heinrich H. Nax, Emilio Frazzoli, Gioele Zardini, Saverio Bolognani
https://arxiv.org/abs/2512.05843 https://arxiv.org/pdf/2512.05843 https://arxiv.org/html/2512.05843
arXiv:2512.05843v1 Announce Type: new
Abstract: The Price of Anarchy (PoA) is a standard metric for quantifying inefficiency in socio-technical systems, widely used to guide policies like traffic tolling. Conventional PoA analysis relies on exact numerical costs. However, in many settings, costs represent agents' preferences and may be defined only up to possibly arbitrary scaling and shifting, representing informational and modeling ambiguities. We observe that while such transformations preserve equilibrium and optimal outcomes, they change the PoA value. To resolve this issue, we rely on results from Social Choice Theory and define the Invariant PoA. By connecting admissible transformations to degrees of comparability of agents' costs, we derive the specific social welfare functions which ensure that efficiency evaluations do not depend on arbitrary rescalings or translations of individual costs. Case studies on a toy example and the Zurich network demonstrate that identical tolling strategies can lead to substantially different efficiency estimates depending on the assumed comparability. Our framework thus demonstrates that explicit axiomatic foundations are necessary in order to define efficiency metrics and to appropriately guide policy in large-scale infrastructure design robustly and effectively.
toXiv_bot_toot
Value Alignment of Social Media Ranking Algorithms
Farnaz Jahanbakhsh, Dora Zhao, Tiziano Piccardi, Zachary Robertson, Ziv Epstein, Sanmi Koyejo, Michael S. Bernstein
https://arxiv.org/abs/2509.14434
From negative to positive $\Lambda$ through cosmological decreasing temperatures and its connection to spacetime foliation and string theory
E. N. Nyergesy, I. G. M\'ari\'an, A. Trombettoni, I. N\'andori
https://arxiv.org/abs/2510.02244
From a story in today’s Wall Street Journal about Woody Allen and his new novel:
Though he’s already at work on a second novel, he rarely reads fiction—“I feel like I’m wasting time.”
More often he reads philosophy and books by physicists.
“I keep thinking I’m going to learn something of deep value that’s going to make me feel better in life,” he says.
“It never does.”
RE: https://fediscience.org/@suomenantropologi/115614886106180185
Vale Keith Hart. That keynote from 2010 (link below) was (and still is) a compelling argument for reconnecting value theory to practical political economy by weaving together Marx's commodity fetishism, the concept of plural economy inspired by Mauss, and the digital revolution's radical cheapening of information.
Replaced article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- Egyptian Ratscrew: Discovering Dominant Strategies with Computational Game Theory
Justin Diamond, Ben Garcia
https://arxiv.org/abs/2304.01007
- Truthful and Almost Envy-Free Mechanism of Allocating Indivisible Goods: the Power of Randomness
Xiaolin Bu, Biaoshuai Tao
https://arxiv.org/abs/2407.13634 https://mastoxiv.page/@arXiv_csGT_bot/112811955506293858
- Learning the Value of Value Learning
Alex John London, Aydin Mohseni
https://arxiv.org/abs/2511.17714 https://mastoxiv.page/@arXiv_csAI_bot/115609411461995995
toXiv_bot_toot
Finite-blocklength Fluid Antenna Systems
Zhentian Zhang, Kai-Kit Wong, David Morales-Jimenez, Hao Jiang, Hao Xu, Christos Masouros, Zaichen Zhang, Chan-Byoung Chae
https://arxiv.org/abs/2509.15643
On Dynamic Programming Theory for Leader-Follower Stochastic Games
Jilles Steeve Dibangoye, Thibaut Le Marre, Ocan Sankur, Fran\c{c}ois Schwarzentruber
https://arxiv.org/abs/2512.05667 https://arxiv.org/pdf/2512.05667 https://arxiv.org/html/2512.05667
arXiv:2512.05667v1 Announce Type: new
Abstract: Leader-follower general-sum stochastic games (LF-GSSGs) model sequential decision-making under asymmetric commitment, where a leader commits to a policy and a follower best responds, yielding a strong Stackelberg equilibrium (SSE) with leader-favourable tie-breaking. This paper introduces a dynamic programming (DP) framework that applies Bellman recursion over credible sets-state abstractions formally representing all rational follower best responses under partial leader commitments-to compute SSEs. We first prove that any LF-GSSG admits a lossless reduction to a Markov decision process (MDP) over credible sets. We further establish that synthesising an optimal memoryless deterministic leader policy is NP-hard, motivating the development of {\epsilon}-optimal DP algorithms with provable guarantees on leader exploitability. Experiments on standard mixed-motive benchmarks-including security games, resource allocation, and adversarial planning-demonstrate empirical gains in leader value and runtime scalability over state-of-the-art methods.
toXiv_bot_toot
Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Determination of the fifth Busy Beaver value
The bbchallenge Collaboration, et al.
Replaced article(s) found for nucl-th. https://arxiv.org/list/nucl-th/new
[1/1]:
- Symmetry energy expansion and the peak value of the bulk viscosity
Steven P Harris