paper-with-me

Papers

Simplex Random Features

2023-01-31 · Isaac Reid, Krzysztof Choromanski, Valerii Likhosherstov, Adrian Weller

We present Simplex Random Features (SimRFs), a new random feature (RF) mechanism for unbiased approximation of the softmax and Gaussian kernels by geometrical correlation of random projection vectors. We prove that SimRFs provide the smallest possible mean square error (MSE) on unbiased estimates of these kernels among the class of weight-independent geometrically-coupled positive random feature (PRF) mechanisms, substantially outperforming the previously most accurate Orthogonal Random Features at no observable extra cost. We present a more computationally expensive SimRFs+ variant, which we prove is asymptotically optimal in the broader family of weight-dependent geometrical coupling schemes (which permit correlations between random vector directions and norms). In extensive empirical studies, we show consistent gains provided by SimRFs in settings including pointwise kernel estimation, nonparametric classification and scalable Transformers.

📄 PDF Abstract BibTeX arXiv:2301.13856

Code (1)

isaac-reid/simplex_random_features 공식 구현

Methods 이 논문이 사용한 방법론

Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…

Similar Papers 제목 키워드 기반

The Sackin Index of Simplex Networks

2021-12-31 · Louxin Zhang

A phylogenetic network is a simplex (or 1-component tree-child) network if the child of every reticulation node is a network leaf. Simplex networks are a superclass of phylogenetic trees and a subclass of tree-child netw…

Efficient learning of simplices

2012-11-09 · Joseph Anderson, Navin Goyal, Luis Rademacher

We show an efficient algorithm for the following problem: Given uniformly random points from an arbitrary n-dimensional simplex, estimate the simplex. The size of the sample and the number of arithmetic operations of our…

SIMPLEX-PB 2.0: A Reliable Dataset for Lexical Simplification in Brazilian Portuguese

2020-07-01 · WS 2020 7 · Nathan Hartmann, Gustavo Henrique Paetzold, S Alu{\'\i}sio, ra

Most research on Lexical Simplification (LS) addresses non-native speakers of English, since they are numerous and easy to recruit. This makes it difficult to create LS solutions for other languages and target audiences.…

Lexical Simplification

Improved Algorithm and Bounds for Successive Projection

2024-03-16 · Jiashun Jin, Zheng Tracy Ke, Gabriel Moryoussef, Jiajun Tang 외

Given a $K$-vertex simplex in a $d$-dimensional space, suppose we measure $n$ points on the simplex with noise (hence, some of the observed points fall outside the simplex). Vertex hunting is the problem of estimating th…

Single Particle Analysis

Probabilistic Simplex Component Analysis by Importance Sampling

2023-02-22 · Nerya Granot, Tzvi Diskin, Nicolas Dobigeon, Ami Wiesel

In this paper we consider the problem of linear unmixing hidden random variables defined over the simplex with additive Gaussian noise, also known as probabilistic simplex component analysis (PRISM). Previous solutions t…