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

83165248330 · Jun 202019922001200920172026
48 results for average connection

Study on averaging geometric structures in Finsler spaces with Lorentzian signature.

problem Averaging geometric structures in Finsler spaces with Lorentzian signature.
method Definition of an average connection without using the timelike vector field.
result No direct relation between the two averaged objects.

Given a Finsler space (M,F) on a manifold M, the averaging method associates to Finslerian geometric objects affine geometric objects} living on MM. In particular, a Riemannian metric is associated to the fundamental tensor gg and an affine, torsion free connection is associated to the Chern-Rund connection. As an il…

2005-01-05abs ↗pdf ↗

The paper rethinks the use of exponential averaging in machine learning optimization.

problem The inefficiency of using exponential averaging in optimization algorithms.
method The paper connects EA-CM algorithms to Wake of Quadratic regularized models and proposes new algorithms, KLD-WRM.
result The new algorithms outperform existing methods like K-FAC on MNIST.

As an important part of the power system, power load forecasting directly affects the national economy. The data shows that improving the load forecasting accuracy by 0.01% can save millions of dollars for the power industry. Therefore, improving the accuracy of power load forecasting has always been the pursuing goals…

2019-12-08abs ↗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 ↗

Average signature measures geodesics in Lie groups.

problem Understanding geometric properties of Lie groups through geodesic paths.
method Introducing average signature A(G)\mathbb A(G) and using it with trace operation to recover geometric properties.
result Average signature can recover geometric properties like dimension, diameter, volume, and scalar curvature.

Given a Finsler space (M,F), one can define natural average Riemannian metrics on M by averaging on the indicatrix I_x the fundamental tensor g of the Finsler function FF. In this paper we determine explicitly the Levi-Civita connection for these average Riemannian metrics. We apply the result to the case when (M,F) i…

2011-10-25abs ↗pdf ↗

Faster algorithms for solving multichain MDPs under average-reward criterion.

problem Navigating towards the best connected component in multichain MDPs.
method Developed algorithms to better solve the navigational subproblem, achieving faster convergence rates.
result Improved rates of convergence and sharper complexity measures for multichain MDPs.

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.

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 ↗

The abstract discusses metrics with positive biorthogonal curvature on 5-manifolds.

problem Finding metrics with positive biorthogonal curvature on simply connected 5-manifolds.
method Using conformal deformation of Wilking's metric and results from Smale.
result Every closed simply connected 5-manifold admits a metric with strictly positive average sectional curvatures of orthogonal 2-planes.

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 introduce a simple algorithm, True Asymptotic Natural Gradient Optimization (TANGO), that converges to a true natural gradient descent in the limit of small learning rates, without explicit Fisher matrix estimation. For quadratic models the algorithm is also an instance of averaged stochastic gradient, where the par…

2017-12-22abs ↗pdf ↗

Describes reconstructing Poisson structures from Lie group actions.

problem Reconstructing invariant Poisson structures from Lie group actions.
method Describes reconstruction of invariant Poisson structures from canonical actions of compact Lie groups on fibered phase spaces.
result Derives symmetry properties of Wong's type equations from main results.

This paper examines ADMM for network averaging, revealing its convergence rates and network topology impacts.

problem Efficiently averaging local information over a network using ADMM.
method Comparative analysis of ADMM and other algorithms on a canonical distributed averaging problem.
result Characterization of ADMM convergence and optimal parameter tuning based on network spectral properties.

Average teaching complexity for locating target regions among halfspace intersections is Θ(d).

problem Teaching the location of a target region among intersections of halfspaces.
method Novel insights from computational geometry to count convex polytopes and faces.
result Average-case teaching complexity is Θ(d), contrasting with Θ(n) worst-case complexity.

Federated learning allows edge devices to collaboratively learn a shared model while keeping the training data on device, decoupling the ability to do model training from the need to store the data in the cloud. We propose Federated matched averaging (FedMA) algorithm designed for federated learning of modern neural ne…

2020-02-15abs ↗pdf ↗

Study differential operators on non-compact harmonic manifolds, finding conditions for radial fundamental solutions and dense heat-semigroups.

problem Conditions for differential operators on non-compact harmonic manifolds to have specific properties.
method Analyzing the algebra of differential operators, their commutation properties, and using geometric averages.
result Algebra of differential operators on non-compact harmonic manifolds has specific properties related to radial fundamental solutions and dense heat-semigroups.

In this paper a new connection between the discrete conformal geometry problem of disk pattern construction and the continuous conformal geometry problem of metric uniformization is presented. In a nutshell, we discuss how to construct disk patterns by optimizing an objective function, which turns out to be intimately …

2000-10-31abs ↗pdf ↗

DSPI connects natural policy gradient to policy iteration, proving global convergence.

problem Optimizing policies in reinforcement learning.
method DSPI framework, combining smoothed policy iteration and natural policy gradient.
result DSPI achieves geometric convergence and optimal complexity for policy optimization.

Random Feature (RF) models are used as efficient parametric approximations of kernel methods. We investigate, by means of random matrix theory, the connection between Gaussian RF models and Kernel Ridge Regression (KRR). For a Gaussian RF model with PP features, NN data points, and a ridge λλ, we show that the avera…

2020-02-19abs ↗pdf ↗

ScoreMatchingRiesz improves debiased machine learning and policy effects estimation.

problem Improving debiased machine learning and policy effects estimation.
method Score matching and Riesz representer estimation.
result Estimates policy path for continuous treatments, improving interpretability.

We extend average edge order results to normal 3-pseudomanifolds.

problem Determining the average edge order of normal 3-pseudomanifolds.
method Extending previous results on 3-manifolds to 3-pseudomanifolds with singularities.
result For a normal 3-pseudomanifold KK, μ0(K)307μ_0(K) \geq \frac{30}{7}, with equality if and only if KK is a specific triangulation of RP2\mathbb{RP}^2.

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 ↗

We use variational Gaussian approximations to analyze parametric models with unknown data-generating distributions.

problem Analyzing inference and learning in parametric models with unknown or intractable data-generating distributions.
method Replica method with variational Gaussian approximation in grand canonical formalism.
result Stationarity conditions adaptively determine parameters of the trial Hamiltonian for each dataset.

Tensor regression networks achieve high compression rate of neural networks while having slight impact on performances. They do so by imposing low tensor rank structure on the weight matrices of fully connected layers. In recent years, tensor regression networks have been investigated from the perspective of their comp…

2017-12-27abs ↗pdf ↗

The Berwald-Landsberg problem is considered for two dimensional manifolds. We sketch the proof that there are not C5\mathcal{C}^5-regular yy-global pure Landsberg surfaces. The method used consists on considerer the holonomy representation of the averaged Chern connection and then exhausting all the possible cases, sh…

2009-12-01abs ↗pdf ↗

Study on predicting graph labels at nodes using local averaging and distance estimation.

problem Predicting graph labels at nodes given observations at other nodes.
method Local averaging and distance estimation methods for graph regression.
result Alternative methods can achieve standard nonparametric rates even when graph neighborhoods are too large or small.