paper-with-me

Papers

Functional Gradient Boosting based on Residual Network Perception

2018-02-25 · ICML 2018 7 · Atsushi Nitanda, Taiji Suzuki

Residual Networks (ResNets) have become state-of-the-art models in deep learning and several theoretical studies have been devoted to understanding why ResNet works so well. One attractive viewpoint on ResNet is that it is optimizing the risk in a functional space by combining an ensemble of effective features. In this paper, we adopt this viewpoint to construct a new gradient boosting method, which is known to be very powerful in data analysis. To do so, we formalize the gradient boosting perspective of ResNet mathematically using the notion of functional gradients and propose a new method called ResFGB for classification tasks by leveraging ResNet perception. Two types of generalization guarantees are provided from the optimization perspective: one is the margin bound and the other is the expected risk bound by the sample-splitting technique. Experimental results show superior performance of the proposed method over state-of-the-art methods such as LightGBM.

📄 PDF Abstract BibTeX arXiv:1802.09031

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Average Pooling 설명 없음
ReLU How Do I Communicate to Expedia? How Do I Communicate to Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Live Support & Special Travel…
1x1 Convolution A 1 x 1 Convolution is a convolution with some special properties in that it can be used for dimensionality reduction,…
Batch Normalization 설명 없음
Bottleneck Residual Block A Bottleneck Residual Block is a variant of the residual block that utilises 1x1 convolutions to create a bottleneck. The…
Global Average Pooling Global Average Pooling is a pooling operation designed to replace fully connected layers in classical CNNs. The idea is to generate one feature map for each corresponding…
Residual Block Residual Blocks are skip-connection blocks that learn residual functions with reference to the layer inputs, instead of learning unreferenced functions. They were introduced…
Kaiming Initialization 설명 없음

Similar Papers 제목 키워드 기반

Wasserstein Gradient Boosting: A Framework for Distribution-Valued Supervised Learning

2024-05-15 · Takuo Matsubara

Gradient boosting is a sequential ensemble method that fits a new weaker learner to pseudo residuals at each iteration. We propose Wasserstein gradient boosting, a novel extension of gradient boosting that fits a new wea…

regressionUncertainty Quantification

Proximal boosting: aggregating weak learners to minimize non-differentiable losses

2018-08-29 · Erwan Fouillen, Claire Boyer, Maxime Sangnier

Gradient boosting is a prediction method that iteratively combines weak learners to produce a complex and accurate model. From an optimization point of view, the learning procedure of gradient boosting mimics a gradient …

Random Feature Representation Boosting

2025-01-30 · Nikita Zozoulenko, Thomas Cass, Lukas Gonon

We introduce Random Feature Representation Boosting (RFRBoost), a novel method for constructing deep residual random feature neural networks (RFNNs) using boosting theory. RFRBoost uses random features at each layer to l…

Residual Networks Behave Like Boosting Algorithms

2019-09-25 · Chapman Siu

We show that Residual Networks (ResNet) is equivalent to boosting feature representation, without any modification to the underlying ResNet training algorithm. A regret bound based on Online Gradient Boosting theory is p…

ITBoost: Information-Theoretic Trust for Robust Boosting

2026-05-06 · Ye Su, Longlong Zhao, Diego Garcia-Gil, Jipeng Guo 외 arxiv

Gradient boosting remains a strong and widely used method for tabular data learning, but its performance often degrades when training labels are noisy. This behavior is largely related to the way boosting algorithms emph…