A Note on Rademacher Functions and Computability
نویسندگان
چکیده
We will speculate on some computational properties of the system of Rademacher functions f n g. The n-th Rademacher function n is a step function on the interval [0; 1), jumping at nitely many dyadic rationals of size 1 2 n and assuming values f1; 1g alternatingly.
منابع مشابه
Rademacher complexity of stationary sequences
We show how to control the generalization error of time series models wherein past values of the outcome are used to predict future values. The results are based on a generalization of standard i.i.d. concentration inequalities to dependent data without the mixing assumptions common in the time series setting. Our proof and the result are simpler than previous analyses with dependent data or st...
متن کاملExploring Steinitz-Rademacher Polyhedra: a Challenge for Automated Reasoning Tools
This note reports on some experiments, using a handful of standard automated reasoning tools, for exploring Steinitz-Rademacher polyhedra, which are models of a certain first-order theory of incidence structures. This theory and its models, even simple ones, presents significant, geometrically fascinating challenges for automated reasoning tools.
متن کاملA note on the Menchov-Rademacher Inequality
We improve constants in the Rademacher-Menchov inequality by showing that for n > 64 E( sup 16k6n | k ∑ i=1 Xi|) 6 0, 11(6, 20 + log2 n), for all orthogonal random variables X1, ..., Xn such that ∑n k=1 E|Xk| = 1. 2000 MSC: primary 26D15; secondary 60E15
متن کاملA Note on Improved Loss Bounds for Multiple Kernel Learning
The paper [5] presented a bound on the generalisation error of classifiers learned through multiple kernel learning. The bound has (an improved) additive dependence on the number of kernels (with the same logarithmic dependence on this number). However, parts of the proof were incorrectly presented in that paper. This note remedies this weakness by restating the problem and giving a detailed pr...
متن کاملQuantum Domain Theory - Definitions and Applications
Classically domain theory is a rigourous mathematical structure to describe denotational semantics for programming languages and to study the computability of partial functions. Recently, the application of domain theory has also been extended to the quantum setting. In this note we review these results and we present some new thoughts in this field.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000