Related papers: A Training Set Subsampling Strategy for the Reduce…

In this work, we propose a novel model order reduction approach for two-phase flow in porous media by introducing a formulation in which the mobility, which realizes the coupling between phase saturations and phase pressures, is regarded as…

Reduced basis methods provide an efficient way of mapping out phase diagrams of strongly correlated many-body quantum systems. The method relies on using the exact solutions at select parameter values to construct a low-dimensional basis,…

Subsampling of received wireless signals is important for relaxing hardware requirements as well as the computational cost of signal processing algorithms that rely on the output samples. We propose a subsampling technique to facilitate the…

We propose Diffusion-Sharpening, a fine-tuning approach that enhances downstream alignment by optimizing sampling trajectories. Existing RL-based fine-tuning methods focus on single training timesteps and neglect trajectory-level alignment,…

The task of repeatedly solving parametrized partial differential equations (pPDEs) in, e.g. optimization or interactive applications, makes it imperative to design highly efficient and equally accurate surrogate models. The reduced basis…

It is often possible to perform reduced order modelling by specifying linear subspace which accurately captures the dynamics of the system. This approach becomes especially appealing when linear subspace explicitly depends on parameters of…

This paper presents a weakly intrusive strategy for computing a low-rank approximation of the solution of a system of nonlinear parameter-dependent equations. The proposed strategy relies on a Newton-like iterative solver which only…

In this work we combine the framework of the Reduced Basis method (RB) with the framework of the Localized Orthogonal Decomposition (LOD) in order to solve parametrized elliptic multiscale problems. The idea of the LOD is to split a high…

The need for multiple interactive, real-time simulations using different parameter values has driven the design of fast numerical algorithms with certifiable accuracies. The reduced basis method (RBM) presents itself as such an option. RBM…

In this paper, we consider the problem of model reduction of large scale systems, such as those obtained through the discretization of PDEs. We propose a randomized proper orthogonal decomposition (RPOD) technique to obtain the reduced…

This paper proposes a model order reduction method for a class of parametric dynamical systems. Using a temporal Fourier transform, we reformulate these systems into complex-valued elliptic equations in the frequency domain, containing…

A bottleneck for computational lithography and optical metrology are long computational times for near field simulations. For design, optimization, and inverse scatterometry usually the same basic layout has to be simulated multiple times…

In this work, we develop a reduced-basis approach for the efficient computation of parametrized expected values, for a large number of parameter values, using the control variate method to reduce the variance. Two algorithms are proposed to…

Progressive Neural Network Learning is a class of algorithms that incrementally construct the network's topology and optimize its parameters based on the training data. While this approach exempts the users from the manual task of designing…

We consider a class of parameter-dependent optimal control problems of elliptic PDEs with constraints of general type on the control variable. Applying the concept of variational discretization, [4], together with techniques from the…

In this study, we propose Shortcut Fine-Tuning (SFT), a new approach for addressing the challenge of fast sampling of pretrained Denoising Diffusion Probabilistic Models (DDPMs). SFT advocates for the fine-tuning of DDPM samplers through…

Semi-supervised learning (SSL) has long been proved to be an effective technique to construct powerful models with limited labels. In the existing literature, consistency regularization-based methods, which force the perturbed samples to…

Dynamical decoupling (DD) is a low-overhead method for quantum error suppression. Despite extensive work in DD design, finding pulse sequences that optimally decouple computational qubits on noisy quantum hardware is not well understood. In…

Certain classes of CUR algorithms, also referred to as cross or pseudoskeleton algorithms, are widely used for low-rank matrix approximation when direct access to all matrix entries is costly. Their key advantage lies in constructing a…

We present a new technique for the interpolation of discretely-sampled non-negat ive scalar fields across regions of missing data. Any set of basis functions can be used, though the method is fastest when they are close to orthogonal. We…