相关论文: Adaptive guaranteed lower eigenvalue bounds with o…

Preconditioned eigenvalue solvers (eigensolvers) are gaining popularity, but their convergence theory remains sparse and complex. We consider the simplest preconditioned eigensolver--the gradient iterative method with a fixed step size--for…

This paper investigates the problem of certifying optimality for sparse generalized linear models (GLMs), where sparsity is enforced through an $\ell_0$ cardinality constraint. While branch-and-bound (BnB) frameworks can certify optimality…

In this paper, we present several new a posteriori error estimators and two adaptive mixed finite element methods \textsf{AMFEM1} and \textsf{AMFEM2} for the Hodge Laplacian problem in finite element exterior calculus. We prove that…

We consider distributed estimation of the inverse covariance matrix, also called the concentration or precision matrix, in Gaussian graphical models. Traditional centralized estimation often requires global inference of the covariance…

This work deals with the isogeometric Galerkin discretization of the eigenvalue problem related to the Laplace operator subject to homogeneous Dirichlet boundary conditions on bounded intervals. This paper uses GLT theory to study the…

We propose a goal-oriented mesh-adaptive algorithm for a finite element method stabilized via residual minimization on dual discontinuous-Galerkin norms. By solving a saddle-point problem, this residual minimization delivers a stable…

A type of adaptive finite element method for the eigenvalue problems is proposed based on the multilevel correction scheme. In this method, adaptive finite element method to solve eigenvalue problems involves solving associated boundary…

We consider adaptive finite element methods for second-order elliptic PDEs, where the arising discrete systems are not solved exactly. For contractive iterative solvers, we formulate an adaptive algorithm which monitors and steers the…

We study fast algorithms for statistical regression problems under the strong contamination model, where the goal is to approximately optimize a generalized linear model (GLM) given adversarially corrupted samples. Prior works in this line…

We give curvature-dependant convergence rates for the optimization of weakly convex functions defined on a manifold of 1-bounded geometry via Riemannian gradient descent and via the dynamic trivialization algorithm. In order to do this, we…

Linear TD($\lambda$) is one of the most fundamental reinforcement learning algorithms for policy evaluation. Previously, convergence rates are typically established under the assumption of linearly independent features, which does not hold…

We study the performances of an adaptive procedure based on a convex combination, with data-driven weights, of term-by-term thresholded wavelet estimators. For the bounded regression model, with random uniform design, and the nonparametric…

Many popular eigensolvers for large and sparse Hermitian matrices or matrix pairs can be interpreted as accelerated block preconditioned gradient (BPG) iterations in order to analyze their convergence behavior by composing known estimates.…

We derive a priori and a posteriori error estimates for the discontinuous Galerkin (dG) approximation of the time-harmonic Maxwell's equations. Specifically, we consider an interior penalty dG method, and establish error estimates that are…

We propose an efficient $\epsilon$-differentially private algorithm, that given a simple {\em weighted} $n$-vertex, $m$-edge graph $G$ with a \emph{maximum unweighted} degree $\Delta(G) \leq n-1$, outputs a synthetic graph which…

Due to the highly non-convex nature of large-scale robust parameter estimation, avoiding poor local minima is challenging in real-world applications where input data is contaminated by a large or unknown fraction of outliers. In this paper,…

We propose a new method, the continuous Galerkin method with globally and locally supported basis functions (CG-GL), to address the parametric robustness issues of reduced-order models (ROMs) by incorporating solution-based adaptivity with…

Anisotropic mesh adaptation is studied for the linear finite element solution of eigenvalue problems with anisotropic diffusion operators. The M-uniform mesh approach is employed with which any nonuniform mesh is characterized…

Regularized MDPs serve as a smooth version of original MDPs. However, biased optimal policy always exists for regularized MDPs. Instead of making the coefficient{\lambda}of regularized term sufficiently small, we propose an adaptive…

In this paper we investigate adaptive discretization of the iteratively regularized Gauss- Newton method IRGNM. All-at-once formulations considering the PDE and the measurement equation simultaneously allow to avoid (approximate) solution…