Results 11 to 20 of about 5,801,457 (341)

Data‐driven performance metrics for neural network learning

open access: yesInternational Journal of Adaptive Control and Signal Processing, EarlyView., 2023
Summary Effectiveness of data‐driven neural learning in terms of both local mimima trapping and convergence rate is addressed. Such issues are investigated in a case study involving the training of one‐hidden‐layer feedforward neural networks with the extended Kalman filter, which reduces the search for the optimal network parameters to a state ...
Angelo Alessandri   +2 more
wiley   +1 more source

Asymptotic behavior of the rate of adaptation [PDF]

open access: yesThe Annals of Applied Probability, 2010
Published in at http://dx.doi.org/10.1214/09-AAP645 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)
Yu, F, Etheridge, A, Cuthbertson, C
openaire   +5 more sources

Asymptotic behavior of massless fields and the memory effect [PDF]

open access: yesPhysical Review D, 2019
We investigate the behavior of massless scalar, electromagnetic, and linearized gravitational perturbations near null infinity in d \geq 4 dimensional Minkowski spacetime (of both even and odd dimension) under the assumption that these fields admit a ...
Gautam Satishchandran, R. Wald
semanticscholar   +1 more source

Asymptotic Behavior of the Kleinberg Model [PDF]

open access: yesPhysical Review Letters, 2009
We study Kleinberg navigation (the search of a target in a d-dimensional lattice, where each site is connected to one other random site at distance r, with probability proportional to r^{-a}) by means of an exact master equation for the process. We show that the asymptotic scaling behavior for the delivery time T to a target at distance L scales as (ln
Stephen Carter   +4 more
openaire   +4 more sources

New results for the non-oscillatory asymptotic behavior of high order differential equations of Poincaré type

open access: yesAIMS Mathematics, 2022
This paper discusses the study of asymptotic behavior of non-oscillatory solutions for high order differential equations of Poincaré type. We present two new and weaker hypotheses on the coefficients, which implies a well posedness result and a ...
Aníbal Coronel , Fernando Huancas
doaj   +1 more source

Averages of unlabeled networks: Geometric characterization and asymptotic behavior [PDF]

open access: yesAnnals of Statistics, 2017
It is becoming increasingly common to see large collections of network data objects -- that is, data sets in which a network is viewed as a fundamental unit of observation.
E. Kolaczyk   +4 more
semanticscholar   +1 more source

Asymptotic Behavior of Beta-Integers [PDF]

open access: yesLetters in Mathematical Physics, 2008
Beta-integers (``$ $-integers'') are those numbers which are the counterparts of integers when real numbers are expressed in irrational basis $ > 1$. In quasicrystalline studies $ $-integers supersede the ``crystallographic'' ordinary integers. When the number $ $ is a Parry number, the corresponding $ $-integers realize only a finite number of
Edita Pelantová   +3 more
openaire   +3 more sources

First-order impulsive differential systems: sufficient and necessary conditions for oscillatory or asymptotic behavior

open access: yesAdvances in Difference Equations, 2021
In this paper, we study the oscillatory and asymptotic behavior of a class of first-order neutral delay impulsive differential systems and establish some new sufficient conditions for oscillation and sufficient and necessary conditions for the asymptotic
Shyam Sundar Santra   +3 more
doaj   +1 more source

Asymptotic behavior for a class of population dynamics

open access: yes, 2020
This paper investigates the asymptotic behavior for a class of n-dimensional population dynamics systems described by delay differential equations. With the help of technique of differential inequality, we show that each solution of the addressed systems
Chuangxia Huang   +2 more
semanticscholar   +1 more source

The Asymptotic Behavior of Grassmannian Codes [PDF]

open access: yesIEEE Transactions on Information Theory, 2012
The iterated Johnson bound is the best known upper bound on a size of an error-correcting code in the Grassmannian $\mathcal{G}_q(n,k)$. The iterated Sch nheim bound is the best known lower bound on the size of a covering code in $\mathcal{G}_q(n,k)$. We use probabilistic methods to prove that both bounds are asymptotically attained for fixed $k$ and ...
Simon R. Blackburn, Tuvi Etzion
openaire   +3 more sources

Home - About - Disclaimer - Privacy