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

68135203270 · May 202619922001200920172026
48 results for asymptotic normality

We consider a skew ruled surface ΦΦ in the Euclidean space E3E^{3} and relative normalizations of it, so that the relative normals at each point lie in the corresponding asymptotic plane of ΦΦ. We call such relative normalizations and the resulting relative images of ΦΦ \emph{asymptotic}. We determine all ruled surf…

2013-07-23abs ↗pdf ↗

Paper explores weighted averaging schemes for SGD, achieving asymptotic normality and optimality.

problem Improving convergence of SGD in various settings.
method Develops a general weighted averaging scheme for SGD and establishes asymptotic normality.
result Establishes asymptotic normality and optimality of weighted averaged SGD solutions.

The paper proves asymptotic normality for multinomial logistic regression on null covariates.

problem Classical asymptotic normality results fail in high-dimensional multinomial logistic models.
method Developed asymptotic normality and chi-square results for multinomial logistic MLE on null covariates.
result Validated new methodology to test feature significance in high-dimensional classification problems.

Paper proves robust M-estimators' coordinates' normality in high dimensions.

problem High-dimensional robust M-estimators' asymptotic normality.
method Develops Stein formulae for high-dimensional random vectors on the sphere.
result Asymptotic normality holds for most coordinates of robust M-estimators with convex penalty.

Normal distributions ensure asymptotic variance reduction in moment matching Monte Carlo.

problem Asymptotic variance reduction in general integration problems.
method Characterization of conditions for asymptotic variance reduction using normal distributions.
result Asymptotic variance reduction is guaranteed for normal distributions in moment matching Monte Carlo.

Proves mass-capacity inequalities for critical area-normalized capacitors, improving Schwarzschild metric uniqueness.

problem Proving mass-capacity inequalities for critical area-normalized capacitors.
method Analyzes asymptotically flat manifolds with boundary capacity potential satisfying an overdetermined problem.
result Improves Schwarzschild metric uniqueness and results for spin asymptotically flat spacetimes.

As bandit algorithms are increasingly utilized in scientific studies and industrial applications, there is an associated increasing need for reliable inference methods based on the resulting adaptively-collected data. In this work, we develop methods for inference on data collected in batches using a bandit algorithm. …

2020-02-08abs ↗pdf ↗

The study explores normal generators for mapping class groups and their properties.

problem Understanding normal generators for mapping class groups of surfaces.
method Examined the relation between normal generation and asymptotic translation lengths on Teichmüller space and curve graph.
result Discussed several open questions related to normal generators.

Stochastic approximation proves asymptotic normality for non-smooth problems.

problem Solving non-smooth stochastic approximation problems.
method Stochastic approximation algorithms for solving smooth equations, extended to non-smooth problems.
result Asymptotic normality and optimality in non-smooth stochastic approximation is proven.

Gradient descent on normalized networks reveals sparsity preferences.

problem Understanding the inductive bias of gradient descent on normalized neural nets.
method Analysis of gradient descent on weight-normalized smooth homogeneous neural nets, focusing on SWN and EWN.
result EWN causes weights to be updated in a way that prefers asymptotic relative sparsity.

Stochastic algo learns from evolving data, achieving optimal performance.

problem Performative prediction and multiplayer extensions.
method Stochastic approximation with decision-dependent distributions.
result Asymptotic normality and optimality of the algorithm's performance.

We address challenges in estimating parameters from adaptively collected data.

problem Estimating parameters from data collected adaptively leads to non-normal asymptotic distributions.
method We develop semi-parametric estimators that account for adaptivity in data collection.
result Our estimators are asymptotically normal under certain conditions.

Study improves BN TTA under distribution shift using higher-order asymptotics.

problem Improving BN TTA for changing data distributions.
method Integrates Edgeworth expansion and saddlepoint approximation with one-step M-estimation.
result Derives optimal weighting parameter for minimized mean-squared error.

The paper improves the empirical bootstrap method for non-normal estimators.

problem Theoretical properties of empirical bootstrap for non-asymptotically normal estimators.
method Establishing limiting distribution, deriving consistency conditions, proposing alternative methods.
result The empirical bootstrap method can be asymptotically consistent under stability conditions.

Asymptotic net is an important concept in discrete differential geometry. In this paper, we show that we can associate affine discrete geometric concepts to an arbitrary non-degenerate asymptotic net. These concepts include discrete affine area, mean curvature, normal and co-normal vector fields and cubic form, and the…

2008-05-14abs ↗pdf ↗

We present sharp tail asymptotics for the density and the distribution function of linear combinations of correlated log-normal random variables, that is, exponentials of components of a correlated Gaussian vector. The asymptotic behavior turns out to depend on the correlation between the components, and the explicit s…

2013-09-12abs ↗pdf ↗

Study on neural networks' performance under different normalizations as N grows.

problem Characterizing neural networks' performance under various normalizations.
method Developed an asymptotic expansion to analyze statistical output of shallow neural networks.
result No bias-variance trade-off exists to leading order in N, and variance decreases as normalization approaches mean field.

We consider the evolution of the asymptotically hyperbolic mass under the curvature-normalized Ricci flow of asymptotically hyperbolic, conformally compactifiable manifolds. In contrast to asymptotically flat manifolds, for which ADM mass is constant during Ricci flow, we show that the mass of an asymptotically hyperbo…

2011-10-04abs ↗pdf ↗

Paper proposes CIV estimator for categorical instruments in small sample settings.

problem Estimation with categorical instruments in settings with few observations per category.
method CIV estimator leveraging regularization assumption for latent categorical variable.
result CIV estimator is asymptotically normal, efficient, and semiparametrically efficient under homoskedasticity.

Defines and analyzes generalized normal ruled surfaces of curves in 3D space.

problem Understanding the geometry of generalized normal ruled surfaces.
method Calculates Gaussian and mean curvatures to determine surface properties and examines curve conditions.
result Determines when surfaces are flat or minimal and identifies specific curve types.

The paper addresses statistical inference for online decision-making in a contextual bandit setting.

problem Understanding the performance of reward models in online decision-making with contextual information.
method The paper uses the contextual bandit framework with a linear reward model and the ε\varepsilon-greedy policy to address the exploration-exploitation dilemma. It employs the martingale central limit theorem and inverse propensity score weighting to establish asymptotic normality of parameter estimators.
result The online ordinary least squares estimator and the online weighted least squares estimator are asymptotically normal, providing insights into the performance of the reward model.

We consider the Laplace normal vector field of relatively normalized ruled surfaces with non-vanishing Gaussian curvature in the three-dimensional Euclidean space R3\mathbb{R}^{3}. We determine all ruled surfaces and all relative normalizations for which the Laplace normal image degenerates into a point or into a curve…

2015-10-28abs ↗pdf ↗

The paper analyzes the randomized midpoint method for Langevin diffusions, revealing biases and asymptotic properties.

problem Analyzing biases and asymptotic properties of the randomized midpoint method for Langevin diffusions.
method Characterization of stationary distribution and asymptotic normality for numerical integration.
result The step-size needs to go to zero for the method to be asymptotically unbiased.

New relation found between ADM mass and generalized Komar energy for dynamical spacetimes.

problem Finding equality between ADM mass and Komar energy in dynamical spacetimes.
method Constructing a generalized Komar energy from the normal evolution vector and proving equality under specific conditions.
result Equality between ADM mass and generalized Komar energy for dynamical asymptotically-flat spacetimes.

Considering the tangent plane at a point to a surface in the four-dimensional Euclidean space, we find an invariant of a pair of two tangents in this plane. If this invariant is zero, the two tangents are said to be conjugate. When the two tangents coincide with a given tangent, then we obtain the normal curvature of t…

2010-02-19abs ↗pdf ↗

SGDM accelerates faster than SGD with large batch sizes and permits broader learning rates.

problem Understanding the role of momentum in SGDM and its convergence rates.
method Analysis of SGDM convergence rates under strongly convex settings, including finite-sample rates and asymptotic normality of the averaged estimator.
result SGDM converges faster than SGD with large batch sizes and permits broader learning rates.

The paper develops approximations for Pearson's chi-square statistic and applies them to confidence intervals.

problem Finding confidence intervals for strictly convex functions of discrete distribution weights.
method Non-asymptotic local normal approximation for multinomial probabilities, deriving bounds and coupling inequalities.
result Developed methods to find confidence intervals for negative entropy of discrete distributions.

The study connects surface geometry in 5D to 4D projections and umbilic curvatures.

problem Understanding the geometry of surfaces in 5D space.
method Relating surfaces in 5D to surfaces in 4D via projections and normal sections, analyzing asymptotic directions and umbilic curvatures.
result Relations between asymptotic directions and umbilic curvatures in 5D surfaces and their counterparts in 4D projections.