most citedA Communication-Efficient Parallel Algorithm for Decision Tree

69 citations · 92 across the 5 of their papers we have counts for

collaborators

5 papers

cs.LG20192 cited

Interpreting Basis Path Set in Neural Networks

Juanping Zhu, Qi Meng, Wei Chen +1

Based on basis path set, G-SGD algorithm significantly outperforms conventional SGD algorithm in optimizing neural networks. However, how the inner mechanism of basis paths work re…

cs.LG201911 cited

Positively Scale-Invariant Flatness of ReLU Neural Networks

Mingyang Yi, Qi Meng, Wei Chen +2

It was empirically confirmed by Keskar et al.\cite{SharpMinima} that flatter minima generalize better. However, for the popular ReLU network, sharp minimum can also generalize well…

cs.LG201669 cited

A Communication-Efficient Parallel Algorithm for Decision Tree

Qi Meng, Guolin Ke, Taifeng Wang +4

Decision tree (and its extensions such as Gradient Boosting Decision Trees and Random Forest) is a widely used machine learning algorithm, due to its practical effectiveness and mo…

cs.LG201610 cited

Asynchronous Stochastic Proximal Optimization Algorithms with Variance Reduction

Qi Meng, Wei Chen, Jingcheng Yu +3

Regularized empirical risk minimization (R-ERM) is an important branch of machine learning, since it constrains the capacity of the hypothesis space and guarantees the generalizati…

stat.ML2016

Generalization Error Bounds for Optimization Algorithms via Stability

Qi Meng, Yue Wang, Wei Chen +3

Many machine learning tasks can be formulated as Regularized Empirical Risk Minimization (R-ERM), and solved by optimization algorithms such as gradient descent (GD), stochastic gr…