VLDB 2026 Research / reviewers in the wild / expert
Ariel Neufeld
dblp:223/5063
· DBLP profile ↗
4ranked-venue papers
2as first author
4since 2021 · last 2025
0000-0001-5500-5245ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Theory of computation · 2 · 2 first-author · 2 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | QuLTSF: Long-Term Time Series Forecasting with Quantum Machine Learning
Hari Hara Suthan C, Paul Griffin 0001, Ariel Neufeld, Jayne Thompson, Mile Gu |
ICAART (1) | 3 |
| 2025 | Multilevel Picard approximations overcome the curse of dimensionality in the numerical approximation of general semilinear PDEs with gradient-dependent nonlinearities
Ariel Neufeld, Sizhou Wu |
J. Complex. | 1 |
| 2023 | A Deep Learning Approach to Data-Driven Model-Free Pricing and to Martingale Optimal TransportabstractWe introduce a novel and highly tractable supervised learning approach based on neural networks that can be applied for the computation of model-free price bounds of, potentially high-dimensional, financial derivatives and for the determination of optimal hedging strategies attaining these bounds. In particular, our methodology allows to train a single neural network offline and then to use it online for the fast determination of model-free price bounds of a whole class of financial derivatives with current market data. We show the applicability of this approach and highlight its accuracy in several examples involving real market data. Further, we show how a neural network can be trained to solve martingale optimal transport problems involving fixed marginal distributions instead of financial market data. Ariel Neufeld, Julian Sester |
IEEE Trans. Inf. Theory | 1 |
| 2023 | Low-Rank Plus Sparse Decomposition of Covariance Matrices Using Neural Network ParametrizationabstractThis article revisits the problem of decomposing a positive semidefinite matrix as a sum of a matrix with a given rank plus a sparse matrix. An immediate application can be found in portfolio optimization, when the matrix to be decomposed is the covariance between the different assets in the portfolio. Our approach consists in representing the low-rank part of the solution as the product$MM^{T}$, where$M$is a rectangular matrix of appropriate size, parametrized by the coefficients of a deep neural network. We then use a gradient descent algorithm to minimize an appropriate loss function over the parameters of the network. We deduce its convergence rate to a local optimum from the Lipschitz smoothness of our loss function. We show that the rate of convergence grows polynomially in the dimensions of the input–output, and the size of each of the hidden layers. Michel Baes, Calypso Herrera, Ariel Neufeld, Pierre Ruyssen |
IEEE Trans. Neural Networks Learn. Syst. | 3 |