Results 71 to 80 of about 1,343 (179)
Empirical‐Process Limit Theory and Filter Approximation Bounds for Score‐Driven Time Series Models
ABSTRACT This article examines the filtering and approximation‐theoretic properties of score‐driven time series models. Under specific Lipschitz‐type and tail conditions, new results are derived, leading to maximal and deviation inequalities for the filtering approximation error using empirical process theory.
Enzo D'Innocenzo
wiley +1 more source
A Categorification of One-Variable Polynomials [PDF]
We develop a diagrammatic categorification of the polynomial ring $\mathbb{Z} [x]$, based on a geometrically-defined graded algebra and show how to lift various operations on polynomials to the categorified setting.
Mikhail Khovanov, Radmila Sazdanovic
doaj +1 more source
q-Bernstein polynomials and their iterates
\(q\)-Bernstein polynomials have been introduced by \textit{G. M. Phillips} [in Numerical Analysis: A. R. Mitchell 75th Birthday Volume, World Scientific, Singapore, 263--269 (1996)]. For \(q=1\) they reduce to the classical Bernstein polynomials. When \(q\) is in \((0,1)\), the corresponding linear operators are positive; several papers deal with this
openaire +2 more sources
Bayesian Inference for Multivariate Monotone Densities
ABSTRACT We consider a nonparametric Bayesian approach to estimation and testing for a multivariate monotone density. Instead of following the conventional Bayesian approach of imposing a prior that satisfies the monotonicity restriction, we place a prior on the step heights via binning and a Dirichlet distribution. The resulting posterior distribution
Kang Wang, Subhashis Ghosal
wiley +1 more source
ABSTRACT Aims Negative symptoms are a core component of schizophrenia, affecting up to 60% of individuals with the disorder. They are categorised into primary negative symptoms (PNS), which are intrinsic to the illness, and secondary negative symptoms, which arise from external factors such as depression or medication side effects.
Dulari Hakamuwa Lekamlage +31 more
wiley +1 more source
Bernstein polynomials and learning theory
Let \(f(x)= -x\log x- (I- x)\log(1 - x)\) for \(0\leq x\leq 1\); it is referred to as the entropy function. Let \(B_n[f]\) denote the nth Bernstein polynomial of \(f\). One half of the paper establishes the estimates \[ f(x)- B_n[f](x)\geq {1\over 2n}+ {1\over 20n^2 x(1-x)}- {1\over 12n^2}\text{ for }{15\over n}\leq x\leq 1-{15\over n}, \] \[ \lim_{n ...
Dietrich Braess, Tomas Sauer
openaire +2 more sources
Gram Decay and Intrinsic Dimensions of Krylov Subspaces
ABSTRACT Krylov subspace methods solve large sparse linear systems Ax=b$$ Ax=b $$ by building a sequence of polynomial approximations to A−1b$$ {A}^{-1}b $$ from successive matrix‐vector products. In finite precision, the number of numerically independent directions that can be extracted from this sequence is bounded by the intrinsic information ...
Stephen J. Thomas
wiley +1 more source
Area of Bernstein-Type Polynomials [PDF]
Bernstein polynomials in one variable are known to be total-variation diminishing when compared to the approximated function f . Here we consider the two variable case and give a counterexample to show they are not area-diminishing.
openaire +1 more source
Neural Network Repair With Shapley‐Guided Search
ABSTRACT The deployment of deep neural networks (DNNs) in safety‐critical domains is critically hampered by their vulnerability to defects, which can arise from malicious attacks or low‐quality data. Therefore, precisely locating the network components responsible for these defects, and subsequently repairing them without compromising overall model ...
Xiaofu Du +4 more
wiley +1 more source
On Stability of Parametrized Families of Polynomials and Matrices
The Schur and Hurwitz stability problems for a parametric polynomial family as well as the Schur stability problem for a compact set of real matrix family are considered.
Handan Akyar +2 more
doaj +1 more source

