paper-with-me

Papers

Random Maxout Features

2015-06-11 · Youssef Mroueh, Steven Rennie, Vaibhava Goel

In this paper, we propose and study random maxout features, which are constructed by first projecting the input data onto sets of randomly generated vectors with Gaussian elements, and then outputing the maximum projection value for each set. We show that the resulting random feature map, when used in conjunction with linear models, allows for the locally linear estimation of the function of interest in classification tasks, and for the locally linear embedding of points when used for dimensionality reduction or data visualization. We derive generalization bounds for learning that assess the error in approximating locally linear functions by linear functions in the maxout feature space, and empirically evaluate the efficacy of the approach on the MNIST and TIMIT classification tasks.

📄 PDF Abstract BibTeX arXiv:1506.03705

Code (0)

등록된 구현이 없습니다.

Tasks

Data VisualizationDimensionality ReductionGeneral ClassificationGeneralization Bounds

Methods 이 논문이 사용한 방법론

Maxout The Maxout Unit is a generalization of the ReLU and the leaky ReLU functions. It is a…

Similar Papers 제목 키워드 기반

Batch-normalized Maxout Network in Network

2015-11-09 · Jia-Ren Chang, Yong-Sheng Chen

This paper reports a novel deep architecture referred to as Maxout network In Network (MIN), which can enhance model discriminability and facilitate the process of information abstraction within the receptive field. The …

Image Classification

Maxout Polytopes

2025-09-25 · Andrei Balakin, Shelby Cox, Georg Loho, Bernd Sturmfels arxiv

Maxout polytopes are defined by feedforward neural networks with maxout activation function and non-negative weights after the first layer. We characterize the parameter spaces and extremal f-vectors of maxout polytopes …

Deep Maxout Network Gaussian Process

2022-08-08 · Libin Liang, Ye Tian, Ge Cheng

Study of neural networks with infinite width is important for better understanding of the neural network in practical application. In this work, we derive the equivalence of the deep, infinite-width maxout network and th…

Bayesian Inference

Improving Deep Neural Networks with Probabilistic Maxout Units

2013-12-20 · Jost Tobias Springenberg, Martin Riedmiller

We present a probabilistic variant of the recently introduced maxout unit. The success of deep neural networks utilizing maxout can partly be attributed to favorable performance under dropout, when compared to rectified …

General Classificationimage-classificationImage Classification

On the expressivity of sparse maxout networks

2025-10-15 · Moritz Grillo, Tobias Hofmann arxiv

We study the expressivity of sparse maxout networks, where each neuron takes a fixed number of inputs from the previous layer and employs a, possibly multi-argument, maxout activation. This setting captures key character…