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,657 papers · 148 categories

Trend · papers per month

3637271,0901,453 · Jun 202019922001200920172026
48 results for deep Ritz method

Paper uses deep Ritz method for solving stationary Schrödinger equation, proving convergence and feature emergence.

problem Solving stationary Schrödinger equation with high-dimensional features.
method Deep Ritz method, gradient descent, single-index model, two-neuron model.
result Gradient descent converges to near-optimal solution, feature emergence observed in two-neuron model.

Paper studies deep learning for solving elliptic PDEs, proving optimal bounds and neural scaling laws.

problem Solving elliptic PDEs from random samples using machine learning.
method Deep Ritz Method and Physics-Informed Neural Networks (PINNs) for the Schrödinger equation.
result Proves minimax optimal bounds and neural scaling laws for deep PDE solvers.

Paper analyzes DRM for solving high-dimensional elliptic PDEs with generalization bounds.

problem Analyzing generalization error of neural network methods for high-dimensional PDEs.
method Developed a new solution theory for spectral Barron space and derived generalization error bounds.
result Generalization error bounds are independent of dimension and solutions lie in spectral Barron space.

Study analyzes error in neural network solving PDEs, providing convergence and error bounds.

problem Error analysis of neural network solving PDEs.
method Three-layer tanh neural network with projected gradient descent (PGD).
result Comprehensive error analysis including approximation, generalization, and optimization errors.

This paper compares deeper and wider neural networks for optimal generalization error in Sobolev losses.

problem The dilemma of choosing between deeper or wider neural networks for optimal generalization error.
method Analytical investigations into the influence of sample points, parameters, and loss function regularity on neural network architecture.
result A higher number of parameters favors wider neural networks, while more sample points and greater loss function regularity favor deeper neural networks.

Paper develops IFTRR to solve sparse generalized eigenvalue problems efficiently.

problem Finding the leading eigenvector with at most k nonzero entries in sparse generalized eigenvalue problems.
method Inverse-free truncated Rayleigh-Ritz method (IFTRR) with a new truncation strategy.
result IFTRR efficiently finds the support set of the leading eigenvector for large scale problems.

In this paper, we propose the idea of radial scaling in frequency domain and activation functions with compact support to produce a multi-scale DNN (MscaleDNN), which will have the multi-scale capability in approximating high frequency and high dimensional functions and speeding up the solution of high dimensional PDEs…

2019-10-25abs ↗pdf ↗

New neural network approach solves Poisson equations efficiently.

problem Approximating solutions to Poisson equations with Dirichlet boundary conditions.
method Using shallow ReLUα-networks to solve Laplace operator equations.
result Neural networks can approximate solutions to the Laplace operator with Dirichlet boundary conditions efficiently.

For a bounded domain ΩΩ with a piecewise smooth boundary in a complete Riemannian manifold MM, we study eigenvalues of the Dirichlet eigenvalue problem of the Laplacian. By making use of a fact that eigenfunctions form an orthonormal basis of L2(Ω)L^2(Ω) in place of the Rayleigh-Ritz formula, we obtain inequalities for …

2011-04-26abs ↗pdf ↗

Fast and accurate methods for low-rank learning problems.

problem Partial singular value decomposition and numerical rank estimation of huge matrices.
method Krylov subspaces and Ritz vectors for fast and accurate solutions.
result Advantages over traditional methods in accuracy and speed.

Bayesian methods enhance deep learning models by improving reliability and uncertainty.

problem Improving reliability and uncertainty awareness in deep learning models.
method Approximate Bayesian inference techniques, including SG-MCMC and VI, applied to deep learning models.
result Enhanced posterior inference for deep learning models, particularly in neural networks and generative models.

Proposes a constraint for deep clustering to handle both simple and complex topologies.

problem Limited prior knowledge for deep clustering methods to perform well on complex topologies.
method Introduces a constraint using symmetric InfoNCE to enhance deep clustering performance.
result The constraint improves deep clustering methods' performance on both simple and complex topologies.

In recent years, deep learning methods applying unsupervised learning to train deep layers of neural networks have achieved remarkable results in numerous fields. In the past, many genetic algorithms based methods have been successfully applied to training neural networks. In this paper, we extend previous work and pro…

2017-11-21abs ↗pdf ↗

Hashing has been widely used for large-scale approximate nearest neighbor search because of its storage and search efficiency. Recent work has found that deep supervised hashing can significantly outperform non-deep supervised hashing in many applications. However, most existing deep supervised hashing methods adopt a …

2017-07-26abs ↗pdf ↗

Deep Penalty Method solves high-dimensional optimal stopping problems using deep learning.

problem High-dimensional optimal stopping problems in American option pricing.
method Inspired by penalty method for PDEs, approximates penalized PDE with Deep BSDE framework.
result Error bound of DPM is O(1λ)+O(λh)+O(h)O(\frac{1}{\lambda}) + O(\lambda h) + O(\sqrt{h}).

This paper introduces Deep Incremental Boosting, a new technique derived from AdaBoost, specifically adapted to work with Deep Learning methods, that reduces the required training time and improves generalisation. We draw inspiration from Transfer of Learning approaches to reduce the start-up time to training each incr…

2017-08-11abs ↗pdf ↗

Unified theory linking Bayesian and ensemble methods in deep learning.

problem Uncertainty quantification in deep learning.
method Reformulating optimisation as convex optimisation in probability measures, studying Wasserstein gradient flows.
result Unified theory explaining success of deep ensembles over variational inference.

Deep density methods improve filtering in high-dimensional systems.

problem Nonlinear filtering in high-dimensional systems.
method Two deep density methods based on Feynman-Kac formulas and neural networks.
result Logarithmic deep backward stochastic differential equation filter outperforms classical methods in high dimensions.

Proposes a method to estimate drug sensitivity uncertainty using deep regression forests.

problem Lack of confidence intervals in deep learning models for critical tasks.
method Uses Deep Regression Forests to estimate variance and uncertainty for drug sensitivity prediction.
result Improves efficiency and coverage of uncertainty estimates for drug sensitivity predictions.

Survey of spectral, probabilistic, and deep metric learning methods.

problem Developing effective distance metrics for various machine learning tasks.
method Divided into spectral, probabilistic, and deep approaches, covering various techniques and their applications.
result Comprehensive overview of metric learning methods, including new developments and applications.

The deep reinforcement learning method usually requires a large number of training images and executing actions to obtain sufficient results. When it is extended a real-task in the real environment with an actual robot, the method will be required more training images due to complexities or noises of the input images, …

2018-06-02abs ↗pdf ↗

A new model DKMPP integrates covariates and uses an integration-free method for spatio-temporal point processes.

problem Training intractable deep spatio-temporal point processes with multimodal covariates.
method DKMPP uses a deep kernel to model complex relationships and an integration-free score matching method.
result DKMPP and score-based estimators outperform baseline models in spatio-temporal point processes.

Develops deep jump learning for continuous treatment OPE.

problem Estimating mean outcomes under new treatment rules using historical data from different rules.
method Adaptive deep discretization of continuous treatment space using deep learning and multi-scale change point detection.
result Validated method through theoretical results, simulations, and real application to Warfarin Dosing.

URSABench benchmarks Bayesian methods for deep learning models.

problem Scalability issues in Bayesian inference for deep learning.
method Open-source benchmark suite for assessing approximate Bayesian inference methods.
result Initial results show promise for addressing uncertainty and robustness in deep learning.

This paper focuses on a comparative evaluation of the most common and modern methods for text classification, including the recent deep learning strategies and ensemble methods. The study is motivated by a challenging real data problem, characterized by high-dimensional and extremely sparse data, deriving from incoming…

2019-02-18abs ↗pdf ↗

Gradient descent methods for deep ReLU networks achieve optimal generalization rates.

problem Generalization of gradient descent methods for deep neural networks
method Establishing minimax-optimal rates for GD and SGD with deep ReLU networks
result Gradient descent methods for deep ReLU networks achieve optimal generalization rates