相关论文: Consistency Relations for an Implicit n-dimensiona…
Many applications in science and engineering require the solution of large linear discrete ill-posed problems that are obtained by the discretization of a Fredholm integral equation of the first kind in several space-dimensions. The matrix…
Recently there has been a surge of interest in understanding implicit regularization properties of iterative gradient-based optimization algorithms. In this paper, we study the statistical guarantees on the excess risk achieved by…
In this article we investigate the connection between regularization theory for inverse problems and dynamic programming theory. This is done by developing two new regularization methods, based on dynamic programming techniques. The aim of…
We consider semidiscrete finite differences schemes for the periodic Scr\"odinger equation in dimension one. We analyze whether the space-time integrability properties observed by Bourgain in the continuous case are satisfied at the…
The shapelet transform is a form of feature extraction for time series, in which a time series is described by its similarity to each of a collection of `shapelets'. However it has previously suffered from a number of limitations, such as…
This paper addresses the problem of matching $N$ weighted graphs referring to an identical object or category. More specifically, matching the common node correspondences among graphs. This multi-graph matching problem involves two…
We outline, test, and apply a new scheme for nonpertubative analyses of quantized field systems in contact with dynamical gravity. While gravity is treated classically in the present paper, the approach lends itself for a generalization to…
Uniformly regular equilibrium problems are natural generalizations of abstract equilibrium prob lems and they are defined over the uniformly prox-regular nonconvex sets. Some new efficient implicit methods for solving uniformly regular…
The vast majority of Dimensionality Reduction (DR) techniques rely on second-order statistics to define their optimization objective. Even though this provides adequate results in most cases, it comes with several shortcomings. The methods…
Neural Networks have been widely used to solve Partial Differential Equations. These methods require to approximate definite integrals using quadrature rules. Here, we illustrate via 1D numerical examples the quadrature problems that may…
Several convergence results in Hilbert scales under different source conditions are proved and orders of convergence and optimal orders of convergence are derived. Also, relations between those source conditions are proved. The concept of a…
We introduce low regularity exponential-type integrators for nonlinear Schr\"odinger equations for which first-order convergence only requires the boundedness of one additional derivative of the solution. More precisely, we will prove…
Iterative regularization exploits the implicit bias of an optimization algorithm to regularize ill-posed problems. Constructing algorithms with such built-in regularization mechanisms is a classic challenge in inverse problems but also in…
Interpolation models are critical for a wide range of applications, from numerical optimization to artificial intelligence. The reliability of the provided interpolated value is of utmost importance, and it is crucial to avoid the…
We considered the most general form of non-static cylindrically symmetric space-times for studying proper curvature symmetry by using the rank of the 6X6 Riemann matrix and direct integration techniques. Studying proper curvature symmetry…
We find the inconsistency of dimensional reduction and naive dimensional regularization in their applications to Chern-Simons type gauge theories. Further we adopt a consistent dimensional regularization to investigate the quantum…
The task of establishing correspondences between two 3D shapes is a long-standing challenge in computer vision. While numerous studies address full-full and partial-full 3D shape matching, only a limited number of works have explored the…
The sample covariance matrix becomes non-invertible in high-dimensional settings, making classical multivariate statistical methods inapplicable. Various regularization techniques address this issue by imposing a structured target matrix to…
We propose and analyze a regularization approach for structured prediction problems. We characterize a large class of loss functions that allows to naturally embed structured outputs in a linear space. We exploit this fact to design…
Parameter identification problems typically consist of a model equation, e.g. a (system of) ordinary or partial differential equation(s), and the observation equation. In the conventional reduced setting, the model equation is eliminated…