Search Results - "Approximation complexity"

Error bounds for approximations with deep ReLU networks by Yarotsky, Dmitry

“…We study expressive power of shallow and deep neural networks with piece-wise linear activation functions. We establish new rigorous upper and lower bounds for…”
Get full text

On the complexity of temporal arborescence reconfiguration by Dondi, Riccardo, Lafond, Manuel

“…In this contribution we study the Arborescence Reconfiguration on temporal digraphs (Temporal Arborescence Reconfiguration). The problem, given two temporal…”
Get full text

On the capacity of deep generative networks for approximating distributions by Yang, Yunfei, Li, Zhen, Wang, Yang

“…We study the efficacy and efficiency of deep generative networks for approximating probability distributions. We prove that neural networks can transform a…”
Get full text

Simultaneous approximation of a smooth function and its derivatives by deep neural networks with piecewise-polynomial activations by Belomestny, Denis, Naumov, Alexey, Puchkin, Nikita, Samsonov, Sergey

“…This paper investigates the approximation properties of deep neural networks with piecewise-polynomial activation functions. We derive the required depth,…”
Get full text

Relaxed TS Fuzzy Model Transformation to Improve the Approximation Accuracy/Complexity Tradeoff and Relax the Computation Complexity by Baranyi, Peter

“…The primary goal of the article is to introduce the relaxed TS fuzzy model transformation, a method that enhances the original TS fuzzy model transformation in…”
Get full text

Approximation in shift-invariant spaces with deep ReLU neural networks by Yang, Yunfei, Li, Zhen, Wang, Yang

“…We study the expressive power of deep ReLU neural networks for approximating functions in dilated shift-invariant spaces, which are widely used in signal…”
Get full text

Theoretical Exploration of Flexible Transmitter Model by Wu, Jin-Hui, Zhang, Shao-Qun, Jiang, Yuan, Zhou, Zhi-Hua

“…Neural network models generally involve two important components, i.e., network architecture and neuron model. Although there are abundant studies about…”
Get full text

Farkas Bounds on Horn Constraint Systems by Subramani, K., Wojciechowski, Piotr, Velasquez, Alvaro

“…In this paper, we analyze the copy complexity of unsatisfiable Horn constraint systems, under the ADD refutation system. Recall that a linear constraint of the…”
Get full text

On Approximation Complexity in Average Case Setting for Tensor Degrees of Random Processes by Pyatkin, K. A., Khartov, A. A.

“…We consider a random field with a zero mean and a continuous covariance function that is a d -tensor degree of a second-order random process. The average case…”
Get full text

Colorful path detection in vertex-colored temporal by Dondi, Riccardo, Hosseinzadeh, Mohammad Mehdi

“…Finding paths is a fundamental problem in graph theory and algorithm design due to its many applications. Recently, this problem has been considered on…”
Get full text

On the uniform approximation estimation of deep ReLU networks via frequency decomposition by Chen, Liang, Liu, Wenjun

“…A recent line of works established the approximation complexity estimation of deep ReLU networks for the bandlimited functions in the MSE (mean square error)…”
Get full text

An Estimate of Average Case Approximation Complexity for Tensor Degrees of Random Processes by Kravchenko, A. A., Khartov, A. A.

“…We consider random fields that are tensor degrees of a random process of second order with a continuous covariance function. The average case approximation…”
Get full text

A simplified criterion for quasi-polynomial tractability of approximation of random elements and its applications by Khartov, A.A.

“…We study approximation properties of sequences of centered random elements Xd, d∈N, with values in separable Hilbert spaces. We focus on sequences of tensor…”
Get full text

The l-Diversity problem: Tractability and approximability by Dondi, Riccardo, Mauri, Giancarlo, Zoppis, Italo

“…Publishing personal data without giving up privacy is becoming an increasingly important problem in different fields. In the last years, different interesting…”
Get full text

Approximation of additive random fields based on standard information: Average case and probabilistic settings by Lifshits, Mikhail, Zani, Marguerite

“…We consider approximation problems for tensor product and additive random fields based on standard information in the average case setting. We also study the…”
Get full text

Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements by Khartov, A.A.

“…We study approximation properties of sequences of centered random elements Xd, d∈N, with values in separable Hilbert spaces. We focus on sequences of tensor…”
Get full text

Decomposition of Additive Random Fields by Zani, M., Khartov, A. A.

“…We consider in this work an additive random field on [0, 1] d , which is a sum of d uncorrelated random processes. We assume that the processes have zero mean…”
Get full text

Correcting gene tree by removal and modification: Tractability and approximability by Beretta, Stefano, Castelli, Mauro, Dondi, Riccardo

“…Gene tree correction with respect to a given species tree is a problem that has been recently proposed in order to better understand the evolution of gene…”
Get full text

New results for the Longest Haplotype Reconstruction problem by Dondi, Riccardo

“…The haplotyping problem has emerged in recent years as one of the most relevant problems in Computational Biology. In particular, in the Single Individual…”
Get full text

On complexity of the bilevel location and pricing problems by Panin, A. A., Plyasunov, A. V.

“…We consider the bilevel mixed integer location and pricing problems. Each problem is determined by the optimization problems of the upper and lower levels of…”
Get full text