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

Trend · papers per month

0.4%0.8%1.2%1.6% · Jan 200019922001200920172026
48 results for two-layer parametrisations

New method for handling multi-dimensional singular controls with jump costs in mean-field problems.

problem Handling jump costs in multi-dimensional singular controls.
method Introducing two-layer parametrisations to interpolate jumps on both distributional and pathwise levels.
result Derivation of a DPP and characterisation of the value function as a minimal super-solution to a quasi-variational inequality.

Develops parametrised Poincaré duality for equivariant fixed points.

problem Understanding equivariant fixed points in non-presentable settings.
method Introduces parametrised Poincaré duality in parametrised higher category theory, proving basechange results.
result Generalises Cnossen's twisted ambidexterity to non-presentable settings and applies to isotropy separation methods.

New framework for analyzing games with multi-dimensional singular controls and non-linear jumps.

problem Analyzing games with multi-dimensional singular controls and non-linear jump impacts.
method Probabilistic framework with novel class of MFGs (MFGs of parametrisations).
result Existence of equilibria and equivalence with MFGs of singular controls.

Combines ML and DA to infer unresolved scale parametrisation from noisy data.

problem Training ML-based parametrisations from realistic, noisy and sparse observations.
method Two-step process: DA for state estimation, ML for model error prediction.
result Hybrid model produces better forecasts and attractor representation.

A new approach to unsupervised learning using recognition-parametrised models.

problem Discovering meaningful latent structure in observational data.
method Recognition-Parametrised Model (RPM) combining parametric and non-parametric components.
result Effective learning of latent structure without explicit generative models.

The paper shows how label noise in training can lead to solutions that solve a Lasso program.

problem Understanding the implicit bias of training algorithms in overparametrised models.
method Analyzing the continuous time version of the training dynamics of a quadratically parametrised model.
result The stochastic flow implicitly solves a Lasso program, providing convergence guarantees and support recovery conditions.

We show that, for certain families φsφ_{\mathbf{s}} of diffeomorphisms of high-dimensional spheres, the commutator of the Dehn twist along the zero-section of TSnT^*S^n with the family of pullbacks φsφ^*_{\mathbf{s}} gives a noncontractible family of compactly-supported symplectomorphisms. In particular, we find example…

2014-07-11abs ↗pdf ↗

The abstract proves every knot type can be parametrized by smooth functions and studies limit knot types.

problem Understanding all knot types and their parametrizations.
method Proving every knot type can be represented by smooth functions and studying limit knot types.
result Every knot type can be parametrized by smooth functions and limit knot types exist.

Neural networks outperform kernel methods in classifying high-dimensional Gaussian mixtures.

problem Classifying high-dimensional Gaussian mixtures using kernel methods and neural networks.
method Theoretical analysis and derivation of learning dynamics for 2LNN and comparison with kernel methods.
result 2LNN can achieve near-optimal performance on high-dimensional Gaussian mixture classification tasks, surpassing kernel methods.

Gradient descent with logistic loss can make two-layer networks interpolate binary classification data.

problem Training two-layer networks for binary classification.
method Gradient descent with logistic loss applied to two-layer networks.
result Gradient descent can drive training loss to zero under certain conditions.

Two-layer neural networks can approximate functions with fractal singularities.

problem Characterizing functions that can be represented by infinitely wide two-layer neural networks.
method Representation formulas and pointwise properties analysis.
result Functions with fractal or curved singularities cannot be represented by two-layer networks with finite path-norm.

In this paper we are dealing with mean curvature flow with surgeries of two-convex hypersurfaces. The main focus is to expand on the discussion in Section 33 of Mean Curvature Flow with Surgeries of Two-Convex Hypersurfaces by Huisken and Sinestrari. Firstly we wish to establish how the neck detection lemma allows us …

2017-06-09abs ↗pdf ↗

We introduce a new parameter to measure the inhomogeneity of training datasets.

problem The need for non-stationary models in supervised learning.
method We introduce a new parameter, the inhomogeneity parameter, to measure the inhomogeneity of training datasets.
result A training set with a non-zero inhomogeneity parameter requires a non-stationary model for accurate predictions.

We present a procedure which allows one to integrate explicitly the class of checkerboard IC-nets which has recently been introduced as a generalisation of incircular (IC) nets. The latter class of privileged congruences of lines in the plane is known to admit a great variety of geometric properties which are also pres…

2018-08-22abs ↗pdf ↗

Researchers extend parametrization of Margulis spacetimes using strip deformations.

problem Parametrize Margulis spacetimes with decorated horoballs.
method Use strip deformations to parametrize complete finite-area hyperbolic surfaces with spikes decorated with horoballs.
result Generalized parametrization of Margulis spacetimes with photons.

The study characterizes quasiperiodic surfaces in pseudo-hyperbolic spaces with curvature conditions.

problem Characterizing quasiperiodic surfaces in pseudo-hyperbolic spaces.
method Curvature conditions, Gromov hyperbolicity, conformal hyperbolicity.
result Limit curves of quasiperiodic surfaces in the Einstein Universe have canonical quasisymmetric parametrizations.

Gradient descent converges to minimum Bayes risk for two-layer ReLU networks in mean field regime.

problem Training two-layer ReLU networks using gradient descent in the mean field regime.
method Describes a condition for convergence to minimum Bayes risk, extending previous results to ReLU-activated networks.
result The condition for convergence does not depend on initialization and concerns weak convergence of network realization.

Estimates generalization error for two-layer ReLU NNs through minimum norm solutions.

problem Estimating generalization error for two-layer ReLU NNs trained by mean squared error.
method Uses minimum norm solutions and Neural Tangent Kernel (NTK) regime to derive generalization error bounds.
result Derives an a priori generalization error bound for two-layer ReLU NNs without requiring exponentially large number of neurons.

Biological systems are often modelled at different levels of abstraction depending on the particular aims/resources of a study. Such different models often provide qualitatively concordant predictions over specific parametrisations, but it is generally unclear whether model predictions are quantitatively in agreement, …

2016-05-07abs ↗pdf ↗

Proposes a new Gaussian factor for probabilistic inference with degenerate settings.

problem Handling linear dependencies among random variables in Gaussian networks.
method Introduces a parametrised factor that relaxes the positive-definite constraint of the covariance matrix.
result Accurately accommodates degeneracies in probabilistic inference without significant computational overhead.

Study on deformations of Einstein and nearly G2 structures in 3-Sasaki manifolds.

problem Deformation theory of Einstein and nearly G2 structures in 3-Sasaki manifolds.
method Systematic study of deformation theory, focusing on infinitesimal deformations and their parametrization via eigenfunctions of the basic Laplacian.
result Infinitesimal Einstein deformations of g1/5g_{1/\sqrt{5}} coincide with infinitesimal G2G_2 deformations of φ1/5\varphi_{1/\sqrt{5}}.

Two-layer neural networks learn efficiently using kernel methods in mean-field analysis.

problem Feature learning ability of two-layer neural networks in the mean-field regime.
method Mean-field analysis through kernel methods, focusing on dynamics of the first layer's kernel.
result Two-layer neural networks can learn a union of multiple reproducing kernel Hilbert spaces more efficiently than kernel methods.

The paper proves rigidity for mapping class group actions on metrics of positive scalar curvature.

problem Rigidity of mapping class group actions on metrics of positive scalar curvature.
method Parametrised Morse theory, 2-index theorem, sphere computations.
result Rigidity theorem for mapping class group action on positive scalar curvature metrics.

Two-layer networks trained on low-dimensional subspaces are vulnerable to adversarial examples.

problem Vulnerability of two-layer neural networks to adversarial examples on low-dimensional subspaces.
method Analysis of gradient behavior and effect of initialization scale and regularization.
result Decreasing initialization scale or adding L2 regularization can improve robustness to adversarial perturbations orthogonal to the data.

Two-layer neural networks must be robust, even with arbitrary weights.

problem Proving the robustness of two-layer neural networks with arbitrary weights.
method Developed a new function-space covering method to prove the robustness law, replacing parameter-space covering.
result Proved the conjectured law for two-layer networks with arbitrary real weights, biases, and affine skip connections.

This work shows linear convergence for two-layer neural networks in mean-field regime.

problem Optimizing two-layer neural networks in the mean-field regime.
method Mean-field analysis and continuous-time noisy gradient descent.
result Establishes linear convergence rate for two-layer neural networks.

For a given bundle ξ ⁣:EMξ\colon E \to M over a manifold, configuration-section spaces on ξξ parametrise finite subsets zMz \subseteq M equipped with a section of ξξ defined on MzM \smallsetminus z, with prescribed "charge" in a neighbourhood of the points zz. These spaces may be interpreted physically as spaces of fiel…

2020-07-22abs ↗pdf ↗

We study the limits and methods of training two-layer autoencoders.

problem Understanding the limits and methods of training two-layer autoencoders.
method Focus on non-linear two-layer autoencoders trained in the proportional regime, using gradient methods.
result Gradient methods achieve the minimizers of the population risk and reveal the structure of the features.

Study on SGD for overparameterized neural networks, focusing on convergence rates.

problem Understanding convergence rates of SGD in overparameterized two-layer neural networks.
method Combines NTK approximation with RKHS analysis to explore SGD dynamics.
result Established sharp convergence rates for SGD in overparameterized two-layer neural networks.

Study shows infoGAN's generalization error bound for two-layer networks.

problem Understanding generalization error in infoGAN for two-layer neural networks.
method Analyzes the difference between empirical and population objective functions, derives Rademacher complexity bounds.
result Derives error bound for infoGAN's generalization error in a two-layer network.

Generalizes neural tangent kernel analysis for two-layer networks with noise and regularization.

problem Limitations of NTK analysis in deep learning practice.
method Generalized NTK analysis for two-layer neural networks with weight decay and gradient noise.
result Noisy gradient descent with weight decay exhibits 'kernel-like' behavior and converges linearly.

This paper presents a phase diagram for two-layer neural networks under different initialization scales.

problem Understanding the behavior of neural networks under varying scales of initialization.
method Analysis of a phase diagram for two-layer neural networks.
result Condensation of weight vectors on isolated orientations during training.

PHP connects to ReLU neural networks for scalable Bayesian inference.

problem Scalability and Bayesian inference in two-layer ReLU neural networks.
method PHP with Gaussian prior, decomposition propositions, annealed sequential Monte Carlo.
result PHP provides an alternative scalable representation for two-layer ReLU neural networks.

Two-layer CNNs can overfit well if initialized correctly.

problem Understanding the conditions for benign overfitting in over-parameterized CNNs.
method Extending analysis to fully trainable two-layer CNNs, examining initialization scaling effects.
result Initialization scaling of the output layer is crucial; large scales lead to fixed output behavior, small scales to complex interactions.

This paper explains double descent in linear neural networks, identifying new factors.

problem Understanding double descent in linear neural networks.
method Gradient flow derivation and necessary conditions for double descent.
result Singular values of input-output covariance matrix are important for double descent in two-layer models.

Two-layer networks learn hard GLMs with SGD in high dimensions.

problem Learning hard generalized linear models with SGD in high-dimensional settings.
method Reduction of SGD dynamics to a stochastic process in lower dimensions, focusing on the role of stochasticity.
result Overparameterization enhances convergence by a constant factor, suggesting minimal role of stochasticity.

Study of two-layer NNs under Gaussian mixtures data, proving polynomial models equivalent to neural networks.

problem Training and generalization performance of two-layer NNs under structured Gaussian mixture data.
method Asymptotic analysis of two-layer NNs after one gradient descent step under Gaussian mixture data assumption.
result High-order polynomial models equivalent to nonlinear neural networks under certain conditions.

By studying the Higgs bundle equations with the gauge group replaced by the group of symplectic diffeomorphisms of the 2-sphere we encounter the notion of a folded hyperkaehler 4-manifold and conjecture the existence of a family of such metrics parametrised by an infinite-dimensional analogue of Teichmueller space.

2015-01-20abs ↗pdf ↗

We give sufficient conditions for a parametrised family of probability measures on a Riemannian manifold with boundary to be represented by random maps of class CkC^k. The conditions allow for the probability densities to approach zero towards the boundary of the manifold. We also formulate two obstructions to regular …

2016-10-10abs ↗pdf ↗

It has been shown that gradient descent can yield the zero training loss in the over-parametrized regime (the width of the neural networks is much larger than the number of data points). In this work, combining the ideas of some existing works, we investigate the gradient descent method for training two-layer neural ne…

2019-09-30abs ↗pdf ↗