Star algorithm for NN ensembling

06/01/2022
by   Sergey Zinchenko, et al.
0

Neural network ensembling is a common and robust way to increase model efficiency. In this paper, we propose a new neural network ensemble algorithm based on Audibert's empirical star algorithm. We provide optimal theoretical minimax bound on the excess squared risk. Additionally, we empirically study this algorithm on regression and classification tasks and compare it to most popular ensembling methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/19/2018

Reinforcement Learning with A* and a Deep Heuristic

A* is a popular path-finding algorithm, but it can only be applied to th...
research
03/21/2023

PRISE: Demystifying Deep Lucas-Kanade with Strongly Star-Convex Constraints for Multimodel Image Alignment

The Lucas-Kanade (LK) method is a classic iterative homography estimatio...
research
10/28/2022

ODNet: A Convolutional Neural Network for Asteroid Occultation Detection

We propose to design and build an algorithm that will use a Convolutiona...
research
08/27/2018

Empirical Analysis of Common Subgraph Isomorphism Approaches to the Lost-in-Space Star Identification Problem

The process of identifying stars is integral toward stellar based orient...
research
04/16/2018

A Novel Parallel Ray-Casting Algorithm

The Ray-Casting algorithm is an important method for fast real-time surf...
research
02/10/2020

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View

In the Steiner Tree problem we are given an edge weighted undirected gra...
research
09/18/2022

Star Anagram Detection and Classification

A star anagram is a rearrangement of the letters of one word to produce ...

Please sign up or login with your details

Forgot password? Click here to reset