Related papers: Adaptive aggregation on graphs
We propose an a posteriori error estimator for high-order $p$- or $hp$-finite element discretizations of selfadjoint linear elliptic eigenvalue problems that is appropriate for estimating the error in the approximation of an eigenvalue…
In this chapter, we identify fundamental geometric structures that underlie the problems of sampling, optimisation, inference and adaptive decision-making. Based on this identification, we derive algorithms that exploit these geometric…
We rewrite the standard nodal virtual element method as a generalised gradient method. This re-formulation allows for computing a reliable and efficient error estimator by locally reconstructing broken fluxes and potentials on elemental…
In this paper, we give a new type of a posteriori error estimators suitable for moving finite element methods under anisotropic meshes for general second-order elliptic problems. The computation of estimators is simple once corresponding…
We derive a residual a posteriori estimator for the Kirchhoff plate bending problem. We consider the problem with a combination of clamped, simply supported and free boundary conditions subject to both distributed and concentrated (point…
A posteriori error estimator is derived for an elliptic interface problem in the fictitious domain formulation with distributed Lagrange multiplier considering a discontinuous Lagrange multiplier finite element space. A posteriori error…
Graph neural networks (GNNs) have been extensively studied for prediction tasks on graphs. As pointed out by recent studies, most GNNs assume local homophily, i.e., strong similarities in local neighborhoods. This assumption however limits…
In this paper, we study an additive model where the response variable is Hilbert-space-valued and predictors are multivariate Euclidean, and both are possibly imperfectly observed. Considering Hilbert-space-valued responses allows to cover…
Adaptive estimation of linear functionals over a collection of parameter spaces is considered. A between-class modulus of continuity, a geometric quantity, is shown to be instrumental in characterizing the degree of adaptability over two…
In this paper, we construct an adaptive multiscale method for solving H(curl)-elliptic problems in highly heterogeneous media. Our method is based on the generalized multiscale finite element method. We will first construct a suitable…
Models trained on semantically related datasets and tasks exhibit comparable inter-sample relations within their latent spaces. We investigate in this study the aggregation of such latent spaces to create a unified space encompassing the…
This paper considers the task of learning how to make a prognosis of a patient based on his/her micro-array expression levels. The method is an application of the aggregation method as recently proposed in the literature on theoretical…
We consider Poisson's equation with a finite number of weighted Dirac masses as a source term, together with its discretization by means of conforming finite elements. For the error in fractional Sobolev spaces, we propose residual-type a…
This paper investigates the nonparametric estimation of a circular regression function in an errors-in-variables framework. Two settings are studied, depending on whether the covariates are circular or linear. Adaptive estimators are…
Graphs are fundamental mathematical structures used in various fields to represent data, signals and processes. In this paper, we propose a novel framework for learning/estimating graphs from data. The proposed framework includes (i)…
An explicit and computable error estimator for the $hp$ version of the virtual element method (VEM), together with lower and upper bounds with respect to the exact energy error, is presented. Such error estimator is employed to provide $hp$…
This work develops polynomial-degree-robust (p-robust) equilibrated a posteriori error estimates for $H(\rm curl)$, $H(\rm div)$ and $H(\rm divdiv)$ problems, based on $H^1$ auxiliary space decomposition. The proposed framework employs…
Various Graph Neural Networks (GNNs) have been successful in analyzing data in non-Euclidean spaces, however, they have limitations such as oversmoothing, i.e., information becomes excessively averaged as the number of hidden layers…
In this article we develop function-based a posteriori error estimators for the solution of linear second order elliptic problems considering hierarchical spline spaces for the Galerkin discretization. We prove a global upper bound for the…
This paper presents a new method for spatially adaptive local (constant) likelihood estimation which applies to a broad class of nonparametric models, including the Gaussian, Poisson and binary response models. The main idea of the method…