Zobrazeno 1 - 10
of 189
pro vyhledávání: '"HAN Congying"'
Publikováno v:
Guan'gai paishui xuebao, Vol 43, Iss 10, Pp 21-29 (2024)
【Objective】 Previous studies indicate that existing parameterizations for additional damping (kB-1) are not applicable to all vegetation types. This paper proposes a new approach to account for significant structural differences during vegetation
Externí odkaz:
https://doaj.org/article/ec05e99a271649f8bcf8f7f96540b374
Model-based Offline Reinforcement Learning trains policies based on offline datasets and model dynamics, without direct real-world environment interactions. However, this method is inherently challenged by distribution shift. Previous approaches have
Externí odkaz:
http://arxiv.org/abs/2408.12830
Autor:
Qiu, Xinmin, Han, Congying, Zhang, Zicheng, Li, Bonan, Guo, Tiande, Wang, Pingyu, Nie, Xuecheng
Developing blind video deflickering (BVD) algorithms to enhance video temporal consistency, is gaining importance amid the flourish of image processing and video generation. However, the intricate nature of video data complicates the training of deep
Externí odkaz:
http://arxiv.org/abs/2403.06243
Autor:
Zhang, Zicheng, Zheng, Ruobing, Liu, Ziwen, Han, Congying, Li, Tianqi, Wang, Meng, Guo, Tiande, Chen, Jingdong, Li, Bonan, Yang, Ming
Recent works in implicit representations, such as Neural Radiance Fields (NeRF), have advanced the generation of realistic and animatable head avatars from video sequences. These implicit methods are still confronted by visual artifacts and jitters,
Externí odkaz:
http://arxiv.org/abs/2402.17364
This paper presents a novel study of the oversmoothing issue in diffusion-based Graph Neural Networks (GNNs). Diverging from extant approaches grounded in random walk analysis or particle systems, we approach this problem through operator semigroup t
Externí odkaz:
http://arxiv.org/abs/2402.15326
Publikováno v:
ICML 2024 Oral
Establishing robust policies is essential to counter attacks or disturbances affecting deep reinforcement learning (DRL) agents. Recent studies explore state-adversarial robustness and suggest the potential lack of an optimal robust policy (ORP), pos
Externí odkaz:
http://arxiv.org/abs/2402.02165
Existing methods provide varying algorithms for different types of Boolean satisfiability problems (SAT), lacking a general solution framework. Accordingly, this study proposes a unified framework DCSAT based on integer programming and reinforcement
Externí odkaz:
http://arxiv.org/abs/2312.16423
This paper introduces CARSS (Cooperative Attention-guided Reinforcement Subpath Synthesis), a novel approach to address the Traveling Salesman Problem (TSP) by leveraging cooperative Multi-Agent Reinforcement Learning (MARL). CARSS decomposes the TSP
Externí odkaz:
http://arxiv.org/abs/2312.15412
Solving Nash equilibrium is the key challenge in normal-form games with large strategy spaces, where open-ended learning frameworks offer an efficient approach. In this work, we propose an innovative unified open-ended learning framework A-PSRO, i.e.
Externí odkaz:
http://arxiv.org/abs/2308.12520
Existing works have advanced Text-to-Image (TTI) diffusion models for video editing in a one-shot learning manner. Despite their low requirements of data and computation, these methods might produce results of unsatisfied consistency with text prompt
Externí odkaz:
http://arxiv.org/abs/2305.17431