Demo Data from EDBT 2026 / reviewers in the wild / expert
Osman Akar
dblp:243/1941
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
High-performance computing · 100% | |
| Artificial intelligence
1 paper |
Deep learning architectures and training · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
High-performance computing › iterative methods
conjugate gradient |
0.7 | 1 | 2023 | A Deep Conjugate Direction Method for Iteratively Solving Linear Systems · ICML 2023 |
High-performance computing › numerical linear algebra
linear solver |
0.7 | 1 | 2023 | A Deep Conjugate Direction Method for Iteratively Solving Linear Systems · ICML 2023 |
High-performance computing
scientific computing systems |
0.7 | 1 | 2023 | A Deep Conjugate Direction Method for Iteratively Solving Linear Systems · ICML 2023 |
Methods — techniques the papers use, named apart from their topics
convolutional neural network · 1.3conjugate gradient · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | A Deep Conjugate Direction Method for Iteratively Solving Linear SystemsabstractWe present a novel deep learning approach to approximate the solution of large, sparse, symmetric, positive-definite linear systems of equations. Motivated by the conjugate gradients algorithm that iteratively selects search directions for minimizing the matrix norm of the approximation error, we design an approach that utilizes a deep neural network to accelerate convergence via data-driven improvement of the search direction at each iteration. Our method leverages a carefully chosen convolutional network to approximate the action of the inverse of the linear operator up to an arbitrary constant. We demonstrate the efficacy of our approach on spatially discretized Poisson equations, which arise in computational fluid dynamics applications, with millions of degrees of freedom. Unlike state-of-the-art learning approaches, our algorithm is capable of reducing the linear system residual to a given tolerance in a small number of iterations, independent of the problem size. Moreover, our method generalizes effectively to various systems beyond those encountered during training. Ayano Kaneda, Osman Akar, Jingyu Chen 0002, Victoria Kala, David Hyde 0001, Joseph Teran |
ICML | 2 |