Search Results for author: Haoran Deng

Found 10 papers, 4 papers with code

Parameter-efficient Prompt Learning for 3D Point Cloud Understanding

1 code implementation24 Feb 2024 Hongyu Sun, Yongcai Wang, Wang Chen, Haoran Deng, Deying Li

Finally, a lightweight PointAdapter module is arranged near target tasks to enhance prompt tuning for 3D point cloud understanding.

Few-Shot Learning Prompt Engineering

Graph-Skeleton: ~1% Nodes are Sufficient to Represent Billion-Scale Graph

1 code implementation14 Feb 2024 Linfeng Cao, Haoran Deng, Yang Yang, Chunping Wang, Lei Chen

In this paper, we argue that properly fetching and condensing the background nodes from massive web graph data might be a more economical shortcut to tackle the obstacles fundamentally.

Feature Correlation Graph Mining +1

Joint Trading and Scheduling among Coupled Carbon-Electricity-Heat-Gas Industrial Clusters

no code implementations20 Dec 2023 Dafeng Zhu, Bo Yang, Yu Wu, Haoran Deng, ZhaoYang Dong, Kai Ma, Xinping Guan

This paper presents a carbon-energy coupling management framework for an industrial park, where the carbon flow model accompanying multi-energy flows is adopted to track and suppress carbon emissions on the user side.

energy trading Management +1

Hydrogen Supply Infrastructure Network Planning Approach towards Chicken-egg Conundrum

no code implementations14 Aug 2023 Haoran Deng, Bo Yang, Mo-Yuen Chow, Gang Yao, Cailian Chen, Xinping Guan

However, there is a strong causality between HFCVs and hydrogen refueling stations (HRSs): the planning decisions of HRSs could affect the hydrogen refueling demand of HFCVs, and the growth of demand would in turn stimulate the further investment in HRSs, which is also known as the ``chicken and egg'' conundrum.

Accelerating Dynamic Network Embedding with Billions of Parameter Updates to Milliseconds

1 code implementation15 Jun 2023 Haoran Deng, Yang Yang, Jiahe Li, Haoyang Cai, ShiLiang Pu, Weihao Jiang

Network embedding, a graph representation learning method illustrating network topology by mapping nodes into lower-dimension vectors, is challenging to accommodate the ever-changing dynamic graphs in practice.

Graph Reconstruction Graph Representation Learning +3

Distributionally Robust Day-ahead Scheduling for Power-traffic Network under a Potential Game Framework

no code implementations4 Dec 2022 Haoran Deng, Bo Yang, Chao Ning, Cailian Chen, Xinping Guan

In order to ensure the individual optimality of the two networks in a unified framework in day-ahead power scheduling, a two-stage distributionally robust centralized optimization model is established to carry out the equilibrium of power-transportation coupled network.

Scheduling

Neural Augmented Kalman Filtering with Bollinger Bands for Pairs Trading

1 code implementation19 Oct 2022 Amit Milstein, Haoran Deng, Guy Revach, Hai Morgenstern, Nir Shlezinger

In this work, we propose KalmenNet-aided Bollinger bands Pairs Trading (KBPT), a deep learning aided policy that augments the operation of KF-aided BB trading.

Relational Learning between Multiple Pulmonary Nodules via Deep Set Attention Transformers

no code implementations12 Apr 2020 Jiancheng Yang, Haoran Deng, Xiaoyang Huang, Bingbing Ni, Yi Xu

In this study, we propose a multiple instance learning (MIL) approach and empirically prove the benefit to learn the relations between multiple nodules.

Multiple Instance Learning Relational Reasoning

Evaluating and Boosting Uncertainty Quantification in Classification

no code implementations13 Sep 2019 Xiaoyang Huang, Jiancheng Yang, Linguo Li, Haoran Deng, Bingbing Ni, Yi Xu

Emergence of artificial intelligence techniques in biomedical applications urges the researchers to pay more attention on the uncertainty quantification (UQ) in machine-assisted medical decision making.

Classification Decision Making +2

Exploiting Channel Similarity for Accelerating Deep Convolutional Neural Networks

no code implementations6 Aug 2019 Yunxiang Zhang, Chenglong Zhao, Bingbing Ni, Jian Zhang, Haoran Deng

To address the limitations of existing magnitude-based pruning algorithms in cases where model weights or activations are of large and similar magnitude, we propose a novel perspective to discover parameter redundancy among channels and accelerate deep CNNs via channel pruning.

Clustering

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