Related papers: Benchmarking Domain-Specific Compiler Optimization…
In black-box combinatorial optimization, objective evaluations are often expensive, so high quality solutions must be found under a limited budget. Factorization machine with quantum annealing (FMQA) builds a quadratic surrogate model from…
Factor Analysis (FA) is a technique of fundamental importance that is widely used in classical and modern multivariate statistics, psychometrics and econometrics. In this paper, we revisit the classical rank-constrained FA problem, which…
Concatenated bit-interleaved and multilevel coded modulation with outer Reed--Solomon codes, inner Chase-algorithm-based soft-decision-decoded Bose--Ray-Chaudhuri--Hocquenghem codes, and four-level pulse amplitude modulation is considered.…
A new concept is introduced for the adaptive finite element discretization of partial differential equations that have a sparsely representable solution. Motivated by recent work on compressed sensing, a recursive mesh refinement procedure…
This research introduces an FPGA-based hardware accelerator to optimize the Singular Value Decomposition (SVD) and Fast Fourier transform (FFT) operations in AI models. The proposed design aims to improve processing speed and reduce…
The Morley finite element method (FEM) is attractive for semilinear problems with the biharmonic operator as a leading term in the stream function vorticity formulation of 2D Navier-Stokes problem and in the von K\'{a}rm\'{a}n equations.…
In this work we propose an adaptive Finite Element Method (FEM) formulation for the Deformable Image Registration problem (DIR) together with a residual-based a posteriori error estimator, whose efficiency and reliability are theoretically…
We propose a matrix-free finite element (FE) homogenization scheme that is considerably more efficient than generic FE implementations. The efficiency of our scheme follows from a preconditioned well-scaled reformulation allowing for the…
Optimization is a key task in a number of applications. When the set of feasible solutions under consideration is of combinatorial nature and described in an implicit way as a set of constraints, optimization is typically NP-hard.…
In this paper, we present a work in progress about a deep learning based approach for automatic code optimization in polyhedral compilers. The proposed technique explores combinations of affine and non-affine loop transformations to find…
This paper presents a novel and lightweight hyperparameter optimization (HPO) method, MOdular FActorial Design (MOFA). MOFA pursues several rounds of HPO, where each round alternates between exploration of hyperparameter space by factorial…
The fermion determinant is a highly non-local object and its logarithm is an extensive quantity. For these reasons it is widely believed that the determinant cannot be treated in acceptance steps of gauge link configurations that differ in…
The capability of discretization of matrix elements in the problem of quadratic functional minimization with linear member built on matrix in N-dimensional configuration space with discrete coordinates is researched. It is shown, that…
Designing efficient optimizers for large language models (LLMs) with low-memory requirements and fast convergence is an important and challenging problem. This paper makes a step towards the systematic design of such optimizers through the…
Adaptive optimization has achieved notable success for distributed learning while extending adaptive optimizer to federated Learning (FL) suffers from severe inefficiency, including (i) rugged convergence due to inaccurate gradient…
Sympiler is a domain-specific code generator that optimizes sparse matrix computations by decoupling the symbolic analysis phase from the numerical manipulation stage in sparse codes. The computation patterns in sparse numerical methods are…
The solution of large sparse linear systems via factorization methods such as LU or Cholesky decomposition, can be computationally expensive due to the introduction of non-zero elements, or ``fill-in.'' Graph partitioning can be used to…
In this paper, we introduce the Phantom Domain Finite Element Method (PDFEM), a novel computational approach tailored for the efficient analysis of heterogeneous and composite materials. Inspired by fictitious domain methods, this method…
Nonlinear dynamic simulations of mechanical resonators have been facilitated by the advent of computational techniques that generate nonlinear reduced order models (ROMs) using the finite element (FE) method. However, designing devices with…
We derive and analyze a fully computable discrete scheme for fractional partial differential equations posed on the full space $\mathbb{R}^d$ . Based on a reformulation using the well-known Caffarelli-Silvestre extension, we study a…