English
Related papers

Related papers: Projection-Forcing Multisets of Weight Changes

200 papers

For every $k \in \mathbb{N}$ let $f_k:[\frac{1}{k+1}, \frac{1}{k}] \to [0,1]$ be decreasing, linear functions such that $f_k(\frac{1}{k+1}) = 1$ and $f_k(\frac{1}{k}) = 0$, $k = 1, 2, \dots$. We define iterated function system (IFS) $S_n$…

Dynamical Systems · Mathematics 2024-04-19 Rafał Tryniecki

In studying the expressiveness of neural networks, an important question is whether there are functions which can only be approximated by sufficiently deep networks, assuming their size is bounded. However, for constant depths, existing…

Machine Learning · Computer Science 2020-12-29 Gal Vardi , Ohad Shamir

This paper presents a fast algorithm for projecting a given function to the set of shift orthogonal functions (i.e. set containing functions with unit $L^2$ norm that are orthogonal to their prescribed shifts). The algorithm can be…

Numerical Analysis · Mathematics 2014-02-24 Farzin Barekat , Rongjie Lai , Ke Yin , Stanley Osher , Russel Caflisch , Vidvuds Ozolins

In this article, the effective lengths of all $q^r$-divisible linear codes over $\mathbb{F}_q$ with a non-negative integer $r$ are determined. For that purpose, the $S_q(r)$-adic expansion of an integer $n$ is introduced. It is shown that…

Combinatorics · Mathematics 2020-01-31 Michael Kiermaier , Sascha Kurz

For a finite subset $I$ of positive integers, the descent polynomial $\mathcal{D}(I;n)$ counts the number of permutations in $S_n$ that have descent set $I$. We generalize descent polynomials by considering permutations with a specific…

Combinatorics · Mathematics 2025-11-11 Jeongwon Lee , Nathan Lesnevich , Martha Precup

General depth weighted scatter estimators are introduced and investigated. For general depth functions, we find out that these affine equivariant scatter estimators are Fisher consistent and unbiased for a wide range of multivariate…

Statistics Theory · Mathematics 2007-06-13 Yijun Zuo , Hengjian Cui

Frank-Wolfe algorithm (FW) and its variants have gained a surge of interests in machine learning community due to its projection-free property. Recently people have reduced the gradient evaluation complexity of FW algorithm to…

Machine Learning · Statistics 2018-05-22 Yan Li , Chao Qu , Huan Xu

Recent work on fractionally-supervised classification (FSC), an approach that allows classification to be carried out with a fractional amount of weight given to the unlabelled points, is further developed in two respects. The primary…

Methodology · Statistics 2017-09-26 Michael P. B. Gallaugher , Paul D. McNicholas

When two free factors A and B of a free group F_n are in "general position" we define the projection of B to the splitting complex (alternatively, the complex of free factors) of A. We show that the projections satisfy properties analogous…

Group Theory · Mathematics 2017-05-17 Mladen Bestvina , Mark Feighn

Given a finite directed graph with $n$ vertices, we define a metric $d_G$ on $\mathbb{F}_q^n$, where $\mathbb{F}_q$ is the finite field with $q$ elements. The weight of a word is defined as the number of vertices that can be reached by a…

Information Theory · Computer Science 2017-05-02 Tuvi Etzion , Marcelo Firer , Roberto Assis Machado

As a projection-free algorithm, Frank-Wolfe (FW) method, also known as conditional gradient, has recently received considerable attention in the machine learning community. In this dissertation, we study several topics on the FW variants…

Optimization and Control · Mathematics 2021-05-11 Mingrui Zhang

Motivated by the works of Shiromoto [3] and Shi et al. [4], we study the existence of MacWilliams type identities with respect to Lee and Euclidean weight enumerators for linear codes over $\mathbb{Z}_{\ell}.$ Necessary and sufficient…

Information Theory · Computer Science 2016-07-15 Yongsheng Tang , Shixin Zhu , Xiaoshan Kai

Let $\mathbb{F}_q$ be a finite field of characteristic not equal to $2$ or $3$. We compute the weight enumerators of some projective and affine Reed-Muller codes of order $3$ over $\mathbb{F}_q$. These weight enumerators answer enumerative…

Number Theory · Mathematics 2022-01-24 Nathan Kaplan

The weight space of the Ising perceptron in which a set of random patterns is stored is examined using the generating function of the partition function $\phi(n)=(1/N)\log [Z^n]$ as the dimension of the weight vector $N$ tends to infinity,…

Disordered Systems and Neural Networks · Physics 2015-05-14 Tomoyuki Obuchi , Yoshiyuki Kabashima

The purpose of this article is to prove a generalisation of the Besicovitch-Federer projection theorem about a characterisation of rectifiable and unrectifiable sets in terms of their projections. For an $m$-unrectifiable set…

Functional Analysis · Mathematics 2016-12-15 Jacek Gałęski

In this paper, influenced by the ideas from A. Mihail, The canonical projection between the shift space of an IIFS and its attractor as a fixed point, Fixed Point Theory Appl., 2015, Paper No. 75, 15 p., we associate to every generalized…

Classical Analysis and ODEs · Mathematics 2018-03-20 Radu Miculescu , Silviu Urziceanu

The approximation of a general $d$-variate function $f$ by the shifts $\phi(\cdot-\xi)$, $\xi\in\Xi\subset \Rd$, of a fixed function $\phi$ occurs in many applications such as data fitting, neural networks, and learning theory. When…

Classical Analysis and ODEs · Mathematics 2008-02-19 Ronald DeVore , Amos Ron

Let $n$ be a positive integer and $f$ a differentiable function from a convex subset $C$ of the Euclidean space $\mathbb{R}^n$ to a smooth manifold. We define an invariant of $f$ via counting certain threshold functions associated to $f$.…

Combinatorics · Mathematics 2018-06-19 Aslı Güçlükan İlhan , Özgün Ünlü

We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of…

Logic · Mathematics 2023-07-06 Christopher J. Eagle , Clovis Hamel , Sandra Müller , Franklin D. Tall

We support some evidence that a long additive MDS code over a finite field must be equivalent to a linear code. More precisely, let $C$ be an $\mathbb F_q$-linear $(n,q^{hk},n-k+1)_{q^h}$ MDS code over $\mathbb F_{q^h}$. If $k=3$, $h \in…

Information Theory · Computer Science 2026-01-28 Sam Adriaensen , Simeon Ball
‹ Prev 1 8 9 10 Next ›