Zobrazeno 1 - 10
of 147
pro vyhledávání: '"Mao, Yuchen"'
Sharpness-Aware Minimization (SAM) has substantially improved the generalization of neural networks under various settings. Despite the success, its effectiveness remains poorly understood. In this work, we discover an intriguing phenomenon in the tr
Externí odkaz:
http://arxiv.org/abs/2410.10373
The persistent challenge of medical image synthesis posed by the scarcity of annotated data and the need to synthesize `missing modalities' for multi-modal analysis, underscored the imperative development of effective synthesis methods. Recently, the
Externí odkaz:
http://arxiv.org/abs/2408.07196
Autor:
Cao, Ruisheng, Lei, Fangyu, Wu, Haoyuan, Chen, Jixuan, Fu, Yeqiao, Gao, Hongcheng, Xiong, Xinzhuang, Zhang, Hanchong, Mao, Yuchen, Hu, Wenjing, Xie, Tianbao, Xu, Hongshen, Zhang, Danyang, Wang, Sida, Sun, Ruoxi, Yin, Pengcheng, Xiong, Caiming, Ni, Ansong, Liu, Qian, Zhong, Victor, Chen, Lu, Yu, Kai, Yu, Tao
Data science and engineering workflows often span multiple stages, from warehousing to orchestration, using tools like BigQuery, dbt, and Airbyte. As vision language models (VLMs) advance in multimodal understanding and code generation, VLM-based age
Externí odkaz:
http://arxiv.org/abs/2407.10956
We investigate pseudo-polynomial time algorithms for Subset Sum. Given a multi-set $X$ of $n$ positive integers and a target $t$, Subset Sum asks whether some subset of $X$ sums to $t$. Bringmann proposes an $\tilde{O}(n + t)$-time algorithm [Bringma
Externí odkaz:
http://arxiv.org/abs/2402.14493
We propose an $\widetilde{O}(n + 1/\eps)$-time FPTAS (Fully Polynomial-Time Approximation Scheme) for the classical Partition problem. This is the best possible (up to a polylogarithmic factor) assuming SETH (Strong Exponential Time Hypothesis) [Abbo
Externí odkaz:
http://arxiv.org/abs/2402.11426
We give new proofs of general relativistic initial data gluing results on unit-scale annuli based on explicit solution operators for the linearized constraint equation around the flat case with prescribed support properties. These results retrieve an
Externí odkaz:
http://arxiv.org/abs/2308.13031
We investigate polynomial-time approximation schemes for the classic 0-1 knapsack problem. The previous algorithm by Deng, Jin, and Mao (SODA'23) has approximation factor $1 + \eps$ with running time $\widetilde{O}(n + \frac{1}{\eps^{2.2}})$. There i
Externí odkaz:
http://arxiv.org/abs/2308.07821
We investigate pseudopolynomial-time algorithms for Bounded Knapsack and Bounded Subset Sum. Recent years have seen a growing interest in settling their fine-grained complexity with respect to various parameters. For Bounded Knapsack, the number of i
Externí odkaz:
http://arxiv.org/abs/2307.12582
Autor:
Mao, Yuchen, Tao, Zhongkai
We apply a new method with explicit solution operators to construct asymptotically flat initial data sets of the vacuum Einstein equation with new localization properties. Applications include an improvement of the decay rate in Carlotto--Schoen [arX
Externí odkaz:
http://arxiv.org/abs/2210.09437
Autor:
Gao, Xue, Zhong, Zeming, Huang, Liangjun, Mao, Yuchen, Wang, Hui, Liu, Jiangwen, Ouyang, Liuzhang, Zhang, Lei, Han, Mengjiao, Ma, Xiuliang, Zhu, Min
Publikováno v:
In Nano Energy 15 December 2023 118 Part B
