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

Trend · papers per month

72144215287 · Jun 202019922001200920172026
48 results for two-scale convergence

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.

Paper studies convergence of Mean-Field GDA dynamics for MNE of continuous games.

problem Finding mixed Nash equilibria in continuous games.
method Two-scale Mean-Field Gradient Descent Ascent dynamics.
result Two-scale Mean-Field GDA converges exponentially to MNE without convexity assumptions.

A new model for defective media using two scales.

problem Modeling defects in media with two scales.
method Generalization of Riemann-Cartan manifolds and fibre bundle theory, constructing a first-order placement map.
result Emergent behaviors like dislocations and disclinations arise from the interaction of macroscopic and microscopic scales.

Paper proposes a mean-field gradient descent for zero-sum games, proving convergence to Nash equilibrium.

problem Finding mixed Nash equilibria in zero-sum games with multiple players.
method Mean-field gradient descent dynamics with time-averaging, incorporating exponentially discounted gradients.
result Exponential convergence rate to mixed Nash equilibrium with respect to total variation metric.

We give a natural way to identify between two scales, potentially arbitrarily far apart, in a non-compact Ricci-flat manifold with Euclidean volume growth when a tangent cone at infinity has smooth cross section. The identification map is given as the gradient flow of a solution to an elliptic equation.

2019-10-27abs ↗pdf ↗

Stochastic variance-reduced gradient (SVRG) is an optimization method originally designed for tackling machine learning problems with a finite sum structure. SVRG was later shown to work for policy evaluation, a problem in reinforcement learning in which one aims to estimate the value function of a given policy. SVRG m…

2019-06-09abs ↗pdf ↗

New method combines machine learning with data assimilation for model error correction.

problem Correcting model errors using sparse and noisy observations.
method Hybrid machine learning and data assimilation methods.
result Tendency correction outperforms resolvent correction in data assimilation experiments.

Agents' heterogeneity is recognized as a driver mechanism for the persistence of financial volatility. We focus on the multiplicity of investment strategies' horizons, we embed this concept in a continuous time stochastic volatility framework and prove that a parsimonious, two-scale version effectively captures the lon…

2012-05-31abs ↗pdf ↗

The financial market is nonpredictable, as according to the Bachelier, the mathematical expectation of the speculator is zero. Nevertheless, we observe in the price fluctuations the two distinct scales, short and long time. Behaviour of a market in long terms, such as year intervals, is different from that in short ter…

2006-08-18abs ↗pdf ↗

We investigate the waiting-time distribution of the absolute return in the Korean stock-market index KOSPI. We define the waiting time as a time interval during which the normalized absolute return remains continuously below a threshold rcr_c. Through an exponential bin plot, we observe that the waiting-time distributi…

2005-08-30abs ↗pdf ↗

In an earlier work we identified the types and numbers of static equilibrium points of solids arising from fine, equidistant nn-discretrizations of smooth, convex surfaces. We showed that such discretizations carry equilibrium points on two scales: the local scale corresponds to the discretization, the global scale to…

2014-10-20abs ↗pdf ↗

We consider microstructure as an arbitrary contamination of the underlying latent securities price, through a Markov kernel QQ. Special cases include additive error, rounding and combinations thereof. Our main result is that, subject to smoothness conditions, the two scales realized volatility is robust to the form of…

2007-09-04abs ↗pdf ↗

Jackknife variance estimation validated for generalized U-statistics.

problem Uncertainty quantification for subsampling-based estimators.
method Jackknife variance estimation for generalized U-statistics with row-wise LrL^r weak law.
result Jackknife and delete-dd variance estimators are ratio-consistent for generalized U-statistics.

We investigate multifractality in the Korean stock-market index KOSPI. The generalized qqth order height-height correlation function shows multiscaling properties. There are two scaling regimes with a crossover time around tc=40t_c =40 min. We consider the original data sets and the modified data sets obtained by removin…

2004-12-15abs ↗pdf ↗

A new method decouples set representation learning from posterior modeling for efficient amortized inference.

problem Efficient inference for large sets of observations with shared factors.
method Train a mean-pool Deep Set on sets of size at most two, then finetune the inference head on pre-aggregated embeddings.
result Matches or outperforms standard baselines at a fraction of the compute cost for large N.

We consider the learning of algorithmic tasks by mere observation of input-output pairs. Rather than studying this as a black-box discrete regression problem with no assumption whatsoever on the input-output mapping, we concentrate on tasks that are amenable to the principle of divide and conquer, and study what are it…

2016-11-08abs ↗pdf ↗

This paper explores online learning of dynamics and state using ensemble Kalman filters.

problem Reconstructing dynamics from partial and noisy observations in real-time.
method Ensemble Kalman filter (EnKF) family of algorithms for online learning of dynamics and state.
result Demonstrates the efficiency and accuracy of online learning methods using Lorenz models.

A new method predicts non-Markovian closure terms for complex systems.

problem Predicting the effect of unresolved variables on resolved dynamics in high-dimensional systems.
method Mamba-Assisted Closure (MAC) framework: sequence model trained to predict closure from resolved trajectory, coupled with reduced-order equations.
result Substantially outperforms existing methods in predictive accuracy and long-time stability.

New principles needed for scaling large language models, challenging traditional regularization methods.

problem The shift from generalization to scaling in machine learning requires new guiding principles.
method Examining the effectiveness of traditional regularization methods in the scaling-centric era.
result Traditional principles of regularization may not generalize to larger scales, highlighting new phenomena like scaling law crossover.

The conditional-mean barrier helps diagnose deterministic surrogates missing uncertainty.

problem Uncertainty in deterministic surrogates for complex systems.
method Developed diagnostics to locate the conditional-mean barrier and prove its necessity for distributional objectives.
result Crossing the barrier requires a loss that scores distributions, not point predictions.

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.

One gradient step improves neural network feature learning by aligning weights with the teacher model.

problem Improving feature learning in neural networks through gradient descent.
method First gradient descent step on the first-layer parameters of a two-layer neural network.
result The first gradient update contains a rank-1 spike, leading to alignment with the teacher model.

This is an intuitive survey of extrinsic and intrinsic notions of convergence of manifolds complete with pictures of key examples and a discussion of the properties associated with each notion. We begin with a description of three extrinsic notions which have been applied to study sequences of submanifolds in Euclidean…

2010-06-02abs ↗pdf ↗

The abstract discusses convergence properties of Lipschitz functions and sets defined by equations.

problem Convergence of Lipschitz functions and sets defined by equations.
method Painlevé-Kuratowski convergence applied to Lipschitz functions and sets defined by equations.
result Generalizations and reverses of classical theorems on convergence of functions and sets.

The objective of this paper is to introduce the notion of generalized almost statistical (briefly, GAS) convergence of bounded real sequences, which generalizes the notion of almost convergence as well as statistical convergence of bounded real sequences. As a special kind of Banach limit functional, we also introduce …

2019-11-15abs ↗pdf ↗

Establishes geometric convergence of iterative optimization algorithms.

problem Analyzes convergence of iterative optimization algorithms under general assumptions.
method General framework for iterative optimization algorithms, proving asymptotic geometric convergence and providing convergence rates.
result Asymptotic geometric convergence of iterative optimization algorithms with exact rate.

New quasi-Newton method guarantees global superlinear convergence.

problem Global convergence and superlinear convergence of quasi-Newton methods.
method Hybrid proximal extragradient method with online learning for Hessian approximation.
result First globally convergent quasi-Newton method with explicit superlinear convergence rate.

We investigate finite-time decoupled convergence in nonlinear two-time-scale stochastic approximation.

problem Achieving decoupled convergence in nonlinear two-time-scale stochastic approximation.
method Nested local linearity assumption, suitable step size selection, convergence analysis of matrix cross term, fourth-order moment convergence rates.
result Finite-time decoupled convergence rates can be achieved in nonlinear two-time-scale stochastic approximation with proper step size selection.

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.

Study shows gap between uniform convergence and test error in random feature models.

problem Understanding the gap between uniform convergence and test error in random feature models.
method Analytical expressions for uniform convergence over norm balls, interpolators, and minimum norm interpolator risk derived and proved.
result Uniform convergence over interpolators still gives a non-trivial bound of test error even when classical uniform convergence is vacuous.