Results 21 to 30 of about 1,569,596 (297)
Incompressible laminar temperature boundary layer on a body of revolution: The adiabatic case [PDF]
In the paper the universal governing equations of incompressible laminar temperature boundary layer on the sphere are obtained using the improved method of general similarity for the case of adiabatic boundary conditions.
Mirić-Milosavljević Mira +1 more
doaj +1 more source
The universe of propositional approximations
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marcelo Finger, Renata Wassermann
openaire +1 more source
Minimum Width for Universal Approximation
The universal approximation property of width-bounded networks has been studied as a dual of classical universal approximation results on depth-bounded networks. However, the critical width enabling the universal approximation has not been exactly characterized in terms of the input dimension $d_x$ and the output dimension $d_y$.
Sejun Park +3 more
openaire +4 more sources
Estimates of the Approximation Error Using Rademacher Complexity: Learning Vector-Valued Functions [PDF]
For certain families of multivariable vector-valued functions to be approximated, the accuracy of approximation schemes made up of linear combinations of computational units containing adjustable parameters is investigated.
Gnecco Giorgio +7 more
core +1 more source
Operators Obtained by Using Certain Generating Function for Approximation
This paper is concerned with the sequence of positive linear operators obtained by certain generating functions of polynomials and with investigation of its approximation properties in detail.
Serhan Varma, Sezgin Sucu
doaj +1 more source
A Comparison between Fixed-Basis and Variable-Basis Schemes for Function Approximation and Functional Optimization [PDF]
Fixed-basis and variable-basis approximation schemes are compared for the problems of function approximation and functional optimization (also known as infinite programming).
Gnecco, Giorgio +3 more
core +1 more source
On the universality of the quantum approximate optimization algorithm [PDF]
AbstractThe quantum approximate optimization algorithm (QAOA) is considered to be one of the most promising approaches towards using near-term quantum computers for practical application. In its original form, the algorithm applies two different Hamiltonians, called the mixer and the cost Hamiltonian, in alternation with the goal being to approach the ...
Mauro E. S. Morales +2 more
openaire +5 more sources
Variational inequations and approximation [PDF]
The existence and uniqueness of the solution of a variational inequality is considered, and methods of approximation of the solution are given.
Noor, MA
core +6 more sources
The Universal Approximation Property
The universal approximation property of various machine learning models is currently only understood on a case-by-case basis, limiting the rapid development of new theoretically justified neural network architectures and blurring our understanding of our current models’ potential.
openaire +4 more sources
An Approximate Quadratic Programming for Efficient Bellman Equation Solution
This paper proposes an efficient algorithm which relies on quadratic programming for approximately solving the Bellman equation in reinforcement learning problem and guarantees to return optimal decision parameters.
Jianmei Su +4 more
doaj +1 more source

