Zobrazeno 1 - 10
of 1 089
pro vyhledávání: '"He, Xiaoyu"'
Federated learning is a distributed learning framework which enables clients to train models individually and to upload their model updates for aggregation. The local training process heavily relies on distributed gradient descent techniques. In the
Externí odkaz:
http://arxiv.org/abs/2409.15955
Machine Translation of Culture-Specific Items (CSIs) poses significant challenges. Recent work on CSI translation has shown some success using Large Language Models (LLMs) to adapt to different languages and cultures; however, a deeper analysis is ne
Externí odkaz:
http://arxiv.org/abs/2408.13534
Autor:
Akram, Waseem, Yang, Siyuan, Kuang, Hailiang, He, Xiaoyu, Din, Muhayy Ud, Dong, Yihao, Lin, Defu, Seneviratne, Lakmal, He, Shaoming, Hussain, Irfan
The global positioning system (GPS) has become an indispensable navigation method for field operations with unmanned surface vehicles (USVs) in marine environments. However, GPS may not always be available outdoors because it is vulnerable to natural
Externí odkaz:
http://arxiv.org/abs/2408.11429
Let $\epsilon_{1},\ldots,\epsilon_{n}$ be a sequence of independent Rademacher random variables. We prove that there is a constant $c>0$ such that for any unit vectors $v_1,\ldots,v_n\in \mathbb{R}^2$, $$\Pr\left[||\epsilon_1 v_1+\ldots+\epsilon_n v_
Externí odkaz:
http://arxiv.org/abs/2408.11034
Learning causal relationships between a set of variables is a challenging problem in computer science. Many existing artificial benchmark datasets are based on sampling from causal models and thus contain residual information that the ${R} ^2$-sortab
Externí odkaz:
http://arxiv.org/abs/2406.15189
Let $ES_{\ell}(n)$ be the minimum $N$ such that every $N$-element point set in the plane contains either $\ell$ collinear members or $n$ points in convex position. We prove that there is a constant $C>0$ such that, for each $\ell, n \ge 3$, $$ (3\ell
Externí odkaz:
http://arxiv.org/abs/2405.03455
Autor:
Conlon, David, Fox, Jacob, He, Xiaoyu, Mubayi, Dhruv, Pham, Huy Tuan, Suk, Andrew, Verstraëte, Jacques
Answering a question of Erd\H{o}s and Graham, we show that for each fixed positive rational number $x$ the number of ways to write $x$ as a sum of reciprocals of distinct positive integers each at most $n$ is $2^{(c_x + o(1))n}$ for an explicit const
Externí odkaz:
http://arxiv.org/abs/2404.16016
Autor:
Conlon, David, Fox, Jacob, Gunby, Benjamin, He, Xiaoyu, Mubayi, Dhruv, Suk, Andrew, Verstraete, Jacques
A fundamental problem in Ramsey theory is to determine the growth rate in terms of $n$ of the Ramsey number $r(H, K_n^{(3)})$ of a fixed $3$-uniform hypergraph $H$ versus the complete $3$-uniform hypergraph with $n$ vertices. We study this problem, p
Externí odkaz:
http://arxiv.org/abs/2404.02021
Clustering of time series is a well-studied problem, with applications ranging from quantitative, personalized models of metabolism obtained from metabolite concentrations to state discrimination in quantum information theory. We consider a variant,
Externí odkaz:
http://arxiv.org/abs/2311.02181
A family of sets $A$ is said to be an antichain if $x\not\subset y$ for all distinct $x,y\in A$, and it is said to be a distance-$r$ code if every pair of distinct elements of $A$ has Hamming distance at least $r$. Here, we prove that if $A\subset 2^
Externí odkaz:
http://arxiv.org/abs/2212.08406