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

94188282376 · Jun 202019922001200920172026
48 results for Convergence Concepts

Study extends null distance concept to Lorentzian length spaces for spacetime analysis.

problem Understanding spacetime convergence and topology in Lorentzian geometry.
method Extend null distance concept to Lorentzian length spaces, study Gromov-Hausdorff convergence.
result First results on compatibility of null distance with synthetic curvature bounds in warped product Lorentzian length spaces.

This work shows how transformers use multi-concept word semantics for efficient in-context learning.

problem Understanding the connection between transformer-based LLMs' multi-concept semantic representation and their innovative in-context learning abilities.
method A concept-based low-noise sparse coding prompt model, leveraging advanced techniques to analyze the exponential convergence of 0-1 loss over non-convex training dynamics.
result Transformers leverage multi-concept word semantics to enable powerful and excellent out-of-distribution in-context learning.

The paper proves stability of the positive mass theorem using intrinsic flat convergence.

problem Stability of the positive mass theorem in mathematical relativity.
method Intrinsic flat convergence of points and applications to stability.
result Revisits and strengthens the stability results for graphical hypersurfaces of Euclidean space.

BC-LLM uses LLMs to find concepts without predefined sets, improving interpretability and performance.

problem Finding a balance between interpretability and accuracy in concept extraction models.
method Bayesian approach with LLMs as both concept extractor and prior.
result BC-LLM outperforms interpretable and black-box models across various datasets.

New method tackles concept shifts in nonparametric regression using robust and adaptive transfer learning.

problem Concept shifts and sample scarcity in target domains hinder nonparametric regression.
method Robust and adaptive transfer learning procedure leveraging fixed bandwidth Gaussian kernels.
result Spectral algorithms with fixed bandwidth Gaussian kernels attain minimax convergence rates for nonparametric regression.

New approach for testable learning using moment matching and Rademacher complexity.

problem Replacing hard-to-verify distributional assumptions with testable ones.
method Moment matching and metric distances in probability.
result Improved sample complexity bounds for various concept classes and distributions.

New varifold solutions for mean curvature flow converge and are unique.

problem Mean curvature flow and Allen-Cahn equation convergence and uniqueness.
method Evolving varifolds coupled to phase volumes, weak-strong uniqueness principle.
result Limits of Allen-Cahn solutions are varifold solutions, and classical flows are unique.

The article introduces a new convergence concept for Lorentzian spaces and applies it to generalized cones.

problem Stability of curvature bounds in generalized Lorentzian cones.
method Introduces \ell-convergence for Lorentzian pre-length spaces, applies it to generalized cones, and proves stability of curvature bounds.
result Sharp timelike curvature and curvature-dimension bounds for generalized cones are established.

We study the density estimation problem with observations generated by certain dynamical systems that admit a unique underlying invariant Lebesgue density. Observations drawn from dynamical systems are not independent and moreover, usual mixing concepts may not be appropriate for measuring the dependence among these ob…

2016-07-13abs ↗pdf ↗

We present an actor-critic framework for MDPs where the objective is the variance-adjusted expected return. Our critic uses linear function approximation, and we extend the concept of compatible features to the variance-adjusted setting. We present an episodic actor-critic algorithm and show that it converges almost su…

2013-10-14abs ↗pdf ↗

Study homogenizes equations on parallelizable manifolds using tensor localization and periodicity.

problem Homogenizing oscillating linear elliptic equations on parallelizable manifolds.
method Two-scale convergence through localization and periodicity induced by geometry.
result Explicit cell formulae for the homogenization limit and a theory of two-scale convergence of tensors.

The subject of this article is the introduction of a new concept of well-posedness of Bayesian inverse problems. The conventional concept of (Lipschitz, Hellinger) well-posedness in [Stuart 2010, Acta Numerica 19, pp. 451-559] is difficult to verify in practice and may be inappropriate in some contexts. Our concept sim…

2019-02-26abs ↗pdf ↗

This thesis investigates belief propagation's performance in graphical models with loops.

problem Belief propagation's performance and convergence guarantees in models with loops are uncertain.
method Investigates how model parameters affect belief propagation's performance, convergence, and approximation quality.
result Model parameters influence the number of fixed points, convergence properties, and approximation quality of belief propagation.

New concept of proper-calibeating extends classic calibrated forecasts to proper scoring rules.

problem Defining and extending calibrated forecasts to proper scoring rules.
method Extending the concepts of calibrated and calibeating forecasts to proper scoring rules and proving their properties.
result Proper-calibration always implies calibration, but proper-calibeating does not necessarily imply calibeating.

New sampling and diffusion models methods introduced without density function assumptions.

problem Sampling and diffusion models without regularity assumptions.
method Inspired by reverse diffusion process, novel sampling and diffusion algorithms.
result Explicit convergence rate and dimension-free particle approximation convergence result.

We derive scaling laws for optimizing neural networks in hardware.

problem Optimizing the large parameter space of neural networks in hardware.
method Analytical derivation of scaling laws for Coordinate Descent optimization.
result Convergence is exponential and scales linearly with the number of neurons.

This study analyses, through cross-section estimation methods, the influence of spatial effects and human capital in the conditional productivity convergence (product per worker) in the economic sectors of NUTs III of mainland Portugal between 1995 and 2002. To analyse the data, Moran's I statistics is considered, and …

2011-10-25abs ↗pdf ↗

We extend the concept of renormalized volume for geometrically finite hyperbolic 33-manifolds, and show that is continuous for geometrically convergent sequences of hyperbolic structures over an acylindrical 3-manifold MM with geometrically finite limit. This allows us to show that the renormalized volume attains its…

2016-05-25abs ↗pdf ↗

We study two important concepts in adversarial deep learning---adversarial training and generative adversarial network (GAN). Adversarial training is the technique used to improve the robustness of discriminator by combining adversarial attacker and discriminator in the training phase. GAN is commonly used for image ge…

2018-07-27abs ↗pdf ↗

New method shows how order of gradient updates impacts stability and convergence in deep learning.

problem Training deep learning models can be unstable and computationally expensive.
method Theoretical analysis and experiments with backward-SGD.
result The order of gradient updates affects stability and convergence, leading to improved performance.

Inspired by the work of Leung-Wan, we study the mean curvature flow in hyperkähler manifolds starting from hyper-Lagrangian submanifolds, a class of middle dimensional submanifolds, which contains the class of complex Lagrangian submanifolds. For each hyper-Lagrangian submanifold, we define a new energy concept called …

2018-08-21abs ↗pdf ↗

The paper studies invariant weighted Bergman metrics on domains.

problem Investigating invariant weighted Bergman metrics under biholomorphisms.
method Introducing invariant weight assignments, using Bergman's minimum integral method and domain version of Tian-Yau-Zelditch expansion.
result Uniform convergence of weighted Bergman kernels and metrics on uniform squeezing domains.