Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

1122 · Apr 202019922001200920172026
21 results for multigrid

New multigrid approach reduces CNN parameters by focusing on structured convolutions.

problem Redundancy in standard CNNs leads to high parameter count.
method Replace standard convolutions with structured multilevel convolutions.
result Linearly proportional number of parameters to network width, no loss in accuracy.

Algorithm solves American options with regime-switching using multigrid and compact finite difference.

problem Pricing American put options with regime-switching.
method Multigrid iterative algorithm based on compact finite difference schemes and Hermite interpolation.
result The algorithm provides a fast and efficient tool for pricing American put options with regime-switching.

A scalable deep learning framework accelerates training of large neural networks for solving 3D Poisson equations.

problem Training large-scale neural networks for solving complex PDEs efficiently.
method Combines multigrid techniques with distributed deep learning to accelerate training.
result Solves 3D Poisson equations up to 512x512x512 resolution efficiently.

Kernel Multigrid accelerates Back-fitting for additive Gaussian Processes.

problem Slow convergence of Back-fitting in training additive Gaussian Processes.
method Kernel Packets (KP) and Sparse Gaussian Process Regression (GPR) to enhance Back-fitting.
result Kernel Multigrid reduces the required iterations to O(logn)\mathcal{O}(\log n).

The support vector machine is a flexible optimization-based technique widely used for classification problems. In practice, its training part becomes computationally expensive on large-scale data sets because of such reasons as the complexity and number of iterations in parameter fitting methods, underlying optimizatio…

2016-11-16abs ↗pdf ↗

Graph neural networks improve AMG convergence for sparse systems.

problem Efficiently constructing algebraic multigrid prolongation operators for sparse linear systems.
method Train a graph neural network to learn prolongation operators from matrix classes, using an unsupervised loss function.
result Improved convergence rates compared to classical AMG methods.

New framework for probabilistic linear solvers reduces manual effort.

problem Manual implementation of probabilistic iterative methods is laborious.
method Affine Tracing: Automatically constructs PIMs from standard implementations.
result Any realistic affine PIM is calibrated, motivating their adoption.

Accelerates MCMC sampling for large-scale problems using machine learning.

problem Efficiently sampling large-scale Bayesian inference problems with high computational cost.
method Integrates low-fidelity machine learning models into a multilevel MCMC framework.
result Significantly accelerates multilevel sampling by a factor of two with similar accuracy.

Improved reinforcement learning with deep learning.

problem Extending MultiGrid Reinforcement Learning to work with deep learning.
method Combining potential-based reward shaping with a learned potential function from interaction, and adapting it for deep learning algorithms.
result DQN augmented with the approach performs significantly better on continuous control tasks.

We consider the problem of estimating the curvature profile along the boundaries of digital objects in segmented black-and-white images. We start with the curvature estimator proposed by Roussillon et al., which is based on the calculation of \emph{maximal digital circular arcs} (MDCA). We extend this estimator to the …

2015-09-29abs ↗pdf ↗

PEARL uses reinforcement learning to improve matrix preconditioners.

problem Learning effective preconditioners for iterative solvers is challenging.
method PEARL employs an actor-critic reinforcement learning framework to learn preconditioners dynamically.
result PEARL outperforms traditional and neural preconditioners in flexibility and solving speed.

A flag is a sequence of nested subspaces. Flags are ubiquitous in numerical analysis, arising in finite elements, multigrid, spectral, and pseudospectral methods for numerical PDE; they arise in the form of Krylov subspaces in matrix computations, and as multiresolution analysis in wavelets constructions. They are comm…

2019-07-01abs ↗pdf ↗