Related papers: Neural empirical interpolation method for nonlinea…

Training implicit neural representations (INRs) to capture fine-scale details typically relies on iterative backpropagation and is often hindered by spectral bias when the target exhibits highly non-uniform frequency content. We propose…

It has been observed that deep neural networks (DNNs) often use both genuine as well as spurious features. In this work, we propose "Amending Inherent Interpretability via Self-Supervised Masking" (AIM), a simple yet interestingly effective…

The recently developed generalized Fourier-Galerkin method is complemented by a numerical continuation with respect to the kinetic energy, which extends the framework to the investigation of modal interactions resulting in folds of the…

We develop and analyze a posteriori error estimators for a proper orthogonal decomposition-discrete empirical interpolation method (Pod-Deim) reduced order model applied to a parametric Poisson equation posed on a parameter-dependent domain…

Influence maximization (IM) is the problem of finding a seed vertex set which is expected to incur the maximum influence spread on a graph. It has various applications in practice such as devising an effective and efficient approach to…

Online optimisation studies the convergence of optimisation methods as the data embedded in the problem changes. Based on this idea, we propose a primal dual online method for nonlinear time-discrete inverse problems. We analyse the method…

We present a reduced-order model (ROM) methodology for inverse scattering problems in which the reduced-order models are data-driven, i.e. they are constructed directly from data gathered by sensors. Moreover, the entries of the ROM contain…

The numerical simulation and optimization of technical systems described by partial differential equations is expensive, especially in multi-query scenarios in which the underlying equations have to be solved for different parameters. A…

This paper introduces a framework for capturing stochasticity of choice probabilities in neural networks, derived from and fully consistent with the Random Utility Maximization (RUM) theory, referred to as RUM-NN. Neural network models show…

Real-time solutions to the influence blocking maximization (IBM) problems are crucial for promptly containing the spread of misinformation. However, achieving this goal is non-trivial, mainly because assessing the blocked influence of an…

A nonlinear-manifold reduced order model (NM-ROM) is a great way of incorporating underlying physics principles into a neural network-based data-driven approach. We combine NM-ROMs with domain decomposition (DD) for efficient computation.…

A non-intrusive reduced order model based on convolutional autoencoders (NIROM-CAEs) is proposed as a data-driven tool to build an efficient nonlinear reduced-order model for stochastic spatio-temporal large-scale physical problems. The…

Interpolation methods for nonlinear finite element discretizations are commonly used to eliminate the computational costs associated with the repeated assembly of the nonlinear systems. While the group finite element formulation…

Sparse Discrete Empirical Interpolation Method (S-DEIM) was recently proposed for state estimation in dynamical systems when only a sparse subset of the state variables can be observed. The S-DEIM estimate involves a kernel vector whose…

Clinical oriented applications of computational electrocardiology require efficient and reliable identification of patient-specific parameters of mathematical models based on available measures. In particular, the estimation of cardiac…

Modelling of physical systems may be a challenging task when it requires solving large sets of numerical equations. This is the case of photovoltaic (PV) systems which contain many PV modules, each module containing several silicon cells.…

Influence Maximization (IM) is a crucial problem in data science. The goal is to find a fixed-size set of highly-influential seed vertices on a network to maximize the influence spread along the edges. While IM is NP-hard on commonly-used…

We introduce a parameterization method called Neural Bayes which allows computing statistical quantities that are in general difficult to compute and opens avenues for formulating new objectives for unsupervised representation learning.…

In analyzing and assessing the condition of dynamical systems, it is necessary to account for nonlinearity. Recent advances in computation have rendered previously computationally infeasible analyses readily executable on common computer…

Kernel-based schemes are state-of-the-art techniques for learning by data. In this work we extend some ideas about kernel-based greedy algorithms to exponential-polynomial splines, whose main drawback consists in possible overfitting and…