English
Related papers

Related papers: 9-variable Boolean Functions with Nonlinearity 242…

200 papers

Identifying the types of orbits is an important topic in the study of chaotic dynamical systems. Beyond the well-known distinctly chaotic and regular motions, we focus on dynamics occurring in regions where regular and chaotic motions…

Chaotic Dynamics · Physics 2025-10-28 Jian Zu , Zhiguo Xu , Jingyue Hao

Low-rank approximations are popular methods to reduce the high computational cost of algorithms involving large-scale kernel matrices. The success of low-rank methods hinges on the matrix rank of the kernel matrix, and in practice, these…

Numerical Analysis · Computer Science 2020-10-22 Ruoxi Wang , Yingzhou Li , Eric Darve

A general analysis of line defect renormalisation group (RG) flows in the $\varepsilon$ expansion below $d=4$ dimensions is undertaken. The defect beta function for general scalar-fermion bulk theories is computed to next-to-leading order…

High Energy Physics - Theory · Physics 2023-07-26 William H. Pannell , Andreas Stergiou

Two classes of ternary bent functions of degree four with two and three terms in the univariate representation that belong to the completed Maiorana-McFarland class are found. Binomials are mappings $\F_{3^{4k}}\mapsto\fthree$ given by…

Discrete Mathematics · Computer Science 2025-07-29 Tor Helleseth , Alexander Kholosha , Niki Spithaki

We develop a method for training neural networks on Boolean data in which the values at all nodes are strictly $\pm 1$, and the resulting models are typically equivalent to networks whose nonzero weights are also $\pm 1$. The method…

Machine Learning · Computer Science 2026-02-20 Veit Elser , Manish Krishan Lal

We present a regularity lemma for Boolean functions $f:\{-1,1\}^n \to \{-1,1\}$ based on noisy influence, a measure of how locally correlated $f$ is with each input bit. We provide an application of the regularity lemma to weaken the…

Computational Complexity · Computer Science 2016-10-25 Chris Jones

We give the first non-trivial upper bounds on the average sensitivity and noise sensitivity of degree-$d$ polynomial threshold functions (PTFs). These bounds hold both for PTFs over the Boolean hypercube and for PTFs over $\R^n$ under the…

Computational Complexity · Computer Science 2009-10-19 Ilias Diakonikolas , Prasad Raghavendra , Rocco A. Servedio , Li-Yang Tan

Radial basis functions (RBFs) are prominent examples for reproducing kernels with associated reproducing kernel Hilbert spaces (RKHSs). The convergence theory for the kernel-based interpolation in that space is well understood and optimal…

Classical Analysis and ODEs · Mathematics 2023-09-15 Thomas Hangelbroek , Christian Rieger

Finding suitable features has been an essential problem in computer vision. We focus on Restricted Boltzmann Machines (RBMs), which, despite their versatility, cannot accommodate transformations that may occur in the scene. As a result,…

Computer Vision and Pattern Recognition · Computer Science 2016-11-15 Mario Valerio Giuffrida , Sotirios A. Tsaftaris

In theoretical analysis of deep learning, discovering which features of deep learning lead to good performance is an important task. In this paper, using the framework for analyzing the generalization error developed in Suzuki (2018), we…

Machine Learning · Statistics 2019-07-26 Yoshikazu Terada , Ryoma Hirose

We present a generalization of the RBF-FD method that computes RBF-FD weights in finite-sized neighborhoods around the centers of RBF-FD stencils by introducing an overlap parameter $\delta \in [0,1]$ such that $\delta=1$ recovers the…

Numerical Analysis · Mathematics 2017-05-24 Varun Shankar

This paper introduces a novel quantum algorithm that is able to classify a hierarchy of classes of imbalanced Boolean functions. The fundamental characteristic of imbalanced Boolean functions is that the proportion of elements in their…

This note carries three purposes involving our latest advances on the radial basis function (RBF) approach. First, we will introduce a new scheme employing the boundary knot method (BKM) to nonlinear convection-diffusion problem. It is…

Computational Engineering, Finance, and Science · Computer Science 2007-05-23 W. Chen , W. He

Achieving rotation invariance in deep neural networks without relying on data has always been a hot research topic. Intrinsic rotation invariance can enhance the model's feature representation capability, enabling better performance in…

Computer Vision and Pattern Recognition · Computer Science 2024-04-18 Hanlin Mo , Guoying Zhao

We investigate the randomized decision tree complexity of a specific class of read-once threshold functions. A read-once threshold formula can be defined by a rooted tree, every internal node of which is labeled by a threshold function…

Computational Complexity · Computer Science 2023-10-19 Nikos Leonardos

This work introduces a general numerical technique to invert one dimensional analytic or tabulated nonlinear functions in assigned ranges of interest. The proposed approach is based on an optimal version of the k-vector range searching, an…

Data Structures and Algorithms · Computer Science 2020-04-07 David Arnas , Daniele Mortari

In this paper, we study classes of Boolean functions that are testable with $O(\psi+1/\epsilon)$ queries, where $\psi$ depends on the parameters of the class (e.g., the number of terms, the number of relevant variables, etc.) but not on the…

Data Structures and Algorithms · Computer Science 2026-04-08 Nader H. Bshouty , George Haddad

We develop further the consequences of the irreducible-Boolean classification established in Ref. [9]; which have the advantage of allowing strong statistical calculations in disordered Boolean function models, such as the…

Mathematical Physics · Physics 2012-08-03 Martha Takane , Federico Zertuche

In this paper we investigate the family of functions representable by deep neural networks (DNN) with rectified linear units (ReLU). We give an algorithm to train a ReLU DNN with one hidden layer to *global optimality* with runtime…

Machine Learning · Computer Science 2018-03-01 Raman Arora , Amitabh Basu , Poorya Mianjy , Anirbit Mukherjee

We characterize the power of constant-depth Boolean circuits in generating uniform symmetric distributions. Let $f\colon\{0,1\}^m\to\{0,1\}^n$ be a Boolean function where each output bit of $f$ depends only on $O(1)$ input bits. Assume the…

Computational Complexity · Computer Science 2025-02-27 Daniel M. Kane , Anthony Ostuni , Kewen Wu
‹ Prev 1 4 5 6 7 8 10 Next ›