no code implementations • ICML 2020 • Yuchao Cai, Hanyuan Hang, Hanfang Yang, Zhouchen Lin
In this paper, we propose a boosting algorithm for regression problems called \textit{boosted histogram transform for regression} (BHTR) based on histogram transforms composed of random rotations, stretchings, and translations.
1 code implementation • Findings (ACL) 2022 • Qiwei Bi, Jian Li, Lifeng Shang, Xin Jiang, Qun Liu, Hanfang Yang
With the adoption of large pre-trained models like BERT in news recommendation, the above way to incorporate multi-field information may encounter challenges: the shallow feature encoding to compress the category and entity information is not compatible with the deep BERT encoding.
no code implementations • 22 May 2024 • Yuheng Ma, Ke Jia, Hanfang Yang
Then we propose HistOfTree, an estimator that fully leverages the information contained in both public and private features.
no code implementations • 2 Dec 2023 • Yuchao Cai, Yuheng Ma, Hanfang Yang, Hanyuan Hang
We consider the paradigm of unsupervised anomaly detection, which involves the identification of anomalies within a dataset in the absence of labeled examples.
1 code implementation • 19 Nov 2023 • Yuheng Ma, Hanfang Yang
Then, we present a novel approach, the locally differentially private classification tree, which attains the mini-max optimal convergence rate.
no code implementations • 13 Sep 2021 • Qiwei Bi, Haoyuan Li, Kun Lu, Hanfang Yang
Previous abstractive methods apply sequence-to-sequence structures to generate summary without a module to assist the system to detect vital mentions and relationships within a document.
no code implementations • 1 Sep 2021 • Hanyuan Hang, Yuchao Cai, Hanfang Yang, Zhouchen Lin
In this paper, we propose an ensemble learning algorithm called \textit{under-bagging $k$-nearest neighbors} (\textit{under-bagging $k$-NN}) for imbalanced classification problems.
no code implementations • 3 Jun 2021 • Hanyuan Hang, Tao Huang, Yuchao Cai, Hanfang Yang, Zhouchen Lin
In this paper, we propose a gradient boosting algorithm for large-scale regression problems called \textit{Gradient Boosted Binary Histogram Ensemble} (GBBHE) based on binary histogram partition and ensemble learning.
no code implementations • 24 Jun 2019 • Hanyuan Hang, Yuchao Cai, Hanfang Yang
Single-level density-based approach has long been widely acknowledged to be a conceptually and mathematically convincing clustering method.