Hierarchical Bayesian Inference and Recursive Regularization for Large-Scale Classification

doi:10.1145/2629585

Return

Hierarchical Bayesian Inference and Recursive Regularization for Large-Scale Classification

2015-04-13

PRE

Siddharth Gopal *

Yiming Yang

DOI：10.1145/2629585

Original

Original request for help

Save

Abstract

En 中文

In this article, we address open challenges in large-scale classification, focusing on how to effectively leverage the dependency structures (hierarchical or graphical) among class labels, and how to make the inference scalable in jointly optimizing all model parameters. We propose two main approaches, namely the hierarchical Bayesian inference framework and the recursive regularization scheme. The key idea in both approaches is to reinforce the similarity among parameter across the nodes in a hierarchy or network based on the proximity and connectivity of the nodes. For scalability, we develop hierarchical variational inference algorithms and fast dual coordinate descent training procedures with parallelization. In our experiments for classification problems with hundreds of thousands of classes and millions of training instances with terabytes of parameters, the proposed methods show consistent and statistically significant improvements over other competing approaches, and the best results on multiple benchmark datasets for large-scale classification.

Keywords:

Design

Algorithms

Experimentation

Large-scale optimization

hierarchical classification

Bayesian methods

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.