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

91182272363 · Jun 202019922001200920172026
48 results for averaging theory

New theory for nonsmooth systems helps optimize and control complex functions.

problem Optimizing and controlling systems with nonsmooth functions.
method Higher-order averaging theory with nonsmooth near-identity transformation and lexicographic differentiation.
result Closed formula for nonsmooth first and second-order averaging.

The paper analyzes MACD using operator theory.

problem Understanding the mathematical foundation of MACD.
method Developed a functional-analytic framework interpreting MACD as a phase-corrected, smoothed derivative operator.
result MACD is structurally equivalent to a band-pass filter and can be expressed as a finite difference of delayed and doubly averaged signals.

In modern portfolio theory, the balancing of expected returns on investments against uncertainties in those returns is aided by the use of utility functions. The Kelly criterion offers another approach, rooted in information theory, that always implies logarithmic utility. The two approaches seem incompatible, too loos…

2009-02-17abs ↗pdf ↗

Since the pioneering work of Ghys, Langevin and Walczak among others, it has been known that several methods of dynamical systems theory can be adopted to study of foliations. Our aim in this paper is to investigate complexity of foliations, by generalising existence problem of time averages in dynamical systems theory…

2018-10-17abs ↗pdf ↗

We show Vector Autoregressive Moving Average models with scalar Moving Average components could be estimated by generalized least square (GLS) for each fixed moving average polynomial. The conditional variance of the GLS model is the concentrated covariant matrix of the moving average process. Under GLS the likelihood …

2019-09-01abs ↗pdf ↗

Paper finds optimal shapes for minimizing average lengths of billiard trajectories in specific polygons.

problem Finding optimal shapes to minimize the average length of billiard trajectories.
method Used techniques from Teichmüller theory.
result Optimal shapes minimize average lengths of billiard trajectories in specific polygons.

The study analyzes when Bayesian averaging over decision trees is reliable.

problem When do Bayesian model averaging weights over decision trees provide reliable information?
method Closed-form solution for Bayesian decision trees with Catalan-exponential priors.
result Established a complete non-asymptotic theory of rational commitment thresholds.

As a natural application of the {\it theory of geometric averaging} in Finsler geometry and generalized Finsler geometry, a new approach to investigate {\it generalized Finsler geometry}, based on a convex invariance of the average structures, is introduced.

2009-05-20abs ↗pdf ↗

Predicting absolute magnitude of fluctuations of price, even if their sign remains unknown, is important for risk analysis and for option prices. In the present work, we display our predictions about absolute magnitude of daily fluctuations of the Dow Jones Industrials Average (DJIA), utilizing the original theory of c…

2006-02-08abs ↗pdf ↗

This paper analyzes the convergence of Federated Average under relaxed assumptions.

problem Lack of theoretical analysis for Federated Average under assumptions beyond smoothness.
method Relaxing assumptions of strong smoothness to semi-smoothness and semi-Lipschitz properties, and introducing a bound on the gradient.
result Provides a theoretical convergence study on Federated Learning under new assumptions.

New findings suggest no ensemble averaging for certain black hole observables.

problem Mystery in AdS/CFT correspondence regarding ensemble averaging of black hole amplitudes.
method Exploring sub-threshold observables in D=3D=3 and proving novel results about hyperbolic geometry.
result Connected solutions of Einstein's equations with disconnected boundary never contribute to sub-threshold observables.

We study U(N|M) character expectation value with the supermatrix Chern-Simons theory, known as the ABJM matrix model, with emphasis on its connection to the knot invariant. This average just gives the half BPS circular Wilson loop expectation value in ABJM theory, which shall correspond to the unknot invariant. We deri…

2014-07-31abs ↗pdf ↗

In this article we present new results for the pricing of arithmetic Asian options within a Black-Scholes context. To derive these results we make extensive use of the local scale invariance that exists in the theory of contingent claim pricing. This allows us to derive, in a natural way, a simple PDE for the price of …

2000-06-08abs ↗pdf ↗

Paper introduces stability in model averaging and proposes a L2-penalty method.

problem Theoretical properties of model averaging from stability perspective.
method Introduces stability, defines asymptotic empirical risk minimizer, and proposes L2-penalty model averaging method.
result Proposed L2-penalty method ensures stability and consistency under reasonable conditions.

Many problems in machine learning and game theory can be formulated as saddle-point problems, for which various first-order methods have been developed and proven efficient in practice. Under the general convex-concave assumption, most first-order methods only guarantee an ergodic convergence rate, that is, the uniform…

2019-03-26abs ↗pdf ↗

The paper improves Monte Carlo methods for optimization problems.

problem Efficiently solving optimization problems with biased Monte Carlo estimators.
method Introduces Multilevel Monte Carlo (MLMC) within Sample Average Approximation (SAA).
result Establishes uniform convergence and sample complexity for MLMC in SAA.

Theory and methods to mitigate omitted variable bias in causal machine learning.

problem Mitigating omitted variable bias in causal machine learning models.
method Developed a general theory and flexible statistical inference methods for bounding and testing the magnitude of omitted variable bias.
result Simple plausibility judgments can bound the magnitude of omitted variable bias in complex, nonlinear models.

Study classifies stock price data into stationary and non-stationary periods for mechanical trading.

problem Classifying stock price fluctuations into stationary and non-stationary periods for trading.
method Stationarity analysis using KM2_2O-Langevin theory and trend-based indicators for stationary periods, oscillator-based indicators for non-stationary periods.
result Back testing confirms the strategy is a safe trading strategy with small maximum drawdown.

Averaged SGD optimizes a smoothed objective, leading to better generalization.

problem Improving generalization performance in machine learning models.
method Analyzed the smoothed objective function of SGD and proved that averaged SGD can optimize this smoothed function efficiently.
result Averaged SGD can efficiently optimize a smoothed objective, leading to better generalization.

We derive a dimensionally-reduced limit theory for an nn-dimensional nonlinear elastic body that is slender along kk dimensions. The starting point is to view an elastic body as an nn-dimensional Riemannian manifold together with a not necessarily isometric W1,2W^{1,2}-immersion in nn-dimensional Euclidean space. The…

2012-01-17abs ↗pdf ↗

We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated group GG has the word problem solvable in subexponential time and has a subgroup of…

2002-06-25abs ↗pdf ↗

This paper proposes a simple but effective graph-based agglomerative algorithm, for clustering high-dimensional data. We explore the different roles of two fundamental concepts in graph theory, indegree and outdegree, in the context of clustering. The average indegree reflects the density near a sample, and the average…

2012-08-25abs ↗pdf ↗

In this thesis, we consider the suitability of using the charged cold fluid model in the description of ultra-relativistic beams. The method that we have used is the following. Firstly, the necessary notions of kinetic theory and differential geometry of second order differential equations are explained. Then an averag…

2012-06-19abs ↗pdf ↗

Consider a family of portfolio strategies with the aim of achieving the asymptotic growth rate of the best one. The idea behind Cover's universal portfolio is to build a wealth-weighted average which can be viewed as a buy-and-hold portfolio of portfolios. When an optimal portfolio exists, the wealth-weighted average c…

2015-10-09abs ↗pdf ↗

Proposes methods to recover labels from shuffled networks using graph averages.

problem Recovering labels from a shuffled network using graph averages.
method Cluster networks into classes, then match the new graph to cluster-averages, minimizing the graph matching objective function.
result Higher fidelity matching performance when clustering networks into different classes.

The paper develops a new theory to understand deep learning optimization.

problem Understanding the dynamics of optimization in deep learning, especially in the edge of stability regime.
method Developed a central flow differential equation to describe the time-averaged trajectory of oscillatory optimizers.
result Central flows can predict long-term optimization trajectories with high numerical accuracy.

New framework analyzes SGD dynamics in large samples and dimensions.

problem Analyzing stochastic gradient descent in large-scale settings.
method Inspired by random matrix theory, new framework for fixed stepsize and finite sum settings.
result SGD dynamics become deterministic in the large sample and dimensional limit, governed by a Volterra integral equation.

Distributed statistical learning problems arise commonly when dealing with large datasets. In this setup, datasets are partitioned over machines, which compute locally, and communicate short messages. Communication is often the bottleneck. In this paper, we study one-step and iterative weighted parameter averaging in s…

2018-09-30abs ↗pdf ↗

In a recent Nature paper, Gabaix et al. \cite{Gabaix03} presented a theory to explain the power law tail of price fluctuations. The main points of their theory are that volume fluctuations, which have a power law tail with exponent roughly -1.5, are modulated by the average market impact function, which describes the r…

2003-09-17abs ↗pdf ↗

CV outperforms mean-variance for stock returns, minimizing risk and maximizing growth.

problem Traditional risk assessment methods underperform in stock market analysis.
method Derived new CV equation and used it to analyze stock performance.
result Stocks with low but positive CV grow exponentially, outperforming high-risk stocks.

In this work, we introduce the {\em average top-kk} (\atk) loss as a new aggregate loss for supervised learning, which is the average over the kk largest individual losses over a training dataset. We show that the \atk loss is a natural generalization of the two widely used aggregate losses, namely the average loss a…

2017-05-24abs ↗pdf ↗

Bayesian stacking improves model performance with varying model weights.

problem Improving model predictions with heterogeneous input performance.
method Bayesian hierarchical stacking with varying model weights inferred via Bayesian inference.
result Hierarchical stacking yields better predictions than linear averaging.

Attempts to accurately measure the monetary velocity or related properties of bitcoin used in transactions have often attempted to either directly apply definitions from traditional macroeconomic theory or to use specialized metrics relative to the properties of the Blockchain like bitcoin days destroyed. In this paper…

2017-12-20abs ↗pdf ↗

This paper studies robust estimation methods in high dimensions, comparing model-averaged and composite quantile estimators.

problem Understanding robustness in high-dimensional regularized estimation.
method Optimal weights are determined by minimizing the asymptotic mean squared error, incorporating regularization effects without perfect selection.
result Model-averaged and composite quantile estimators often outperform least-squares methods in prediction quality.

This paper develops a new theory for ensemble learning beyond variance reduction.

problem Ensemble learning's effectiveness for stable estimators is not fully explained by variance reduction.
method Develops a general weighting theory for ensemble learning, formalizing ensembles as linear operators and introducing geometric and spectral constraints.
result Structured weights can outperform uniform averaging by reshaping approximation geometry and redistributing spectral complexity.

Study the averaging principle for non-autonomous slow-fast systems and apply it to financial local stochastic volatility models.

problem Understanding the behavior of non-autonomous slow-fast systems of stochastic differential equations.
method Prove the averaging principle under specific conditions and apply it to a financial model.
result Prices of derivatives converge to those calculated using the limit model under a risk-neutral measure.

The paper shows Gaussian fluctuations in eigenvalue statistics of random hyperbolic surfaces.

problem Understanding fluctuations in Laplace eigenvalues of random hyperbolic surfaces.
method Analyzing fluctuations of linear statistics of Laplace eigenvalues over moduli space of surfaces of large genus.
result The distribution of linear statistics tends to a Gaussian as the genus of surfaces increases.