Zobrazeno 1 - 10
of 247
pro vyhledávání: '"Lin, Yixuan"'
Autor:
Lin, Yixuan, Liu, Ji
The push-sum algorithm is probably the most important distributed averaging approach over directed graphs, which has been applied to various problems including distributed optimization. This paper establishes the explicit absolute probability sequenc
Externí odkaz:
http://arxiv.org/abs/2304.09443
Autor:
Lin, Yixuan, Liu, Ji
The paper proposes a heterogeneous push-sum based subgradient algorithm for multi-agent distributed convex optimization in which each agent can arbitrarily switch between subgradient-push and push-subgradient at each time. It is shown that the hetero
Externí odkaz:
http://arxiv.org/abs/2303.17060
This paper considers a distributed optimization problem in the presence of Byzantine agents capable of introducing untrustworthy information into the communication network. A resilient distributed subgradient algorithm is proposed based on graph redu
Externí odkaz:
http://arxiv.org/abs/2209.13095
In decentralized cooperative multi-agent reinforcement learning, agents can aggregate information from one another to learn policies that maximize a team-average objective function. Despite the willingness to cooperate with others, the individual age
Externí odkaz:
http://arxiv.org/abs/2207.12533
In its simplest form the well known consensus problem for a networked family of autonomous agents is to devise a set of protocols or update rules, one for each agent, which can enable all of the agents to adjust or tune their "agreement variable" to
Externí odkaz:
http://arxiv.org/abs/2204.00199
Autor:
Lin, Yixuan, Liu, Ji
The push-sum based subgradient is an important method for distributed convex optimization over unbalanced directed graphs, which is known to converge at a rate of $O(\ln t/\sqrt{t})$. This paper shows that the subgradient-push algorithm actually conv
Externí odkaz:
http://arxiv.org/abs/2203.16623
This paper considers a resilient high-dimensional constrained consensus problem and studies a resilient distributed algorithm for complete graphs. For convex constrained sets with a singleton intersection, a sufficient condition on feasibility redund
Externí odkaz:
http://arxiv.org/abs/2203.14123
Autor:
Han, Haolei, Lin, Xiangxin, Wu, Yuxuan, Li, Houru, Jia, Qi, Hu, Changmin, Lin, Yixuan, Liao, Guangqin, Qian, Yongzhong, Qiu, Jing
Publikováno v:
In Food Research International November 2024 196
Publikováno v:
In Bioorganic & Medicinal Chemistry 1 November 2024 113
Autor:
Lei, Haoqiang, Liu, Fengjie, Jia, Meng, Ni, Huanhuan, Han, Yanfeng, Chen, Junyuan, Wang, Huan, Gu, Honghui, Chen, Yiqi, Lin, Yixuan, Wang, Panpan, Yang, Zhenjiang, Cai, Yu
Publikováno v:
In International Journal of Biological Macromolecules November 2024 279 Part 2