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

Trend · papers per month

6491,2971,9462,594 · Jun 202019922001200920172026
48 results for finite speed of propagation

Study on solutions of degenerate equations on manifolds, linking behavior to geometry and decay rates.

problem Behavior of solutions to degenerate parabolic equations on manifolds with inhomogeneous density.
method Analysis of Cauchy problem on Riemannian manifolds, considering weight function as capacitary coefficient.
result Estimates of vanishing rate and finite speed of propagation in subcritical ranges, universal bounds and blow-up in supercritical ranges.

We investigate shock-wave solutions of the Einstein equations in the case when the speed of propagation is equal to the speed of light. The work extends the shock matching theory of Smoller and Temple, which characterizes solutions of the Einstein equations when the spacetime metric is only Lipschitz continuous across …

2002-08-13abs ↗pdf ↗

Uniform-in-time analysis for Stein Variational Gradient Descent across various metrics.

problem Understanding long-term behavior of finite-particle systems in relation to their mean-field limits.
method Developed uniform-in-time propagation-of-chaos results for continuous-time SVGD using cutoff strategies and finite-dimensional theories.
result Uniform-in-time propagation-of-chaos bounds in various metrics, including Langevin kernel Stein discrepancy, Wasserstein-1, and Wasserstein-2 distances.

Using a simple and well-motivated modification of the stress-energy tensor for a viscous fluid proposed by Lichnerowicz, we prove that Einstein's equations coupled to a relativistic version of the Navier-Stokes equations are well-posed in a suitable Gevrey class if the fluid is incompressible and irrotational. These la…

2013-10-07abs ↗pdf ↗

Study shows critical initialisation not crucial for ReLU networks under dropout limits.

problem Effect of initialisation on training speed and generalisation in ReLU networks.
method Large-scale statistical analysis of over 12,000 trained networks.
result Non-critical initialisations perform similarly to critical initialisations in terms of performance.

SingleProp speeds up robust neural network training with minimal certification.

problem Efficiently defending neural networks against adversarial attacks with certified guarantees.
method SingleProp regularizer that requires only one forward pass per training iteration.
result Comparable certified accuracy to state-of-the-art defenses, but significantly faster training.

Field theory explains optimal scaling in ResNets for signal propagation.

problem Understanding optimal scaling parameter for ResNet performance.
method Finite-size field theory for ResNets to study signal propagation and scaling.
result Analytical expressions for optimal scaling parameter, independent of other hyperparameters.

Deep neural network reconstructs traffic speeds from sparse vehicle data.

problem Reconstructing traffic speeds from limited probe vehicle data.
method Convolutional neural network architecture for spatio-temporal learning.
result The method can reconstruct traffic speeds with low probe vehicle penetration.

The Resilient Propagation (Rprop) algorithm has been very popular for backpropagation training of multilayer feed-forward neural networks in various applications. The standard Rprop however encounters difficulties in the context of deep neural networks as typically happens with gradient-based learning algorithms. In th…

2015-09-15abs ↗pdf ↗

Deep networks with orthogonal weights show stable fluctuations, improving generalization and training speed.

problem Fluctuations in deep networks with Gaussian weights can impair training, especially in networks with depth comparable to width.
method Analytical and numerical studies of fully-connected networks with orthogonal weight initialization and tanh activations.
result Rectangular networks with orthogonal weights have stable fluctuations independent of network depth, leading to better generalization and training speed.

Finite-time extinction and smoothing effects in fractional fast diffusion on manifolds.

problem Finite-time extinction and smoothing effects in fractional fast diffusion equations.
method Nonlinear semigroups techniques, weighted LpL^p spaces, fractional Green function.
result Sharp extinction rates and pointwise lower bounds for solutions.

EP method speeds up Bayesian probit regression in high dimensions.

problem Computational challenges in high-dimensional Bayesian probit regression.
method Adapting EP approximation to multivariate Gaussian prior and skew-normal distribution.
result EP routine is computationally feasible in high-dimensional settings.

A new stochastic algorithm approximates optimal distributions without requiring propagation of chaos.

problem Optimizing functionals over probability distributions using finite particle systems.
method Virtual particle stochastic approximation, viewed as a form of stochastic gradient descent in the Wasserstein space.
result The algorithm's output converges to the optimal distribution and produces i.i.d. samples.

Deep vanilla transformers trained without shortcuts achieve similar performance to standard models.

problem Training deep vanilla transformers without shortcuts and normalizations.
method Parameter initializations, bias matrices, and location-dependent rescaling.
result Deep vanilla transformers can train at similar speeds and performance to standard models.

Deep learning speeds up material property quantification using stress waves.

problem Quantifying material properties from stress waves in complex media.
method Surrogate deep learning FWI scheme trained on random sampled properties and local minima.
result Demonstrates feasibility of deep learning for high-accuracy material property estimation.

Researchers reconstruct simple Riemannian manifolds from boundary wave arrival times.

problem Reconstructing Riemannian manifolds from unknown interior sources and arrival times.
method Discrete metric approximation using labeled Gromov--Hausdorff distance.
result Finite-time approximations converge to the true Riemannian manifold.

Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms correspond to extrema of the Bethe and Kikuchi free energy. However, belief propagation does not always converge, which explains the need for approach…

2012-10-19abs ↗pdf ↗

Modeling of a wide class of physical phenomena, such as crystal growth and flame propagation, leads to tracking fronts moving with curvature-dependent speed. When the speed is the curvature this leads to one of the classical degenerate nonlinear second order differential equations on Euclidean space. One naturally wond…

2016-07-07abs ↗pdf ↗

Deep neural networks have gained tremendous popularity in last few years. They have been applied for the task of classification in almost every domain. Despite the success, deep networks can be incredibly slow to train for even moderate sized models on sufficiently large datasets. Additionally, these networks require l…

2018-07-30abs ↗pdf ↗

Many inference problems involving questions of optimality ask for the maximum or the minimum of a finite set of unknown quantities. This technical report derives the first two posterior moments of the maximum of two correlated Gaussian variables and the first two posterior moments of the two generating variables (corre…

2009-10-01abs ↗pdf ↗

Classifies self-similar solutions for heat equations with positive speed.

problem Classifying self-similar solutions for semilinear heat equations.
method Analyzes the semilinear heat equation ut=Δu+up1uu_t=Δu+|u|^{p-1}u for p>1p>1.
result Finite time blowing up solutions converge to a positive constant after rescaling.

Study traveling waves in hyperbolic space for Fisher-KPP equations.

problem Understanding wave behavior in hyperbolic space for Fisher-KPP equations.
method Analyzes the Cauchy problem in hyperbolic space for heat equation with Fisher-KPP forcing term.
result Proves new results on the dichotomy of solution propagation or vanishing based on diffusion and reaction strength.

Gaussian processes (GP) are attractive building blocks for many probabilistic models. Their drawbacks, however, are the rapidly increasing inference time and memory requirement alongside increasing data. The problem can be alleviated with compactly supported (CS) covariance functions, which produce sparse covariance ma…

2012-03-15abs ↗pdf ↗

New EP variants improve inference stability and efficiency.

problem Inference stability and efficiency issues in EP.
method Motivated by natural-gradient optimization, new EP variants are introduced that are robust to Monte Carlo noise and efficient with single samples.
result Improved stability and efficiency in inference tasks.

Humans gain an implicit understanding of physical laws through observing and interacting with the world. Endowing an autonomous agent with an understanding of physical laws through experience and observation is seldom practical: we should seek alternatives. Fortunately, many of the laws of behaviour of the physical wor…

2018-12-04abs ↗pdf ↗

The perturbative Chern-Simons theory is studied in a finite-dimensional version or assuming that the propagator satisfies certain properties (as is the case, e.g., with the propagator defined by Axelrod and Singer). It turns out that the effective BV action is a function on cohomology (with shifted degrees) that solves…

2008-11-13abs ↗pdf ↗

Efficiently verifies neural networks by handling neuron splits, improving speed and accuracy.

problem Handling neuron split constraints in incomplete neural network verification.
method β-CROWN, which optimizes parameters β to encode neuron splits and uses them in bound propagation.
result β-CROWN significantly speeds up verification while maintaining high accuracy.

In this paper, we will show an unprecedented method to accelerate training and improve performance, which called random gradient (RG). This method can be easier to the training of any model without extra calculation cost, we use Image classification, Semantic segmentation, and GANs to confirm this method can improve sp…

2018-08-13abs ↗pdf ↗

Study reconstructs Riemannian metric from Cherenkov radiation in complex media.

problem Reconstructing internal geometry of inhomogeneous anisotropic targets.
method Mathematical model of waves in medium, including vector-valued wave operator and phase velocity.
result Riemannian metric inside a bounded region can be reconstructed from boundary measurements of Cherenkov radiation.

New methods speed up training of differentially private deep learning models.

problem Training differentially private deep learning models is slower than non-private models.
method Derive and implement new per-example gradient clipping methods compatible with auto-differentiation.
result Significant training speed-ups (54x - 94x) for various models and architectures.