Related papers: The Partial Averaging method
We use the abstract method of (local) martingale problems in order to give criteria for convergence of stochastic processes. Extending previous notions, the formulation we use is neither restricted to Markov processes (or semimartingales),…
We compute averages of products and ratios of characteristic polynomials associated with Orthogonal, Unitary, and Symplectic Ensembles of Random Matrix Theory. The pfaffian/determinantal formulas for these averages are obtained, and the…
The randomized Kaczmarz (RK) method is an iterative method for approximating the least-squares solution of large linear systems of equations. The standard RK method uses sequential updates, making parallel computation difficult. Here, we…
In this paper, we propose a model averaging approach for addressing model uncertainty in the context of partial linear functional additive models. These models are designed to describe the relation between a response and mixed-types of…
The theory of quasi-arithmetic means is a powerful tool in the study of covariance functions across space-time. In the present study we use quasi-arithmetic functionals to make inferences about the permissibility of averages of functions…
We propose generalized additive partial linear models for complex data which allow one to capture nonlinear patterns of some covariates, in the presence of linear components. The proposed method improves estimation efficiency and increases…
Fractional calculus has been used to describe physical systems with complexity. Here, we show that a fractional calculus approach can restore or include complexity in any physical systems that can be described by partial differential…
This paper is devoted to studying the global and finite convergence of the semi-smooth Newton method for solving a piecewise linear system that arises in cone-constrained quadratic programming problems and absolute value equations. We first…
Variational-hemivariational inequalities are an important mathematical framework for nonsmooth problems. The framework can be used to study application problems from physical sciences and engineering that involve non-smooth and even…
Methods were initiated by Mark Kac and Richard Feynman to evaluate random functionals of the form $\int^t_0V(X_s)ds$ for a nonnegative $V$ and a Markov process $X_t$. Their results evolved into the well known Feynman Kac formula.…
The article is devoted to the expansions of iterated Ito stochastic integrals based on generalized multiple Fourier series converging in the sense of norm in the space $L_2([t, T]^k),$ $k\in\mathbb{N}.$ The method of generalized multiple…
We consider various iterative algorithms for solving the linear equation $ax=b$ using a quantum computer operating on the principle of quantum annealing. Assuming that the computer's output is described by the Boltzmann distribution, it is…
This paper studies the rate of convergence for conditional quasi-Monte Carlo (QMC), which is a counterpart of conditional Monte Carlo. We focus on discontinuous integrands defined on the whole of $R^d$, which can be unbounded. Under…
A diagrammatic method is presented for averaging over the circular ensemble of random-matrix theory. The method is applied to phase-coherent conduction through a chaotic cavity (a ``quantum dot'') and through the interface between a normal…
A stochastic algorithm is proposed, finding the set of generalized means associated to a probability measure on a compact Riemannian manifold M and a continuous cost function on the product of M by itself. Generalized means include p-means…
We prove the quasi-optimal convergence of a standard adaptive finite element method (AFEM) for nonlinear elliptic second-order equations of monotone type. The adaptive algorithm is based on residual-type a posteriori error estimators and…
In this paper, we introduce the fractional Fourier series on the fractional torus and study some basic facts of fractional Fourier series, such as fractional convolution and fractional approximation. Meanwhile, fractional Fourier inversion…
This paper uses a minimum divergence framework to introduce a new way of calculating model weights that can be used to average probabilistic predictions from statistical and machine learning models. The method is general and can be applied…
We introduce a mini-batch stochastic variance-reduced algorithm to solve finite-sum scale invariant problems which cover several examples in machine learning and statistics such as principal component analysis (PCA) and estimation of…
This article is intended to provide a pedagogical introduction to the supersymmetry method for performing ensemble-averaging in Gaussian random-matrix theory. The method is illustrated by a detailed calculation of the simplest non-trivial…