Search Results for author: Haoyue Wang

Found 7 papers, 1 papers with code

A multi-layer refined network model for the identification of essential proteins

no code implementations6 Dec 2023 Haoyue Wang, Li Pan, Bo Yang, Junqiang Jiang, Wenbin Li

In order to improve the accuracy of the identification of essential proteins, researchers attempted to obtain a refined PIN by combining multiple biological information to filter out some unreliable interactions in the PIN.

Specificity

Exploring Depth Information for Face Manipulation Detection

no code implementations29 Dec 2022 Haoyue Wang, Meiling Li, Sheng Li, Zhenxing Qian, Xinpeng Zhang

As one of the important face features, the face depth map, which has shown to be effective in other areas such as the face recognition or face detection, is unfortunately paid little attention to in literature for detecting the manipulated face images.

Face Detection Face Recognition

Quant-BnB: A Scalable Branch-and-Bound Method for Optimal Decision Trees with Continuous Features

no code implementations23 Jun 2022 Rahul Mazumder, Xiang Meng, Haoyue Wang

Recently there has been significant interest in learning optimal decision trees using various approaches (e. g., based on integer programming, dynamic programming) -- to achieve computational scalability, most of these approaches focus on classification tasks with binary features.

Combinatorial Optimization

Linear regression with partially mismatched data: local search with theoretical guarantees

no code implementations3 Jun 2021 Rahul Mazumder, Haoyue Wang

We prove that under a suitable scaling of the number of mismatched pairs compared to the number of samples and features, and certain assumptions on problem data; our local search algorithm converges to a nearly-optimal solution at a linear rate.

regression

Interior-Point Methods Strike Back: Solving the Wasserstein Barycenter Problem

no code implementations NeurIPS 2019 Dongdong Ge, Haoyue Wang, Zikai Xiong, Yinyu Ye

Computing the Wasserstein barycenter of a set of probability measures under the optimal transport metric can quickly become prohibitive for traditional second-order algorithms, such as interior-point methods, as the support size of the measures increases.

Cannot find the paper you are looking for? You can Submit a new open access paper.