English
Related papers

Related papers: KRW Composition Theorems via Lifting

200 papers

Relational machine learning programs like those developed in Inductive Logic Programming (ILP) offer several advantages: (1) The ability to model complex relationships amongst data instances; (2) The use of domain-specific relations during…

Machine Learning · Computer Science 2024-02-05 Ashwin Srinivasan , A Baskar , Tirtharaj Dash , Devanshu Shah

We give a new proof of the Kat\v{e}tov-Tong theorem. Our strategy is to first prove the theorem for compact Hausdorff spaces, and then extend it to all normal spaces. The key ingredient is how the ring of bounded continuous real-valued…

General Topology · Mathematics 2020-01-27 Guram Bezhanishvili , Patrick J. Morandi , Bruce Olberding

Inference problems with conjectured statistical-computational gaps are ubiquitous throughout modern statistics, computer science and statistical physics. While there has been success evidencing these gaps from the failure of restricted…

Computational Complexity · Computer Science 2020-06-30 Matthew Brennan , Guy Bresler

Understanding the relationship between the depth of a neural network and its representational capacity is a central problem in deep learning theory. In this work, we develop a geometric framework to analyze the expressivity of ReLU networks…

Machine Learning · Computer Science 2026-03-20 Juan L. Valerdi

We provide an upper bound on the number of neurons required in a shallow neural network to approximate a continuous function on a compact set with a given accuracy. This method, inspired by a specific proof of the Stone-Weierstrass theorem,…

Machine Learning · Statistics 2025-10-09 Frantisek Hakl , Vit Fojtik

We give improved separations for the query complexity analogue of the log-approximate-rank conjecture i.e. we show that there are a plethora of total Boolean functions on $n$ input bits, each of which has approximate Fourier sparsity at…

Computational Complexity · Computer Science 2020-09-08 Arkadev Chattopadhyay , Ankit Garg , Suhail Sherif

Folklore in complexity theory suspects that circuit lower bounds against $\mathbf{NC}^1$ or $\mathbf{P}/\operatorname{poly}$, currently out of reach, are a necessary step towards proving strong proof complexity lower bounds for systems like…

Computational Complexity · Computer Science 2024-05-06 Noel Arteche , Erfan Khaniki , Ján Pich , Rahul Santhanam

We consider the symmetric binary perceptron model, a simple model of neural networks that has gathered significant attention in the statistical physics, information theory and probability theory communities, with recent connections made to…

Probability · Mathematics 2021-11-16 Emmanuel Abbe , Shuangping Li , Allan Sly

Recently Conrey, Farmer and Zirnbauer conjectured formulas for the averages over a family of ratios of products of shifted L-functions. Their L-functions Ratios Conjecture predicts both the main and lower order terms for many problems,…

Number Theory · Mathematics 2010-09-15 Steven J. Miller

Raz's recent result \cite{Raz2010} has rekindled people's interest in the study of \emph{tensor rank}, the generalization of matrix rank to high dimensions, by showing its connections to arithmetic formulas. In this paper, we follow Raz's…

Computational Complexity · Computer Science 2011-11-22 Yang D. Li

We report on a verification of the Fundamental Theorem of Algebra in ACL2(r). The proof consists of four parts. First, continuity for both complex-valued and real-valued functions of complex numbers is defined, and it is shown that…

Logic in Computer Science · Computer Science 2018-10-11 Ruben Gamboa , John Cowles

We generalize the feasible interpolation theorem for semantic derivations from K.(1997) by allowing randomized protocols (protocols in the sense of K.(1997). We also introduce an extension of the monotone circuit model, monotone circuits…

Logic · Mathematics 2018-11-26 Jan Krajicek

Blundell, Buesing, Davies, Veli\v{c}kovi\'c, and Williamson (BBDVW) introduced the notion of a hypercube decomposition of an interval in Bruhat order. They conjectured a recursive formula in terms of this structure which, if shown for all…

Combinatorics · Mathematics 2026-02-23 Grant T. Barkley , Christian Gaetz

In this note, given a pair $(\mathfrak{g}, \lambda)$, where $\mathfrak{g}$ is a complex semisimple Lie algebra and $\lambda \in \mathfrak{h}^*$ is a dominant integral weight of $\mathfrak{g}$, where $\mathfrak{h} \subset \mathfrak{g}$ is…

Representation Theory · Mathematics 2019-04-16 Joseph Malkoun

We examine the minimal constraints imposed by the Weak Gravity Conjecture (WGC) on the particle spectrum of a quantum gravity theory. Towers of super-extremal states have previously been argued to be required for consistency of the WGC…

High Energy Physics - Theory · Physics 2024-05-20 Cesar Fierro Cota , Alessandro Mininno , Timo Weigand , Max Wiesner

The Sensitivity Conjecture and the Log-rank Conjecture are among the most important and challenging problems in concrete complexity. Incidentally, the Sensitivity Conjecture is known to hold for monotone functions, and so is the Log-rank…

Computational Complexity · Computer Science 2016-04-08 Chengyu Lin , Shengyu Zhang

A Morita context is constructed for any comodule of a coring and, more generally, for an $L$-$\cC$ bicomodule $\Sigma$ for a pure coring extension $(\cD:L)$ of $(\cC:A)$. It is related to a 2-object subcategory of the category of $k$-linear…

Rings and Algebras · Mathematics 2008-11-03 Gabriella Böhm , Joost Vercruysse

A well-known conjecture of Gross and Zagier states that the values of the higher automorphic Green's function at pairs of points with complex multiplication in the upper half-plane are proportional to the logarithm of an algebraic number.…

Number Theory · Mathematics 2025-08-19 Francis Brown , Tiago J. Fonseca

The Charge Convexity Conjecture (CCC) states that in a unitary conformal field theory in $d\geq 3$ dimensions with a global symmetry, the minimal dimension of operators in certain representations of the symmetry, as a function of the charge…

High Energy Physics - Theory · Physics 2023-08-15 Ofer Aharony , Yacov-Nir Breitstein

Strassen's asymptotic rank conjecture [Progr. Math. 120 (1994)] claims a strong submultiplicative upper bound on the rank of a three-tensor obtained as an iterated Kronecker product of a constant-size base tensor. The conjecture, if true,…

Data Structures and Algorithms · Computer Science 2023-10-19 Andreas Björklund , Petteri Kaski