English
Related papers

Related papers: A Mini-Batch Method for Solving Nonlinear PDEs wit…

200 papers

Adaptive learning is necessary for non-stationary environments where the learning machine needs to forget past data distribution. Efficient algorithms require a compact model update to not grow in computational burden with the incoming data…

Machine Learning · Computer Science 2023-07-11 Vanessa Gómez-Verdejo , Emilio Parrado-Hernández , Manel Martínez-Ramón

Exact Gaussian Process (GP) regression has O(N^3) runtime for data size N, making it intractable for large N. Many algorithms for improving GP scaling approximate the covariance with lower rank matrices. Other work has exploited structure…

Machine Learning · Statistics 2012-09-24 Elad Gilboa , Yunus Saatçi , John P. Cunningham

Few-shot segmentation is a challenging dense prediction task, which entails segmenting a novel query image given only a small annotated support set. The key problem is thus to design a method that aggregates detailed information from the…

Computer Vision and Pattern Recognition · Computer Science 2022-09-01 Joakim Johnander , Johan Edstedt , Michael Felsberg , Fahad Shahbaz Khan , Martin Danelljan

The stochastic gradient descent (SGD) algorithm has been widely used to optimize deep Cox neural network (Cox-NN) by updating model parameters using mini-batches of data. We show that SGD aims to optimize the average of mini-batch…

Machine Learning · Statistics 2026-04-16 Lang Zeng , Weijing Tang , Zhao Ren , Ying Ding

We study here a fixed mini-batch gradient decent (FMGD) algorithm to solve optimization problems with massive datasets. In FMGD, the whole sample is split into multiple non-overlapping partitions. Once the partitions are formed, they are…

Computation · Statistics 2023-04-17 Haobo Qi , Feifei Wang , Hansheng Wang

High-dimensional partial differential equations (PDE) appear in a number of models from the financial industry, such as in derivative pricing models, credit valuation adjustment (CVA) models, or portfolio optimization models. The PDEs in…

Numerical Analysis · Mathematics 2020-07-15 Christian Beck , Weinan E , Arnulf Jentzen

Gaussian process (GP) methods have been widely studied recently, especially for large-scale systems with big data and even more extreme cases when data is sparse. Key advantages of these methods consist in: 1) the ability to provide…

Methodology · Statistics 2024-09-13 Chenyi Lyu , Xingchi Liu , Lyudmila Mihaylova

We introduce and analyze a parallel sequential Monte Carlo methodology for the numerical solution of optimization problems that involve the minimization of a cost function that consists of the sum of many individual components. The proposed…

Computation · Statistics 2022-01-04 Ömer Deniz Akyildiz , Dan Crisan , Joaquín Míguez

The non-storability of electricity makes it unique among commodity assets, and it is an important driver of its price behaviour in secondary financial markets. The instantaneous and continuous matching of power supply with demand is a key…

Risk Management · Quantitative Finance 2019-04-04 Daniel Poh , Stephen Roberts , Martin Tegnér

Standard Gaussian Process (GP) regression, a powerful machine learning tool, is computationally expensive when it is applied to large datasets, and potentially inaccurate when data points are sparsely distributed in a high-dimensional…

Machine Learning · Computer Science 2016-03-08 Z. Zhang , K. Duraisamy , N. A. Gumerov

Stochastic gradient descent (SGD) method is popular for solving non-convex optimization problems in machine learning. This work investigates SGD from a viewpoint of graduated optimization, which is a widely applied approach for non-convex…

Optimization and Control · Mathematics 2023-08-15 Da Li , Jingjing Wu , Qingrun Zhang

Stochastic optimization lies at the core of most statistical learning models. The recent great development of stochastic algorithmic tools focused significantly onto proximal gradient iterations, in order to find an efficient approach for…

Machine Learning · Computer Science 2020-03-31 Andrei Patrascu , Ciprian Paduraru , Paul Irofti

Solving partial differential equations (PDEs) within the framework of probabilistic numerics offers a principled approach to quantifying epistemic uncertainty arising from discretization. By leveraging Gaussian process regression and…

Machine Learning · Statistics 2025-08-18 Akshay Thakur , Sawan Kumar , Matthew Zahr , Souvik Chakraborty

Gaussian processes (GPs) provide a nonparametric representation of functions. However, classical GP inference suffers from high computational cost for big data. In this paper, we propose a new Bayesian approach, EigenGP, that learns both…

Machine Learning · Computer Science 2015-07-14 Hao Peng , Yuan Qi

Gaussian processes (GP) are one of the most successful frameworks to model uncertainty. However, GP optimization (e.g., GP-UCB) suffers from major scalability issues. Experimental time grows linearly with the number of evaluations, unless…

Machine Learning · Statistics 2020-02-27 Daniele Calandriello , Luigi Carratino , Alessandro Lazaric , Michal Valko , Lorenzo Rosasco

Geostatistics is a branch of statistics concerned with stochastic processes over continuous domains, with Gaussian processes (GPs) providing a flexible and principled modelling framework. However, the high computational cost of simulating…

Computation · Statistics 2026-03-20 Flávio B. Gonçalves , Marcos O. Prates , Gareth O. Roberts

The key task of physical simulation is to solve partial differential equations (PDEs) on discretized domains, which is known to be costly. In particular, high-fidelity solutions are much more expensive than low-fidelity ones. To reduce the…

Machine Learning · Statistics 2020-06-11 Zheng Wang , Wei Xing , Robert Kirby , Shandian Zhe

The discovery of Partial Differential Equations (PDEs) is an essential task for applied science and engineering. However, data-driven discovery of PDEs is generally challenging, primarily stemming from the sensitivity of the discovered…

Machine Learning · Statistics 2024-03-27 Aoxue Chen , Yifan Du , Liyao Mars Gao , Guang Lin

We propose a new integrated method of exploiting model, batch and domain parallelism for the training of deep neural networks (DNNs) on large distributed-memory computers using minibatch stochastic gradient descent (SGD). Our goal is to…

Machine Learning · Computer Science 2018-05-17 Amir Gholami , Ariful Azad , Peter Jin , Kurt Keutzer , Aydin Buluc

Gaussian processes (GPs) are instrumental in modeling spatial processes, offering precise interpolation and prediction capabilities across fields such as environmental science and biology. Recently, there has been growing interest in…

Methodology · Statistics 2025-09-04 Jiawen Chen , Aritra Halder , Yun Li , Sudipto Banerjee , Didong Li