Search Results for author:
Found 30 papers, 16 papers with code
Don't Waste Your Bits! Squeeze Activations and Gradients for Deep Neural Networks via TinyScript
Recent years have witnessed intensive research interests on training deep neural networks (DNNs) more efficiently by quantization-based compression methods, which facilitate DNNs training in two ways: (1) activations are quantized to shrink the memory consumption, and (2) gradients are quantized to decrease the communication cost.
Dense-to-Sparse Gate for Mixture-of-Experts
However, we found that the current approach of jointly training experts and the sparse gate introduces a negative impact on model accuracy, diminishing the efficiency of expensive large-scale model training.
K-Core Decomposition on Super Large Graphs with Limited Resources
For example, the distributed K-core decomposition algorithm can scale to a large graph with 136 billion edges without losing correctness with our divide-and-conquer technique.
HET: Scaling out Huge Embedding Model Training via Cache-enabled Distributed Framework
Embedding models have been an effective learning paradigm for high-dimensional data.
PointCLIP: Point Cloud Understanding by CLIP
On top of that, we design an inter-view adapter to better extract the global feature and adaptively fuse the few-shot knowledge learned from 3D into CLIP pre-trained in 2D.
RIM: Reliable Influence-based Active Learning on Graphs
Message passing is the core of most graph models such as Graph Convolutional Network (GCN) and Label Propagation (LP), which usually require a large number of clean labeled data to smooth out the neighborhood over the graph.
Node Dependent Local Smoothing for Scalable Graph Learning
Recent works reveal that feature or label smoothing lies at the core of Graph Neural Networks (GNNs).
ProxyBO: Accelerating Neural Architecture Search via Bayesian Optimization with Zero-cost Proxies
Designing neural architectures requires immense manual efforts.
Cardinality Estimation in DBMS: A Comprehensive Benchmark Evaluation
Therefore, we propose a new metric P-Error to evaluate the performance of CardEst methods, which overcomes the limitation of Q-Error and is able to reflect the overall end-to-end performance of CardEst methods.
Graph Attention Multi-Layer Perceptron
Graph neural networks (GNNs) have recently achieved state-of-the-art performance in many graph-based applications.
Evaluating Deep Graph Neural Networks
Based on the experimental results, we answer the following two essential questions: (1) what actually leads to the compromised performance of deep GNNs; (2) when we need and how to build deep GNNs.
Grain: Improving Data Efficiency of Graph Neural Networks via Diversified Influence Maximization
Data selection methods, such as active learning and core-set selection, are useful tools for improving the data efficiency of deep learning models on large-scale datasets.
ROD: Reception-aware Online Distillation for Sparse Graphs
Unfortunately, many real-world networks are sparse in terms of both edges and labels, leading to sub-optimal performance of GNNs.
VolcanoML: Speeding up End-to-End AutoML via Scalable Search Space Decomposition
End-to-end AutoML has attracted intensive interests from both academia and industry, which automatically searches for ML pipelines in a space induced by feature engineering, algorithm/model selection, and hyper-parameter tuning.
OpenBox: A Generalized Black-box Optimization Service
Black-box optimization (BBO) has a broad range of applications, including automatic machine learning, engineering, physics, and experimental design.
CausCF: Causal Collaborative Filtering for RecommendationEffect Estimation
It is based on the idea that similar users not only have a similar taste on items, but also have similar treatment effect under recommendations.
GMLP: Building Scalable and Flexible Graph Neural Networks with Feature-Message Passing
In recent studies, neural message passing has proved to be an effective way to design graph neural networks (GNNs), which have achieved state-of-the-art performance in many graph-based tasks.
Explore User Neighborhood for Real-time E-commerce Recommendation
On the one hand, it utilizes UI relations and user neighborhood to capture both global and local information.
Efficient Automatic CASH via Rising Bandits
In this framework, the BO methods are used to solve the HPO problem for each ML algorithm separately, incorporating a much smaller hyperparameter space for BO methods.
Efficient and Scalable Structure Learning for Bayesian Networks: Algorithms and Applications
To resolve this, we propose a new structure learning algorithm LEAST, which comprehensively fulfills our business requirements as it attains high accuracy, efficiency and scalability at the same time.
MFES-HB: Efficient Hyperband with Multi-Fidelity Quality Measurements
Instead of sampling configurations randomly in HB, BOHB samples configurations based on a BO surrogate model, which is constructed with the high-fidelity measurements only.
FLAT: Fast, Lightweight and Accurate Method for Cardinality Estimation
Despite decades of research, existing methods either over simplify the models only using independent factorization which leads to inaccurate estimates, or over complicate them by lossless conditional factorization without any independent assumption which results in slow probability computation.
Graph Neural Networks in Recommender Systems: A Survey
In this survey, we provide a comprehensive review of the most recent works on GNN-based recommender systems.
Contrastive Learning for Sequential Recommendation
Sequential recommendation methods play a crucial role in modern recommender systems because of their ability to capture a user's dynamic interest from her/his historical interactions.
UniNet: Scalable Network Representation Learning with Metropolis-Hastings Sampling
Finally, with the new edge sampler and random walk model abstraction, we carefully implement a scalable NRL framework called UniNet.
DeGNN: Characterizing and Improving Graph Neural Networks with Graph Decomposition
Despite the wide application of Graph Convolutional Network (GCN), one major limitation is that it does not benefit from the increasing depth and suffers from the oversmoothing problem.
X-Forest: Approximate Random Projection Trees for Similarity Measurement
First, we introduced RP Trees into the tasks of similarity measurement such that accuracy is improved.
AHash: A Load-Balanced One Permutation Hash
Unlike the densification to fill the empty bins after they undesirably occur, our design goal is to balance the load so as to reduce the empty bins in advance.
An Experimental Evaluation of Large Scale GBDT Systems
Gradient boosting decision tree (GBDT) is a widely-used machine learning algorithm in both data analytic competitions and real-world industrial applications.
Fast Hyperparameter Optimization of Deep Neural Networks via Ensembling Multiple Surrogates
The performance of deep neural networks crucially depends on good hyperparameter configurations.
