Zobrazeno 1 - 10
of 8 010
pro vyhledávání: '"CHEN, Xiaohong"'
Stock markets play an important role in the global economy, where accurate stock price predictions can lead to significant financial returns. While existing transformer-based models have outperformed long short-term memory networks and convolutional
Externí odkaz:
http://arxiv.org/abs/2410.03707
Autor:
Jin, Dongming, Zhao, Shengxin, Jin, Zhi, Chen, Xiaohong, Wang, Chunhui, Fang, Zheng, Xiao, Hongbin
Cyber-physical systems (CPSs) integrate cyber and physical components and enable them to interact with each other to meet user needs. The needs for CPSs span rich application domains such as healthcare and medicine, smart home, smart building, etc. T
Externí odkaz:
http://arxiv.org/abs/2408.02450
Requirements Engineering (RE) is a critical phase in the software development process that generates requirements specifications from stakeholders' needs. Recently, deep learning techniques have been successful in several RE tasks. However, obtaining
Externí odkaz:
http://arxiv.org/abs/2405.03256
This paper studies minimax optimization problems defined over infinite-dimensional function classes of overparameterized two-layer neural networks. In particular, we consider the minimax optimization problem stemming from estimating linear functional
Externí odkaz:
http://arxiv.org/abs/2404.12312
Synchronized dual-arm rearrangement is widely studied as a common scenario in industrial applications. It often faces scalability challenges due to the computational complexity of robotic arm rearrangement and the high-dimensional nature of dual-arm
Externí odkaz:
http://arxiv.org/abs/2403.08191
Autor:
Chen, Xiaohong, Wu, Baoyindureng
Let $G$ be a graph of order $n$. A path decomposition $\mathcal{P}$ of $G$ is a collection of edge-disjoint paths that covers all the edges of $G$. Let $p(G)$ denote the minimum number of paths needed in a path decomposition of $G$. Gallai conjecture
Externí odkaz:
http://arxiv.org/abs/2310.11704
Autor:
Chen, Xiaohong, Wu, Baoyindureng
Let $G$ be a graph of order $n$. A path decomposition $\mathcal{P}$ of $G$ is a collection of edge-disjoint paths that covers all the edges of $G$. Let $p(G)$ denote the minimum number of paths needed in a path decomposition of $G$. Gallai conjecture
Externí odkaz:
http://arxiv.org/abs/2310.11189
We introduce a new class of algorithms, Stochastic Generalized Method of Moments (SGMM), for estimation and inference on (overidentified) moment restriction models. Our SGMM is a novel stochastic approximation alternative to the popular Hansen (1982)
Externí odkaz:
http://arxiv.org/abs/2308.13564
Publikováno v:
Industrial Management & Data Systems, 2024, Vol. 124, Issue 8, pp. 2633-2662.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/IMDS-11-2023-0877