paper-with-me

홈 › Papers

Deep learning with t-exponential Bayesian kitchen sinks

2018-02-10 · Harris Partaourides, Sotirios Chatzis

Bayesian learning has been recently considered as an effective means of accounting for uncertainty in trained deep network parameters. This is of crucial importance when dealing with small or sparse training datasets. On the other hand, shallow models that compute weighted sums of their inputs, after passing them through a bank of arbitrary randomized nonlinearities, have been recently shown to enjoy good test error bounds that depend on the number of nonlinearities. Inspired from these advances, in this paper we examine novel deep network architectures, where each layer comprises a bank of arbitrary nonlinearities, linearly combined using multiple alternative sets of weights. We effect model training by means of approximate inference based on a t-divergence measure; this generalizes the Kullback-Leibler divergence in the context of the t-exponential family of distributions. We adopt the t-exponential family since it can more flexibly accommodate real-world data, that entail outliers and distributions with fat tails, compared to conventional Gaussian model assumptions. We extensively evaluate our approach using several challenging benchmarks, and provide comparative results to related state-of-the-art techniques.

📄 PDF Abstract BibTeX arXiv:1802.03651

Code (0)

등록된 구현이 없습니다.

Tasks

Deep Learning

Similar Papers 제목 키워드 기반

Johnson-Lindenstrauss Lemma, Linear and Nonlinear Random Projections, Random Fourier Features, and Random Kitchen Sinks: Tutorial and Survey

2021-08-09 · Benyamin Ghojogh, Ali Ghodsi, Fakhri Karray, Mark Crowley

This is a tutorial and survey paper on the Johnson-Lindenstrauss (JL) lemma and linear and nonlinear random projections. We start with linear random projection and then justify its correctness by JL lemma and its proof. …

Dimensionality ReductionLEMMA

Convolutional Kitchen Sinks for Transcription Factor Binding Site Prediction

2017-05-31

We present a simple and efficient method for prediction of transcription factor binding sites from DNA sequence. Our method computes a random approximation of a convolutional kernel feature map from DNA sequence and then…

PredictionTranscription Factor Binding Site Prediction

Fastfood: Approximate Kernel Expansions in Loglinear Time

2014-08-13 · Quoc Viet Le, Tamas Sarlos, Alexander Johannes Smola

Despite their successes, what makes kernel methods difficult to use in many large scale problems is the fact that storing and computing the decision function is typically expensive, especially at prediction time. In this…

RF Spectrogram Anomaly Detection with Quantum Kitchen Sinks: Architecture, Representation, and Hardware Validation

2026-07-15 · Abdallah Aaraba, Alexis Vieloszynski, Remon Polus, Ola Ahmad 외 arxiv

The broadcast nature of wireless channels exposes radio-frequency (RF) networks to anomalous and malicious transmissions, making anomaly detection a fundamental requirement for secure spectrum management. Quantum Kitchen…

Anomaly Detection

Reducing the Computational Complexity of Learning with Random Convolutional Features

2023-05-05 · ICASSP 2023 5 · M. A. Omidi, B. Seyfe, S. Valaee

In the last decade, there has been a surge of research interest in feature extraction using random sampling. These techniques are fast and scalable and, at the same time, have practical favorability in low-sample size an…

feature selectionTime Series