Zengfeng Huang

Orcid: 0000-0003-2671-7483

According to our database1, Zengfeng Huang authored at least 59 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
FreshGNN: Reducing Memory Access via Stable Historical Embeddings for Graph Neural Network Training.
Proc. VLDB Endow., February, 2024

Lipschitz Bandits With Batched Feedback.
IEEE Trans. Inf. Theory, 2024

Space Complexity of Euclidean Clustering.
CoRR, 2024

2023
Learning Regularized Noise Contrastive Estimation for Robust Network Embedding.
IEEE Trans. Knowl. Data Eng., May, 2023

Efficient Tree-SVD for Subset Node Embedding over Large Dynamic Graphs.
Proc. ACM Manag. Data, 2023

Effective stabilized self-training on few-labeled graph data.
Inf. Sci., 2023

Understanding Community Bias Amplification in Graph Representation Learning.
CoRR, 2023

StructComp: Substituting propagation with Structural Compression in Training Graph Contrastive Learning.
CoRR, 2023

UNREAL: Unlabeled Nodes Retrieval and Labeling for Heavily-imbalanced Node Classification.
CoRR, 2023

ReFresh: Reducing Memory Access from Exploiting Stable Historical Embeddings for Graph Neural Network Training.
CoRR, 2023

Visual Analytics for Phishing Scam Identification in Blockchain Transactions with Multiple Model Comparison.
Proceedings of the 16th International Symposium on Visual Information Communication and Interaction, 2023

Rethinking Semi-Supervised Imbalanced Node Classification from Bias-Variance Decomposition.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Adversarially Robust Distributed Count Tracking via Partial Differential Privacy.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

On Coresets for Clustering in Small Dimensional Euclidean spaces.
Proceedings of the International Conference on Machine Learning, 2023

2022
ASGNN: Graph Neural Networks with Adaptive Structure.
CoRR, 2022

Exploiting Neighbor Effect: Conv-Agnostic GNNs Framework for Graphs with Heterophily.
CoRR, 2022

Compressive Sensing Approaches for Sparse Distribution Estimation Under Local Privacy.
Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

BSAL: A Framework of Bi-component Structure and Attribute Learning for Link Prediction.
Proceedings of the SIGIR '22: The 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, Madrid, Spain, July 11, 2022

Transformers from an Optimization Perspective.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Optimal Clustering with Noisy Queries via Multi-Armed Bandit.
Proceedings of the International Conference on Machine Learning, 2022

Why Propagate Alone? Parallel Use of Labels and Features on Graphs.
Proceedings of the Tenth International Conference on Learning Representations, 2022

2021
Efficient and High-Quality Seeded Graph Matching: Employing Higher-order Structural Information.
ACM Trans. Knowl. Discov. Data, 2021

Communication-Efficient Distributed Covariance Sketch, with Application to Distributed PCA.
J. Mach. Learn. Res., 2021

Implicit vs Unfolded Graph Neural Networks.
CoRR, 2021

Batched Lipschitz Bandits.
CoRR, 2021

BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein Approximation.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Understanding Bandits with Graph Feedback.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Learning Based Proximity Matrix Factorization for Node Embedding.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Scaling Up Graph Neural Networks Via Graph Coarsening.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Discrete-time Temporal Network Embedding via Implicit Hierarchical Learning in Hyperbolic Space.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Graph Neural Networks Inspired by Classical Iterative Algorithms.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Communication complexity of approximate maximum matching in the message-passing model.
Distributed Comput., 2020

Compressive Privatization: Sparse Distribution Estimation under Locally Differentially Privacy.
CoRR, 2020

Correction to: Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks.
Algorithmica, 2020

SCE: Scalable Network Embedding from Sparsest Cut.
Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

Personalized PageRank to a Target Node, Revisited.
Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

Joint Representation Learning of Legislator and Legislation for Roll Call Prediction.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Simple and Deep Graph Convolutional Networks.
Proceedings of the 37th International Conference on Machine Learning, 2020

Automatic Term Name Generation for Gene Ontology: Task and Dataset.
Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2020, 2020

PathQG: Neural Question Generation from Facts.
Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing, 2020

2019
Near Optimal Frequent Directions for Sketching Dense and Sparse Matrices.
J. Mach. Learn. Res., 2019

Higher-order Weighted Graph Convolutional Networks.
CoRR, 2019

Dynamic Self-training Framework for Graph Convolutional Networks.
CoRR, 2019

Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks.
Algorithmica, 2019

Dynamic Graph Stream Algorithms in o(n) Space.
Algorithmica, 2019

Optimal Sparsity-Sensitive Bounds for Distributed Mean Estimation.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

GB-KMV: An Augmented KMV Sketch for Approximate Containment Similarity Search.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

2018
Efficient and High-Quality Seeded Graph Matching: Employing High Order Structural Information.
CoRR, 2018

2017
Top-k spatial-keyword publish/subscribe over sliding window.
VLDB J., 2017

The Communication Complexity of Distributed epsilon-Approximations.
SIAM J. Comput., 2017

Efficient Matrix Sketching over Distributed Data.
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

Tracking Matrix Approximation over Distributed Sliding Windows.
Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

2016
SKYPE: Top-k Spatial-keyword Publish/Subscribe Over Sliding Window.
Proc. VLDB Endow., 2016

Clairvoyant Mechanisms for Online Auctions.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015
Communication Complexity of Approximate Matching in Distributed Graphs.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2014
Tracking the Frequency Moments at All Times.
CoRR, 2014

2013
Mergeable summaries.
ACM Trans. Database Syst., 2013

2011
Sampling based algorithms for quantile computation in sensor networks.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2011

Optimal sampling algorithms for frequency estimation in distributed data.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011


  Loading...