Tiny birds, and their tiny superfood, could decline due to ‘irreversible’ effects of Vancouver port expansion
The Roberts Bank Terminal 2 expansion at Canada’s busiest cargo port could be fast-tracked by the federal government. It’s a major stop for 3.5 million western sandpipers to eat and recharge while travelling the entire Pacific
From The Narwhal
Embracing Evolution: A Call for Body-Control Co-Design in Embodied Humanoid Robot
Guiliang Liu, Bo Yue, Yi Jin Kim, Kui Jia
https://arxiv.org/abs/2510.03081 https://
Towards Fast Coarse-graining and Equation Discovery with Foundation Inference Models
Manuel Hinz, Maximilian Mauel, Patrick Seifner, David Berghaus, Kostadin Cvejoski, Ramses J. Sanchez
https://arxiv.org/abs/2510.12618
Uncertainty Quantification for Multi-level Models Using the Survey-Weighted Pseudo-Posterior
Matthew R. Williams, F. Hunter McGuire, Terrance D. Savitsky
https://arxiv.org/abs/2510.09401
Dream to Recall: Imagination-Guided Experience Retrieval for Memory-Persistent Vision-and-Language Navigation
Yunzhe Xu, Yiyuan Pan, Zhe Liu
https://arxiv.org/abs/2510.08553 htt…
Fast Visuomotor Policy for Robotic Manipulation
Jingkai Jia, Tong Yang, Xueyao Chen, Chenhuan Liu, Wenqiang Zhang
https://arxiv.org/abs/2510.12483 https://…
The Cost of Simplicity: How Reducing EEG Electrodes Affects Source Localization and BCI Accuracy
Eva Guttmann-Flury, Yanyan Wei, Shan Zhao, Jian Zhao, Mohamad Sawan
https://arxiv.org/abs/2510.10770
dHPR: A Distributed Halpern Peaceman--Rachford Method for Non-smooth Distributed Optimization Problems
Zhangcheng Feng, Defeng Sun, Yancheng Yuan, Guojun Zhang
https://arxiv.org/abs/2511.10069 https://arxiv.org/pdf/2511.10069 https://arxiv.org/html/2511.10069
arXiv:2511.10069v1 Announce Type: new
Abstract: This paper introduces the distributed Halpern Peaceman--Rachford (dHPR) method, an efficient algorithm for solving distributed convex composite optimization problems with non-smooth objectives, which achieves a non-ergodic $O(1/k)$ iteration complexity regarding Karush--Kuhn--Tucker residual. By leveraging the symmetric Gauss--Seidel decomposition, the dHPR effectively decouples the linear operators in the objective functions and consensus constraints while maintaining parallelizability and avoiding additional large proximal terms, leading to a decentralized implementation with provably fast convergence. The superior performance of dHPR is demonstrated through comprehensive numerical experiments on distributed LASSO, group LASSO, and $L_1$-regularized logistic regression problems.
toXiv_bot_toot