Zobrazeno 1 - 10
of 8 651
pro vyhledávání: '"Tan, Li"'
We connect the problem of properly PAC learning decision trees to the parameterized Nearest Codeword Problem ($k$-NCP). Despite significant effort by the respective communities, algorithmic progress on both problems has been stuck: the fastest known
Externí odkaz:
http://arxiv.org/abs/2409.13096
Smooth boosters generate distributions that do not place too much weight on any given example. Originally introduced for their noise-tolerant properties, such boosters have also found applications in differential privacy, reproducibility, and quantum
Externí odkaz:
http://arxiv.org/abs/2409.11597
Autor:
Zhong, Xian, Salahuddin, Zohaib, Chen, Yi, Woodruff, Henry C, Long, Haiyi, Peng, Jianyun, Udawatte, Nuwan, Casale, Roberto, Mokhtari, Ayoub, Zhang, Xiaoer, Huang, Jiayao, Wu, Qingyu, Tan, Li, Chen, Lili, Li, Dongming, Xie, Xiaoyan, Lin, Manxia, Lambin, Philippe
Artificial intelligence (AI)-based decision support systems have demonstrated value in predicting post-hepatectomy liver failure (PHLF) in hepatocellular carcinoma (HCC). However, they often lack transparency, and the impact of model explanations on
Externí odkaz:
http://arxiv.org/abs/2408.03771
We consider the task of properly PAC learning decision trees with queries. Recent work of Koch, Strassle, and Tan showed that the strictest version of this task, where the hypothesis tree $T$ is required to be optimally small, is NP-hard. Their work
Externí odkaz:
http://arxiv.org/abs/2407.01402
In this paper, our main aim is to investigate the strong convergence for a McKean-Vlasov stochastic differential equation with super-linear delay driven by fractional Brownian motion with Hurst exponent $H\in(1/2, 1)$. After giving uniqueness and exi
Externí odkaz:
http://arxiv.org/abs/2406.09678
Consider the expected query complexity of computing the $k$-fold direct product $f^{\otimes k}$ of a function $f$ to error $\varepsilon$ with respect to a distribution $\mu^k$. One strategy is to sequentially compute each of the $k$ copies to error $
Externí odkaz:
http://arxiv.org/abs/2405.16340
Autor:
Lim, Jue Tao, Bansal, Somya, Chong, Chee Seng, Dickens, Borame, Ng, Youming, Deng, Lu, Lee, Caleb, Tan, Li Yun, Chain, Grace, Ma, Pei, Sim, Shuzhen, Tan, Cheong Huat, Cook, Alex R, Ng, Lee Ching
In a study conducted in Singapore, a country prone to dengue outbreaks due to its climate and urban population, researchers examined the effectiveness of releasing male Aedes aegypti mosquitoes infected with Wolbachia (wAlbB strain) to reduce dengue
Externí odkaz:
http://arxiv.org/abs/2311.09754
This letter investigates the motion control problem of two mobile robots under allowable collisions. Here, the allowable collisions mean that the collisions do not damage the mobile robots. The occurrence of the collisions is discussed and the effect
Externí odkaz:
http://arxiv.org/abs/2311.08880
We propose a simple generalization of standard and empirically successful decision tree learning algorithms such as ID3, C4.5, and CART. These algorithms, which have been central to machine learning for decades, are greedy in nature: they grow a deci
Externí odkaz:
http://arxiv.org/abs/2310.01551