The Third Trick

نویسندگان

چکیده

We prove a result, similar to the ones known as Ishihara's First and Second Trick, for sequences of functions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Kernel Trick for Distances

A method is described which, like the kernel trick in support vector machines (SVMs), lets us generalize distance-based algorithms to operate in feature spaces, usually nonlinearly related to the input space. This is done by identifying a class of kernels which can be represented as norm-based distances in Hilbert spaces. It turns out that common kernel algorithms, such as SVMs and kernel PCA, ...

متن کامل

The Birthday Trick with Lies

In this article, we determine the number of yes/no questions required to figure out a birthday (a number between 0 and 31) when up to r incorrect answers to these questions are allowed. In the language of error-correcting codes, we construct optimal (shortest possible length) codes of size 32 and minimal distance d for each positive integer d .

متن کامل

The nature of the Mādhyamika trick

This paper evaluates several recent efforts to interpret the work of Nāgārjuna through the lens of modern symbolic logic. An attempt is made to uncover the premises that justify the use of symbolic logic for this purpose. This is accomplished through a discussion of (1) the historical origins of those premises in the Indian and Tibetan traditions, and (2) how such assumptions prejudice our unde...

متن کامل

The Averaging Trick and the Cerný Conjecture

The results of several papers concerning the Černý conjecture are deduced as consequences of a simple idea that I call the averaging trick. This idea is implicitly used in the literature, but no attempt was made to formalize the proof scheme axiomatically. Instead, authors axiomatized classes of automata to which it applies.

متن کامل

Kernel Reparametrization Trick

While deep neural networks have achieved state-of-the-art performance on many tasks across varied domains, they still remain black boxes whose inner workings are hard to interpret and understand. In this paper, we develop a novel method for efficiently capturing the behaviour of deep neural networks using kernels. In particular, we construct a hierarchy of increasingly complex kernels that enco...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logical Methods in Computer Science

سال: 2022

ISSN: ['1860-5974']

DOI: https://doi.org/10.46298/lmcs-18(3:21)2022